archive
Every paper Pith has read. Search by title, abstract, or pith.
2161 papers in math.CO · page 1
-
Toric ideals encode 3-point function relations via designs and pseudomanifolds
Incidence toric ideals and three-point functions
-
Three-row Chomp has exactly one winning first move for any length
Unique Winning Opening Move in Three-Row Chomp
-
Strong majority colorings bounded by 2Δ+1 colors
Strong majority colorings of graphs
-
Square grids have the most spanning trees among fixed-vertex rectangles
A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
-
Spectral radius bound yields k edge-disjoint 2-connected factors
Spectral radius and edge-disjoint connected factors of graphs
-
Semifields of order 256 with nucleus order 16 fully classified
New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256
-
Planar graphs without 4-cycles or shared triangle vertices admit flexible DP-4-colorings
Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles
-
Projective planes force some intersection size to repeat on Θ(q^{3/2}) lines
Balanced intersection size distributions in projective planes
-
Three-ball Hamming intersection rate given explicitly by α and β
List Reconstruction Problem with List Size Two
-
Low dimension suffices for near-max retrieval margins
Is Dimensionality a Barrier for Retrieval Models?
4 Piths -
Graph theory decides irreducible realizations for trace-zero spectra
The INIEP: Irreducible and Positive Realizations
-
Formula counts Pfaffian orientations on punctured cellulated surfaces
The number of Pfaffian orientations on punctured polygonally cellulated surfaces
-
Any sign pattern realized in Ehrhart polynomials
Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern
-
Finite states give rational counts for m-adjacency 132-avoiders
Finite-state enumeration of adjacency-constrained 132-avoiding permutations
-
AMDS constacyclic codes at length 4p^ς produce quantum AMDS codes
AMDS and quantum AMDS Constacyclic codes of length $4p^\varsigma $ over $\mathbb{F}_{{p}^{m}}$
-
k-WL cannot distinguish all simple-spectrum graphs for any k
Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them
-
Line-free sets in F_p^3 exceed hypercube by p^{3/2} term
A superlinear improvement on line-free sets in $\mathbb{F}_p^3$
-
Edge counts in random-graph polytopes obey central limit theorems
Central limit theorems for high dimensional lattice polytopes: cosmological polytopes
-
Iterative proof raises lower bound on H-blowup order
Finding blowups one vertex at a time
-
Uniform distribution maximizes independent-set sampling probability
Maximum Probability of Independence in Transitive Matroids
-
q-Polymatroids equate higher supports and rank weights
Higher Rank-Support Weights and q-Polymatroids
-
Per-vertex cliques tighten Q-index bound
Localized Tur\'{a}n-type inequalities for $Q$-index
-
Bound on intersections fixes code parameters for Hermitian varieties up to dim 4
Functional codes arising from rank $n$ Hermitian varieties and hypersurfaces in low dimensions
-
One multi-pile one-or-one-or-both version yields simple P-positions
Generalizing OOOOOOB
-
Group character degree sums relate to twisted involution counts
Complex Representations of Groups and Involutions of its Automorphisms
-
Iwasawa λ-invariants distribute over isogeny graphs as ℓ varies
Distributions of Iwasawa $\lambda$-invariants of $\mathbf{Z}_p$-towers over supersingular isogeny graphs
-
Code equivalence reduces to GI exactly when hull dimension is at most 1
The Closure of LCD-to-GI Reductions via Generalized Inner Products
-
Polynomial return sets syndetic iff polynomials linearly independent
Sets of large values of polynomial multi-correlation functions
-
Full-chord sets reach polylog Buffon discrepancy
Polylogarithmic Full-Chord Buffon Discrepancy
-
Affine star matrices reduce to Egyptian fraction equation
Star-Shaped Integral Cartan-Type Matrices and an Egyptian-Fraction Classification of Affine Weighted Trees
-
Explicit formulas for subalgebra zeta functions of Heisenberg groups
Symplectic lattice counting and zeta functions of higher Heisenberg groups
-
Generating function proves three formulas for complete Bell polynomials
Concise and elegant proofs of three formulas for complete Bell polynomials
-
Sum-free functions match Reed-Muller subcodes at 3/2 distance
On Reed-Muller subcodes, Grassmannian partitions and sum-free functions
-
Exact formula proves Betti recurrence for path cut complexes
Betti Numbers of Cut Complexes of Squared Paths and a Recurrence Conjecture
-
Grove polynomials dualize quasisymmetric Schubert cells
Grove polynomials and $K$-theoretic quasisymmetry
-
Graded fundamental theorems extend to fermionic matrix tuples
Fermionic matrices and super Cayley--Hamilton algebras
-
Path graph minimizes p-energy for every p at least 2
Path-Minimality of $p$-Energy for Connected Graphs
-
Structural results yield regular graphs with MMS property
The Manickam-Mikl\'os-Singhi Property in Graphs and Hypergraphs
-
All lattice path matroids are Ehrhart positive
Ehrhart positivity for lattice path matroids
-
Three bounded-complexity notions for fuzzy functions are equivalent
Holographic functions and neural networks
-
Matrix rational series create self-similar tilings in any dimension
On the self-similarity of rational power series with matrix coefficients
-
0/1-polytopes uniquely decompose into indecomposables
Indecomposability of 0/1-polytopes
-
Ore degree-sum condition yields near-perfect H-tilings
An Ore-type condition for $H$-tilings in graphs
3 Piths -
Degree sum condition ensures almost H-tiling in large graphs
An Ore-type condition for $H$-tilings in graphs
3 Piths -
Exact hidden paths recovered from noisy high-dimensional observations
Exact Hidden Paths in Noisy High Dimensional Path Spaces
-
Categorical Lusztig cycles form silting collections in weave sheaves
Categorical Lusztig cycles and weave schobers
-
Exact Turán number obtained for f3-blow-up of F5
On the Tur\'an number of blow-ups of $\mathcal{F}_5$
-
Ramsey numbers for many disjoint copies of H extend to random graphs
A random version of the Burr-Erd\H{o}s-Spencer theorem
-
Strict pattern counts speed Ehrhart computation for Gelfand-Tsetlin polytopes
Fast computation of Ehrhart polynomials of Gelfand--Tsetlin polytopes via Macdonald reciprocity
-
Generic polynomials on product spaces lack Cartesian structure
On the structure and generic non-Cartesianity of polynomials in product spaces