English
Related papers

Related papers: The quotient problem for linear recurrence sequenc…

200 papers

We consider the inverse problem of determining coefficients appearing in semilinear elliptic equations stated on Riemannian manifolds with boundary given the knowledge of the associated Dirichlet-to-Neumann map. We begin with a negative…

Analysis of PDEs · Mathematics 2024-06-18 Ali Feizmohammadi , Yavar Kian , Lauri Oksanen

A recurrence relation is said to have the Laurent property if all of its iterates are Laurent polynomials in the initial values with integer coefficients. We consider a family of nonlinear recurrences with the Laurent property, which were…

Exactly Solvable and Integrable Systems · Physics 2020-10-28 Andrew N. W. Hone , Joe Pallister

We study a refined version of the Linnik problem on the asymptotic behavior of the number of representations of integer $m$ by an integral polynomial as $m$ tends to infinity. We assume that the polynomial arises from invariant theory, and…

Number Theory · Mathematics 2007-05-23 Alex Eskin , Hee Oh

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

Let $(x_n)_{n\geq0}$ be a linear recurrence sequence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In 2017,…

Number Theory · Mathematics 2024-08-14 Deepa Antony , Rupam Barman

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

The descent polynomial of a finite $I\subseteq \mathbb{Z}^+$ is the polynomial $d(I,n)$, for which the evaluation at $n>\max(I)$ is the number of permutations on $n$ elements, such that $I$ is the set of indices where the permutation is…

Combinatorics · Mathematics 2019-01-16 Ferenc Bencs

The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…

Dynamical Systems · Mathematics 2015-06-09 Cristian Ghiu , Raluca Tuliga , Constantin Udriste

Let $ (G_n)_{n=0}^{\infty} $ be a polynomial power sum, i.e. a simple linear recurrence sequence of complex polynomials with power sum representation $ G_n = f_1\alpha_1^n + \cdots + f_k\alpha_k^n $ and polynomial characteristic roots $…

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

For a nonzero integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j + n is a perfect square for all 1 <= i < j <= m, is called a D(n)-m-tuple. In this paper, by using properties of so-called regular Diophantine…

Number Theory · Mathematics 2020-10-12 Andrej Dujella , Vinko Petričević

Let us denote ${\cal V}$, the finite dimensional vector spaces of functions of the form $\psi(x) = p_n(x) + f(x) p_m(x)$ where $p_n(x)$ and $p_m(x)$ are arbitrary polynomials of degree at most $n$ and $m$ in the variable $x$ while $f(x)$…

Mathematical Physics · Physics 2016-12-21 Y. Brihaye , J. Ndimubandi , B. Prasad Mandal

For every natural number $n\geq 2$ and every finite sequence $L$ of natural numbers, we consider the set $UD_n(L)$ of all uniquely decodable codes over an $n$-letter alphabet with the sequence $L$ as the sequence of code word lengths, as…

Information Theory · Computer Science 2016-09-01 Adam Woryna

The study of Diophantine triples taking values in linear recurrence sequences is a variant of a problem going back to Diophantus of Alexandria which has been studied quite a lot in the past. The main questions are, as usual, about existence…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christoph Hutle , Florian Luca

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

Combinatorics · Mathematics 2007-05-23 Noam D. Elkies

In this paper, we consider a certain variation of the "isoperimetric problem" adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for…

Combinatorics · Mathematics 2011-07-18 Patrick Devlin

We study M(n), the number of distinct values taken by multinomial coefficients with upper entry n, and some closely related sequences. We show that both pP(n)/M(n) and M(n)/p(n) tend to zero as n goes to infinity, where pP(n) is the number…

Combinatorics · Mathematics 2007-05-23 George E. Andrews , Arnold Knopfmacher , Burkhard Zimmermann

Given an elliptic curve $E$ and a point $P$ in $E(\mathbb{R})$, we investigate the distribution of the points $nP$ as $n$ varies over the integers, giving bounds on the $x$ and $y$ coordinates of $nP$ and determining the natural density of…

Number Theory · Mathematics 2020-09-29 Alex Cowan

In this note, we study the divisibility relation $U_m\mid U_{n+k}^s-U_n^s$, where ${\bf U}:=\{U_n\}_{n\ge 0}$ is the Lucas sequence of characteristic polynomial $x^2-ax\pm 1$ and $k,m,n,s$ are positive integers.

Number Theory · Mathematics 2015-11-26 Yuri Bilu , Takao Komatsu , Florian Luca , Amalia Pizarro-Madariaga , Pantelimon Stanica

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

Computational Complexity · Computer Science 2017-04-07 Joel Ouaknine , James Worrell

Let $M$ and $N$ be fixed non-negative integer numbers and let $\pi_N$ be a polynomial of degree $N$. Suppose that $(P_n)_{n\geq0}$ and $(Q_n)_{n\geq0}$ are two orthogonal polynomial sequences such that %their derivatives of orders $k$ and…

Classical Analysis and ODEs · Mathematics 2019-06-19 K. Castillo , D. Mbouna