archive
Every paper Pith has read. Search by title, abstract, or pith.
962 papers in math.CO · page 2
-
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
-
Weight distributions now closed for five perfect-code families
Closed Expressions for the Weight Distributions of Codes Associated with Perfect Codes
-
Planar 4-regular graphs always have conflict-free cuts except the octahedron
Conflict-Free Cuts in Planar and 3-Degenerate Graphs with 1-Regular Conflicts
-
Chromatic number of chamber Kneser graphs equals incidence-free number
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
-
Kneser chromatic number equals incidence-free number for projective planes
A note on the chromatic number of Kneser graphs on chambers of projective planes and incidence-free sets
-
Asymptotics of union-free hypergraphs settled for most t,r
Sharp bounds for uniform union-free hypergraphs
-
Asymptotics of t-union-free r-hypergraphs determined for most t,r
Sharp bounds for uniform union-free hypergraphs
-
Cubic surfaces yield positive geometries in dimensions 2
Positive Geometries from Cubic Surfaces
-
Sprout graph determines dendrite topology
Self-similar dendrites with finite boundary and P-sprouts
-
Divisor chains classify Gorenstein simplices with periodic h*-polynomials
Classification and counting of Gorenstein simplices with $h^*$-polynomial $1+t^k+\cdots+t^{(v-1)k}$
-
Walk and partition link yields hitting times in regular graphs
An algebraic-combinatorial framework for finding the average hitting times in graphs with high regularity
-
Hecke-Clifford superalgebras are semisimple only when h exceeds n or 2n
Representations of Hecke-Clifford superalgebras at roots of unity
-
Bound on oriented diameter for diameter-4 graphs improved to 18
An improved upper bound on the oriented diameter of graphs with diameter $4$
-
Tree min-max game value converges for d of 3 or more
A noisy min-max game on trees
-
Structural conditions give explicit permutation quadrinomials over F_{q^2}
Explicit determination of a class of permutation rational functions in any characteristic
-
384 pairs of Type-2 isomorphic circulant graphs on 32 vertices
A study on Type-2 isomorphic circulant graphs. Part 3: 384 pairs of Type-2 isomorphic circulant graphs $C_{32}(R)$
-
Modified Kostant game bijects to minimal Weyl coset representatives
Weyl Groups and the Modified Kostant Game
-
Normalized necklace counts rise strictly for real x over 1
Analytic Properties of Necklace Polynomials
-
C_16(1,2,7) and C_16(2,3,5) are Type-2 isomorphic for m=2
A study on Type-2 isomorphic circulant graphs. Part 1: Type-2 isomorphic circulant graphs $C_n(R)$ w.r.t. $m$ = 2
-
Minimal sequence collections detect discontinuities
On minimal collections of sequences for testing continuity
-
Recurrence for A001711 proven via harmonic closed form
A short proof of Mathar's 2020 recurrence conjecture for the generalized-Stirling sequence A001711
-
This paper defines generalized Andrásfai graphs GA(t,k) that include complete graphs and…
Generalized Andr\'asfai graphs and special Betti diagrams of edge ideals
-
Hamiltonian graphs with sublinear degree admit k-cycle 2-factors
On $2$-factors of Hamiltonian graphs
-
Averaging stabilizes meta-Fibonacci to sqrt(n) growth
Critical Slow Growth in Averaged Meta-Fibonacci Recursions
-
Perturbations refine nodal bounds for graph eigenvectors
Urschel Nodal Domains via Perturbation Theory
-
Min and max sizes of well-balanced subsets found for all simple root systems
Balanced subsets in root systems
-
Alternating compositions yield Wronskian times p-dependent constant
The Alternating Compositions of Weighted Differential Operators Yield The Weights' Wronskian With Which Constant?
-
Coarse Menger theorem holds on every surface with bounded modulator
A coarse Menger's Theorem for planar and bounded genus graphs
-
Spinal networks counted exactly with words and generating functions
Counting Spinal Tree-Child Networks via Word Encodings and Generating Functions
-
Modularity shows overlap gap on stochastic block model
The stochastic block model has the overlap graph property for modularity
-
Subgaussian vectors equal sum of fixed Gaussians in any dimension
On Talagrand's Convexity Conjecture
-
Ramsey chromatic thresholds for 3-chromatic pairs take one of five values
Chromatic thresholds for pairs of graphs
-
Polarity extends canonical forms to curved polypols as holonomic periods
Canonical forms and moment-generating functions of plane polypols
-
Theta graphs classified by when list counts match chromatic counts
Enumeratively Chromatic-Choosable Theta Graphs
-
Folding subgroups have length series in q-integers
The Poincar\'e Series of Coxeter Folding Subgroups
-
Colored stars capture local-global convergence for bounded graphs
Star observations in bounded-degree graphs