English
Related papers

Related papers: The quotient problem for linear recurrence sequenc…

200 papers

We consider the nonlinear string equation with Dirichlet boundary conditions $u_{xx}-u_{tt}=\phi(u)$, with $\phi(u)=\Phi u^{3} + O(u^{5})$ odd and analytic, $\Phi\neq0$, and we construct small amplitude periodic solutions with frequency…

Dynamical Systems · Mathematics 2015-06-26 Guido Gentile , Vieri Mastropietro , Michela Procesi

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

Number Theory · Mathematics 2022-03-01 James Haoyu Bai , Joseph Meleshko , Samin Riasat , Jeffrey Shallit

The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers. This is a fundamental reachability problem for continuous linear dynamical systems,…

Systems and Control · Computer Science 2016-05-11 Ventsislav Chonev , Joel Ouaknine , James Worrell

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

Logic in Computer Science · Computer Science 2023-05-25 George Kenison , Klara Nosan , Mahsa Shirmohammadi , James Worrell

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

Discrete Mathematics · Computer Science 2013-12-17 Armen Bagdasaryan

Let $n$ be a non-negative integer and put $p_{n}(x)=\prod_{i=0}^{n}(x+i)$. In the first part of the paper, for given $n$, we study the existence of integer solutions of the Diophantine equation $$ y^m=p_{n}(x)+\sum_{i=1}^{k}p_{a_{i}}(x), $$…

Number Theory · Mathematics 2018-09-13 Szabolcs Tengely , Maciej Ulas

We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…

Combinatorics · Mathematics 2007-05-23 Guoce Xin

We consider a periodic planar Lorentz process with strictly convex obstacles and finite horizon. This process describes the displacement of a particle moving in the plane with unit speed and with elastic reflection on the obstacles. We call…

Dynamical Systems · Mathematics 2013-03-14 Francoise Pene

We study unitary random matrix ensembles of the form $Z_{n,N}^{-1} |\det M|^{2\alpha} e^{-N \Tr V(M)}dM$, where $\alpha>-1/2$ and $V$ is such that the limiting mean eigenvalue density for $n,N\to\infty$ and $n/N\to 1$ vanishes quadratically…

Mathematical Physics · Physics 2010-07-30 T. Claeys , A. B. J. Kuijlaars , M. Vanlessen

Cubic and quartic non-autonomous differential equations with continuous piecewise linear coefficients are considered. The main concern is to find the maximum possible multiplicity of periodic solutions. For many classes, we show that the…

Classical Analysis and ODEs · Mathematics 2010-10-01 Mohamad Ali Alwash

Let $(a_n)_{n=0}^\infty$ be a second-order linear recurrence sequence with constant coefficients over the field of $p$-adic numbers $\mathbb{Q}_p$. We study the set of limit points of the sequence of consecutive ratios…

Number Theory · Mathematics 2024-06-11 Rishi Kumar

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

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…

Symbolic Computation · Computer Science 2015-11-05 Maximilian Jaroschek

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

Recurrence coefficients of semi-classical orthogonal polynomials (orthogonal polynomials related to a weight function $w$ such that $w'/w$ is a rational function) are shown to be solutions of non linear differential equations with respect…

Classical Analysis and ODEs · Mathematics 2016-09-06 Alphonse P. Magnus

Let $A(n,m)$ denote the Eulerian numbers, which count the number of permutations on $[n]$ with exactly $m$ descents. It is well known that $A(n,m)$ also counts the number of permutations on $[n]$ with exactly $m$ excedances. In this report,…

Combinatorics · Mathematics 2023-06-22 David Dong

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

Number Theory · Mathematics 2026-04-13 Ruofan Li

In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in…

Number Theory · Mathematics 2018-01-01 Zafer Şiar , Refik Keskin

We recast homogeneous linear recurrence sequences with fixed coefficients in terms of partial Bell polynomials, and use their properties to obtain various combinatorial identities and multifold convolution formulas. Our approach relies on a…

Combinatorics · Mathematics 2014-12-17 Daniel Birmajer , Juan B. Gil , Michael D. Weiner
‹ Prev 1 4 5 6 7 8 10 Next ›