English
Related papers

Related papers: Effective results on the Skolem Problem for linear…

200 papers

The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…

General Mathematics · Mathematics 2025-02-14 J. Stöckl

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

Symbolic Computation · Computer Science 2018-04-10 Marko Petkovšek

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and…

Number Theory · Mathematics 2008-03-04 Bakir Farhi

We identify a structural pattern in the construction of known infinite families of trees whose independence polynomials are not log-concave. Using this pattern and properties of polynomial ring ideals, we derive linear recurrences for these…

Combinatorics · Mathematics 2026-03-17 César Bautista-Ramos , Carlos Guillén-Galván , Paulino Gómez-Salgado

We study the uniform distribution of the polynomial sequence $\lambda(P)=(\lfloor P(k) \rfloor )_{k\geq 1}$ modulo integers, where $P(x)$ is a polynomial with real coefficients. In the nonlinear case, we show that $\lambda(P)$ is uniformly…

Number Theory · Mathematics 2018-12-18 Mohammad Javaheri

Consider a sequence of real-valued functions of a real variable given by a homogeneous linear recursion with differentiable coefficients. We show that if the functions in the sequence are differentiable, then the sequence of derivatives…

Functional Analysis · Mathematics 2025-03-05 Dávid Papp , Kolos Csaba Ágoston

For a nonsingular integer matrix A, we study the growth of the order of A modulo N. We say that a matrix is exceptional if it is diagonalizable, and a power of the matrix has all eigenvalues equal to powers of a single rational integer, or…

Number Theory · Mathematics 2009-11-10 Pietro Corvaja , Zeev Rudnick , Umberto Zannier

A sequence $\mathbf{A}$ is said to be realizable if satisfies so called sign and Dold conditions. We will say that a sequence almost satisfies the Dold condition if there exists a constant $c\in\mathbb{N}_+$ such that…

Number Theory · Mathematics 2025-09-15 Mateusz Rajs

A sequence of positive integers is complete if every positive integer is a sum of distinct terms. A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with nonnegative coefficients…

We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…

Logic in Computer Science · Computer Science 2018-10-11 Ruben Gamboa , John Cowles

We give lower bounds in terms of~$n,$ for the number of limit cycles of polynomial vector fields of degree~$n,$ having any prescribed invariant algebraic curve. By applying them when the ovals of this curve are also algebraic limit cycles…

Dynamical Systems · Mathematics 2026-01-01 Armengol Gasull , Paulo Santana

Polynomially-recursive sequences generally have a periodic behavior mod $m$. In this paper, we analyze the period mod $m$ of a second order polynomially-recursive sequence. The problem originally comes from an enumeration of avoiding…

Number Theory · Mathematics 2019-03-07 Cyril Banderier , Florian Luca

We study recurrence, and multiple recurrence, properties along the $k$-th powers of a given set of integers. We show that the property of recurrence for some given values of $k$ does not give any constraint on the recurrence for the other…

Dynamical Systems · Mathematics 2014-02-26 Nikos Frantzikinakis , Emmanuel Lesigne , Mate Wierdl

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

Number Theory · Mathematics 2022-10-31 Geoffrey Price , Katherine Thompson

The column number question asks for the maximal number of columns of an integer matrix with the property that all its rank size minors are bounded by a fixed parameter $\Delta$ in absolute value. Polynomial upper bounds have been proved in…

Combinatorics · Mathematics 2025-03-28 Björn Kriepke , Matthias Schymura

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-05-23 Trueman MacHenry , Kieh Wong

The aim of the paper is to develop a general theory of solvability of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of arbitrary order in Sobolev spaces. Boundary conditions are allowed to be…

Classical Analysis and ODEs · Mathematics 2023-10-12 Vladimir Mikhailets , Olena Atlasiuk

Linear recursions of degree $k$ are determined by evaluating the sequence of Generalized Fibonacci Polynomials, $\{F_{k,n}(t_1,...,t_k)\}$ (isobaric reflects of the complete symmetric polynomials) at the integer vectors $(t_1,...,t_k)$. If…

Number Theory · Mathematics 2007-12-17 Trueman MacHenry , Kieh Wong

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

Combinatorics · Mathematics 2015-02-10 Aleksi Saarela
‹ Prev 1 4 5 6 7 8 10 Next ›