<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
<channel>
<title>Paperlane: new arXiv Combinatorics</title>
<link>https://pragyaangaur.dev/Paperlane/mine.html?f=math.CO</link>
<atom:link href="https://pragyaangaur.dev/Paperlane/feed/math.CO.xml" rel="self" type="application/rss+xml"/>
<description>New arXiv mathematics papers each day, with code and Lean signals. Thank you to arXiv for use of its open access interoperability.</description>
<language>en</language>
<lastBuildDate>Sat, 21 Nov 2026 15:23:16 +0000</lastBuildDate>
<item><title>[math.AG] Presentations of the cohomology ring of Hessenberg varieties for the minimal nilpotent orbit in type A</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26246.html</link><guid isPermaLink="false">arxiv:2611.26246v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.AG</category><category>math.CO</category><category>math.RT</category><description>&lt;p&gt;Giulia Gaggero, Megumi Harada, Hannah Nardone, Brett Nasserden, Jenna Rajchgot, Lisa Seccia, Adam Van Tuyl&lt;/p&gt;&lt;p&gt;In 2016 Abe and Crooks found a presentation for the cohomology ring of Hessenberg varieties associated with the minimal nilpotent orbit. Specifically, they presented the ring as a quotient of the cohomology ring of the flag variety, and described the kernel of the quotient map as the span of certain Schubert classes. This note improves upon their result in the Lie type A case, by giving a minimal generating set for the kernel. Our description uses substantially fewer generators than that of Abe-Crooks. Our list consists of a set of Schubert polynomials associated to permutations constructed from the Hessenberg function ${\mathbf h}$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26246v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Thirteen Improved Binary Constant-Weight Codes with Explicit Cyclic Orbit Certificates</title><link>https://pragyaangaur.dev/Paperlane/p/2611.24958.html</link><guid isPermaLink="false">arxiv:2611.24958v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>cs.IT</category><description>&lt;p&gt;Peter Rafat Adel Iskandar&lt;/p&gt;&lt;p&gt;We exhibit thirteen explicit binary constant-weight codes improving lower bounds recorded in Brouwer&amp;#x27;s table, including $A(29,6,5)\geq 333$, $A(55,4,5)\geq 66144$, and $A(62,4,5)\geq 107360$. Their 408,729 codewords are specified by 11,386 orbit representatives under explicitly given cyclic coordinate permutations, together with a standalone reconstruction and distance verifier. All thirteen orbit expansions were checked to agree exactly with the full codeword lists.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.24958v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Star decomposition of complete multipartite graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.24973.html</link><guid isPermaLink="false">arxiv:2611.24973v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Juho Lee&lt;/p&gt;&lt;p&gt;We study minimum degree-sum conditions for decompositions into stars of sizes $k$ and $k+1$, where $k\ge3$. Write $σ(G)=\min_{uv\in E(G)}(d(u)+d(v))$, and let $c_k$ be the least integer threshold guaranteeing a $\{K_{1,k},K_{1,k+1}\}$-decomposition for every finite simple graph. Using Tarsi&amp;#x27;s sufficient condition, we prove that $K_n$ admits such a decomposition whenever $n\ge2k$. Together with the obstruction $K_{2k-1}$ of Zhao and Wu, this gives the optimal integer threshold $4k-3$ for complete graphs. For complete multipartite graphs, we establish the sufficiency of $σ(G)\ge9$ when $k=3$ by a finite computational verification and an extension argument. For every $k\ge3$, the complete tripartite graph $G_k=K_{k^2-k-1,k-2,1}$ satisfies $σ(G_k)=k^2-1$ and has no such decomposition. Consequently, $c_k\ge k^2$, even when the class is restricted to complete multipartite graphs. The optimal integer threshold in this class is therefore $9$ for $k=3$. Sufficiency of $σ(G)\ge k^2$ for complete multipartite graphs with $k\ge4$, and the exact values of $c_k$ for general graphs, remain open in this study.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.24973v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The chromatic-AT choosability of Pseudo-Halin graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.24974.html</link><guid isPermaLink="false">arxiv:2611.24974v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Zhiguo Li, Cuicui Ma, Zeling Shao&lt;/p&gt;&lt;p&gt;The \emph{Alon-Tarsi number} $AT(G)$ of a graph $G$ is the smallest integer $k$ such that $G$ admits an orientation $D$ with maximum outdegree at most $k-1$ in which the number of even Eulerian subdigraphs differs from the number of odd Eulerian subdigraphs. A 2-connected planar graph $G$ with minimum degree at least 3 is called a \emph{pseudo-Halin graph} if deleting the edges on the boundary of a single face $f_0$ yields a tree. Let $\mathcal{A}$ denote the class of pseudo-Halin graphs in which no two interior vertices are adjacent and every interior vertex has odd degree (equivalently, graphs obtained by iterated Hajós sums of wheels with an odd number of exterior vertices). In this paper, we completely determine the chromatic number and the Alon-Tarsi number of all pseudo-Halin graphs. Specifically, by structural induction and the method of $AT$-orientations, we prove that $AT(G)=χ(G)=4$ if $G\in\mathcal{A}$, and $AT(G)=χ(G)=3$ otherwise. Consequently, every pseudo-Halin graph is chromatic-AT choosable.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.24974v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] On the Erdős--Ginzburg--Ziv problem for $\mathbb Z_n^3$</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25050.html</link><guid isPermaLink="false">arxiv:2611.25050v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.NT</category><description>&lt;p&gt;Dongchun Han, Hanbin Zhang&lt;/p&gt;&lt;p&gt;The Erdős--Ginzburg--Ziv constant $\mathsf s(\mathbb Z_n^r)$ is the least positive integer $t$ such that every sequence of $t$ elements of $\mathbb Z_n^r$ contains $n$ terms whose sum is zero. In this paper, we prove that $$\mathsf s(\mathbb Z_n^3)=9n+o(n)$$ for odd $n$. For every fixed $r\ge 4$, we also show that $\mathsf s(\mathbb Z_n^r)\le\bigl(\binom{2r-1}{r}+1\bigr)n+o_r(n).$ Our approach combines Alon--Dubiner-type spectral expansion, Zakharov&amp;#x27;s convex-geometric framework, and restricted-sum ideas developed by Han and Ren.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25050v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Flatness and Tightness in Hypertopes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25099.html</link><guid isPermaLink="false">arxiv:2611.25099v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Gabe Cunningham, Claudio Alexandre Piedade, Philippe Tranchida&lt;/p&gt;&lt;p&gt;A hypertope is a thin, residually connected incidence geometry. For each pair of types $\{i,j\}$, the residues of that type must be polygons, and if all residues of that type are the same type of polygon, then we can record this information in a diagram $D$. Given such a diagram, we prove a lower bound on the number of chambers of a hypertope with that diagram. A hypertope that achieves this bound is called \emph{tight}. We prove that a hypertope is tight if and only if its diagram $D$ is a forest and, for every pair of types $\{i,j\}$ that is not an edge of $D$, every $i$-element is incident to every $j$-element. This generalizes a previously known result about abstract polytopes. Finally, we describe a combinatorial method and an algebraic method for constructing tight hypertopes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25099v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A Density Bound for Muñiz&#x27;s List Reversal</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25115.html</link><guid isPermaLink="false">arxiv:2611.25115v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Alan Talmage&lt;/p&gt;&lt;p&gt;Muñiz described the problem of reversing a list of positive integers under the following rules: given a list of distinct positive integers, at each step, one can combine two adjacent entries into their sum or break an entry into two entries with the same sum, under the constraints that after each step the list must contain distinct entries no larger than the original largest entry. The question of what lists are and are not reversible under these rules is studied and an asymptotic upper bound on the density of an irreversible list is established.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25115v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Labeled Chip-Firing on Ordered Directed Graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25137.html</link><guid isPermaLink="false">arxiv:2611.25137v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Ryota Inagaki, Tanya Khovanova, Austin Luo&lt;/p&gt;&lt;p&gt;We study labeled chip-firing on rooted directed graphs where for each vertex $v$, the children of $v$ are linearly ordered. When a vertex fires, the selected chips are sent to its children in increasing order. We show that homomorphisms preserving these child choices transport legal firing sequences. We then consider the directed lattice $\mathbb Z_{\geq0}^2$ and ask which chips can reach a given vertex. We give a recurrence for the smallest reachable label when sufficiently many chips are present and show that consecutive pairing attains this minimum. Finally, we determine the largest reachable label by symmetry and prove that the reachable labels form an interval when the number of initial chips is sufficiently large.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25137v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] New lower bounds for six small hypergraph Ramsey numbers</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25143.html</link><guid isPermaLink="false">arxiv:2611.25143v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Christian Lysenstøen&lt;/p&gt;&lt;p&gt;Let $R(k,l;t)$ denote the least $n$ such that every colouring of the $t$-subsets of an $n$-set with two colours has $k$ points all of whose $t$-subsets have the first colour, or $l$ points all of whose $t$-subsets have the second. We give explicit colourings proving $R(4,5;3)\ge 38$, $R(4,6;3)\ge 71$, $R(5,5;3)\ge 99$, $R(5,6;4)\ge 201$, $R(6,6;4)\ge 601$ and $R(6,6;5)\ge 84$. The first three improve the bounds 35, 63 and 88 listed in Radziszowski&amp;#x27;s dynamic survey. The last three improve the listed bounds 67, 133 and 72, and for the two 4-uniform numbers also the values 159 and 317 of a recent data deposit. The colourings of 3-subsets are invariant under groups of affine maps $x\mapsto ax+b$ of $\mathbb{Z}_n$, for $n=37$, 69 and 97, in the last two cases with one further fixed point. Those of 4-subsets live on the projective line over $\mathbb{F}_q$, for $q=199$ and $q=599$, and are invariant under $\mathrm{PSL}(2,q)$ or $\mathrm{PGL}(2,q)$, so each is given by a table of $q$ entries. For 5-subsets we show that, for every prime $q\ge 5$, invariance under $\mathrm{PGL}(2,q)$ forces six points all of whose 5-subsets have the same colour; our colouring is invariant under all affine maps of $\mathbb{Z}_{83}$. By known constructions the bounds give $R(5,5,5;3)\ge 9605$ and $R_k(5;3)\ge 98^{2^{k-2}}+1$, and $R(6,7;4)\ge 2001$, $R(7,7;4)\ge 12001$ and $R(8,8;4)\ge 588001$. The colourings, and programs that verify them, accompany the paper as ancillary files.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25143v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A refinement of Szemerédi&#x27;s distinct-distance bound for points in general position</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25148.html</link><guid isPermaLink="false">arxiv:2611.25148v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Péter Ágoston, Krishnendu Bhowmick&lt;/p&gt;&lt;p&gt;We prove that every collinear triple free set of $n\ge4$ points in the Euclidean plane determines at least $\lfloor n/3\rfloor+1$ distinct distances. This refines the classical bound $\lceil(n-1)/3\rceil$ of Szemerédi that is based on counting isosceles triangles. The refinement is based on treating the diameters separately: they only appear on the convex hull, so for them, we can use the planar diameter theorem and Altman&amp;#x27;s theorem on distances in convex polygons.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25148v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] \textsc{Max-Cut} on Token Graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25153.html</link><guid isPermaLink="false">arxiv:2611.25153v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>cond-mat.str-el</category><description>&lt;p&gt;José Angel Alejandro-Soto, Paulo T. Araujo, Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia, Mohamed Hibat-Allah, Md Moshiur Rahman Raj, Mahmud Ashraf Shamim, Ana Laura Trujillo-Negrete&lt;/p&gt;&lt;p&gt;Let $G$ be a graph on $n$ vertices, with a positive weight assigned to each edge. A cut of $G$ is a partition of its vertices into two sets $X$ and $Y$; the weight of $(X,Y)$ is the sum of the weight of the edges of $G$ with one endpoint in $X$ and the other endpoint in $Y$. The Max-Cut problem asks for the maximum weight, $m(G)$, of a cut of $G$. The $k$-token graph of $G$, is the graph, $F_k(G)$, whose vertices are the $k$-subsets of vertices of $G$, two of them being adjacent when their symmetric difference is an edge of $G$. The phase-reconstruction problem for Heisenberg antiferromagnets in physics can be rephrased as a Max-Cut problem on token graphs. Motivated by this, we study the Max-Cut problem on token graphs, mainly when all edges are assigned the same weight. Our main focus is to bound $m(F_k(G))$ in terms of $m(G)$. We prove that $m(F_k(G))\geq\binom{n-2}{k-1}m(G)$, and that this bound is tight up to a multiplicative factor of $1+O(k/n)$; in the case when $k=c \cdot n$ for some constant $0 &amp;lt; c &amp;lt; 1$, we provide an example where this bound is off by a multiplicative constant factor. We also show bounds for $m(F_k(G))$ for various classes of graphs $G$. Finally, we consider the algorithmic complexity of finding $m(F_k(G))$, showing it to be NP-complete for a constant $k$, and giving evidence that, when the weights take finitely many values, it is not NP-hard for $k\geq n^δ$ for any constant $δ&amp;gt;0$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25153v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Iterative constructions of semifields 2-dimensional over a nucleus</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25182.html</link><guid isPermaLink="false">arxiv:2611.25182v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.RA</category><description>&lt;p&gt;Lukas Kölsch, Paolo Santonastaso, Yue Zhou&lt;/p&gt;&lt;p&gt;The construction of finite semifields dates back to Dickson&amp;#x27;s work in 1906. To the best of our knowledge, only two iterative constructions were previously known: those of Hiramine, Matsumoto and Oyama in 1987, and of Kantor and Williams in 2004. The latter yields, for suitable even orders, superpolynomially many pairwise non-isotopic semifields. In this paper, we use skew-polynomial rings to give a new iterative construction of finite semifields. This construction produces large families of pairwise non-isotopic semifields, each of which is $2$-dimensional over one of its nuclei. In particular, we show that this construction method yields semifields not contained in any family of semifields known so far.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25182v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A note on Turán densities of daisies and hypergraph products</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25244.html</link><guid isPermaLink="false">arxiv:2611.25244v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Marko Pejić&lt;/p&gt;&lt;p&gt;The Turán density of an $r$-uniform hypergraph $\mathcal H$ is defined as $π(\mathcal{H})=\lim_{n\rightarrow\infty} \operatorname{ex}(n,\mathcal{H})/\binom{n}{r}$, where $\operatorname{ex}(n,\mathcal H)$ denotes the largest number of edges in an $\mathcal H$-free $r$-uniform hypergraph on $n$ vertices. For integers $r\geq s\geq2$ and $t\geq s$, an $(r,s,t)$-daisy $\mathcal D_r(s,t)$ is the $r$-uniform hypergraph consisting of all unions of a fixed $(r-s)$-set with the $s$-subsets of a disjoint $t$-set. We show that for every fixed $s\geq3$, \[ \lim_{r\rightarrow\infty}π(\mathcal D_r(s,t))=1-O_s(t^{-(s-1)}) \] as $t\rightarrow\infty$. This bound is best possible up to the implicit constant by a classical result of de Caen, and it answers, in a stronger form, a question of Ellis, Ivan and Leader, who asked for the case $s=3$. Moreover, we show a related result for matroid basis hypergraphs. We also consider Turán densities of hypergraph products, of which daisies are a special case. The product of two hypergraphs on disjoint vertex sets consists of all unions of an edge of the first with an edge of the second. For the product $\mathcal H^d$ of $d$ disjoint copies of a fixed $r$-uniform hypergraph $\mathcal H$ that is not $r$-partite, we show that $1-π(\mathcal H^d) \rightarrow 0$ exponentially fast as $d\rightarrow\infty$, and we determine the exponential rate in terms of the minimum number of edges in a homomorphic image of $\mathcal H$. This answers a question of Bollobás, Leader and Malvenuto up to a polynomial factor in $d$, and we further address a related question of theirs for products of two different hypergraphs.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25244v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Nilpotent skew-symmetric tridiagonal Bohemian matrices: a proof of Corless&#x27;s conjecture</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25266.html</link><guid isPermaLink="false">arxiv:2611.25266v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.RA</category><description>&lt;p&gt;Marcel Blattner&lt;/p&gt;&lt;p&gt;Corless studied the skew-symmetric tridiagonal matrices $T_m(u)$ with superdiagonal $u \in \{1, i\}^{m-1}$. He showed that $T_m(u)$ can be nilpotent only if $m = 2^K - 1$ and that the $2^{K-1}$ vectors $u$ obtained from the empty vector by repeated application of $u \mapsto (u, 1, i, \rev u)$ and $u \mapsto (u, i, 1, \rev u)$ give nilpotent matrices, and he conjectured that there are no others. We prove this conjecture. Reducing the characteristic polynomial modulo $4$ gives a necessary condition for nilpotency that is linear over $\F$. For $m &amp;gt; 1$ it forces $u = (v, 1, i, \rev v)$ or $u = (v, i, 1, \rev v)$, and an identity implicit in Corless&amp;#x27;s proof then reduces the problem to $v$. Since $T_m(u)$ is diagonally similar to a finite section of the Feinberg--Zee hopping matrix, the theorem also determines the nilpotent tridiagonal sign matrices. We further show that the $(1,1)$ entry of the resolvent of a nilpotent $T_m(u)$ is $λ^{-1} \pm λ^{-3} \pm λ^{-7} \pm \dots \pm λ^{-(2^K - 1)}$, with signs that determine $u$. The proof of the main theorem has been formalised in Lean~4.&lt;/p&gt;&lt;p&gt;abstract mentions Lean&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25266v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The Semi--Fibonacci Partition Tree</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25331.html</link><guid isPermaLink="false">arxiv:2611.25331v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.NT</category><description>&lt;p&gt;Andrés R. Moreno, José L. Ramírez&lt;/p&gt;&lt;p&gt;In this work, we introduce a binary tree in which every semi-Fibonacci partition appears exactly once. The left--right address of a vertex gives an explicit formula for the parts of the corresponding partition and encodes statistics such as the largest $2$-adic valuation among its parts. We construct a sign-reversing involution that refines Andrews&amp;#x27;s parity theorem by determining the difference between the numbers of partitions of a given integer at even and odd depths. Inspired by properties of the Calkin--Wilf tree, we study several parameters of our tree and use them to obtain new results on semi-Fibonacci partitions. We also derive generating functions for partition statistics and determine the average and extremal partition sizes at each level.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25331v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A complete intersection theorem for sets of bounded size</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25346.html</link><guid isPermaLink="false">arxiv:2611.25346v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jing Gu, Biao Wu&lt;/p&gt;&lt;p&gt;Let \(1\le t\le k\le n\) and \(2k&amp;lt;n+t\). We prove that a largest \(t\)-intersecting family of subsets of \([n]\) of size at most \(k\) is obtained by taking all such subsets that contain at least \(t+r\) points of a fixed \((t+2r)\)-element set, for some \(0\le r\le\left\lfloor\frac{n-t}{2}\right\rfloor\). This settles a conjecture of Ahlswede, Bey, Engel and Khachatrian from 2002.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25346v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Strong chromatic index of graphs with Ore-degree at most nine</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25381.html</link><guid isPermaLink="false">arxiv:2611.25381v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Xiaoxue Hu, Jiangxu Kong, Yu Xue&lt;/p&gt;&lt;p&gt;The strong chromatic index $χ_s^{\prime}(G)$ of a graph $G$ is the minimum number of colors in an edgecoloring in which distinct edges at distance at most two in the line graph receive different colors. Let $θ(G)=\max _{x y \in E(G)}\left(d_G(x)+d_G(y)\right)$ denote the maximum edge weight, also called the Ore-degree, of $G$. We prove that every finite loopless multigraph $G$ with $θ(G) \leq 9$ satisfies $χ_s^{\prime}(G) \leq 28$. For simple graphs, this improves the direct greedy bound from 32 to 28. In particular, it verifies the Erdős-Nešetřil conjecture for simple graphs of maximum degree five whose vertices of degree five form an independent set, using one fewer color than the conjectured bound of 29. When $θ(G)=9$, our bound is four colors above the bound of 24 predicted by the Ore-degree conjecture of Chen, Huang, Yu, and Zhou.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25381v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Note on the random triadic process II</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25447.html</link><guid isPermaLink="false">arxiv:2611.25447v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Fang Tian, Yiting Yang&lt;/p&gt;&lt;p&gt;For a fixed integer $r\geqslant 3$, the random $r$-generalized triadic process starts from a minimum weakly $K_r$-saturated graph, namely the complete $(r-1)$-partite graph $K_{1^{r-2},n-r+2}$ with $r-2$ singleton parts and one part of size $n-r+2$. At each step of the process a new edge $\boldsymbol{e}$ is added with probability $p$, provided there exists a copy of $B_{r-2}$ in $K_n$ for which $\boldsymbol{e}$ is its spine and the only edge that has not yet been added to the current graph, where $B_{r-2}$ denotes a triangular book graph consisting of $r-2$ triangles sharing a single common edge known as the spine of the book. When $r=3$, this is the random triadic process. Korándi et al. proved a sharp threshold probability ${p}= \frac 12n^{ - \frac 12}$ for the propagation of the random triadic process.Tian and Yang complemented those results by considering the final size of the random $r$-generalized triadic process when ${p}=o( n^{- \frac 12}\log^{ α(3-r)} n)$ for any fixed constant $α&amp;gt; \frac 12$.In this note, we further consider the sharp threshold probability $\tilde{p}_r$ for the propagation of the random $r$-generalized triadic process when $r\geqslant 4$. We prove that $\frac 12 n^{- \frac 12}&amp;lt;\tilde{p}_r\leqslant c\, n^{- \frac 12}\log^{ \frac 12} n$ for some positive constant $c$, and conjecture that $\tilde{p}_r= c_r\, n^{ - \frac 12}$, where $c_r= \frac 12(r-2)!^{ \frac{1}{2r-4}}\bigl( \frac{2r-5}{r-2}\bigr)^{ \frac{2r-5}{2r-4}}$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25447v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Fixed-opening-set positivity for perfect matchings</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25505.html</link><guid isPermaLink="false">arxiv:2611.25505v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Myungkyu Chae&lt;/p&gt;&lt;p&gt;For a perfect matching $M$ on $[2n]$, let $P_M$ be the interval order on its edges and let $\operatorname{Open}(M)$ be the set of smaller endpoints of its edges. For an opening set $O$ that occurs for some matching, put $S_O=\sum_{\operatorname{Open}(M)=O}X_{\operatorname{Inc}(P_M)}$ and $H_O=ωS_O$. We give explicit Schur and power-sum expansions of $H_O$ with nonnegative integer coefficients, and prove that $H_O$ is $h$-positive (equivalently, $S_O$ is $e$-positive). The Schur coefficients count standard tableaux of staggered skew shapes with prescribed entries in the left cells of distinguished dominoes. The Schur expansion follows from a Jacobi--Trudi sign-reversing involution on arrays with prescribed opener positions. For every partition $μ$ of $n$, a coefficient-transfer formula expresses $[h_μ]H_O$ as a positive scalar multiple of an elementary coefficient of the chromatic symmetric function of a clique blow-up of a path. This graph is a unit interval graph, so Hikita&amp;#x27;s theorem gives nonnegativity. The power-sum coefficients admit a cycle-type autocorrelation formula in terms of the restricted permutations from the Ferrers threshold model and an interpretation by alternating permutations with prescribed valley values and record partitions; we also obtain explicit threshold formulas. Further results include descent-set refinements, formulas for selected $h$-coefficients, and a rim-hook cancellation for the coefficient of $h_n$. These results refine the global matching identity of Amdeberhan, Shareshian, and Stanley.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25505v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Rational Designs and Prouhet--Tarry--Escott Problems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25516.html</link><guid isPermaLink="false">arxiv:2611.25516v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.MG</category><category>math.NT</category><description>&lt;p&gt;Ryutaro Misawa, Masanori Sawa, Filip Špiranec&lt;/p&gt;&lt;p&gt;For every strength, we prove the existence of rational designs on spheres, orthogonal and unitary groups, real and complex Grassmannians, and ellipsoids that are defined by positive-definite quadratic forms with rational coefficients and have a rational point. This answers Bannai&amp;#x27;s Problem for these spaces, solves the problem of Cui--Xia--Xiang on rational spherical $4$-designs on the unit circle, and proves Xiang&amp;#x27;s conjecture in the stronger form of existence in every dimension. To this end, we introduce the $(G,\mathcal{S})$-Prouhet--Tarry--Escott problem for an abelian group $G$ and a finite set of characters $\mathcal{S}$ and develop its existence and minimality theory. We also prove a general theorem transforming integer-weighted rational designs into equi-weighted designs on distinct rational points. On the unit circle $\mathbb{S}^1$, we determine the minimum sizes of rational spherical designs of strengths $4,5,6,7$ and show that they are respectively $2304,4608,9216,9216$. We also show that the minimum size of a rational spherical $5$-design on $\mathbb{S}^2$ is $192$. We further apply our framework to prove a conjecture of Thuswaldner--Ziegler on sums of distinct units and to answer Mahabaduge&amp;#x27;s problem on convex equilateral lattice polygons affirmatively.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25516v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Distance-hereditary split graphs whose second largest eigenvalue does not exceed 1</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25544.html</link><guid isPermaLink="false">arxiv:2611.25544v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Zihao Geng, Qian-Qian Chen, Ji-Ming Guo&lt;/p&gt;&lt;p&gt;The gem is obtained by joining a vertex to every vertex of a path on four vertices. A distance-hereditary split graph is a split graph containing no induced gem. In this paper, we characterize all connected distance-hereditary split graphs whose second largest eigenvalue does not exceed 1 and determine the multiplicity of the eigenvalue 1. Our result extends previous results on threshold graphs whose second largest eigenvalue does not exceed 1.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25544v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] k-trees with second largest eigenvalue at most one</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25559.html</link><guid isPermaLink="false">arxiv:2611.25559v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Zihao Geng, Ji-Ming Guo, Jongyook Park&lt;/p&gt;&lt;p&gt;The problem of characterizing graphs whose second largest adjacency eigenvalue is at most $1$ was posed by Hoffman and first studied by Cvetković in 1982. In this paper, all $k$-trees with second largest eigenvalue at most $1$ are characterized. We determine all equality cases and the multiplicity of the eigenvalue $1$. For each fixed $k\geq2$, we also determine the $k$-trees attaining the largest second largest eigenvalue below $1$ and the smallest above $1$. Finally, we determine all minimal forbidden induced subgraphs among $k$-trees with $k\geq 1$, each of which has second largest eigenvalue greater than $1$, but deleting any vertex gives a graph whose second largest eigenvalue is at most $1$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25559v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Positive semidefiniteness of random submatrices</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25662.html</link><guid isPermaLink="false">arxiv:2611.25662v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.PR</category><description>&lt;p&gt;Rajko Nenadov, Lander Verlinde&lt;/p&gt;&lt;p&gt;Given a symmetric matrix $A \in [-1,1]^{n \times n}$, we estimate the probability that a random principal submatrix, obtained by taking each index independently with probability $p$, is positive semidefinite. As a corollary, we show that $O(\varepsilon^{-1})$ indices chosen uniformly at random suffice for testing positive semidefiniteness with squared Frobenius distance threshold $\varepsilon n^2$, thus nearly matching the lower bound of Bakshi, Chepurko, and Jayaram (``Testing Positive Semi-Definiteness via Random Submatrices&amp;#x27;&amp;#x27;, FOCS 2020). The key ingredient is a dense model lemma for positive semidefinite matrices, proved using the hyperplane separation theorem and a contraction inequality for Rademacher random variables.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25662v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A sharp bounded bijection for tight cylindric partitions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25684.html</link><guid isPermaLink="false">arxiv:2611.25684v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.NT</category><description>&lt;p&gt;Scott D. Hughes&lt;/p&gt;&lt;p&gt;Fix a cyclic profile of coprime rank $r$ and level $\ell$, both at least three, and an entry bound $n\ge1$. Let $d$ be the deficit from the maximum volume of a tight cylindric partition. For $d\le n\min(r,\ell)$, the one-row combinatorial $R$ matches the tight cylinders whose last slice lies inside the maximizer&amp;#x27;s last slice with the partitions of $d$ in which each part occurs fewer than $r$ times. The inverse preserves the profile and entry bound. We identify every partition missed at the next deficit. A prefix test decides whether any cylinder lies outside this sector and, if so, identifies the unique one of least deficit. This explains the leading coefficient gap in Warnaar&amp;#x27;s $Q_{n,c}$. We also determine the first correction to the vertex terms of the published bounded determinant.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25684v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Extremal spectral results of outerplanar graphs without starlike trees</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25685.html</link><guid isPermaLink="false">arxiv:2611.25685v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Fulong Ye, Bofeng Huo, Yuxiang Liu, Ligong Wang&lt;/p&gt;&lt;p&gt;A graph $G$ is $F$-free if it does not contain $F$ as a subgraph. Let $\operatorname{SPEX}_{\mathcal{OP}}(n,F)$ denote the set of $n$-vertex $F$-free outerplanar graphs with maximum spectral radius. Define $S(l_1,l_2,\ldots,l_t)$ as the starlike tree obtained from $t$ vertex-disjoint paths of lengths $l_1,l_2,\ldots,l_t$ by identifying one endpoint of each path, and $C_{l_1,l_2,\ldots,l_t}$ as the graph obtained from $t$ vertex-disjoint cycles of lengths $l_1,l_2,\ldots,l_t$ by identifying one vertex from each cycle. When $l_1=l_2=\cdots=l_t=l$, we abbreviate these graphs as $S(t\cdot l)$ and $C_{t\cdot l}$, respectively. Previous results determined $\operatorname{SPEX}_{\mathcal{OP}}(n,S(t\cdot l))$ for $t\ge4$ [Graphs Combin. 42 (2026) 80] and for $t=3$, in each case for sufficiently large $n$. For $C_{l_1,l_2,\ldots,l_t}$, the corresponding extremal graphs are known for $t=2$ and sufficiently large $n$. The sets $\operatorname{SPEX}_{\mathcal{OP}}(n,C_{t\cdot l})$ were also determined for sufficiently large $n$ [Discrete Math. 349 (2026) 114673]. In this paper, we determine $\operatorname{SPEX}_{\mathcal{OP}}(n,S(l_1,l_2,\ldots,l_t))$ for sufficiently large $n$ when the branch lengths are not all equal. Our result for $t\ge4$ also includes equal branch lengths. As applications, we determine $\operatorname{SPEX}_{\mathcal{OP}}(n,C_{l_1,l_2,\ldots,l_t})$ for arbitrary cycle lengths and sufficiently large $n$. We also determine $\operatorname{SPEX}_{\mathcal{OP}}(n,F)$ for certain linear forests $F=\bigcup_{i=1}^tP_{l_i}$ and sufficiently large $n$. Finally, we apply our main theorems to obtain the known results on outerplanar graphs forbidding matchings or theta graphs for sufficiently large $n$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25685v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Real Principal-Minor Detectors: Normal Forms and Regular Parity Lifts</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25715.html</link><guid isPermaLink="false">arxiv:2611.25715v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Qingying Deng, Chaoyang Zhang&lt;/p&gt;&lt;p&gt;Let $A$ be a symmetric matrix over $\mathbb{F}_2$ on a finite index set, and let $t$ be the column of diagonal entries of $A$, viewed over $\mathbb{R}$. A real detector of $A$ is a real matrix whose principal minors equal the integer $0/1$ representatives of the corresponding principal minors of $A$. We prove that $A$ has a real detector if and only if it has one of the form $K+tt^T$, with $K$ skew-symmetric and $\{0,\pm1\}$-valued. These conditions are equivalent to the existence of a principally unimodular skew-symmetric signing of the bordered lift matrix of $A$, and to regularity of the parity lift of its delta-matroid. If the graph on the nonempty index set of $A$, with edges given by its nonzero off-diagonal entries, is connected, every real detector of $A$ is diagonally similar to a detector of this form. The proof uses cut-transposes to preserve the prescribed symmetric part up to diagonal similarity, then applies feasible singleton pivots to a minimal counterexample. For ribbon bouquets, the characterization proves Whistler&amp;#x27;s conjecture. For every $A$ with a real detector, the feasible-set generating polynomial is Hurwitz stable, and the polynomial counting feasible sets of sizes $2i-1$ or $2i$ by $i$ has only strictly negative real zeros and ultra-log-concave coefficients.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25715v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Fourier bases for square-order Paley graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25727.html</link><guid isPermaLink="false">arxiv:2611.25727v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.NT</category><description>&lt;p&gt;Bart De Bruyn, Sergey Goryainov, Yilin Xie, Weihao Yan, Ferdinando Zullo&lt;/p&gt;&lt;p&gt;Let $q$ be an odd prime power and consider the Paley graph $P(q^2)$ on the finite field $\mathbb{F}_{q^2}$. A well-known optimal eigenfunction of this graph is supported on the norm-one subgroup, where it takes the values $1$ and $-1$ on the two cosets of its subgroup of index two. Its support has the minimum possible size $q+1$. Starting from this eigenfunction, we construct a family of multiplicative translates and prove that they form a basis of the space of complex-valued functions on $\mathbb{F}_{q^2}^{\times}$. After extending these functions to the whole field, the translates indexed by squares form a basis of one nonprincipal eigenspace of the Paley graph, while those indexed by nonsquares form a basis of the other. In particular, both nonprincipal eigenspaces admit bases consisting entirely of optimal eigenfunctions. The main ingredient is a multiplicative Fourier analysis of the shifted eigenfunction. We determine the moduli of all its Fourier coefficients and, in particular, show that none of them vanishes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25727v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Beyond geometric lattices: pseudo-atoms and redundant join representations in the face lattice of the permutohedron</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25741.html</link><guid isPermaLink="false">arxiv:2611.25741v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Giovanni Rossi&lt;/p&gt;&lt;p&gt;We study the lattice obtained from the poset of ordered set partitions (the Fubini poset), ordered by merging adjacent blocks, by adjoining a bottom element of rank -1. It is the face lattice of the permutohedron. We look at it from the point of view of geometric lattices: it is graded, atomic and coatomic in the strong sense that every element is a meet of coatoms, but it is not semimodular. Its atoms are the $n!$ permutations, and its elements of rank one, which we call pseudo-atoms, are the edges of the permutohedron. Describing ordered set partitions by chains of subsets, the cuts, we show that the rank is modular whenever the meet is above $\bot$, while the join of two distant atoms can have large rank, so that the rank of the join is a metric on permutations. An element has a unique representation as a join of atoms only up to rank one; above it, irredundant representations have sizes ranging from two to the rank, and the redundancy of an element is its number of atoms minus two. The Möbius function is that of an Eulerian lattice, the Whitney numbers are the face numbers of the permutohedron, and the characteristic polynomial has the alternating coefficients of the geometric case, but only $\bot$ and $\top$ are left-modular, so the lattice is not supersolvable. We show that it is CL-shellable, we exhibit EL-labelings for $n\le5$, and we compare the independent sets of Raz arXiv:2307.05005 (v3, Jan. 2026) with irredundant families and with the matroid of the vertices of the permutohedron. Replacing ordered set partitions by partial flags of subspaces of $\mathbb F_q^n$ gives a $q$-analogue, whose Möbius function is $(-1)^{\mathrm{rk}+1}q^κ$, with $κ$ the number of pairs of elements in a common block at $q=1$, and whose characteristic polynomial and Betti numbers are polynomials in $q$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25741v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Coxeter Group Symmetries of Frieze Patterns</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25785.html</link><guid isPermaLink="false">arxiv:2611.25785v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.RT</category><description>&lt;p&gt;Yuta Kozaki, Saburo Kakei&lt;/p&gt;&lt;p&gt;Coxeter group symmetries of frieze patterns are investigated through their relation to $2\times n$ matrices and the associated Plücker coordinates. For odd order $n$, the symmetric group acts on the set of friezes, while for even $n$, the dihedral subgroup acts. We further show that a larger group acts when $n = 6$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25785v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Weak Degeneracy with Availability for Planar Graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25850.html</link><guid isPermaLink="false">arxiv:2611.25850v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Zdeněk Dvořák, Evelyne Smith-Roberge&lt;/p&gt;&lt;p&gt;Every planar graph admits exponentially many proper colorings for any assignment of lists of five allowed colors to its vertices. In this paper, we show that very little beyond degeneracy is needed to prove that this statement holds. In particular, given a planar graph G (but not the list assignment), our argument provides an algorithm consisting entirely of instructions of the following form: ``Color the vertex v using any color c from its list, and remove c from the lists of neighbors of v.&amp;#x27;&amp;#x27; and ``For the edge uv, choose any k colors from the list of u, then color v by any color c from its list that does not appear among these k colors, and remove c from the lists of neighbors of v.&amp;#x27;&amp;#x27; For every assignment of lists of size five to vertices of G, following this algorithm in all possible ways guarantees that at least $2^{|V(G)|/7}$ different proper colorings of G are produced (and at least one color choice is guaranteed to be available in each step). We also show that this result has the following consequence: for every planar graph G, there exists a set $R\subseteq V(G)$ of size at least 0.06|V(G)| such that G can be properly colored from any assignment of lists of size four to vertices in R and lists of size five to the rest of vertices of G. Moreover, these statements remain true even in stronger settings, such as for correspondence coloring.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25850v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A very robust Ramsey theorem for hypergraph matchings</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25893.html</link><guid isPermaLink="false">arxiv:2611.25893v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Peter Keevash, Peleg Michaeli&lt;/p&gt;&lt;p&gt;A fundamental result in Ramsey theory due to Alon, Frankl and Lovász gives an exact formula for the $q$-colour Ramsey numbers of matchings in $r$-uniform hypergraphs: if $n\ge\mathsf{AFL}_r(\mathbf{t})=(r-1)\|\mathbf{t}\|_\infty+1+\sum_{j=1}^q(t_j-1)$ then in any $q$-edge-colouring of $K^r_n$ there is some colour $j$ with a matching of size $t_j$. We show that a very weak quasirandomness assumption suffices for this Ramsey property: we can replace $K^r_n$ by any $r$-graph $H$ on at least $\mathsf{AFL}_r(\mathbf{t})+o(n)$ vertices that is a sublinear connector, meaning that it has no balanced $r$-partite holes of linear size. This generalises the result for $r=2$ (ordinary graphs) that we proved previously using a compression algorithm based on Gallai-Edmonds decompositions. This structure theory is unavailable in the hypergraph setting, so we combine two other proof methods, namely (a) simultaneous optimisation in all colours by clustering vertices using fractional cover weights from LP duality, and (b) local-to-global structure via random sampling and Kahn&amp;#x27;s matching theorem.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25893v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Schubert Calculus in the Eye of the Storm</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25956.html</link><guid isPermaLink="false">arxiv:2611.25956v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Neil J. Y. Fan, Peter L. Guo, Changzheng Li, Rui Xiong&lt;/p&gt;&lt;p&gt;We introduce new combinatorial objects, called storm diagrams, to study the torus-equivariant quantum $K$-theory of complete flag varieties $GL_n(\mathbb{C})/B$. We consider the quantum product of an arbitrary Schubert class with a modified Hirzebruch $λ_y$-class of a tautological subbundle. We show that its Schubert expansion coefficients are given by the total weights of storm diagrams. As applications, we establish Pieri rules for the torus-equivariant quantum $K$-theory of partial flag varieties $GL_n(\mathbb{C})/P$. Our storm diagrams provide the first combinatorial model for a manifestly positive multiplication formula for partial flag varieties beyond the Chevalley case, with restrictions imposed on only one of the two Schubert classes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25956v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Proof of Stanley&#x27;s Conjecture on the Leading Ehrhart Coefficients of the Birkhoff Polytope</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25973.html</link><guid isPermaLink="false">arxiv:2611.25973v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jiahang Liu, Jinlong Tang&lt;/p&gt;&lt;p&gt;Let $c(n,k)$ denote the coefficient of $r^{(n-1)^2-k}$ in the Ehrhart polynomial of the $n\times n$ Birkhoff polytope. For every fixed nonnegative integer $k$, we prove that $c(n,k)/c(n,0)\sim n^{3k}/(2^k k!)$ as $n\to\infty$, confirming a conjecture of Stanley.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25973v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Stars and paths in oriented graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26034.html</link><guid isPermaLink="false">arxiv:2611.26034v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Xuanrui Hu, Hanyi Wang, Yuefang Sun, Bo Deng&lt;/p&gt;&lt;p&gt;Let $\overrightarrow{F}$ be a fixed oriented graph. Its oriented Turán number, written $\exo(n,\overrightarrow{F})$, is the largest size of an $n$-vertex oriented graph with no copy of $\overrightarrow{F}$. This parameter extends the classical notion of Turán number to oriented graphs. In this paper, we investigate the supersaturation results for the directed path $P_k~(k\geq 2)$ and all oriented stars $\overrightarrow{S}_{p,q}~(0\leq p\leq q$), and all oriented paths of order at most four.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26034v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] An improved Moore bound for girths seven and eleven</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26037.html</link><guid isPermaLink="false">arxiv:2611.26037v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Frederik Garbe&lt;/p&gt;&lt;p&gt;Let $n(d,k)$ be the minimum number of vertices of a graph of minimum degree $d$ and girth at least $g=2k+1$. A simple counting argument gives the classical lower bound $n(d,k)\ge m(d,k)=1+d\sum_{i=0}^{k-1}(d-1)^i$, known as the Moore bound and dating back at least to 1960. Apart from complete graphs and odd cycles, graphs attaining this lower bound can exist only for girth $5$ and degrees $3,7$ and $57$ (Hoffman and Singleton 1960; Bannai and Ito 1973; Damerell 1973). Nevertheless, for more than sixty years this lower bound has not been substantially improved beyond an additive constant. For $k\geq 3$, i.e. girth at least $7$, the best general bound was $n(d,k)\ge m(d,k)+2$, due to Bannai and Ito (1981). We show that for fixed girth $7$ and growing degree $d$ we have $n(d,3)\ge m(d,3)+(1-o(1))d/8$. Furthermore, for girth $11$ we have $n(d,5)\ge m(d,5)+Ω(d^{3/5})$. In particular, the excess $n(d,k)-m(d,k)$, for $k\in\{3,5\}$, tends to infinity with $d$ and is therefore generally unbounded, which answers a question of Bollobás from 1978. For the degree/diameter problem we obtain similar bounds. A graph of maximum degree $d$ and diameter $3$ or $5$ has at most $m(d,3)-Ω(\sqrt{d})$ or $m(d,5)-Ω(d^{3/10})$ vertices, respectively. This answers a question of Bermond and Bollobás from 1981: for every constant $c$ there are $d$ and $k$ such that every graph of maximum degree $d$ and diameter $k$ has at least $c$ fewer vertices than the Moore bound.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26037v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Hilbert functions over the exterior algebra and f-vectors in higher rank III: Lattice points of the Kozlov polytope</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26110.html</link><guid isPermaLink="false">arxiv:2611.26110v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jan Snellman&lt;/p&gt;&lt;p&gt;Let $E$ be the exterior algebra on $n$ generators and $F=\bigoplus_{i=1}^r Eg_i$ a graded free $E$-module with $°g_i=d_i$. Part I of this series identified the convex hull of the Hilbert functions of the quotients $F/M$, $M$ a proper monomial submodule, as the Kozlov polytope $\mathrm{Koz}(n;\mathbf{d})$, a Minkowski sum of shifted Kozlov simplices, and described its vertices at rank two, conjecturing its facets there; Part II counted the Hilbert functions. Here we study the lattice points of the polytope. We show that the Kozlov simplex $\mathrm{Koz}(n)$ is a lecture hall simplex and that every point of $\mathrm{Koz}(n;\mathbf{d})$ has a unique chained decomposition into points of $\mathrm{Koz}(n)$. Hence the lattice points of $\mathrm{Koz}(n;\mathbf{d})$ are exactly the sums of shifted lattice points of $\mathrm{Koz}(n)$, the polytope has the integer decomposition property, every lattice point is a Hilbert function when $n\le 3$, and lattice-point counts and Ehrhart polynomials are products of transfer matrices of the kind used in Part II. We determine the codegree of every Kozlov polytope and show that none is Gorenstein for $n\ge 3$. Finally we compare discrete and continuous invariants: the number of Hilbert functions against the volume and the lattice-point count, where we prove Kupreyeva&amp;#x27;s observed limit for the fraction of lattice points that are $f$-vectors and extend it to every rank. We also compare the centroid and second moments of the Hilbert functions with those of the polytope.&lt;/p&gt;&lt;p&gt;abstract mentions Lean&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26110v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Maximum signless Laplacian spectral radius of graphs with given minimum degree and edge connectivity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26130.html</link><guid isPermaLink="false">arxiv:2611.26130v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Joyentanuj Das, Iswar Mahato&lt;/p&gt;&lt;p&gt;Let $G$ be a simple connected graph of order $n$ with minimum degree $δ$ and edge connectivity $k$. Recently, in [Linear Algebra Appl. 751 (2026) 318-330], Zhao, Ye, and Fan characterized the extremal graph with maximum signless Laplacian spectral radius among all graphs of order $n$ with minimum degree $δ$ and edge connectivity $k$ when $n \geq δ^2+4δ+3$ and $k \in \{0,1,2\}$, and proposed the corresponding problem for $3 \leq k \leq δ-1$. In this paper, we solve the problem for the entire range $0 \leq k \leq δ-1$ and completely remove the order restriction. Specifically, we prove that $$ q(G) \leq q(B_{n,n-δ-1}^{k}), $$ with equality if and only if $G \cong B_{n,n-δ-1}^{k}$, where $B_{n,n-δ-1}^{k}$ is the graph obtained from $K_{n-δ-1} \cup K_{δ+1}$ by adding $k$ edges joining a single vertex of $K_{n-δ-1}$ to $k$ distinct vertices of $K_{δ+1}$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26130v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Optimal Radius Ratio of Compact Nonuniform Packings</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26189.html</link><guid isPermaLink="false">arxiv:2611.26189v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.MG</category><category>math.OC</category><description>&lt;p&gt;Zhen Zhang&lt;/p&gt;&lt;p&gt;We study the ratio of the smallest to the largest radius in a nonuniform disk packing whose tangency graph triangulates the plane. We give a computer-assisted proof that the largest possible ratio is $s=0.651050185882609\ldots$, attained uniquely up to similarity by packing~53 of Fernique, Hashemi, and Sizova. In fact, every nonuniform packing with radius ratio at least $0.65105$ is similar to this packing. No periodicity or restriction on the number of radii is assumed; the radii are required only to have a positive infimum and a finite supremum. Following the finite-subgraph exclusion program of Connelly and Zhang, we first restrict the degree-five flowers and their pairings. The remaining exceptional degree-seven corona forces seventeen complete flowers on an unfolded disk with thirty-seven labels. An exact interval certificate excludes their angle equations. A comparison of logarithmic radii on a recurrent network then forces the radii and the three local degree words. We identify the entire triangulation by reducing these words to the square--octagon tiling and showing that its decoration is forced.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26189v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] The existence of generalized Steiner systems</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26226.html</link><guid isPermaLink="false">arxiv:2611.26226v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Xuan Wang, Shitao Li, Minjia Shi&lt;/p&gt;&lt;p&gt;A generalized Steiner system $GS(t,w,n,q)$ is a $q$-ary constant-weight code of length $n$ and weight $w$ that has minimum distance at least $2(w-t)+1$ and attains the Johnson-type upper bound $(q-1)^t\binom nt/\binom wt$. For strengths $t=1$ and $t=2$, such systems were known to exist for all sufficiently large lengths satisfying the necessary divisibility conditions. For general fixed parameters, Liu and Shangguan (J. Combin.\ Theory Ser.~A 209 (2025), 105955) proved that the Johnson-type bound is attained asymptotically, and asked whether it is attained with equality for all sufficiently large lengths satisfying these conditions. We answer this question affirmatively. We prove that, for fixed integers $q\geq3$ and $w&amp;gt;t\geq1$, a $GS(t,w,n,q)$ exists for every sufficiently large $n$ such that $\binom{w-i}{t-i}$ divides $(q-1)^{t-i}\binom{n-i}{t-i}$ for all $0\leq i&amp;lt;t$. Moreover, the system can be chosen so that the supports of distinct codewords intersect in at most $t$ coordinates. Our proof assigns an independent random labelling to every set of $t+1$ coordinates, which turns large support intersections into conflicts in an exact covering problem, and then applies Keevash&amp;#x27;s decomposition theorem for labelled complexes.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26226v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Sharp topological overlap in every dimension</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26229.html</link><guid isPermaLink="false">arxiv:2611.26229v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>cs.CG</category><description>&lt;p&gt;Sergey Norin&lt;/p&gt;&lt;p&gt;For a positive integer $d$ let $c_d^{\mathrm{top}}$ (resp. $c_d^{\mathrm{aff}}$) be the maximum $c$ such that, for every continuous (resp. affine) map from the $n$-dimensional simplex $Δ^n$ to $\mathbb{R}^d$, some point of $\mathbb{R}^d$ lies in the images of at least $(c-o(1))\binom{n+1}{d+1}$ of the $d$-dimensional faces, as $n\to\infty$. We show that \[ c_d^{\mathrm{top}}=c_d^{\mathrm{aff}}=\frac{(d+1)!}{(d+1)^{d+1}}. \] The second equality confirms a conjecture of Bukh, Matoušek, and Nivasch, who established the upper bound. The proof was found by GPT-6 Astra, following the directions of the author.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26229v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Combinatorial Dvoretzky Theory</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26253.html</link><guid isPermaLink="false">arxiv:2611.26253v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.MG</category><description>&lt;p&gt;Tomer Milo&lt;/p&gt;&lt;p&gt;Let $P \subset \mathbb{R}^n$ be an $n$-dimensional polytope such that $P \subset B_2^n$. Let $M^*(P)$ denote its mean width, and let $N$ be the number of facets (faces of dimension $n-1$) of $P$. We prove the following two bounds: (1) If $N \leq e^n$, then \[ M^*(P) \leq 1 - \frac{c}{\log^2(\frac{N}{n})}. \] (2) For arbitrary $N$, \[ M^*(P) \leq 1 - \frac{c}{n}N^{-\frac{2}{n-1}}. \] In both bounds, $c&amp;gt;0$ is an absolute constant.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26253v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] An asymptotic bound for Yuster&#x27;s independent transversal factor conjecture</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26259.html</link><guid isPermaLink="false">arxiv:2611.26259v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>cs.DM</category><description>&lt;p&gt;Xin Zhang&lt;/p&gt;&lt;p&gt;An $[r,n,1]$-graph has $r$ independent parts of size $n$, with a matching between each pair of parts. Yuster conjectured in 2021 that every such graph has a partition into independent transversals whenever $n\ge 2\lceil r/2\rceil$. We prove that there is an absolute constant $A&amp;gt;0$ such that, for all sufficiently large $r$, this partition exists whenever $n\ge\lceil r+A r^{20/21}\rceil$. Thus $f(r)\le r+O(r^{20/21})$, where $f(r)$ is the least $n_0$ such that every $[r,n,1]$-graph has such a partition whenever $n\ge n_0$. In particular, $f(r)/r\to1$, giving an asymptotic form of the conjecture.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26259v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Dense induced bipartite subgraphs under local sparsity</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26277.html</link><guid isPermaLink="false">arxiv:2611.26277v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Peiru Kuang, Jing Lin, Yan Wang&lt;/p&gt;&lt;p&gt;The study of dense induced bipartite subgraphs dates back to the work of Erdős, Faudree, Pach, and Spencer on triangle-free graphs. In this paper, we study this problem under different local sparsity conditions. First, we prove that for every fixed integer $t\ge 2$ and all sufficiently large $d$, every $K_{t,t}$-free graph of minimum degree at least $d$ contains an induced bipartite subgraph of average degree at least $\log d-16t\log\log d$. This follows from our bound $χ_f(G)\le d/(\log d-16t\log\log d)$ for every $d$-degenerate $K_{t,t}$-free graph $G$, which answers a problem of Allen, Dhawan, and Noel. For triangle-free $d$-degenerate graphs $G$, we prove that $χ_f(G)\le(2.85+o(1))d/\log d$, improving the leading constant 4 in the bound of Martinsson and Steiner. So every triangle-free graph of minimum degree at least $d$ contains an induced bipartite subgraph of average degree at least $(20/57-o(1))\log d$. We also extend the study of a conjecture of Esperet, Kang, and Thomassé to graphs containing triangles. We prove that if $G$ has minimum degree at least $d$ and each edge belongs to at most $d/k^2$ triangles, where $k=\lfloor\log d/\log\log d\rfloor$, then $G$ contains an induced bipartite subgraph of average degree $Ω(\log d/\log\log d)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26277v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Rainbow Matchings in $K_{r+1}$-free Graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26280.html</link><guid isPermaLink="false">arxiv:2611.26280v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Hongliang Lu, Xinxin Ma, Xing Peng&lt;/p&gt;&lt;p&gt;Let $n,m,r$ be positive integers with $n\ge 2m+2$, where $n$ is sufficiently large relative to $r$. Alon and Frankl determined the maximum number of edges in an $n$-vertex graph containing neither $K_{r+1}$ nor a matching of size $m+1$. In this paper, we establish a rainbow analogue of their result. More precisely, if $G_1,\ldots,G_{m+1}$ are $K_{r+1}$-free graphs on a common vertex set of size $n$, each having more than $\operatorname{ex}(n,\{K_{r+1},M_{m+1}\})$ edges, then $\{G_1,\ldots,G_{m+1}\}$ admits a rainbow matching.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26280v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Equality in the clique bound for critical graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26330.html</link><guid isPermaLink="false">arxiv:2611.26330v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Hongyang Wang&lt;/p&gt;&lt;p&gt;A graph is $k$-critical if its chromatic number is $k$ and every proper subgraph is $(k-1)$-colorable. Gao and Ma (2023) proved that every $n$-vertex $k$-critical graph with $n &amp;gt; k \ge 4$ contains at most $n - k + 3$ cliques of size $k - 1$, and asked which graphs attain this bound. We answer this question by showing that equality holds if and only if $n - k + 3$ is odd and the graph is isomorphic to the join of a complete graph on $k - 3$ vertices and a cycle of length $n - k + 3$. More generally, for $n&amp;gt;k\ge3$, we determine when the size of a nonempty family of distinct $(k-1)$-cliques in an $n$-vertex $k$-critical graph attains the upper bound $s-k+3$, where $s$ is the number of vertices covered by the family. Equality holds if and only if the graph is such a join (with the complete part empty when $k = 3$) and the family consists of all its $(k-1)$-cliques.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26330v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Hook histories and a two-parameter Murnaghan--Nakayama rule for dual canonical Grothendieck functions</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26397.html</link><guid isPermaLink="false">arxiv:2611.26397v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.RT</category><description>&lt;p&gt;Siddheswar Kundu, Santosha Pattanayak&lt;/p&gt;&lt;p&gt;We establish a two-parameter Murnaghan--Nakayama rule for power-sum multiplication in the dual canonical stable Grothendieck basis. The coefficients admit a closed boundary product formula and a signed combinatorial description by hook histories. We determine their exact support and prove an exact divisibility law for off-diagonal coefficients governed by the edge-connected components of the indexing skew diagram. We also obtain a hook expansion of power sums, an explicit binomial reduction to the dual stable rule, and a Grassmannian $K$-homological interpretation of the one-parameter specialization. Finally, we deduce complementary rules for power-sum multiplication in the canonical basis and the corresponding lowering operation in the dual canonical basis.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26397v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Algebraic matroids with non-algebraic duals exist in any positive characteristic</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26429.html</link><guid isPermaLink="false">arxiv:2611.26429v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.AG</category><description>&lt;p&gt;Lukas Grund&lt;/p&gt;&lt;p&gt;We show that for every field $K$ of positive characteristic there exists an algebraic matroid $M$ over $K$ such that the dual matroid $M^*$ is not algebraic over any field. Our conceptual proof relies on the theory of matroids over one-dimensional algebraic groups. As an application, we deduce that the classes of supports of realizable volume polynomials and of realizable covolume polynomials differ in positive characteristic.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26429v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] An operator $b$-positivity conjecture for Jack characters</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26439.html</link><guid isPermaLink="false">arxiv:2611.26439v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jean-Yves Thibon&lt;/p&gt;&lt;p&gt;Goulden and Jackson defined a Jack deformation $a_{μν}^λ(α)$ of the connection coefficients of the symmetric group and conjectured that these were polynomials in $b=α-1$ with nonnegative interger coefficients. This conjecture was extended to the structure constants of (stable) Jack characters by Śniady. We formulate a stronger operator conjecture: the differential operators $Δ_μ(α)$ that multiply by stable Jack characters should have coefficients in ${\mathbb N}[b]$ in the normally ordered Heisenberg basis $p_ID_J$. We provide numerical evidence, as well as theoretical consequences of the conjecture which can be rigorously proved. Namely, we exhibit two families of $α$-shifted symmetric functions whose associated differential operators are ${\mathbb N}[b]$ positive simultaneously on the bases $p_ID_J$ and $Δ_μ(α)$. These operators correspond to the Boolean cumulants of the Jack transition measure and to the Cartan generators of the affine Yangian $Y(\widehat{\mathfrak gl}_1)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26439v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Hypergraph Hajnal-Szemerédi</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26513.html</link><guid isPermaLink="false">arxiv:2611.26513v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Michelle Delcourt, Cicely Henderson, Thomas Lesgourgues, Luke Postle&lt;/p&gt;&lt;p&gt;A seminal result of Hajnal and Szemerédi from 1970 asserts that every graph on $n$ vertices with $q\;|\;n$ and minimum degree at least $\Big(1-\frac{1}{q}\Big)n$ admits a $K_q$-factor (a collection of vertex-disjoint copies of $K_q$ spanning all vertices). There has been sustained interest in extending this result to hypergraph $K_q^r$-factors. For general $q$ and $r$, Lu and Székely in 2007 showed that every large enough, $r$-graph $G$ with $q\mid v(G)$ and $δ_{r-1}(G) \ge \left(1- \frac{c}{q^{r-1}}\right)v(G)$ admits a $K_q^r$-factor (where $c$ is a constant depending on $r$ but not $q$), and there have been various subsequent improvements to the constant (but not the order) of this bound over the ensuing decades. Meanwhile, results from codegree Turán theory show that $δ_{r-1}(G) \ge \left(1 - \frac{c \cdot \log q}{q^{r-1}} \right)v(G)$ is necessary. Surprisingly, our main result shows that the order of this upper bound is not correct and, in fact, the codegree $K_q^r$-factor threshold is much closer to this codegree Turán theory bound. In particular, we show that $δ_{r-1}(G) \ge \left( 1-c\cdot \frac{\log^{1-1/(r-1)}q}{q^{r-1}}\right)v(G)$ suffices for the existence of a $K_q^r$-factor. Our key contribution is showing the same is true for the fractional threshold. Inspired by the first and fourth author&amp;#x27;s recent proof of the Nash-Williams&amp;#x27; Conjecture, we accomplish this by combining a linear programming framework with ideas from discharging. Additionally, we establish a technical result about finding large independent sets in sparse, non-uniform hypergraphs, which may be of independent interest.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26513v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Large $k$-cross-free families</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26539.html</link><guid isPermaLink="false">arxiv:2611.26539v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Jack H. Koolen, Anyuan Tian&lt;/p&gt;&lt;p&gt;Two subsets $A,B$ of a finite set $X$ are crossing if $A\cap B$, $A\setminus B$, $B\setminus A$, and $X\setminus(A\cup B)$ are all nonempty. A family is $k$-cross-free if it contains no $k$ pairwise crossing members. We construct such families on $n$ elements of size $(\frac{1}{3}+o(1))kn\log k$, where the asymptotic is taken as $k$ tends to infinity and is uniform over all integers $n\ge k$. This disproves the uniform $O(kn)$ bound conjectured by Karzanov and Lomonosov. Our construction consists of cyclic intervals with at most one point deleted, together with their complements. We also prove an $O(kn\log k)$ upper bound for $k$-cross-free families closed under all cyclic shifts of a fixed cyclic ordering of the ground set.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26539v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Edge cuts of bounded degree in sparse graphs</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26556.html</link><guid isPermaLink="false">arxiv:2611.26556v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><description>&lt;p&gt;Anna Neopryatnaya, Vladimir Verdenko, Vsevolod Voronov&lt;/p&gt;&lt;p&gt;Every simple graph on $n \ge 2$ vertices with at most $2n-2$ edges can be split into two nonempty parts with at most two crossing edges at each vertex. For $d \ge 3$ we bound the minimum number of edges in an n-vertex graph without a d-cut.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26556v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Quasipolynomial pyjamas</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26622.html</link><guid isPermaLink="false">arxiv:2611.26622v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.CO</category><category>math.DS</category><category>math.NT</category><description>&lt;p&gt;Sida Li&lt;/p&gt;&lt;p&gt;The ``pyjama stripe&amp;quot; $E(\varepsilon)$ is the set of all complex numbers whose real part lies within $\varepsilon$ of the nearest integer. The Pyjama Problem asks whether, for each $\varepsilon &amp;gt; 0$, there exists some union of finitely many rotations of $E(\varepsilon)$ about the origin that covers the plane. This was answered in the affirmative by Manners. Kravitz and Leng subsequently showed that $\exp(\exp(\exp(\varepsilon^{-O(1)})))$ rotations suffice. In this paper, we prove an upper bound of \[\exp((\log \varepsilon^{-1})^{50000})\] rotations. We also show that at least $(π/2 + 0.003 + o(1))\varepsilon^{-1}$ rotations are necessary, improving upon the natural lower bound of $(π/2 + o(1))\varepsilon^{-1}$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26622v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] Minimal primes and radicality of join-meet ideals of modular lattices with one diamond</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25997.html</link><guid isPermaLink="false">arxiv:2611.25997v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.AC</category><category>math.CO</category><category>math.RA</category><description>&lt;p&gt;Takayuki Hibi, Francesco Navarra&lt;/p&gt;&lt;p&gt;Let $L$ be a finite modular lattice with exactly one diamond, that is, exactly one interval of length two with at least three atoms. We describe the minimal primes of the join-meet ideal $I_L$ in terms of maximal closed distributive sublattices of $L$, and we show that $I_L$ has height $|L|-\mathrm{rank}(L)$. Moreover, we characterize the radicality of $I_L$, over any field, in terms of the complements of the atoms of the diamond in their fibres. Finally, we prove that $I_L$ is unmixed if and only if all its minimal primes have the same height, if and only if the rank of every maximal closed distributive sublattice through an atom of the diamond is $\mathrm{rank}(L)-1$; in this case $I_L$ is radical.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25997v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.AC] Comprehensive Gröbner Bases in Macaulay2</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26457.html</link><guid isPermaLink="false">arxiv:2611.26457v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.AC</category><category>math.CO</category><description>&lt;p&gt;María Agustina Cagliero, Oliver Clarke, Lorenzo De Biase, Angelo El Saliby, Giulia Gaggero, Weijia Wang&lt;/p&gt;&lt;p&gt;Studying parameter-dependent polynomial systems often requires stratifying parameter space according to the algebraic or geometric properties of the specialised systems. Comprehensive Gröbner bases and systems, which provide Gröbner bases valid under every specialisation, either uniformly or on specified regions of parameter space, are classical tools for studying polynomial ideals under specialisation. We introduce ComprehensiveGBs, a Macaulay2 package for computing comprehensive Gröbner bases and systems, either over the full parameter space or under specified parameter conditions. We describe its use and implementation, with examples involving Weierstrass cubics and graphs.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26457v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.GT] A census of alternating tangles</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25042.html</link><guid isPermaLink="false">arxiv:2611.25042v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.GT</category><category>math.CO</category><description>&lt;p&gt;Brendan D. McKay, Jeffrey Meier&lt;/p&gt;&lt;p&gt;We give a census of the roughly 10 billion prime, connected, alternating tangles with at most 14 crossings. Along the way, we prove analogs of the Tait conjectures for alternating tangles and observe that aspects of the geometry of alternating tangles are reflected in their diagrams, as is the case with links.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25042v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.IT] There is no binary linear $[65,9,29]$ code</title><link>https://pragyaangaur.dev/Paperlane/p/2611.24997.html</link><guid isPermaLink="false">arxiv:2611.24997v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>cs.IT</category><category>cs.DM</category><category>math.CO</category><description>&lt;p&gt;Zhichao Tang, Xiang Fan&lt;/p&gt;&lt;p&gt;We prove that no binary linear $[65,9,\geqslant29]$ code exists, equivalently, that no even binary linear $[66,9,\geqslant30]$ code exists. Together with known constructions, this determines $d_2(65,9)=28$, $n_2(9,29)=66$, and $n_2(9,30)=67$. A residual-code bound and a known construction also give $d_2(122,10)=56$. To prove nonexistence, we associate with a hypothetical even code a quadratic function derived from half the codeword weight modulo $2$. Its polar form determines the fourth derivative of a Boolean function of degree at most four. Character sums, weight moments, and the exclusion of weight-$42$ codewords give upper bounds on the support of this function in seven cases. Restrictions to nondegenerate affine subspaces exclude six cases. In the remaining case, equality would force four distinct coordinate functionals to be identically $1$ on an affine seven-space, although at most two can have this property. The argument uses published minimum-length results for binary linear codes of dimensions eight and nine.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.24997v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.OC] Integer Programming Strategies for the Snake-in-the-Box Problem</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25268.html</link><guid isPermaLink="false">arxiv:2611.25268v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.OC</category><category>math.CO</category><description>&lt;p&gt;Tim Kunt, Thorsten Koch, Hyejun Park&lt;/p&gt;&lt;p&gt;We present a selection of Integer Programming (IP) strategies for the Snake-in-the-Box problem, which asks for the longest induced path in the $d$-dimensional hypercube. Current records are based on sophisticated, exhaustive searches, with optimality proven only for instances up to dimension 8, motivating our study of IP formulations. We address symmetries and potential strengthenings. With the smallest open instance having as few as 512 binary decision variables, the proposed IPs offer a challenging and intriguing combinatorial problem. In addition, we extend the problem to higher-dimensional grid graphs and provide solutions for unexplored and unsolved instances.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25268v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] The Markov Property on Decorated Metric Planar Maps</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25081.html</link><guid isPermaLink="false">arxiv:2611.25081v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.PR</category><category>math-ph</category><category>math.CO</category><description>&lt;p&gt;Pablo Araya, Luis Fredes, Avelio Sepúlveda&lt;/p&gt;&lt;p&gt;We introduce decorated metric planar maps: planar maps whose edges $e$ are replaced by segments $[0,w_e]$, together with a continuous function on the resulting metric space, the decoration. We consider laws under which, conditionally on the metric map, the decoration follows a statistical physics model such as the Ising model or the Gaussian free field: the values at the vertices interact through a quadratic Hamiltonian and, given these values, the decoration along each edge is a Brownian bridge. Working with 4-regular maps with a boundary (the duals of quadrangulations with a boundary), we define a Markov property that allows explorations to stop in the middle of an edge. We show that, under mild regularity assumptions, the rerooting-invariant families of laws satisfying this Markov property are exactly the Boltzmann decorated metric maps. We also prove a strong Markov property and show that the random submaps inducing a Markovian decomposition are exactly the stopping maps for a suitable filtration. Finally, we obtain analogous results for classical decorated planar maps.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25081v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.PR] On Romik&#x27;s rationality conjectures for critical percolation</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26570.html</link><guid isPermaLink="false">arxiv:2611.26570v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.PR</category><category>math-ph</category><category>math.CO</category><description>&lt;p&gt;Melda Akyazi-Zavadski, Nathanaël Berestycki, Sunil Chhita&lt;/p&gt;&lt;p&gt;The completely packed $O(1)$ loop model can be viewed as an interface representation of critical bond percolation on the square lattice. We consider submatching events, which prescribe how these interfaces pair finitely many consecutive boundary points. Romik&amp;#x27;s rationality conjectures predict that the probabilities of these events on the semi-infinite cylinder are given by specific rational functions, which even become dyadic rationals in the half-plane limit. We derive explicit Pfaffian formulae for the probability of $k$ nested arches on the semi-infinite cylinder of circumference $2N$, valid for $k&amp;lt;N$. We deduce that these probabilities are rational functions of $N$ and, by taking the limit $N\to\infty$, that the corresponding half-plane probabilities remain rational. This establishes key aspects of Romik&amp;#x27;s conjectures. Our proof uses identities of Fonseca and Zinn-Justin, derived through the qKZ formalism, which express these probabilities as ratios of enumeration numbers for totally symmetric self-complementary plane partitions (TSSCPPs). These plane partitions admit a dimer representation, allowing us to apply Kasteleyn theory. We evaluate the resulting hypergeometric sum using Zeilberger&amp;#x27;s and Gosper&amp;#x27;s algorithms and then take the half-plane limit $N\to\infty$. Along the way, we derive a somewhat simplified expression for the inverse Kasteleyn matrix entries (encoding correlations in TSSCPPs) of Ayyer and Chhita, which might be of independent interest.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26570v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.RT] Euler up-down numbers and quiver representations</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26185.html</link><guid isPermaLink="false">arxiv:2611.26185v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>math.RT</category><category>math.AG</category><category>math.CO</category><description>&lt;p&gt;Giovanni Cerulli Irelli, Evgeny Feigin, Markus Reineke&lt;/p&gt;&lt;p&gt;We show that Euler up-down numbers enumerate isoclasses of representations arising from quiver Grassmannians which provide an explicit realization of PBW degenerate flag varieties. Using this geometric realization, we derive several formulas connecting Euler up-down numbers, median Genocchi numbers, and Motzkin numbers. We also define a new $q$-analogue of Euler up-down numbers and derive several formulas for these polynomials. We describe a natural poset structure on the set of isoclasses of subrepresentations and describe it in terms of the classical degeneration order. Finally, we prove that the finer strata defined by fixing isotypes of sub- and quotient representations are the orbits under the automorphism group of the ambient quiver representation.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26185v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Near-Quadratic Sample Compression for All VC Classes</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25011.html</link><guid isPermaLink="false">arxiv:2611.25011v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>cs.LG</category><category>cs.AI</category><category>cs.DS</category><category>math.CO</category><category>stat.ML</category><description>&lt;p&gt;Yang Cai, Vineet Gupta, Yanchen Jiang, Christopher Liaw, Aranyak Mehta, Shay Moran, Grigoris Velegkas, Di Wang, Manfred K. Warmuth&lt;/p&gt;&lt;p&gt;The sample compression conjecture is a longstanding open problem in learning theory, originating in the work of Littlestone and Warmuth in the 1980s. At its heart is a connection between simplification and generalization: if a predictor consistent with a training sample is defined using only a small part of that sample, then it is likely to generalize. Sample compression schemes formalize this idea, and many natural learning algorithms can be analyzed this way. The sample compression conjecture of Floyd and Warmuth (1995) asserts that every binary concept class of VC dimension $d$ admits a sample compression scheme of size $O(d)$; a weaker conjecture asks only for size polynomial in $d$. Both have remained open: the first bound depending only on $d$, due to Moran and Yehudayoff (2016), is exponential in $d$. We prove the weaker conjecture by constructing a sample compression scheme of size $O(d^2 \log^2 d)$.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25011v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Convexity is overrated: Shortest paths on 4-polytopes are hard to compute</title><link>https://pragyaangaur.dev/Paperlane/p/2611.25164.html</link><guid isPermaLink="false">arxiv:2611.25164v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>cs.CG</category><category>cs.CC</category><category>math.CO</category><category>math.MG</category><description>&lt;p&gt;Igor Pak&lt;/p&gt;&lt;p&gt;We prove that computing geodesic distance on the boundary of a rational convex $4$-polytope is NP-hard. We then construct rational $4$-polytopes with two rational points joined by exponentially many shortest paths of equal rational length, disproving several conjectures along the way. For the same problem, we also prove SQRTSUM-hardness under deterministic polynomial-time Turing reductions. By a separate argument, we show that the square of the geodesic distance between distinct rational boundary points of a rational convex polytope is a totally positive multiquadratic number.&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.25164v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] A Tensor-Algebraic No-Go Theorem for High-Dimensional Photonic Greenberger--Horne--Zeilinger States Discovered with AlphaProof Nexus</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26300.html</link><guid isPermaLink="false">arxiv:2611.26300v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>quant-ph</category><category>cs.AI</category><category>math.CO</category><description>&lt;p&gt;Mario Krenn, Moritz Firsching, George Tsoukalas, Rishikesh Gajjala, Xuemei Gu, Swarat Chaudhuri&lt;/p&gt;&lt;p&gt;Photonic GHZ states generated with probabilistic pair sources can be described by edge-coloured, complex-weighted graphs. In this representation, conditioning on an event with one photon in every detector turns the output amplitudes into coherent sums over perfect matchings, and generating an \(N\)-photon \(D\)-dimensional GHZ state is equivalent to constructing a monochromatic quantum graph. Here, we prove that no complex-weighted monochromatic quantum graph exists for any even \(N\ge4\) when \(D\ge N\). The proof, discovered through AI-assisted formal proof search in Lean using AlphaProof Nexus, constructs a weighted sum \(\mathcal F\) of amplitudes whose coefficients factor vertex by vertex. Summing over the colours at one fixed vertex reduces the problem to an \((N-1)\times N\) matrix of effective edge weights. For the graph amplitudes \(ω\) and GHZ target \(Δ\), the row--column imbalance yields \(\mathcal F(ω)=0\) but \(\mathcal F(Δ)\neq0\), contradicting the required equality \(ω=Δ\). Finally, we give a physical interpretation of the AI-discovered mathematical proof.&lt;/p&gt;&lt;p&gt;abstract mentions Lean&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26300v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
<item><title>[math.CO] Degree Lower Bounds for Symmetric Boolean Functions: Breaking the Prime-Gap Barrier</title><link>https://pragyaangaur.dev/Paperlane/p/2611.26446.html</link><guid isPermaLink="false">arxiv:2611.26446v1</guid><pubDate>Fri, 20 Nov 2026 14:55:46 +0000</pubDate><category>cs.CC</category><category>math.CO</category><description>&lt;p&gt;Xiaoming Sun, Chengu Wang&lt;/p&gt;&lt;p&gt;We prove that every nonconstant symmetric Boolean function on $n$ variables has exact real polynomial degree at least $n-O(n^{1/3}(\log n)^{2/3})$. This makes progress toward the conjecture of von zur Gathen and Roche that the degree is always at least $n-3$. The original prime-gap argument of von zur Gathen and Roche yields a degree deficit of $O(n^{0.525})$ using the theorem of Baker, Harman, and Pintz, or $O(n^{0.52})$ using an estimate claimed in a recent preprint. Our $\widetilde{O}(n^{1/3})$ bound on the degree deficit improves upon the $\widetilde{O}(\sqrt{n})$ bound obtainable from the prime-gap approach, even assuming the Riemann hypothesis or Legendre&amp;#x27;s conjecture. Notably, our proof avoids prime-gap estimates entirely. The proof combines vanishing binomial moments with the arithmetic of linear recurrences. A quantitative form of the integer Hankel determinant method in the Pólya--Carlson theorem forces the function&amp;#x27;s values on a central interval of Hamming weights to satisfy a short rational recurrence. A second determinant argument bounds the number of characteristic roots near $-1$. Through the binomial transform, these roots can then be cancelled by a polynomial test of degree below the deficit. An integer annihilator and contour estimates make the test isolate the first failure of the recurrence, yielding a contradiction with the vanishing-moment conditions. If the recurrence agrees with the function on a sufficiently long interval, arithmetic height bounds instead force a bounded period, which is ruled out by a separate polynomial test. Every numbered result in the paper has been formally verified in Lean~4.&lt;/p&gt;&lt;p&gt;abstract mentions Lean&lt;/p&gt;&lt;p&gt;&lt;a href=&quot;https://arxiv.org/abs/2611.26446v1&quot;&gt;Read on arXiv&lt;/a&gt;&lt;/p&gt;</description></item>
</channel>
</rss>
