Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2407.21304

The Wide Band Cayley Continuants

William Y. C. Chen·Elena L. Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Cayley continuants are referred to the determinants of tridiagonal matrices in connection with the Sylvester continuants. Munarini-Torri found a striking combinatorial interpretation of the Cayley continuants in terms of the joint distribution of the number of odd cycles and the number of even cycles of permutations of $[n]=\{1,2,\ldots, n\}$. In view of a general setting, $r$-regular cycles (with length not divisible by $r$) and $r$-singular cycles (with length divisible by $r$) have been extensively studied largely related to roots of permutations. We introduce the wide band Cayley continuants as an extension of the original Cayley continuants, and we show that they can be interpreted in terms of the joint distribution of the number of $r$-regular cycles and the number of $r$-singular cycles over permutations of $[n]$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Y. C. Chen, Elena L. Wang. 2024-07-31. The Wide Band Cayley Continuants. https://arxiv.org/abs/2407.21304

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗