archive
Every paper Pith has read. Search by title, abstract, or pith.
2161 papers in math.CO · page 4
-
Piatetski-Shapiro primes contain k-term APs for gamma near 1
Linear equations in Piatetski-Shapiro primes
-
Localization yields path categories for small categories
Weak and Strong Fibrations of Functors
-
ILPs compute exact harmonious chromatic numbers
Harmonious Colorings: bounds, heuristics and integer-linear formulations
-
Sharma-Mittal entropy is subadditive and supermodular under majorization
The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
-
Sharma-Mittal entropy is subadditive on majorization lattice
The Sharma-Mittal Entropy is Subadditive and Supermodular on the Majorization Lattice
-
Integral planes recover E8 sums and block rank-eight golden orders
Integral Planes and Unit-Norm Polytopes
-
Random graphs realize in 2^k ways or infinitely many
The number of realisations of a random graph
-
Almost every forbidden-blowup graph splits into r restricted parts
The typical structure of oriented graphs and digraphs with forbidden blow-up of transitive tournaments
-
Abelian Schur groups classified after verifying nonpowerful-order cases
Classification of abelian Schur groups II
-
Three-layer ReLU nets have explicit parameter symmetries
The Symmetries of Three-Layer ReLU Networks
-
Any graph needs at most n²/8 edits to become word-representable
The edit distance of word-representable and comparability graphs
-
Most vertex-transitive cubic graphs have base size at most 2
The base size of vertex-transitive cubic graphs
-
Max-tree maps avoiding d-permutations onto d-ary trees
Max-tree for d-permutations and pattern avoidance
-
Max-tree maps avoiding d-permutations to d-ary trees
Max-tree for d-permutations and pattern avoidance
-
Pattern counts bound entropy of symmetric subshifts
Explicit entropy bounds for symmetric nearest-neighbor subshifts
-
FHP theories extend NIP into low NTP2 with new field examples
Fractional Helly property and combinatorics of forking in NTP$_2$ theories
-
Interference-free morphisms preserve occurrence counts under iteration
On Occurrence-Preserving Morphisms
-
Codegree bound for intersecting families holds from n=2k+sqrt(2k)
Note on the codegree version of the Erd\H{o}s--Ko--Rado theorem
-
Tableaux count Schur coefficients for two-row Lie modules
Thrall's problem for two rows
4 Piths -
Zero-divisor graph invariants computed for F_p ring quotient
On Zero-Divisor Graph of the Ring $\frac{\mathbb{F}_p[u, v]}{\langle u^2,\, v^2, \, uv-vu\rangle}$
-
Recursive S_n structure proves specific molecule is a cell
Recursive structures of molecules and cells in Gelfand $S_n$-graphs
-
Equitable DP-coloring adds size balance to correspondence colorings
An introduction to equitable DP coloring of graphs
-
Pinching correction fixes refined BMV upper bound for m=2
On the Failure of the Upper Bound in the Refined BMV Conjecture and a Pinching Correction
-
Bent functions build explicit complete MUB sets
MUBs from bent functions
-
Triprojective structure yields APN permutations in odd dimensions divisible by three
Triprojective almost perfect nonlinear permutations and functions
-
Matroid rank yields global rigidity conditions for looped graphs
On Generic Linearly Constrained Frameworks
-
Integer coefficients fail to ensure thick returns along Hardy functions
Counterexamples to integer-coefficient criteria for recurrence along functions from a Hardy field
-
Colored Dyck paths encode bicubic planar maps
Rooted bicubic planar maps via Dyck paths
-
Weighted trace polynomial reconstructs trees from second moment
The (n-2,2)-Spectrum of a Graph
-
C4 expansion is sole counterexample to triangle conjecture
Triangles in graphs without the expansion of $4$-cycle
-
Quantum tower attack breaks ML-KEM-1024 and related schemes
Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics
-
Characterization yields free Schur ultrafilter on Z
Combinatorics of Schur ultrafilters
-
C4-free graphs get SNT-rank algorithm from star cover optimization
Optimization problem for star covers of graphs without four cycles
-
Character conditions for perfect sets in Cayley graphs
Equitable partitions of regular graphs, and perfect sets in normal Cayley graphs
-
Exact edge counts for outerplanar graphs avoiding double stars
The Outerplanar Tur\'{a}n Number of Double Stars
-
Min-degree k graphs with large girth contain induced K_{k+1} subdivisions
Induced subdivisions in graphs of large girth
-
Probabilistic surjectivity forces near-dictatorship in classification
Classification aggregation: a quantitative impossibility theorem
-
High-probability coverage still forces near-dictatorship in classification aggregation
Classification aggregation: a quantitative impossibility theorem
-
Delsarte bounds extend to multivariate Q-polynomial schemes
Codes and designs in multivariate $Q$-polynomial association schemes
-
Local split property recognizes probe diamond-free graphs in O(nm) time
Structural characterization and efficient recognition of probe diamond-free graphs
-
Unique dominant root settles ultimate positivity for any-order P-recursive sequences
Positivity of arbitrary-order P-recursive sequences with a unique dominant root
-
2-coloring of 2-sphere avoids mono unit triangles
Monochromatic unit equilateral triangle on low-dimensional spheres
-
Closed forms derived for weighted Tower of Hanoi costs
The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences
-
Closed forms found for weighted Tower of Hanoi costs
The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences
-
Weighted Hanoi yields closed forms via two move strategies
The Weighted Tower of Hanoi: Algebraic Structure, Phase Transitions, and Integer Sequences
-
ASL(Z)-invariant subsets come from polynomials and independent sampling
${\mathrm{ASL}_n}(\mathbb Z)$ invariant random subsets of $\mathbb Z^n$
3 Piths -
Nontrivial units vanish with high probability in random hypergraphs
Star-collision in random hypergraphs
-
Topfull graphs maximize 1-capacity via factorizations
Span capacities of graphs
-
No nontrivial t-edge-balanced graphs exist for t of 4 or more
On $t$-edge-balanced graphs
-
α-critical W_p graphs have three equivalent characterizations
A Ridge-Saturation Characterization of $\alpha$-Critical $\mathbf {W}_p$ Graphs