Search arXivSearch

arXiv · 2602.15622

Integral and arithmetic structures of alternating (zigzag) numbers $A_n$

Abstract

The alternating (zigzag) numbers $A_n$, counting the ascending alternating permutations of $\left\{1,\cdots,n\right\}$ and defined by the exponential generating function $\tan x+\sec x$, admit several classical combinatorial and analytic representations. In this work we unify and extend three complementary structures of $A_n$. First, starting from the Stirling number expansion of zigzag numbers, we derive a contour integral representation, as well as a positive Laplace-type integral representation $$ A_n = 2^n \int_0^\infty e^{-y} f_n(y)\, dy, \qquad f_n(y) := \sum_{k=0}^{n} (-1)^k S(n,k) \left(\frac{y}{2}\right)^k, $$ where the kernel $f_n(y)$ is the polynomial generating function of Stirling numbers. A continuous interpolation of the discrete product (falling factorial) is introduced subsequently. This provides a direct analytic bridge between set partitions and Laplace asymptotics. Second, using the partial fraction expansion of $\tan$, we obtain the well-known hyperbolic integral representation $$ A_{2n+1}=\frac{1}π\int_0^\infty\frac{y^{2n+1}}{\sinh(y/2)}\,dy, $$ equivalently expressed in classical $\cosh$ form for $A_{2n}$. This representation interprets zigzag numbers as spectral moments associated with half-integer poles. The connection with Fourier analysis and Mellin transforms is also outlined. Finally, combining spectral expansions with Stirling identities, we derive congruence relations modulo primes for $A_n$. These results exhibit a dual analytic-combinatorial structure of zigzag numbers, linking partition expansions, trigonometric spectra, and arithmetic properties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jean-Christophe Pain. 2026-02-17. Integral and arithmetic structures of alternating (zigzag) numbers $A_n$. https://arxiv.org/abs/2602.15622

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO