English
Related papers

Related papers: On the representability of sequences as constant t…

200 papers

Many integer sequences including the Catalan numbers, Motzkin numbers, and the Apr{\'e}y numbers can be expressed in the form ConstantTermOf$\left[P^nQ\right]$ for Laurent polynomials $P$ and $Q$. These are often called ``constant term…

Combinatorics · Mathematics 2025-03-31 Nadav Kohen

An integer sequence that is defined by initial values and a linear recurrence with constant integer coefficients, can be represented by the difference of two arithmetic terms containing exponentiation. All constants occuring in the term are…

Number Theory · Mathematics 2024-06-11 Mihai Prunescu

Constant-recursive sequences are those which satisfy a linear recurrence, so that later terms can be obtained as a linear combination of the previous ones. The rank of a constant-recursive sequence is the minimal number of previous terms…

Number Theory · Mathematics 2025-01-27 Eric Rowland , Jesus Sistos Barron

We define a class of sequences ${a_n}$ by $a_1=a$ and $a_{n+1}=P(a_n)$, where $P(x)$ is a polynomial with real coefficients. We then find out for which values $a$ and for which polynomials $P(x)$ these sequences will be constant after a…

General Mathematics · Mathematics 2009-09-09 Florentin Smarandache

We prove that the constant terms of powers of a Laurent polynomial satisfy certain congruences modulo prime powers. As a corollary, the generating series of these numbers considered as a function of a p-adic variable satisfies a non-trivial…

Number Theory · Mathematics 2013-06-26 Anton Mellit , Masha Vlasenko

We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…

Logic · Mathematics 2025-06-09 Mihai Prunescu , Lorenzo Sauras-Altuzarra

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 introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…

Formal Languages and Automata Theory · Computer Science 2019-08-13 Corentin Barloy , Nathanaël Fijalkow , Nathan Lhote , Filip Mazowiecki

We introduce hypergeometric-type sequences. They are linear combinations of interlaced hypergeometric sequences (of arbitrary interlacements). We prove that they form a subring of the ring of holonomic sequences. An interesting family of…

Symbolic Computation · Computer Science 2024-04-22 Bertrand Teguia Tabuguia

In this paper, we discover a new noncommutative algebra. We refer this algebra as the constant term algebra of type $A$, which is generated by certain constant term operators. We characterize a structural result of this algebra by…

Combinatorics · Mathematics 2023-05-04 Guoce Xin , Chen Zhang , Yue Zhou , Yueming Zhong

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

The Hofstadter Q-sequence, with its simple definition, has defied all attempts at analyzing its behavior. Defined by a simple nested recurrence and an initial condition, the sequence looks approximately linear, though with a lot of noise.…

Number Theory · Mathematics 2016-09-22 Nathan Fox

A strongly polynomial sequence of graphs $(G_n)$ is a sequence $(G_n)_{n\in\mathbb{N}}$ of finite graphs such that, for every graph $F$, the number of homomorphisms from $F$ to $G_n$ is a fixed polynomial function of $n$ (depending on $F$).…

Combinatorics · Mathematics 2016-08-09 Andrew Goodall , Jaroslav Nesetril , Patrice Ossona de Mendez

Hypergeometric sequences are rational-valued sequences that satisfy first-order linear recurrence relations with polynomial coefficients; that is, $\langle u_n \rangle_{n=0}^\infty$ is hypergeometric if it satisfies a first-order linear…

Logic in Computer Science · Computer Science 2024-04-25 George Kenison

Sequence theories are an extension of theories of strings with an infinite alphabet of letters, together with a corresponding alphabet theory (e.g. linear integer arithmetic). Sequences are natural abstractions of extendable arrays, which…

Logic in Computer Science · Computer Science 2023-08-02 Artur Jeż , Anthony W. Lin , Oliver Markgraf , Philipp Rümmer

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

Number Theory · Mathematics 2016-03-11 Andrew N. W. Hone

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Number Theory · Mathematics 2016-02-08 Tigran Hakobyan

Let $H$ be the fixed point group of a rational involution $\si$ of a reductive $p$-adic group of charactersistic different from 2(this new version allows to remove the hypothesis on the characteristic of the residue field, see Proposition…

Representation Theory · Mathematics 2013-05-28 Jacques Carmona , Patrick Delorme

We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…

Combinatorics · Mathematics 2026-04-17 Piero Giacomelli

Regular sequences generalize the extensively studied automatic sequences. Let $S$ be an abstract numeration system. When the numeration language $L$ is prefix-closed and regular, a sequence is said to be $S$-regular if the module generated…

Formal Languages and Automata Theory · Computer Science 2021-04-01 Michel Rigo , Manon Stipulanti
‹ Prev 1 2 3 10 Next ›