Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
39 articles · 3 sources · 39 papers ·
Top topics: Algorithms
arXiv:2608.10696v1 Announce Type: new Abstract: Shellsort's best general lower and classical upper bounds differ by an iterated-logarithmic factor. Lower bounds use signed, order-free cancellation, whereas upper bounds…
arXiv:2603.14846v4 Announce Type: replace-cross Abstract: We define an information-complexity property for aggregation functions, capturing a vast range of practical aggregations, and prove that any Message-Passing…
arXiv:2604.22627v2 Announce Type: replace-cross Abstract: Joint measurements on multiple copies of a quantum state provide access to nonlinear observables such as $\operatorname{tr}(\rho^t)$, but whether replica number…
arXiv:2608.11195v1 Announce Type: cross Abstract: AI agents are increasingly used in mathematics research, but it is often unclear how to use them effectively. Towards this, we present an extensive case study of how AI…
arXiv:2608.10179v1 Announce Type: new Abstract: A tensor has border rank at most $r$ if it can be written as $T=\lim_{\varepsilon \rightarrow 0} T(\varepsilon)$ where $T(\varepsilon)$ has rank at most $r$ for all…
arXiv:2608.11066v1 Announce Type: cross Abstract: We prove inference-time quantum coordination advantages for specified AI state-tracking tasks. A solver compresses semantic history into a future-accessible boundary…
arXiv:2608.11181v1 Announce Type: new Abstract: When a probabilistic predictor answers many conditional-probability queries, are its answers self-consistent, and can this be verified in polynomial time? This problem is…
arXiv:2608.10874v1 Announce Type: new Abstract: A proper conflict-free (PCF) $k$-coloring of a graph $G$ is a proper $k$-coloring such that there exists a color that appears exactly once in the neighborhood of every…
arXiv:2510.13705v3 Announce Type: replace-cross Abstract: We prove a support--shattering uncertainty principle for functions on the Boolean cube. Let $\mathbb{F}$ be any field and let $f:\{0,1\}^n\to\mathbb{F}$ be…
arXiv:2311.13523v3 Announce Type: replace-cross Abstract: We study the problem of gradually representing a complex graph as a sequence of drawings of small subgraphs whose union is the complex graph. The sequence of…
arXiv:2009.09674v2 Announce Type: replace-cross Abstract: Let $\mathcal G$ be a hypergraph whose edges are colored. An {\it $(\alpha,n)$-detachment} of $\mathcal G$ is a hypergraph obtained by splitting a vertex…
arXiv:2507.18776v2 Announce Type: replace-cross Abstract: We address the problem proposed by Chartrand, Erd\H{o}s and Oellermann (1988) about the existence of regular $K_3$-irregular graphs. We first establish bounds on…
arXiv:2608.10617v1 Announce Type: new Abstract: For a connected graph $G = (V, E)$, a set $D \subseteq V$ is a co-secure dominating set if $D$ is a dominating set of $G$ and for each vertex $u \in D$ there exists a…
arXiv:2608.10380v1 Announce Type: new Abstract: A connectivity function on a finite set $E$ is a function $f\colon 2^E\to\mathbb Z$ that is submodular and symmetric, with $f(\varnothing)=0$. Given a connectivity…
arXiv:2608.11094v1 Announce Type: new Abstract: In the undirected \emph{Densest Subgraph Problem (DSG)} the goal is to output a subset $S$ of vertices of a given graph $G$ that maximizes the quantity $|E(S)|/|S|$, where…
arXiv:2309.09359v3 Announce Type: replace-cross Abstract: Skiplists are used in a variety of applications for storing data subject to order criteria. In this article we discuss the design, analysis and performance of a…
arXiv:2506.16021v2 Announce Type: replace-cross Abstract: The problem of locally routing on geometric networks using limited memory is extensively studied in computational geometry. We consider one particular graph, the…
arXiv:2608.10421v1 Announce Type: new Abstract: In this paper, we present a stable mergesort variant, "directional mergesort", that to sort an array of $n$ elements makes no more than $nH+3n$ comparisons and…
arXiv:2608.10753v1 Announce Type: new Abstract: Having simple algorithms is important for the practical adoption of new algorithms. However, simplifying existing algorithms is a field that does not usually receive a lot…
arXiv:2603.12894v3 Announce Type: replace Abstract: The BEST theorem, due to de Bruijn, van Aardenne-Ehrenfest, Smith, and Tutte, is a classical tool from graph theory that links the Eulerian trails in a directed graph…
Showing 1 day · 39 items available
