Nonexistence of 3-ladders at ℵ₂ matches Mahlo consistency
Ditor's 1984 question on whether the size bound ℵ_{n-1} is attained for n=3 is independent of ZFC.
full image
Combinatorics
Discrete mathematics, graph theory, enumeration, combinatorial optimization, Ramsey theory, combinatorial game theory
Ditor's 1984 question on whether the size bound ℵ_{n-1} is attained for n=3 is independent of ZFC.
full image
A Resolution of ErdH{o}s Problem 550 on Tree versus Complete Multipartite Ramsey Numbers
R(T, K_{m1..mk}) ≤ (k-1)(R(T, K_{m1 m2})-1) + m1 holds for all large trees T, resolving Erdős question 550.
A Resolution of ErdH{o}s Problems 593 and 1177: Obligatory Triple Systems and Exact Spectra
Resolves Erdős 593 via generative class and bridge conditions; yields spectrum dichotomy for 1177.
full image
The structure of FAC posets and the Aharoni--Korman conjecture
Result applies to all such posets by first decomposing them into scattered components that mirror the full order.
full image
Robustness and hyperstability for the ErdH{o}s-Gallai theorem
Graphs with average degree d retain a cycle of length (1-c)d after keeping each edge with probability about 1/d.
full image
Part bounds for the Sylow permutation characters of S_n
Partitions labeling the irreducible parts of the 2-Sylow permutation character are restricted in length.
Symmetric edge polytopes are not gamma-positive
An infinite family of counterexamples begins at dimension 36, showing their Ehrhart h*-polynomials are not always gamma-positive.
full image
Characterisations of strong Delta-matroids
Five equivalent characterisations unify exchange axioms and arise from tropicalisation of the orthogonal Grassmannian quadratics.
full image
Polynomial mixing for polygonal side matchings
Genus-preserving swaps connect all diagrams of a given genus and reach uniform distribution after polynomially many steps.
full image
From Ham-Sandwich to Centerpoints: Semialgebraic Algorithms for Cutting Polytopal Measures
For polytopal measures the cap-volume function is piecewise rational, turning prescribed-proportion cuts into polynomial-time semialgebraic
An extremal theorem for positive curvature of graphs
The bound is optimal, with a unique extremal example when n is even and at least 12.
full image
Towards the Overfull Conjecture II
Result covers all large graphs where maximum degree exceeds half the vertices by any fixed positive fraction.
full image
Tensor Amplification and Spectral Transfer for Sidorenko-Type Inequalities
When v(H) ≤ e(H) the combinatorial inequality holds exactly when homomorphism density meets a power of the Perron radius.
Characterizing finite posets whose probabilistic powerdomain are RB-domains
Classification shows probabilistic powerdomain fails to preserve RB-domains, with diamond as counterexample.
One-Weight Colorings, the Symmetric Class, and Lower Bounds for Hales--Jewett Numbers
The match reduces the symmetric lower-bound problem to one-dimensional Gallai coloring and supplies HJ(3,3) at least 22.
Counterexamples to two conjectures about matroids
White's toric ideal claim and Mason's log-concavity claim both fail for specific matroid constructions.
full image
3-Colouring Graphs Excluding a Fixed Minor
Extends the planar result to all proper minor-closed classes and improves the 2008 square-root bound
The universal zero-sum invariant and weighted zero-sum for infinite abelian groups II
The classification covers every finite case; weighted versions over infinite groups reduce to kernel-cover properties on Cartesian powers.
Separating Geodesic Structure and Product Structure
Graphs of bounded row treewidth can require arbitrarily large geodesic treewidth; deciding geodesic treewidth 1 for treewidth-2 graphs is in
full image
A recurrence solved via exponential generating functions yields the number and links it to ordered Bell numbers.
On Orthogonal Graphs and their Automorphisms
The graph on non-isotropic points with tangent-line edges is fixed by the induced subgraph around any single vertex.
Double-scaled SYK from boundary metrics of planar maps
At fixed perimeter the geodesic chord diagrams follow exactly the same distribution as in the double-scaled SYK model.
full image
A nine-line counterexample to a conjecture on the minimal degree of Jacobian relations
Arrangements with identical lattices have mdr values 4 and 5, so one falls below the conjectured d/2 bound for degree 9.
AVD Total Coloring of Central Graphs, Subdivision Graphs, and the Join of Graphs
Verification for regular graphs, complete bipartite graphs, and equal-order joins narrows the open cases of the 2020 conjecture.
full image
Plain cycles stay unpartitioned at all sizes while c=2 rings switch with log-evidence growing linearly in n.
full image
A Shifted t-Schur Weight from the Modified Odd Operator
The operator produces explicit Pfaffian kernel, Fredholm expression for largest part, and cumulants; negative t gives a probability measure.
Euler characters for general linear Lie superalgebra
Results stated in new terms extend prior work on the general linear Lie superalgebra.
Spherical Designs with Infinite Harmonic Strength
For dimensions two and higher, finite point sets integrate spherical harmonics of infinitely many degrees exactly precisely when they are sy
A note on long nontrivial cycle in Hamiltonian graphs
Combining a poset-based constructive method with a nonconstructive approach improves the prior n-O(n^{4/5}) bound and is tight for these tec
full image
A global girth obstruction for Garg--Mineyev taiko product structures
High middle-link girth forces a rectangle decomposition that drops at least one horizontal girth below 6, closing the Garg-Mineyev route for
full image
On the generalized Tur\'{a}n number of the complete bipartite graph K_(3,b+1)
Completes the cubic-order result by handling the remaining odd-b case via a finite-geometry construction.
Categorification of some Penrose polynomials
A cube of resolutions from possibly nonorientable 2D cobordisms produces doubly- and triply-graded groups whose Euler characteristics match
The analytic properties of Hoggatt triangles
Minors taken from consecutive rows and columns of Pascal's triangle yield total positivity and normal row asymptotics for every d.
Total positivity of transformation matrices for uniform subdivisions
Combinatorial argument shows all minors positive; sufficient condition gives TP2 for uniform and r-colored cases.
full image
The operator that multiplies coefficients by Narayana polynomials sends nonnegative real-rooted inputs to real-rooted outputs and certifies
Formalized q-series: The Rogers-Ramanujan Identities and Beyond
Custom structures for q-Pochhammer symbols and Bailey's lemma produce computer-checked proofs of the classical identities.
Sharp Lower Bounds for Sumsets in Hypercubes
The exponent p = n log(m+1)/log(nm+1) is optimal for subsets of {0..m}^d and resolves a long-standing conjecture.
full image
The difference a(G) − α(G) never exceeds a closed-form function of the maximum matching size, attained for every μ.
full image
Alexander's conjecture for infinite simplicial complexes
The finite-case result extends: triangulations with a common subdivision also share a common stellar subdivision when complexes may be infin
Decomposition of Greedy Tamari Intervals and Bipartite Planar Maps
An explicit recursive isomorphism proves they are equi-enumerous and supplies the missing refined count.
full image
Vector-valued smoothing for finite Sidon sets
A vector-valued convolution inequality with averaged kernel energies tightens the coefficient on the N^{1/4} term.
Spanning \(k\)-trees and the colorful Carath\'eodory theorem
Elementary combinatorial argument proves the constrained version for joins with sphere wedges, replacing earlier topological proofs.
full image
Coefficients from the algebra match weighted placements on staircase boards and interpret generalized Stirling numbers for p not equal to 1.
full image
A complete solution to the generalized honeymoon Oberwolfach problem with one round table
For HOP with s small tables and one round table, the divisibility requirements guarantee a solution exists.
full image
An improved constant for Vizing's conjecture
New inequality improves the constant in the open Vizing conjecture on how domination scales under graph products.
An edge-spectral supersaturation of Mubayi's theorem for color-critical graphs
Exceeding 2(1-1/r)m by q yields at least (B_F-o(1)) q m^{(f-2)/2} copies when q ≤ δ_F sqrt(m).
full image
Fair Allocation under Conflict Constraints via Strong Colorability
The paper introduces a hierarchy of strong chromatic number variants to characterize and algorithmically guarantee SD-EF1, EF1, and EF[1,1]…
Function-Counting Theory for Low-Dimensional Data Structures
Extending Cover's counting theory shows how manifold structure shapes classification capacity and generalization.
full image
The Schur positivity of nabla m_μ
A 1999 conjecture is settled by a recursion into the C_α(1) basis followed by known positivity of LLT polynomials and shuffle theorems.
On the Extended 1-2-3 Conjecture of Pilz
For any finite A of positive integers the n-fold difference A Δ 2A Δ ⋯ Δ nA contains at least n elements once n exceeds an A-dependent thres
Order polytopes of generalized snake posets are h^*-real-rooted
A link to non-nesting rook polynomials settles the conjecture for these order and flow polytopes.
full image
Constructive Winning Breaker Strategies in the Maker-Breaker C_k-Game
First polynomial-time strategies for Breaker in k-cycle games for any fixed k at least 4, with constants better than random play and asympto
On the Linearity of Squarefree Powers of Edge Ideals
I(G)^{[p]} has linear first syzygies exactly when the graph meets a matching criterion.
full image
The Minimal Absolute Value of Sums of Fifth Roots of Unity
The value decreases only when n equals 5F_m, L_m or 2L_m and stays constant otherwise within each residue class modulo 5.
Wythoff-Fibonacci Sequences and a Perturbed Greedy Almost-involution
The correction produces complementary sequences and an explicit almost-involution whose differences also cover every integer once.
full image
On balancing consecutive slices of cake
Parameters inside the construction give the limsup max-to-min value directly, supplying explicit upper bounds for small r.
full image
Further Results on the maximun number of stars in graphs with forbidden properties
Further results confirm the conjectured extremal number when t is below the large-t threshold.
Generalized ErdH{o}s--Rogers problems for r-uniform hypergraphs
The bound holds for r-uniform hypergraphs with r≥3 whenever G admits no homomorphism to nonempty F, sharpening prior exponents and recoverin
Characterization and linear-time recognition of balanced distance-hereditary graphs
Equivalence with hereditary clique-Helly property yields linear-time recognition inside this class.
full image
Infinite ternary strings free of long parameterized repetitions and binary strings free of order-preserving ones are constructed via substit
full image
On the number of extension closed additive subcategories for uniformly oriented A_n quivers
The number of extension-closed additive subcategories obeys a recurrence, connects to Fibonacci numbers, and admits exponential growth bound
full image
The construction used for type A extends, giving equivalence to order polytopes of heap posets.
full image
Near-bipartite bricks in which every b-invariant edge is a forcing edge
Complete description shows every such edge is forcing except for three small graphs.
full image
For edge-color-critical graphs, non-r-partite spectral extremal graphs are edge extremal
When ex is within O(1) of Turán edges minus n/r, non-r-partite F-free graphs of largest spectral radius also have the most edges.
Robust Quantum Memory Advantage from Contextuality
Promise problems on exclusivity graphs force classical automata to χ(G) states but allow quantum ones to use ξ(G)+1 dimensions with constant
full image
Multiplicity for partially ordered sets
Every 2-coloring of B_9 forces a monochromatic (S,T,U) with |S|+|T|=|U|, while the total number of such triples is asymptotically 4^n/sqrt(p
Pseudo-centralizers in affine Hecke algebras
In types A_n, B_2 and G_2 the v-deformed Fomin-Stanley algebra is indexed by cosets of the finite Weyl group inside the affine Weyl group
full image
Peres--Schlag's nonempty-interior problem and a shifted-product variant for product sets
The threshold improves on the naive 2/n exponent and applies equally to shifted products.
The continuous oriented chromatic number of directed Schreier graphs of mathbb Z²-shift actions
Continuous maps to 7-vertex tournaments exist but none to 6-vertex ones.
full image
On the Peres--Schlag orthogonal projection problem and Kakeya-type sets
It also improves the parameter ranges where Euclidean projections have nonempty interior beyond earlier bounds.
full image
The classification of Bidihedral Groups
Bidihedral groups are defined by this product and all receive explicit isomorphism types.
A Complete Intersection Theorem for Large Permutation Groups
For all n larger than some n0 the maximum t-intersecting families in S_n are the F_{n,t,r} families defined by fixed points in an initial se
Determining the Complexity of Chromatic Sum in Classes Defined by a Set of Forbidden Graphs
New NP-completeness result on planar subdivisions completes the map for all minor-free and H-free classes.
Duality and a Canonical Sheaf in Periodic Riemann Functions
r-periodic cases with perfect-matching weights turn b¹ formulas into perfect pairings on finite O_r-modules over a five-point space.
full image
Improving the known upper bound from eight for graphs without pendant paths of length two.
full image
Guesswork Under Linear Constraints: Exact Exponent for Coset Decoding
The exact rate for the ρ-th moment of coset rank equals the unconstrained value minus ρ times one minus the code rate.
On Deranged Unit-Interval Parking Functions and the Deranged Bell Numbers
The ordered-set-partition bijection restricts directly to the deranged case, equating the two families and producing new generating function
The sharp diagonal spectral correlation inequality on the discrete cube
The inequality Cov(f,g) ≥ 4 ∑ |S| ˆf(S)² ˆg(S)² holds with equality only for disjoint supports, common dictatorships, or the AND-OR pair.
On the Spectrum of the Line Graph of a Family of Bipartite Graphs Arising from the Boolean Lattice
Eigenvalues and multiplicities given for all n and k; integrality holds when n equals 2k minus 1
The inequality is asymptotically sharp for every pair s less than t and recovers a known theorem when s is 2.