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.

09 Sep 2026 edition

27 articles · 1 source · 27 papers ·

Top topics: Algorithms

Algorithms

Limited Independence Suffices for Large-k Min-wise Hashing

arXiv:2607.10255v3 Announce Type: replace-cross Abstract: Min-wise hashing and its $k$-min-wise variant are standard tools in similarity estimation, sampling, sketching, and streaming. A $k$-min-wise family requires…

Source: arXiv cs.DM Haoran Wang
Algorithms

A $(\log n)^{1/4}$ Bound for the Koml\'os Problem

arXiv:2609.08885v1 Announce Type: cross Abstract: Let $A\in\mathbb{R}^{m\times n}$ have columns of Euclidean norm at most one. We prove that $\operatorname{disc}(A)\le2395\left(1+\log_+\frac n9\right)^{1/4}+2\sqrt2$.…

Source: arXiv cs.DM Eren Ercan
Algorithms

Clique Number of Tournaments II

arXiv:2609.07481v1 Announce Type: cross Abstract: The directed clique number $\vec{\omega}(T)$ of a tournament $T$ is the minimum, over all orderings of the vertices of $T$, of the clique number of the graph whose edges…

Source: arXiv cs.DM Guillaume Aubian, Samuel Coulomb
Algorithms

Generalized Graph Search Trees

arXiv:2609.08625v1 Announce Type: new Abstract: Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph…

Source: arXiv cs.DM Florian Krowiorz, Robert Scheffler
Algorithms

Set families: restricted distances via restricted intersections

arXiv:2504.12296v4 Announce Type: replace-cross Abstract: Denote by $f_D(n)$ the maximum size of a set family $\mathcal{F}$ on $[n] = \{1, \dots, n\}$ with distance set $D$. That is, $|A \bigtriangleup B| \in D$ holds…

Source: arXiv cs.DM Zichao Dong, Jun Gao, Hong Liu, Minghui Ouyang, Qiang Zhou
Algorithms

Oracle-free Boltzmann Sampling for Powersets

arXiv:2601.09508v3 Announce Type: replace Abstract: We propose an approach for sampling powersets under the Boltzmann distribution in an oracle-free way, i.e. without numerically evaluating the associated generating…

Source: arXiv cs.DM Jean Peyen
Algorithms

Expressivity of Contradiction Graphs

arXiv:2605.20434v2 Announce Type: replace-cross Abstract: We study the contradiction graphs associated with a binary concept class. For a class $H\subseteq\{0,1\}^X$, the order-$m$ contradiction graph $G_m(H)$ has as…

Source: arXiv cs.DM Jesse Campbell, Daniel Ibaibarriaga, Lev Reyzin
Algorithms

Linear Programming Bounds for LCD Codes via Gauss Phases

arXiv:2609.08662v1 Announce Type: cross Abstract: For $q\in\set{2,3}$, we show that a $k$-dimensional linear code over the finite field $\F_q$ of order $q$ is linear complementary dual (LCD) exactly when one…

Source: arXiv cs.DM Ming-Hsuan Kang, Maosheng Xiong
Algorithms

Coloring graphs with no long induced path

arXiv:2609.08847v1 Announce Type: cross Abstract: Let $P_t$ denote the induced path on $t$ vertices. Let $\omega(G)$ denote the maximum number of vertices in a clique of a graph $G$. Previously Gy\'arf\'as (1987) proved…

Source: arXiv cs.DM Sang-il Oum
Algorithms

The list size of random linear codes at capacity

arXiv:2609.06570v1 Announce Type: cross Abstract: Let $C \le \mathbb{F}_q^n$ be a uniformly random $\mathbb{F}_q$-linear code of rate $1 - h_q(\rho) - \varepsilon$, and let $L^*(C,\rho)$ be the least $L$ such that every…

Source: arXiv cs.DM Shashwat Silas
Algorithms

Moments of crosscorrelation demerit factors of binary sequences

arXiv:2609.05771v1 Announce Type: cross Abstract: Families of sequences with low mutual aperiodic crosscorrelation assist the design of systems for multi-user asynchronous communications and multiple-input…

Source: arXiv cs.DM Daniel J. Katz, Harmony M. Vargas
Algorithms

List coloring uncrowded hypergraphs at the shattering threshold

arXiv:2606.18048v2 Announce Type: replace-cross Abstract: Improving an earlier bound of Frieze and Mubayi, Iliopoulos showed that any $k$-uniform uncrowded hypergraph of maximum degree $\Delta$ has list chromatic number…

Source: arXiv cs.DM Abhishek Dhawan, Abhishek Methuku, Minh-Quan Vo
Algorithms

Synchronization Strings over the Optimal Alphabet

arXiv:2609.04122v2 Announce Type: replace-cross Abstract: Synchronization strings provide deterministic position labels for recovering coordinates after insertions and deletions. Haeupler and Shahrasbi introduced these…

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

A simple algorithm for computing Hamilton paths on independent set polytopes

arXiv:2609.07304v1 Announce Type: new Abstract: The independent set polytope, or stable set polytope, of a graph $G$ is the 0/1-polytope defined by the convex hull of the characteristic vectors of all independent sets…

Source: arXiv cs.DM Jean Cardinal, Pia Herkenrath, Torsten M\"utze, Francesco Verciani
Algorithms

An analogue of Reed's conjecture for digraphs

arXiv:2407.05827v4 Announce Type: replace-cross Abstract: Reed in 1998 conjectured that every graph $G$ satisfies $\chi(G) \leq \lceil \frac{\Delta(G)+1+\omega(G)}{2} \rceil$. As a partial result, he proved the…

Source: arXiv cs.DM Ken-ichi Kawarabayashi, Lucas Picasarri-Arrieta

Showing 1 day · 27 items available