Search arXivSearch

arXiv · 1607.01292

Orbit Dirichlet series and multiset permutations

Abstract

We study Dirichlet series enumerating orbits of Cartesian products of maps whose orbit distributions are modelled on the distributions of finite index subgroups of free abelian groups of finite rank. We interpret Euler factors of such orbit Dirichlet series in terms of generating polynomials for statistics on multiset permutations, viz. descent and major index, generalizing Carlitz's $q$-Eulerian polynomials. We give two main applications of this combinatorial interpretation. Firstly, we establish local functional equations for the Euler factors of the orbit Dirichlet series under consideration. Secondly, we determine these (global) Dirichlet series' abscissae of convergence and establish some meromorphic continuation beyond these abscissae. As a corollary, we describe the asymptotics of the relevant orbit growth sequences. For Cartesian products of more than two maps we establish a natural boundary for meromorphic continuation. For products of two maps, we prove the existence of such a natural boundary subject to a combinatorial conjecture.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Angela Carnevale, Christopher Voll. 2017-11-06. Orbit Dirichlet series and multiset permutations. https://doi.org/10.1007/s00605-017-1128-9

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