arXiv subjects

Tuong Le

Publications and source records attributed to Tuong Le.

8 recordsLinked to original sources

arXiv2026

Koszul Orlik--Solomon Algebras from Non-supersolvable Arrangements

The cohomology ring of the complement of a complex hyperplane arrangement is given by its Orlik--Solomon algebra. It is known that the defining ideal of the Orlik--Solomon algebra has a quadratic Gr\"obner basis in the standard presentation if and only if the intersection lattice is supersolvable; such algebras are automatically Koszul. In 1997, Shelton and Yuzvinsky posed the question as to whether all Koszul Orlik--Solomon algebras arise from supersolvable arrangements. We answer this question negatively using three related constructions that produce non-supersolvable arrangements whose Orlik--Solomon algebras are Koszul. Moreover, these arrangements may be chosen to be irreducible, realizable over $\mathbb{Q}$, and of any rank $\geq 3$. Our constructions rely on a result of Falk and Proudfoot which we strengthen and generalize. In two of the three cases, we show non-supersolvability using a corrected form of a result of Ziegler regarding supersolvability of parallel connections. We also construct Koszul Orlik--Terao algebras coming from non-supersolvable arrangements.

math.CO↗

arXiv2026

Duals of algebraic matroids need not be algebraic

We give an example showing that the dual of an algebraic matroid need not be algebraic. Our example is a matroid of rank 6 on 10 elements which is algebraic in characteristic 2. It is obtained by gluing an algebraic realization of the non-Fano matroid to a realization of the Fano matroid. Its dual is shown not to be algebraic using the Ingleton-Main lemma.

math.CO↗

arXiv2026

Skew Hives, Skew Skeps, Skew Schur Log-Concavity

Knutson and Tao's hives is a combinatorial model to compute Littlewood--Richardson coefficients. Similar to hives, Speyer introduced skeps and used them to prove a Schur log-concavity conjecture by Lam--Postnikov--Pylyavskyy. We first introduce skew hive and skew skep models, which specialize to both hives and skeps, and use this to prove a skew Schur log-concavity result generalizing Lam--Postnikov--Pylyavskyy conjecture. As a consequence, we obtain some log-concavity results concerning Newell--Littlewood numbers and shadow skew Schur functions. Finally, we explain bijections between (skew) hives, (skew) skeps, and peelable tableaux by Nguyen--Nguyen--Woodruff, answering Speyer's question.

math.CO↗

arXiv2026

On the asymptotic behavior of finite hyperfields

Hobby has recently shown that almost all finite hyperfields of even order fail to be the quotient of a field. Using a probabilistic argument, we extend this result to all orders: a finite hyperfield is almost always non-quotient. This confirms a conjecture of Baker--Jin. We show that in almost every finite hyperfield the sum of any four or more nonzero elements contains 0. We also give a precise asymptotic for the number of finite hyperfields on a given finite abelian group.

math.RA↗

arXiv2026

On symmetric pattern avoidance sets

For a set of permutations $S\subseteq S_n$, consider the quasisymmetric generating function $$Q(S): = \sum_{w\in S}F_{n, \mathrm{Des}(w)},$$ where $\mathrm{Des}(w) := \{i\mid w(i)> w(i+1)\}$ is the descent set of $w$ and $F_{n, \mathrm{Des}(w)}$ is Gessel's fundamental quasisymmetric function. A set of permutations is said to be symmetric (respectively, Schur-positive) if its quasisymmetric generating function is symmetric (respectively, Schur-positive). Given a set $\Pi$ of permutations, let $S_n(\Pi)$ denote the set of permutations in $S_n$ that avoid all patterns in $\Pi.$ A set $\Pi$ is said to be symmetrically avoided (respectively, Schur-positively avoided) if $S_n(\Pi)$ is symmetric (respectively, Schur-positive) for all $n.$ Marmor proved in 2025 that for $n\ge 5$, a symmetric set $S\subseteq S_n$ has size at least $n-1$ unless $S\subseteq \{12\cdots n, n\cdots 21\}$ and asked for a general classification of the possible sizes of symmetric sets not containing the monotone elements $12\cdots n $ and $n\cdots 21$. We give a complete answer to this question for $n\ge 52.$ We also give a classification of symmetric sets of size at most $n-1$, thereby showing that they are actually Schur-positive, resolving a conjecture of Marmor. Finally, we give a classification of symmetrically avoided sets of size at most $n-1$, thereby showing that they are actually Schur-positively avoided.

math.CO↗

arXiv2025

Notes on the Linear Algebraic View of Regularity Lemmas

When regularity lemmas were first developed in the 1970s, they were described as results that promise a partition of any graph into a ``small'' number of parts, such that the graph looks ``similar'' to a random graph on its edge subsets going between parts. Regularity lemmas have been repeatedly refined and reinterpreted in the years since, and the modern perspective is that they can instead be seen as purely linear-algebraic results about sketching a large, complicated matrix with a smaller, simpler one. These matrix sketches then have a nice interpretation about partitions when applied to the adjacency matrix of a graph. In these notes we will develop regularity lemmas from scratch, under the linear-algebraic perspective, and then use the linear-algebraic versions to derive the familiar graph versions. We do not assume any prior knowledge of regularity lemmas, and we recap the relevant linear-algebraic definitions as we go, but some comfort with linear algebra will definitely be helpful to read these notes.

cs.DS↗

arXiv2024

Improved Online Reachability Preservers

A reachability preserver is a basic kind of graph sparsifier, which preserves the reachability relation of an $n$-node directed input graph $G$ among a set of given demand pairs $P$ of size $|P|=p$. We give constructions of sparse reachability preservers in the online setting, where $G$ is given on input, the demand pairs $(s, t) \in P$ arrive one at a time, and we must irrevocably add edges to a preserver $H$ to ensure reachability for the pair $(s, t)$ before we can see the next demand pair. Our main results are: -- There is a construction that guarantees a maximum preserver size of $$|E(H)| \le O\left( n^{0.72}p^{0.56} + n^{0.6}p^{0.7} + n\right).$$ This improves polynomially on the previous online upper bound of $O( \min\{np^{0.5}, n^{0.5}p\}) + n$, implicit in the work of Coppersmith and Elkin [SODA '05]. -- Given a promise that the demand pairs will satisfy $P \subseteq S \times V$ for some vertex set $S$ of size $|S|=:\sigma$, there is a construction that guarantees a maximum preserver size of $$|E(H)| \le O\left( (np\sigma)^{1/2} + n\right).$$ A slightly different construction gives the same result for the setting $P \subseteq V \times S$. This improves polynomially on the previous online upper bound of $O( \sigma n)$ (folklore). All of these constructions are polynomial time, deterministic, and they do not require knowledge of the values of $p, \sigma$, or $S$. Our techniques also give a small polynomial improvement in the current upper bounds for offline reachability preservers, and they extend to a stronger model in which we must commit to a path for all possible reachable pairs in $G$ before any demand pairs have been received. As an application, we improve the competitive ratio for Online Unweighted Directed Steiner Forest to $O(n^{3/5 + \varepsilon})$.

cs.DS↗

arXiv2024

Quantum bumpless pipe dreams

Schubert polynomials are polynomial representatives of Schubert classes in the cohomology of the complete flag variety and have a combinatorial formulation in terms of bumpless pipe dreams. Quantum double Schubert polynomials are polynomial representatives of Schubert classes in the torus-equivariant quantum cohomology of the complete flag variety, but no analogous combinatorial formulation had been discovered. We introduce a generalization of the bumpless pipe dreams called quantum bumpless pipe dreams, giving a novel combinatorial formula for quantum double Schubert polynomials as a sum of binomial weights of quantum bumpless pipe dreams. We give a bijective proof for this formula by showing that the sum of binomial weights satisfies a defining transition equation.

math.CO↗