Search arXivSearch

arXiv · 2411.03681

Density and Symmetry in the Generalized Motzkin Numbers mod $p$

Abstract

We give a formula for the density of $0$ in the sequence of generalized Motzkin numbers, $M^{a, b}_n$, modulo a prime, $p$, in terms of the first $p$ generalized central trinomial coefficients $T^{a, b}_n\bmod p$ (with $n<p$). We apply our method to various other sequences to obtain similar formulas. We also prove that $T^{a, b}_{p-1-n}\equiv (b^2-4a^2)^{\frac{p-1}{2}-n}T^{a, b}_n\pmod p$ to obtain tight lower bounds for the density of $0$ in our sequences. This symmetry of the first $p$ central trinomial coefficients mod $p$ also appears in a couple of other applications, including the proof of a novel symmetry of the first $p-2$ Motzkin numbers that is of independent interest: $M^{a, b}_{p-3-n}\equiv (b^2-4a^2)^{\frac{p-3}{2}-n}M^{a, b}_n\pmod p$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nadav Kohen. 2025-01-17. Density and Symmetry in the Generalized Motzkin Numbers mod $p$. https://arxiv.org/abs/2411.03681

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