Search arXivSearch

arXiv · 2606.23750

Power series for roots of a trinomial and Kummer-like identities for higher order hypergeometric series

Abstract

We study the trinomial equation $x^n +px +q =0$. Here $p$ and $q$ are both real and nonzero. For $n\ge3$, expressions for the roots have been published as hypergeometric series in powers of the parameter $q^{n-1}/p^n$. For the special case of the cubic ($n=3$), we employ Kummer's identities to derive alternative series solutions in powers of the discriminant $D$, and also series in powers of $1/D$. We next derive new series, in powers of $D$ and also in powers of $1/D$, for all $n\ge 3$. The resulting series suggest identities analogous to Kummer's identities, for higher order hypergeometric series.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. R. Mane. 2026-07-05. Power series for roots of a trinomial and Kummer-like identities for higher order hypergeometric series. https://arxiv.org/abs/2606.23750

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