TILens turns technical updates into a focused daily brief: official releases,
trusted reporting, and practitioner analysis, deduplicated and organized by topic.
arXiv:2611.22352v1 Announce Type: cross Abstract: Most fair-ranking methods assume categorical protected attributes, requiring continuous attributes such as age or income to be discretized into groups. This introduces…
arXiv:2611.22303v1 Announce Type: new Abstract: We compute the commutator length $\cl(w)$ of a reduced word $w\in[F,F]$ of length $M$ in a free group. Given a target $g\ge1$, a deterministic algorithm decides $\cl(w)\le…
arXiv:2602.11476v3 Announce Type: replace-cross Abstract: Persistent memory must retain history without revisiting it at every transition. Bounded Local Generator Classes (BLGC) formalize carried numerical state,…
arXiv:2610.17833v4 Announce Type: replace Abstract: We present PHastR, a minimal perfect hash function of the PHast family. Like PHast+, the fast-to-build variant of PHast, PHastR finds feasible seeds with bit-parallel…
arXiv:2611.22023v1 Announce Type: new Abstract: We consider a class of combinatorial optimization problems where the goal is to find a largest induced subgraph with a prescribed property. We assume that the property is…
arXiv:2507.14812v2 Announce Type: replace Abstract: In a typical online resource allocation problem, we start with a fixed inventory of resources and make online allocation decisions in response to resource requests…
arXiv:2609.17650v3 Announce Type: replace Abstract: The Binary Tree Mechanism is a standard algorithm for differentially private continual counting, but its complete asymptotic optimality under differential privacy has…
arXiv:2611.21943v1 Announce Type: new Abstract: With $k\geq 1$ repairpersons starting initially from a depot, we present a 3.877-competitive deterministic algorithm for the fundamental online traveling repairperson…
arXiv:2611.22376v1 Announce Type: cross Abstract: We give a deterministic polynomial-time algorithm that allocates $m$ indivisible goods among $n$ agents with nonnegative additive valuations using $O(n^5\log^2 m)$ value…
arXiv:2610.28141v3 Announce Type: replace-cross Abstract: We show that computing an approximate correlated equilibrium of a polytope game is PPAD-complete, and thus polynomial-time equivalent to finding a Nash…
arXiv:2611.22216v1 Announce Type: cross Abstract: In the seminal Bertrand network game introduced by Babaioff et al. (2013), each seller posts a single price to captive buyers and to the markets it shares with…
arXiv:2604.17509v3 Announce Type: replace-cross Abstract: What is the largest constant $c\in [0,1]$ with the property that every finite collection $\mathcal{C}$ of axis-parallel squares in the plane admits a disjoint…
arXiv:2611.21966v1 Announce Type: cross Abstract: Consider the collection of independent transversals of a vertex-partitioned graph of maximum degree $\Delta$. It is a classic result that when all parts have size at…
arXiv:2610.39870v2 Announce Type: replace-cross Abstract: We complete the determination of the minimum possible length of eight-dimensional binary self-orthogonal codes with given minimum distance. For dimension nine we…
arXiv:2611.22205v1 Announce Type: cross Abstract: We give explicit colourings improving the comparison lower bounds assembled here for several Hales--Jewett and van der Waerden numbers. The main algebraic tool…
arXiv:2611.13693v2 Announce Type: replace-cross Abstract: Using the recent strong convergence results of Bordenave and Collins (Annals of Mathematics) and Chen et al. (Annals of Mathematics), we study the average case…
arXiv:2611.22365v1 Announce Type: new Abstract: A discrete-time dynamical system is strongly transitive if every point can be reached, in finitely many steps, from every non-empty open set. We study this property for…
arXiv:2611.22552v1 Announce Type: cross Abstract: We prove that every $(\pw,\omega)$-bounded class of graphs has bounded tree-independence number, answering a question of Be\v{s}ter \v{S}torgel, Dallard, Lozin,…
arXiv:2609.30302v5 Announce Type: replace Abstract: In 1984, Frank Harary introduced the first convexity games in graphs, all of them based on the geodesic convexity, which is the graph convexity related to shortest…
arXiv:2601.20263v2 Announce Type: replace-cross Abstract: Gaussian Boson Sampling (GBS) is a quantum computational model that leverages linear optics to solve sampling problems believed to be classically intractable.…