Search arXivSearch

arXiv · 2609.14095

A Rigidity Property of the Deformed q-Exponential Function

Abstract

The deformed \(q\)-exponential function \[ e_q(z,u) = \sum_{n=0}^{\infty} u^{\binom{n}{2}} \frac{z^n}{(q;q)_n} \] provides a common framework containing several classical \(q\)-exponential functions as particular cases, including the Jackson \(q\)-exponentials \(e_q(z)\) and \(E_q(z)\). In this paper we investigate the multiplicative inversion problem \[ e_q(z,u)e_q(-z,v)=1, \] and determine all pairs of deformation parameters \((u,v)\) for which this identity holds. To this end, we introduce a family of coefficient polynomials whose common zeros characterize the inversion property. A geometric analysis of the first nontrivial coefficients reduces the problem to two parameter branches. The symmetric branch is excluded through a parity phenomenon, while the nonsymmetric branch is completely determined by the first two coefficient constraints. As a consequence, we prove a rigidity theorem showing that \[ e_q(z,u)e_q(-z,v)=1 \] if and only if \[ (u,v)=(1,q) \qquad\text{or}\qquad (u,v)=(q,1). \] Thus the classical Jackson inversion identity is rigid within the deformed family and no new multiplicative inversion identities arise from the deformation parameter.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ronald Orozco López. 2026-09-12. A Rigidity Property of the Deformed q-Exponential Function. https://arxiv.org/abs/2609.14095

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