Searcharxiv⌕ Search

arXiv subjects

Yangbiao Zhou

Publications and source records attributed to Yangbiao Zhou.

3 recordsLinked to original sources

Integral Exponential Series: Fibonacci Weights and Implicit Equations

We apply classical prime-power congruence criteria to two families of exponential series. For the Fibonacci numbers $F_n$, we characterize the polynomials $P\in\Z[T]$ for which $\exp(\sum_{n\ge1}P(F_n)x^n/n)$ has integer coefficients: this holds if and only if $P$ is even and $P(0)\equiv P(1)\equiv P(2)\pmod5$. In particular, $5$ is the least positive multiplier for each positive even power of $F_n$, and the series with weights $5F_n^{2k}$ has degree $5^{k-1}$ over $\Q(x)$ for $k\ge1$. For $R_n(y)\in\Z[y]$ satisfying $R_{pn}(y)\equiv R_n(y)\pmod p$ for every prime $p$ and every $n\ge1$, we prove that $H(x,y)=\exp(\sum_{n\ge1}R_n(y)^n x^n/n)$ belongs to $\Z[y][[x]]$ and that $A(x)=H(x,A(x))$ has a unique integral solution. For $q\in \Z$, taking $R_n(y)=q^n+y$ proves the conjecture in OEIS A163138; the Fibonacci result proves the conjecture in A207969 and A207970. For the implicit family with indeterminate $q$, the coefficient of $x^n$ has degree $n^2$, leading coefficient $1/n$, and nonnegative integer coefficients in the binomial basis, for every $n\ge1$.

math.NT↗

Ehrhart Series and Transfer Matrices for Period-Two Polytopes with Consecutive Inequalities

We study a family of period-two polytopes that can be naturally realized as lattice polytopes. In contrast to polytopes defined by a uniform system of inequalities, this family is characterized by consecutive coordinate inequalities whose bounds alternate between $s+1$ and $s$. The lattice points of these polytopes admit an explicit transfer-matrix formulation, which provides an effective framework for their enumeration and analysis. Furthermore, by considering fixed dilations, we investigate the associated dimensional generating functions and derive rational forms for the generating functions of the lattice points in the $m$-th dilates of the polytopes.

math.CO↗

Magic labelling enumeration on pseudo-line graphs and pseudo-cycle graphs

Stanley's theorem establishes that for any finite graph $G$, the number $h_G(s)$ of magic labelings with magic sum $s$ can be expressed as a sum of two polynomials in $s$. However, determining the precise form of $h_G(s)$ is generally challenging. This paper aims to compute $h_G(s)$ and its generating function for pseudo-line graphs and pseudo-cycle graphs, thereby extending the earlier work of Bóna et al.\cite{Bona-1,Bona}.

math.CO↗