Skip to content
TILens What matters today in tech v0.3.1
Theme

Daily edition · Algorithms

The daily ledger

TILens turns technical updates into a focused daily brief: official releases, trusted reporting, and practitioner analysis, deduplicated and organized by topic.

04 Sep 2026 edition

36 articles · 3 sources · 36 papers ·

Top topics: Algorithms · AI

Algorithms

Vanilla Exact Synthesis of CNOT Circuits is NP-hard

arXiv:2609.04160v1 Announce Type: cross Abstract: Exact CNOT synthesis asks for a minimum-size CNOT circuit implementing an invertible linear transformation. Although several related synthesis models have been shown to…

Source: arXiv cs.CC Chenjian Li, Ji Guan
Algorithms AI

The Head Complexity of Boolean Functions in Single-Layer Attention

arXiv:2609.04046v1 Announce Type: new Abstract: What can a single layer of self-attention compute? We study head complexity: the minimum number of attention heads required to compute a function in a one-layer…

Source: arXiv cs.CC Rajmohan Rajaraman, Ravi Sundaram, Amanuel Tesfaye
Algorithms

Distinctness threshold for pseudorandom unitaries

arXiv:2609.03065v1 Announce Type: cross Abstract: Pseudorandomness is increasingly recognized as a key property of ensembles in quantum information theory, statistical mechanics, and quantum many-body physics. Yet it…

Source: arXiv cs.CC Asad Raza, Jens Eisert, Bill Fefferman
Algorithms

Random Garbage Separates XOR from Forward-Only Queries

arXiv:2609.03628v1 Announce Type: new Abstract: We give exponential quantum query separations between the standard XOR interface and two forward-only interfaces that supply neither an adjoint nor an inverse oracle. Let…

Source: arXiv cs.CC Khaled Elbassioni, Rishikesh Gajjala, Saurabh Ray
Algorithms

Helly-Type Theorems for Splitting Point Sets

arXiv:2609.02180v2 Announce Type: replace-cross Abstract: Let $0 < \alpha \leq 1/2$. We say that a finite point set $P$ in $\mathbb{R}^d$ is $\alpha$-split by a hyperplane $h$ if each of the closed half-spaces…

Source: arXiv cs.DM Lidor Portal, Natan Rubin
Algorithms

A proof of Ross's conjecture for two-site moving-target search

arXiv:2608.09368v2 Announce Type: replace-cross Abstract: A target moves between two sites according to a discrete-time Markov chain with a $2\times2$ transition matrix $M$. At each epoch one site is searched at…

Source: arXiv cs.DM Yunpeng Li
Algorithms

Curves, points, incidences and covering

arXiv:2507.21758v4 Announce Type: replace-cross Abstract: Given a point set, mostly a grid in our case, we seek upper and lower bounds on the number of curves that are needed to cover the point set. We say a curve…

Source: arXiv cs.DM Arijit Bishnu, Mathew Francis, Pritam Majumder
Algorithms

On the volumes of the elliptope, metric polytope, and cut polytope

arXiv:2604.16735v2 Announce Type: replace Abstract: In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope,…

Source: arXiv cs.DM David Avis, Luc Devroye, Antoine Deza
Algorithms

Equality cases of the Stanley--Yan log-concave matroid inequality

arXiv:2407.19608v2 Announce Type: replace-cross Abstract: The \emph{Stanley--Yan} (SY) \emph{inequality} gives the ultra-log-concavity for the numbers of bases of a matroid which have given sizes of intersections with…

Source: arXiv cs.DM Swee Hong Chan, Igor Pak
Algorithms

Synchronization Strings over the Optimal Alphabet

arXiv:2609.04122v1 Announce Type: cross Abstract: Synchronization strings attach deterministic position labels to a stream that survive insertions and deletions. Haeupler and Shahrasbi introduced these objects, and…

Source: arXiv cs.DM Huibo Xu, Shi Fu, Youming Qiao, Dacheng Tao
Algorithms AI

Parameterized Hardness of Zonotope Containment and Neural Network Verification

arXiv:2509.22849v3 Announce Type: replace-cross Abstract: Neural networks with ReLU activations are a widely used model in machine learning. It is thus important to have a profound understanding of the properties of the…

Source: arXiv cs.DM Vincent Froese, Moritz Grillo, Christoph Hertrich, Moritz Stargalla
Algorithms

On the Gap of Finite Posets

arXiv:2608.12678v2 Announce Type: replace-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…

Source: arXiv cs.DM Alireza Haqi
Algorithms

On the Laplacian spectral gap of generalized pancake graphs

arXiv:2608.15398v2 Announce Type: replace-cross Abstract: The generalized pancake graph $P(m,n)$ is the Cayley graph of the group of colored permutations $\mathbb{Z}_m\wr S_n=(\mathbb{Z}_m)^n\rtimes S_n$ generated by…

Source: arXiv cs.DM Sa\'ul A. Blanco
Algorithms

Long induced paths in sparse graphs and graphs with forbidden patterns

arXiv:2411.08685v2 Announce Type: replace-cross Abstract: Consider a graph $G$ with a path $P$ of order $n$. What conditions force $G$ to also have a long induced path? As complete bipartite graphs have long paths but…

Source: arXiv cs.DM Julien Duron, Louis Esperet, Jean-Florent Raymond

Showing 1 day · 36 items available