TILens turns technical updates into a focused daily brief: official releases,
trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:1701.06951v4 Announce Type: replace-cross Abstract: We present a test for determining if a substochastic matrix is convergent. By establishing a duality between weakly chained diagonally dominant (w.c.d.d.)…
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…
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$.…
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…
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…
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…
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…
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…
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…
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…
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…
arXiv:2609.05750v1 Announce Type: cross Abstract: We study the mixing time of the systematic scan dynamics for high-dimensional discrete distributions. This Markov chain updates coordinates sequentially according to a…
arXiv:2609.09146v1 Announce Type: new Abstract: Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently…
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…
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…
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…
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…
arXiv:2412.03540v2 Announce Type: replace-cross Abstract: We prove a sharp version of Talagrand's selector process conjecture. Roughly speaking, given any collection of nonnegative weight vectors whose support form a…
arXiv:2607.04141v3 Announce Type: replace-cross Abstract: We introduce split-free cable expressions and their sequential restriction. Live cables are vertex blocks that future operations cannot split. The main result…
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…