Search arXivSearch

arXiv · 2607.08279

Dilated Hankel determinants

Abstract

For a sequence $\mathbf a=(a_0,a_1,\dots)$ we define its dilated Hankel determinant $\ddot{H}_n(\mathbf a)=\det(a_{2i+j})_{0\le i,j\le n-1}$, the minor of the infinite Hankel matrix $(a_{i+j})$ formed from the even-indexed rows and the first $n$ columns. We prove that, for a broad class of sequences, $\ddot{H}_n$ admits a remarkably simple product evaluation. This mirrors the behaviour of the classical Hankel determinant $H_n$, but with two key distinctions: the class of sequences for which such formulas are known is far larger in the classical case; and, whereas $H_n$ enjoys a single universal evaluation -- the Heilermann formula via the Jacobi continued fraction -- no analogous general method exists for the dilated determinant, which is therefore considerably more challenging. Our evaluations instead rest on six methods developed here, four of general scope and two of a more specialised nature. The cases treated include the factorial numbers, the Catalan and central binomial coefficients; the Euler numbers and a one-parameter secant family; the involution numbers; the Springer numbers along with elliptic and derivative deformations; the reciprocal-sine function, whose evaluation rests on a new Catalan determinant proved by condensation; a Bessel analogue of the Euler numbers; and a multiplicative Bessel family. As an application, we settle a conjecture of Chapoton and the author on the roots of the Poupard and Kreweras polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guo-Niu Han. 2026-07-09. Dilated Hankel determinants. https://arxiv.org/abs/2607.08279

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO