archive
Every paper Pith has read. Search by title, abstract, or pith.
2161 papers in math.CO · page 2
-
Exact weak k-metric dimension set for most K_n × K_n products
The weak $k$-metric dimension of the direct product of complete graphs
-
Ovoids attain sharp bounds on (r,s)-sets in PG(n,q)
$(r,s)$-sets from Desarguesian ovoids
-
Divisibility relations bound projective dimension of ideal squares
Cellular resolutions of second powers of square-free monomial ideals with divisibility relations
-
Catalytic equations reduce to grammar systems with universal growth
Combinatorics and Asymptotics of Positive Systems of Linear Catalytic Equations
-
Polylog edges force k noncrossing nested cycles
Polylogarithmic Bounds for Nested Cycles without Geometric Crossings
-
Shared pseudo-arc fixes Desarguesian spread intersection to Segre system
Segre Varieties and Desarguesian Spreads
-
Projection of flags complex gives sub-polynomial expander
A Simple Sub-Polynomial Degree Coboundary Expander
5 Piths -
Wheel Ramsey numbers bounded linearly by 6n
Diagonal Ramsey numbers for wheels
-
Exact sizes found for graphs with only star or incomparable induced subgraphs
Induced/Incomparable versus Ramsey
-
Persistent homology extends fractal Euler number to Cantor dust
An extension of fractal Euler number via persistent homology
-
Hypergraph conjecture fails due to excess edges
Excess Obstructions and Star-Isolated Certificates for the Hypergraph Nash--Williams--Tutte Conjecture
-
Algorithm exactly samples weighted polygon triangulations in O(n√λ log n) time
On weighted partial triangulations of convex polygons
-
Single 3-graph requires infinitely many structures for approximation
A single $3$-graph with infinite stability number
-
Quadratic forms classify undirected graphs on finite field subspaces
Graphs from quadratic forms and vector spaces over finite fields
-
Z_p-Ramsey number at most n + 6p
A linear upper bound on the $\mathbb{Z}_p$-Ramsey number of graphs with sufficiently large $2$-packing
-
AG codes yield rank-metric codes with small tensor rank defect
Constructions of Rank-Metric Codes of Small Tensor Rank
-
Four subdivision products give spectra of digraphs
Spectra of Subdivision Products of Digraphs
-
Linear-time algorithm finds EGZ zero-sum subsequence
Finding a Solution to the Erd\H{o}s-Ginzburg-Ziv Theorem in Linear Time
-
Set of permutations lacks reversal factorization in Hecke algebra
On Kazhdan--Lusztig basis elements having no reversal factorization
-
Regularization keeps only unique LCAs of small leaf sets in DAGs
Regularizing and Normalizing DAGs and Phylogenetic Networks
-
Six partition reciprocal conjectures proved by formalization
Reciprocals of Partition Polynomials
-
Formal proofs confirm six conjectures on partition reciprocal sums
Reciprocals of Partition Polynomials
-
Rado graph has the finite length property
The Finite Length Property of the Rado Graph and Friends
-
Polynomial at -1 counts signed strong classes for every odd k
Cyclic Sieving for Strong Dichotomy Enumeration
-
Uniform expansion produces thresholds for all monotone properties in geometric graphs
Thresholds for geometric graphs
-
Random graphs force monochromatic H-tilings at n^{-1/max(m2(H),1)}
Ramsey properties for tilings in random graphs
-
For prime-power r, low-dimensional T_r(f) guarantees an r-Tverberg point that survives…
Tverberg cores and Kalai's cascade conjecture
-
Infinite-exponent partitions on orders and graphs break weak choice
Structural Infinite-Exponent Partition Relations and Weak Choice Principles
-
Algebraic equation derived for A348410 generating function
The generating function of A348410 in OEIS using the diagonal method and another sequence (A001008) from OEIS
-
Degree threshold forces matching of size s in k-hypergraphs
On degree bounds of $k$-uniform hypergraphs with bounded matching number
-
k-connected graphs can be vertex-pancyclic without pancyclic edges
On $k$-connected vertex-pancyclic graphs without pancyclic edges
-
Double Lambert series coeff equals sum of divisors
Two Proofs of a Conjecture of Amdeberhan, Andrews and Ballantine for double Lambert series and a new Representation for $E_2(q)$
-
Bijection maps twenty-vertex configs to restricted Gelfand-Tsetlin patterns
A probabilistic bijection between twenty-vertex configurations with a free west boundary and Gelfand-Tsetlin patterns avoiding three equal entries in a row
-
Graphs of genus g need at least (8/3)^g Pfaffians
Exponential Lower Bounds for the Pfaffian Number of Graphs
-
Hypersimplicial subdivision gives geometric proof of Brenti-Welker identity
A geometric proof of the Brenti--Welker identity
-
n by n toroidal grid has treewidth exactly 2n-1
Treewidth of the $n \times n$ toroidal grid
-
Hop and 2-step domination NP-complete even on regular graphs
On the Complexity of Hop Domination and 2-Step Domination in Graph Classes
-
Nabla preserves Schur positivity for two-column Hall-Littlewood polynomials
Schur positivity of the nabla operator on two-column modified Hall--Littlewood polynomials
-
Correction shows generic 2D partial order has finite big Ramsey degrees
Corrigendum and Addendum to "Fra\"{\i}ss\'{e}'s Conjecture and big Ramsey degrees of structures admitting finite monomorphic decomposition''
-
r-graphs can avoid full Ramsey arrow but satisfy reduced version
A note on hypergraphs with asymmetric Ramsey properties
-
Odd type D has exactly 2^r-1 rational Weyl group elements
Rational Weyl group elements of odd type D
5 Piths -
Miniature volume of any lattice polytope is 1/binom(2d+1,d) of original
Horizontal miniatures and normal-sized miniatures of convex lattice polytopes
-
Extra slow Tamari lattices are semidistributive and congruence uniform
The extra slow Tamari lattice
-
Atlas thickness of posets at most width plus one
Navigating Posets with Few Maps
-
Positive-curvature trees restricted to endpoint caterpillars
Positive-Curvature Discrete Einstein Metrics on Trees
-
Integer grid connects in three steps or fewer
Pythagorean walks on $\mathbb{Z}^2$
-
Dense oriented graphs force biased squared Hamilton cycles
Oriented Discrepancy of The Square of Hamilton Cycles
-
Forbidden s-point pattern forces sub-maximal incidences
Extremal structure in dense arrangements of $k$-intersecting curves
-
Algebraic point set disproves Erdős unit distance conjecture
Remarks on the disproof of the unit distance conjecture
-
All 2-power string C-groups of rank d project onto one common group
String C-groups of 2-power order project onto a common string C-group