English
Related papers

Related papers: Linear divisibility sequences and Salem numbers

200 papers

In this paper we study odd unimodal and odd strongly unimodal sequences. We use $q$-series methods to find several fundamental generating functions. Employing the Euler--Maclaurin summation formula we obtain the asymptotic main term for…

Number Theory · Mathematics 2023-08-23 Kathrin Bringmann , Jeremy Lovejoy

We reprove a few results concerning paperfolding sequences using properties of Catalan numbers modulo 2.

Combinatorics · Mathematics 2007-05-23 Roland Bacher

We formulate a well-posedness and approximation theory for a class of generalised saddle point problems. In this way we develop an approach to a class of fourth order elliptic partial differential equations using the idea of splitting into…

Numerical Analysis · Mathematics 2019-04-02 Charles M. Elliott , Hans Fritz , Graham Hobbs

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

Information Theory · Computer Science 2017-02-21 Qi Zhang , Jing Yang

In this paper we introduce a new sequence of polynomials, which follow the same recursive rule of the well-known Lucas-Lehmer integer sequence. We show the most important properties of this sequence, relating them to the Chebyshev…

Classical Analysis and ODEs · Mathematics 2017-03-07 Pierluigi Vellucci , Alberto Maria Bersani

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…

Symbolic Computation · Computer Science 2010-05-05 Manuel Kauers , Carsten Schneider

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

Information Theory · Computer Science 2023-03-17 Hongwei Liu , Zihao Yu

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…

Number Theory · Mathematics 2018-04-25 Dmitry I. Khomovsky

Linearization problem of ordinary differential equations by a new set of tangent transformations is considered in the paper. This set of transformations allows one to extend the set of transformations applied for the linearization problem.…

Classical Analysis and ODEs · Mathematics 2013-10-02 S. Suksern , S. V. Meleshko

We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…

Combinatorics · Mathematics 2019-09-04 Jacob Sprittulla

The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…

Combinatorics · Mathematics 2016-08-16 J. Tharrats

We present a necessary and sufficient condition for a root greater than unity of a monic reciprocal polynomial of an even degree at least four, with integer coefficients, to be a Salem number. We determine the probability of fulfillment the…

Number Theory · Mathematics 2019-09-24 Dragan Stankov

Let $f(x)$ be a monic polynomial over $\mathbb{Q}$ with complex roots $\alpha_1,\dots,\alpha_n$. Linear relations among them and $1$ over $\mathbb{Q}$ play an important role when we study the distribution of roots modulo a prime. We study…

Number Theory · Mathematics 2018-10-17 Yoshiyuki Kitaoka

It is an exposition of the work of Mignotte, Shorey, Tijdeman, Vereshchagin and Bacik on decidability of the vanishing problem for linear recurrence sequences of order 4.

Number Theory · Mathematics 2025-03-12 Yuri Bilu

We derive modular parametrizations for certain infinite series whose summands involve central binomial coefficients and higher-order harmonic numbers. When the rates of convergence are certain rational numbers, modularity allows us to…

Number Theory · Mathematics 2026-03-04 Zhi-Wei Sun , Yajun Zhou

Given an ordered structure, we study a natural way to extend the order to preorders on type spaces. For definably complete, linearly ordered structures, we give a characterisation of the preorder on the space of 1-types. We apply these…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

Number Theory · Mathematics 2017-11-16 Jonathan Hickman , James Wright

Skolem and Langford sequences and their many generalizations have applications in numerous areas. The $\otimes_h$-product is a generalization of the direct product of digraphs. In this paper we use the $\otimes_h$-product and super…

Combinatorics · Mathematics 2015-11-20 Susana-Clara López , Francesc-Antoni Muntaner-Batle

Let $n_1$ and $n_2$ be two distinct primes with $\mathrm{gcd}(n_1-1,n_2-1)=4$. In this paper, we compute the autocorrelation values of generalized cyclotomic sequence of order $4$. Our results show that this sequence can have very good…

Information Theory · Computer Science 2016-03-08 Priti Kumari , Pramod Kumar Kewat

We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related…

Combinatorics · Mathematics 2007-05-23 Andrey O. Matveev