A double-logarithmic upper bound on the chromatic number of the associahedron

Sang-il Oum; David R. Wood

Home/Archive/arXiv

arXiv · 2609.39015

A double-logarithmic upper bound on the chromatic number of the associahedron

Sang-il Oum·David R. Wood

View original source ↗Read source document ↗Export metadata ↓

Abstract

We show that the associahedron $\mathcal{A}_n$ has chromatic number $O(\log\log n)$, improving on the previously best known upper bound of $O(\log n)$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Sang-il Oum, David R. Wood. 2026-09-30. A double-logarithmic upper bound on the chromatic number of the associahedron. https://arxiv.org/abs/2609.39015

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A power series expansion of the Wilf function

In this work, the author employs the Faà di Bruno formula, identities for the partial Bell polynomials, two combinatorial identities, and the (logarithmically) complete monotonicity of generating functions for several integer sequences, together with the Wronski theorem, to investigate a collection of analytic and combinatorial structures. The study establishes Taylor series expansions for various functions involving the inverse (hyperbolic) tangent function and derives the Maclaurin expansion of the Wilf function, a composite of the inverse tangent, square root, and exponential functions. The coefficients in this expansion are expressed in terms of Stirling numbers of the second kind, and their generating functions, limits, positivity, monotonicity, and logarithmic convexity are analyzed. The paper further presents closed-form formulas for special values of the Gauss hypergeometric function and for certain partial Bell polynomials, along with several infinite series representations of the circular constant and related sequences. An asymptotic rational approximation to the circular constant is recovered, and connections among several integer sequences are established via determinants.

math.CO↗

arXiv2026

Bilinear generating functions of the multivariable Al-Salam-Carlitz polynomials and applications

In this paper, by the method of comparing coefficients, we establish a new generating function of multivariable Al-Salam-Carlitz polynomials which contains both Rogers' and Bowman's symmetirc expansion formulas and the classical $q$-Mehler formula as special cases. Some new $q$-series identities related to the multivariable Al-Salam-Carlitz polynomials are also presented.

math.CO↗

arXiv2026

Schreier Sets of Intervals, Super-Schreier Sets, and Catalan Numbers

A finite nonempty set $F\subset\mathbb{N}$ is Schreier if $\min F\ge |F|$. First, we prove a linear recurrence relation and compute initial counts for Schreier sets consisting of intervals. Two intervals of integers are separated if their union is not an interval. If $\mathcal J_{k,n}$ is the collection of Schreier sets that are the union of exactly $k$ separated intervals, then the sequence $(|\mathcal{J}_{k,n}|)_{n=1}^\infty$ satisfies the characteristic polynomial $p_k(x) = (x-1)^{2k+1}(x+1)^k$. Furthermore, we introduce the new concept of $k$-super-Schreier sets and let $\mathcal{S}_{k,n}$ denote the collection of $k$-super-Schreier sets whose maximum is $n$. We show that the sequence $(|\mathcal{S}_{k,n}|)_{n=1}^\infty$ satisfies a Fibonacci-type recurrence with a remainder term expressible as a polynomial of $n$.

math.CO↗