Skip to content
TILens What matters today in tech v0.3.2
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.

24 Sep 2026 edition

56 articles · 3 sources · 56 papers ·

Top topics: Algorithms · AI

Algorithms

An elementary proof of the Koml\'os conjecture

arXiv:2609.20979v2 Announce Type: replace-cross Abstract: We give an elementary proof of the Koml\'os conjecture by simplifying the recent proof of Guo, Fang, and Lu. We show that any vectors…

Source: arXiv cs.CC Sankeerth Rao Karingula, Shachar Lovett
Algorithms

Near-Optimal Mixedness Testing with Pauli Measurements

arXiv:2608.18839v3 Announce Type: replace-cross Abstract: We consider a fundamental problem of \emph{mixedness testing}: Given $n$ copies of an $N$-qubit state $\rho$, determine whether $\rho = \mathbb{I}_d/d$ or…

Source: arXiv cs.CC Jayadev Acharya, Abhilash Dharmavarapu, Yuhan Liu, Nengkun Yu
Algorithms

Blocky Matrices and Group Idempotents

arXiv:2609.27951v1 Announce Type: cross Abstract: We prove a common generalization of two structure theorems: the dimension-free decomposition theorem for idempotent Schur multipliers and the idempotent theorem in…

Source: arXiv cs.CC Gaia Carenini
Algorithms AI

Weighted Quantum Signal Processing: Low-Depth Polynomial Approximation with Applications to Kolmogorov-Arnold Networks

arXiv:2609.21567v2 Announce Type: replace-cross Abstract: Quantum Signal Processing is a powerful quantum framework for generating and approximating univariate polynomials. However, QSP is often limited by circuit-depth…

Source: arXiv cs.CC Rohit Sarma Sarkar, Rupayan Bhattacharjee, Elias F. Combarro, Michele Grossi, Lirand\"e Pira, Carmen G. Almud\'ever, Sergi Abadal, Eduard Alarcon
Algorithms

Quantum Soundness of a Total-Degree Line-versus-Point Test

arXiv:2609.27129v1 Announce Type: cross Abstract: We prove quantum soundness of the total-degree diagonal line-vs-point test using the individual-degree soundness theorem of Ji, Natarajan, Vidick, Wright, and Yuen. A…

Source: arXiv cs.CC Tianrun Zhao
Algorithms

Envy-Free Allocation of Indivisible Goods under Leontief Preferences

arXiv:2609.28308v1 Announce Type: cross Abstract: Envy-freeness is a fundamental notion of fairness in the allocation of indivisible goods. In this paper, we study envy-free allocation under Leontief preferences, which…

Source: arXiv cs.CC Tanmay Inamdar, Pallavi Jain, Pranjal Pandey
Algorithms AI

Attention-based representations for multi-task computation

arXiv:2608.04243v1 Announce Type: cross Abstract: Multi-head attention layers produce vector representations that support multiple downstream tasks. We establish bounds on the number of heads required in two simple and…

Source: arXiv cs.CC Daniel Hsu, Mingyue Xu
Algorithms

Ideal Membership in Polynomial Calculus: Complexity and Reductions

arXiv:2609.28243v1 Announce Type: new Abstract: The Ideal Membership Problem (IMP) asks whether a polynomial f belongs to an ideal of Q[x_1, ..., x_n]. Polynomial Calculus (PC) certifies membership by deriving f from…

Source: arXiv cs.CC Alex Bortolotti, Monaldo Mastrolilli
Algorithms

Signed circulants at the Ramanujan bound

arXiv:2607.18334v2 Announce Type: replace-cross Abstract: For the circulant graph $C_n(1,2)$ with $n\ge10$ even, the $\F_2$ system requiring every quadrilateral to be unbalanced is consistent and its solutions form…

Source: arXiv cs.DM Vaibhav Suvagiya
Algorithms

A New Upper Bound for the Tur\'an Density of the Tetrahedron

arXiv:2609.27495v1 Announce Type: cross Abstract: We prove that the Tur\'an density of the tetrahedron $K_4^{(3)}$ satisfies $\pi(K_4^{(3)}) \le 312372062889819/560000000000000 < 0.557808$, improving Baber's upper bound…

Source: arXiv cs.DM Gyeongwon Jeong, Seonghun Park, Seonghyuk Im, Joonkyung Lee, Hongseok Yang
Algorithms

Lettericity Is NP-Complete

arXiv:2609.28023v1 Announce Type: cross Abstract: The lettericity of a graph $G$ is the smallest size of a set $\Sigma$ such that there exist $w_1, \ldots, w_{|V(G)|} \in \Sigma$ and a decoder $D \subseteq \Sigma^2$ for…

Source: arXiv cs.DM Henning Fernau, Samuel German, Kevin Mann
Algorithms

Smallest Cubic Non-1-Planar Graphs

arXiv:2609.27168v1 Announce Type: cross Abstract: A graph is 1-planar if it has a drawing in which every edge is crossed at most once. We show that the smallest cubic non-1-planar graphs have $30$ vertices. Two such…

Source: arXiv cs.DM Sergey Pupyrev
Algorithms

A New Method that can Generate Ramsey Colourings for Eight and Thirteen Colours

arXiv:2609.26851v1 Announce Type: new Abstract: We study representations for relation algebras corresponding to certain edge colourings of complete graphs. Previously suitable colourings were obtained for the number of…

Source: arXiv cs.DM Charles Gretton, Tomasz Kowalski, Richard Pennifold, Cody Christopher

Showing 1 day · 56 items available