English
Related papers

Related papers: On the period mod $m$ of polynomially-recursive se…

200 papers

In recent years, the asymptotic normality of some famous combinatorial sequences has been the subject of extensive study. However, the methods used to prove the asymptotic normality of various combinatorial sequences differ significantly.…

Combinatorics · Mathematics 2025-04-17 Zhongjie Li

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

Rings and Algebras · Mathematics 2024-01-25 Mohammed Mouçouf

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

Combinatorial transgressions are secondary invariants of a space admitting triangulations. They arise from subdivisions and are analogous to transgressive forms such as those arising in Chern-Weil theory. Unlike combinatorial characteristic…

Geometric Topology · Mathematics 2008-06-04 Jer-Chin Chuang

We study the dynamics of the positive solutions of a second-order, Ricker-type exponential difference equation with periodic parameters. We find that qualitatively different dynamics occur depending on whether the period p of the main…

Dynamical Systems · Mathematics 2017-02-14 N. Lazaryan , H. Sedaghat

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

Number Theory · Mathematics 2023-06-13 Darlison Nyirenda , Beaullah Mugwangwavari

The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…

General Mathematics · Mathematics 2024-03-18 Yuri Heymann

Consider $\{p_n\}_{n=0}^{\infty}$, a sequence of polynomials orthogonal with respect to $w(x)>0$ on $(a,b)$, and polynomials $\{g_{n,k}\}_{n=0}^{\infty},k \in \mathbb{N}_0$, orthogonal with respect to $c_k(x)w(x)>0$ on $(a,b)$, where…

Classical Analysis and ODEs · Mathematics 2021-10-27 A. S. Jooste , D. D. Tcheutia , W. Koepf

We obtain new non-existence results of perfect p-ary sequences with period n (called type $[p, n]$). The first case is a class with type [p\equiv5\pmod 8,p^aqn']. The second case contains five types [p\equiv3\pmod 4,p^aq^ln'] for certain…

Information Theory · Computer Science 2019-12-18 Chang Lv

We establish noncommutative Kn\"{o}rrer periodicity for projective-module factorizations over an arbitrary ring, using the equivariantization theory with respect to various actions by a cyclic group of order two. We obtain an explicit…

Rings and Algebras · Mathematics 2025-09-09 Xiao-Wu Chen , Wenchao Wu

We study the recurrence coefficients of the monic polynomials $P_n(z)$ orthogonal with respect to the deformed (also called semi-classical) Freud weight \begin{equation*} w_{\alpha}(x;s,N)=|x|^{\alpha}{\rm…

Mathematical Physics · Physics 2018-04-02 Mengkun Zhu , Yang Chen

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

Probability · Mathematics 2019-06-18 Adrien Hardy

We discuss polynomials orthogonal with respect to a semi-classical generalised higher order Freud weight \[\omega(x;t,\lambda)=|x|^{2\lambda+1}\exp\left(tx^2-x^{2m}\right),\qquad x\in\mathbb{R},\] with parameters $\lambda > -1$,…

Classical Analysis and ODEs · Mathematics 2023-04-24 Peter A. Clarkson , Kerstin Jordaan , Ana Loureiro

Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…

Combinatorics · Mathematics 2015-10-01 William Y. C. Chen , Qing-Hu Hou , Doron Zeilberger

We show that polynomial recursions $x_{n+1}=x_{n}^{m}-k$ where $k,m$ are integers and $m$ is positive have no nontrivial periodic integral orbits for $m\geq3$. If $m=2$ then the recursion has integral two-cycles for infinitely many values…

Dynamical Systems · Mathematics 2022-09-05 Hassan Sedaghat

In this paper, we study a class of orthogonal polynomials defined by a three-term recurrence relation with periodic coefficients. We derive explicit formulas for the generating function, the associated continued fraction, the orthogonality…

Classical Analysis and ODEs · Mathematics 2025-07-01 Dan Dai , Mourad E. H. Ismail , Xiang-Sheng Wang

We are studying fractional linear recursions of second and third orders and finding periodic recursions with periods of eight and twelve, which, apparently, were not known before.

General Mathematics · Mathematics 2023-10-23 Evgeni Lozitsky

For a prime $p\ge 5$ let $q_0,q_1,\ldots,q_{(p-3)/2}$ be the quadratic residues modulo $p$ in increasing order. We study two $(p-3)/2$-periodic binary sequences $(d_n)$ and $(t_n)$ defined by $d_n=q_n+q_{n+1}\bmod 2$ and $t_n=1$ if…

Number Theory · Mathematics 2020-05-19 Arne Winterhof , Zibi Xiao

We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…

Number Theory · Mathematics 2015-07-22 Andrew N. W. Hone

We characterize the structure of the periods of a neuronal recurrence equation. Firstly, we give a characterization of k-chains in 0-1 periodic sequences. Secondly, we characterize the periods of all cycles of some neuronal recurrence…

Neural and Evolutionary Computing · Computer Science 2016-02-23 Serge Alain Ebélé , Renè Ndoundam