Daily edition · Algorithms
TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.
42 articles · 3 sources · 42 papers ·
Top topics: Algorithms
arXiv:2608.13382v1 Announce Type: cross Abstract: Two graphs $G$ and $H$ are homomorphism indistinguishable over a graph class $\mathcal{F}$ if they admit the same number of homomorphisms from every graph in…
arXiv:2608.12550v1 Announce Type: new Abstract: Dadush et al.\ (2024) recently developed a scaling-invariant layered least squares algorithm for linear programming whose complexity depends on the optimal condition…
arXiv:2608.12671v1 Announce Type: cross Abstract: Multi-layer transformers form the critical component of essentially all large language models (LLMs) in use today. Because of their ubiquity and computational…
arXiv:2608.11195v2 Announce Type: replace-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…
arXiv:2608.12955v1 Announce Type: new Abstract: Multi-Agent Path Finding for Large Agents (LA-MAPF) is a geometric variant of MAPF in which agents are modeled as disks and conflicts are determined by physical overlap in…
arXiv:2608.12664v1 Announce Type: new Abstract: We prove that, for every constant $\rho>1$, the Euclidean shortest vector problem is NP-hard to approximate within any constant factor $\rho$ under a deterministic…
arXiv:2608.12976v1 Announce Type: new Abstract: This article provides an assignment designed to let undergraduate students who have completed an undergraduate CS1/CS2 sequence try to themselves, in groups, prove…
arXiv:2307.13826v5 Announce Type: replace Abstract: This monograph is an exposition on an exciting new technique known as spectral independence, which has been instrumental in analyzing the convergence rate of Markov…
arXiv:2608.12430v1 Announce Type: new Abstract: In phylogenetics, Metropolis-Hastings methods are commonly used to sample phylogenetic trees or networks, for example from Bayesian posteriors. These methods generally use…
arXiv:2512.24436v2 Announce Type: replace-cross Abstract: We construct a four-dimensional lattice-gas model with finite-range interactions that has non-periodic, "quasicrystalline" Gibbs states at low temperatures. Such…
arXiv:2608.12948v1 Announce Type: cross Abstract: The well-known Bermond-Thomassen conjecture states that every digraph of minimum out-degree at least $2k-1$ contains $k$ vertex-disjoint directed cycles. Despite being…
arXiv:2608.13310v1 Announce Type: cross Abstract: The $(\min,+)$ convolution is a central problem in fine-grained complexity, and whether it admits a truly subquadratic algorithm remains open. We study it through…
arXiv:2608.12678v1 Announce Type: cross Abstract: Let $P$ be a finite nonempty poset with $n$ elements, let $f:P\to\{1,\ldots,n\}$ be a uniformly random order-preserving bijection, and put $h_P(x)=\mathbb E[f(x)]$.…
arXiv:2608.13130v1 Announce Type: cross Abstract: We consider the problem of shifting two tokens placed on nonadjacent vertices $u,v$ of a graph $G$ on $n$ vertices to two nonadjacent vertices $u',v'$ of $G$ using a…
arXiv:2608.13487v1 Announce Type: new Abstract: Let $K\subset\mathbb{R}^n$ be an isotropic convex body. We prove that the hit-and-run walk, started from any $M$-warm distribution, reaches total-variation distance…
arXiv:2608.01387v2 Announce Type: replace Abstract: We extend Baier's foundationial work on tunnelling Burrows-Wheeler Transforms (BWTs) by showing how something that would be a good tunnel except for a strings that…
arXiv:2603.05358v2 Announce Type: replace-cross Abstract: For a fixed graph class $\Pi$, the goal of $\Pi$-Modification is to transform an input graph $G$ into a graph $H\in\Pi$ using at most $k$ modifications. Vertex…
arXiv:2608.13158v1 Announce Type: new Abstract: Given a simple, undirected, and unweighted graph $G$, and an integer $R$, the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether…
arXiv:2608.12575v1 Announce Type: new Abstract: Cardinality estimation - counting the number of distinct elements in a data stream - requires a tradeoff between memory and accuracy. ExaLogLog recently established the…
arXiv:2603.28602v2 Announce Type: replace-cross Abstract: Trotter decomposition provides a simple approach to simulating open quantum systems by decomposing the Lindbladian into a sum of individual terms. While it is…
Showing 1 day · 42 items available
