archive
Every paper Pith has read. Search by title, abstract, or pith.
2161 papers in math.CO · page 3
-
Finite groups without m-HORs or m-POSRs classified
On $m$-partite oriented semiregular representations of finite groups
-
Q_{4n} is NCI-group for all n
Generalized quaternion NCI-groups, NNN-groups and NNND-groups
-
Splitting and merging unify graphs
An axiomatic framework from splitting and merging in MAT-labeled graphs, vines, and single-peaked domains
-
t-admissible subgraphs determine regularity of symbolic powers
Critical subgraphs and the regularity of symbolic powers of cover ideals of graphs
-
Point sets achieve over n^1.014 unit distances
An explicit lower bound for the unit distance problem
-
Skew cylindric Schur functions expand positively with fusion coefficients
A concise proof of cylindric Schur positivity
-
Binary morphism avoids 16-powers but not 15-powers
Box Progressions, Abelian Power-Free Morphisms and A Sieve Technique for the Template Method
-
Unique-clique graphs yield spectral bounds via derived clique graphs
A Comprehensive Study of Clique Graphs and Clique Regular Graphs
-
Smallest zeta pole governs p-adic subalgebra counts in nilpotent algebras
$p$-Adic Asymptotic Subalgebra Enumeration
-
Optimal upper bound set for three-cosystole in rank-six regular matroids
Higher cosystoles of matroids
-
Bijection maps extended affine symmetric group to tabloid tuples
Dual Affine Robinson-Schensted Correspondence
-
k-gon triangulations appear in random graphs at constant-factor thresholds
Spanning triangulations in random graphs
-
Target-SAT triples solvable size for hardest random 3-SAT
Targeting Clause Type Distributions: a Picklock for Random Satisfiability Problems
-
Hypercube geodesics change color at most (π/2)√n times
Hypercube geodesics with few colour changes
1 Piths -
Hypercube geodesics need only sqrt(n) color changes in worst 2-coloring
Hypercube geodesics with few colour changes
1 Piths -
Exact formula counts primes between consecutive odd squares
A Matrix-Theoretic Exact Formula for Counting Primes in Intervals Between Consecutive Odd Squares
-
Inflated type-A characters give positive unimodal coefficients
Haiman's Conjecture and Springer's Representations
-
Every signed planar graph is 5-choosable
Every signed planar graph is $5$-choosable: A short proof and refinements
-
Design colourings impose new limits on Hadamard matrices
Locally Semi-Equitable Colourings of BIBDs
-
Short proofs settle three combinatorial conjectures
Short Proofs in Algebraic and Enumerative Combinatorics
-
Short proofs resolve echelonmotion conjecture and yield new Dilworth proof
Short Proofs in Algebraic and Enumerative Combinatorics
-
Generic sextics limit tropical tritangent lifts to six partitions
A lifting partition theorem for tropical tritangent classes to smooth space sextic curves
-
Recursive formula computes moments for coin flip pattern waits
Moments for generalizations of a coin flip game
-
WLP fails for chordal graphs in Orlik-Terao algebras
Subarrangements of type A: the weak Lefschetz property of the Artinian Orlik-Terao algebra
-
Graph function lattices match quiver subrepresentation lattices
A categorification of Kauffman states for planar graphs
-
Criterion gives exact p-adic valuation for trace codes from extension matrices
Divisibility of Trace Codes
-
Solutions to σ(n+1) = k σ(n) have zero natural density
A generalization of the Erd\H{o}s-Sierpi\'nski conjecture
-
Exact asymptotic minima for spanning forests in regular graphs
On asymptotic values for the minimum number of spanning forests in simple regular graphs
-
Exact limits found for minimum spanning-forest counts in regular graphs
On asymptotic values for the minimum number of spanning forests in simple regular graphs
-
Nondegenerate rank-metric codes map to hyperplane systems
The geometry of rank-metric codes
-
Cyclotomy yields first Paley-type skew partial difference sets
Cyclotomic skew partial difference sets and partial difference families
-
Toric normality matches for anti-blocking and unconditional polytopes
Algebraic aspects of unconditional lattice polytopes
-
Quantum homomorphism orders embed every countable partial order
The Quantum Homomorphism Orders are Universal
-
Linear algebra proves restricted sumset bound
Linear Algebraic Method and the Erd\H{o}s-Heilbronn Conjecture
-
Closed-rich constants of infinite words bounded above by 0.165952
Bounds on the closed-rich constant of infinite words
-
Kleitman bound holds exactly for subspaces when n is at least d+1
Kleitman's theorem over vector spaces: parity phenomena in canonical and global stability
-
Large 1-tough graphs free of P2 union k isolates are Hamiltonian
On hamiltonian cycles of 1-tough $(P_{2} \cup kP_{1})$-free graphs
-
Exact disjunctive domination numbers pinned down for C3 and C4 torus grids
On the disjunctive domination numbers of the torus grid graphs
-
Exact conditions found for multi-room wakeup solutions
A parallel wakeup problem and multi-room light switch strategies
-
Number of finite additive 2-bases grows exponentially
On the number of finite additive 2-bases
-
Probabilistic proof shows exponential growth of additive 2-bases
On the number of finite additive 2-bases
-
Mesh patterns of length 2 reduce to 105 equidistribution classes
Equidistribution of mesh patterns of short length
-
Cross t-intersecting families with tau_t >= t+1 maximize size product
On extremal cross $t$-intersecting families with $t$-covering number conditions
-
Roth theorem proved by combinatorial averages over sub-progressions
A Fourier-Free Density-Increment Proof of Roth's Theorem
-
Universal cycles exist for every affine line in AG(n,q)
Universal Cycles on Affine Lines
-
Consensus time centers around half log n plus log log n
Limit Laws for Consensus Protocols on the Complete Graph
-
Tweaked optimization improves covering code density bound
A Note on the Asymptotic Least Density of Covering Codes in $[q]^n$
-
Separation distance profiles computed for riffle shuffles and transpositions
Limit Profiles for Separation Distance
-
Shrinking factors enable super-linear NRD bounds for CSP predicates
Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
-
Steering speeds random walks to near-linear cover
Faster random walks via infrequent steering