English
Related papers

Related papers: On Positivity and Minimality for Second-Order Holo…

200 papers

Linear second order recursive sequences with arbitrary initial conditions are studied. For sequences with the same parameters a ring and a group is attached, and isomorphisms and homomorphisms are established for related parameters. In the…

Number Theory · Mathematics 2025-01-31 Zbigniew Lipinski , Maciej P. Wojtkowski

A linear equation is $r$-regular, if, for every $r$-coloring of the positive integers, there exist positive integers of the same color which satisfy the equation. In 2005, Fox and Radoicic conjectured that the equation $x_1 + 2x_2 + \cdots…

Combinatorics · Mathematics 2014-04-15 Noah Golowich

We study the periodic boundary value problem associated with the second order nonlinear differential equation $$ u" + c u' + \left(a^{+}(t) - \mu \, a^{-}(t)\right) g(u) = 0, $$ where $g(u)$ has superlinear growth at zero and at infinity,…

Classical Analysis and ODEs · Mathematics 2015-08-11 Guglielmo Feltrin , Fabio Zanolin

A class of binary sequences with period $2p$ is constructed using generalized cyclotomic classes, and their linear complexity, minimal polynomial over ${\mathbb{F}_{{q}}}$ as well as 2-adic complexity are determined using Gauss period and…

Information Theory · Computer Science 2021-09-10 Yan Wang , Xilin Han , Weiqiong Wang , Ziling Heng

The classical Ulam sequence is defined recursively as follows: $a_1=1$, $a_2=2$, and $a_n$, for $n > 2$, is the smallest integer not already in the sequence that can be written uniquely as the sum of two distinct earlier terms. This…

Combinatorics · Mathematics 2020-11-03 Tej Bade , Kelly Cui , Antoine Labelle , Deyuan Li

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Combinatorics · Mathematics 2012-09-03 Fabien Durand

For every monic polynomial $f \in \mathbb{Z}[X]$ with $\operatorname{deg}(f) \geq 1$, let $\mathcal{L}(f)$ be the set of all linear recurrences with values in $\mathbb{Z}$ and characteristic polynomial $f$, and let \begin{equation*}…

Number Theory · Mathematics 2024-01-17 Federico Accossato , Carlo Sanna

We prove a general statement about the integrality of the sequences generated by a recursion of the following form: $nu_n$ equals a linear combination of $u_{n-1},u_{n-2},\dots,u_0$ with polynomial coefficients in $n$ of special form. This…

Number Theory · Mathematics 2026-04-21 Florian Fürnsinn , Danylo Radchenko , Wadim Zudilin

For every positive integer $n$ and every $\delta \in [0,1]$, let $B(n, \delta)$ denote the probabilistic model in which a random set $A \subseteq \{1, \dots, n\}$ is constructed by choosing independently every element of $\{1, \dots, n\}$…

Number Theory · Mathematics 2020-12-15 Carlo Sanna

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

Combinatorics · Mathematics 2023-01-24 Simone Costa , Stefano Della Fiore , M. A. Ollis

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

We prove that if the signed binomial coefficient $(-1)^i\binom{k}{i}$ viewed modulo p is a periodic function of i with period h prime to p in the range $0\le i\le k$, then k+1 is a power of p, provided h is not too large compared to k. (In…

Number Theory · Mathematics 2007-05-23 Sandro Mattarei

We interest in the behaviour of the period function for equations of the type $u'' + g(u) = 0$ and $u'' + f(u)u' + g(u) = 0$ with a center at the origin 0. $g$ is a function of class $C^k$. For the conservative case, if $k \geq 2$ one shows…

Dynamical Systems · Mathematics 2007-05-23 A. Raouf Chouikha

Let $S=(s_1,s_2,...,s_m,...)$ be a linear recurring sequence with terms in $GF(q^n)$ and $T$ be a linear transformation of $GF(q^n)$ over $GF(q)$. Denote $T(S)=(T(s_1),T(s_2),...,T(s_m),...)$. In this paper, we first present counter…

Information Theory · Computer Science 2009-12-03 Zhi-Han Gao , Fang-Wei Fu

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

Number Theory · Mathematics 2020-10-21 Nabin Kumar Meher , Sudhansu Sekhar Rout

Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for a plethora of applications such as the verification of probabilistic systems, model checking, computational biology, and economics. Positivity (are all terms of…

Logic in Computer Science · Computer Science 2023-07-14 Mihir Vahanwala

A sequence of points $z_k$ in the unit disk is said to be thin for a given decrease function $\rho$, if there is a nontrivial bounded holomorphic function such that the infinite series $\sum_k \rho(1-|z_k|)|f(z_k)|$ converges. All sequences…

Complex Variables · Mathematics 2007-05-23 Vladimir Ya. Eiderman , Pascal J. Thomas

We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more…

Combinatorics · Mathematics 2024-02-14 Joseph Meleshko , Pascal Ochem , Jeffrey Shallit , Sonja Linghui Shan

Pisot sequences (sequences $a_n$ with initial terms $a_0=x, a_1=y$, and defined for $n>1$ by $a_n= \lfloor a_{n-1}^2/a_{n-2} + \frac{1}{2} \rfloor$) often satisfy linear recurrences with constant coefficients that are valid for all $n \geq…

Number Theory · Mathematics 2016-09-28 Shalosh B. Ekhad , N. J. A. Sloane , Doron Zeilberger