archive
Every paper Pith has read. Search by title, abstract, or pith.
934 papers in math.CO · page 1
-
Combinatorial model realizes join complex for alt nu-Tamari lattices
A combinatorial model for the canonical join complex of alt $\nu$-Tamari lattices
-
Graphs with exactly two Helmholtzian eigenvalues classified
Helmholzian Spectra of Graphs: Novel Properties
-
Dice sum reaches prime after expected rolls known to 1000 decimals
When Does the Dice Sum Become Prime?
-
Markov bases reduce distance in graph toric ideals iff they hit circuits
Distance Reduction in Bouquet Decompositions and Toric Ideals of Graphs
-
Cayley graphs revive quantum states at time 2π/p
Quantum Fractional Revival and Entanglement Entropy in Unitary Cayley Graphs
-
Lattice sums in polyhedra bounded via multiplicative approximation
Multiplicative Diophantine approximation and bounds for lattice sums
-
Banning many differences forces small sets without arithmetic progressions
A note on arithmetic progressions with restricted differences
-
Cochordal property yields exact Betti numbers for chain ring graphs
Betti numbers for cochordal zero-divisor graphs of commutative rings
-
Cyclic orbits reorganize all Leibniz terms in determinants
ARE Method: Orbital Decompositions and Dihedral Cancellations for Determinants
-
Merging builds labelings for graphs of even cycles and paths
A merging procedure for labelings of bipartite graphs
-
4/9 is a non-jump for 3-uniform hypergraphs
The number $4/9$ is a non-jump for $3$-graphs
-
Element partition rules out generalized bent functions for composite q
Nonexistence of certain classes of generalized bent functions: Revisiting the element partition method
-
Affine invariance threshold in prime fields is o(log p)
Almost Affine Invariance Over Prime Fields: Green Problem 90
-
Inhomogeneous q-Whittaker polynomials form basis of extended symmetric ring
Inhomogeneous $q$-Whittaker polynomials II: ring theorem and positive specializations
-
The paper defines semi-interlaced polytopes by relaxing the interlacing condition on…
Semi-interlaced polytopes
-
Magic rectangle sets exist over dihedral groups for even m and n
Note on a magic rectangle set on dihedral group
-
Conjecture holds for standard hypercube decompositions
Double shortcuts of standard hypercube decompositions
-
Size or spectrum threshold forces k-d-critical graphs
Size and spectral conditions for a graph with given minimum degree to be $k$-$d$-critical
-
Base partitions and moves realize Russell's series for CMPP partitions
Combinatorial construction of Russell's series for partition classes defined by Capparelli, Meurman, Primc, and Primc in the $k$=1 Case
-
Ternary maximal self-orthogonal codes of length 25 classified
Classification of ternary maximal self-orthogonal codes of length 25
-
Dyck row-insertion yields Schur-positive symmetric functions
Dyck Symmetric Functions and Applications to \(q,t\)-Catalan Polynomials
-
Cross-index matches topological union bound only for Z2
The mapping index through the lens of the cross-index
-
Temperley-Lieb immanants prove Schur-positive on ribbon matrices
Temperley-Lieb Immanants of Ribbon Decomposition Matrices
-
Circulant graphs form Abelian groups via Type-2 isomorphism
A study on Type-2 isomorphic circulant graphs. Part 6: Abelian groups $(T2_{n,m}(C_n(R)), \circ)$ and $(V_{n,m}(C_n(R)), \circ)$
-
Random mutations make c-vectors sign-coherent with probability 1
Eventual sign coherence
-
960 triples of Type-2 isomorphic circulant graphs on 54 vertices
A study on Type-2 isomorphic circulant graphs. Part 4: 960 triples of Type-2 isomorphic circulant graphs $C_{54}(R)$
-
Closed form proves recurrence for Lehmer-Comtet diagonal
A short proof of Mathar's 2021 recurrence conjecture for the Lehmer-Comtet diagonal A045406
-
q-Fibonomials proven unimodal for n at most 3
Unimodality of $q$-Fibonomial coefficients for small cases
-
Deepest leaves in binary trees decay as 4 to the minus m
The Distribution of the Deepest Leaves in Binary Trees
-
Unbreakable quasi-graphic matroids now fully classified
The unbreakable quasi-graphic matroids
-
Infinite family of groups has D-finite cogrowth series
On groups with D-finite cogrowth series
-
Pseudorandom graphs hold nearly α^n spanning trees
On the number of distinct spanning trees in pseudorandom graphs
-
Log-convexity unifies majorization inequalities for polynomials
Majorization Inequalities from Logarithmic Convexity
-
Evolution algebras from expanders meet Alon-Boppana bound
Expander Evolution Algebras
-
Chromatic number fixes minimum size of G-Sperner families
Cover-free families on graphs
-
Rod groups collapse into 32 isomorphism classes
Subperiodic groups and bounded automorphisms of periodic graphs
-
Relative accessibility matches algebraic version for groups via Boolean subring
Relative accessibility for graphs
-
Summing all topologies solves 3D quantum gravity
A solvable model of 3d quantum gravity
-
Tree-like pairings guarantee factorization of tensor invariants at large N
Large $N$ factorization of families of tensor trace-invariants
-
RL discovers rigid graphs with record realization counts
Learning Minimally Rigid Graphs with High Realization Counts
-
18 pairs of Type-2 isomorphic circulants on 48 vertices
A study on Type-2 isomorphic circulant graphs. Part 5: Type-2 isomorphic circulant graphs of orders 48, 81, 96
-
Recursive rules build all matroid polytopes in ranks 2 and 3
The polytope of all matroids in ranks 2 and 3
-
Stepping-up lemma gives linear-height towers for p-colored path Ramsey numbers
A stepping-up lemma for monotone paths with bounded color complexity
-
Field multiplication symmetric tensor rank matches its Gabidulin code rank
Symmetric Tensor Decompositions over Finite Fields
-
Planar digraph feedback vertex sets bounded by (n-2)/(g-2)
Feedback vertex sets of planar digraphs with fixed digirth
-
Outer-k-string recognition is NP-hard for any fixed k
Two Results on Outer-String Graphs
-
Manipulated lifting yields first set-like sunflower-free subspace families
On set-like sunflower-free families of subspaces over finite fields
-
Reeb spaces stay 1D graphs even without CW structure
Representations of Reeb spaces via simplified graphs and examples
-
Finite-field angular metric yields unique projective decoding
Angle Between Two Vectors over Finite Fields and an Application to Projective Unique Decoding
-
Circular words contain at most 5/3 n distinct squares
A Tighter Upper Bound for the Number of Distinct Squares in Circular Words