Related papers: Anti-recurrence sequences
In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…
Words are sequences of letters over a finite alphabet. We study two intimately related topics for this object: quasi-randomness and limit theory. With respect to the first topic we investigate the notion of uniform distribution of letters…
Even though Zaremba's conjecture remains open, Bourgain and Kontorovich solved the problem for a full density subset. Nevertheless, there are only a handful of explicit sequences known to satisfy the strong version of the conjecture, all of…
It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…
In his Ph.D. thesis, Ira Gessel proved a reciprocity formula for noncommutative symmetric functions which enables one to count words and permutations with restrictions on the lengths of their increasing runs. We generalize Gessel's theorem…
We solve in the negative two open problems, related to the linear and topological structure of the set of recurrent vectors, asked by Sophie Grivaux, Alfred Peris and the first author of this paper. Firstly, we show that there exist…
Windowed recurrences are sliding window calculations where a function is applied iteratively across the window of data, and are ubiquitous throughout the natural, social, and computational sciences. In this monograph we explore the…
Linear recurrent sequences are those whose elements are defined as linear combinations of preceding elements, and finding recurrence relations is a fundamental problem in computer algebra. In this paper, we focus on sequences whose elements…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
This paper gives the recursion formula for mixed multiplicities of maximal degrees with respect to joint reductions of ideals, which is one of important results in the mixed multiplicity theory. Using this result, we give consequences on…
In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…
We define the arithmetic self-similarity (AS) of a one-sided infinite sequence sigma to be the set of arithmetic progressions through sigma which are a vertical shift of sigma. We study the AS of several famlies of sequences, viz.…
The core of a finite-dimensional modular representation $M$ of a finite group $G$ is its largest non-projective summand. We prove that the dimensions of the cores of $M^{\otimes n}$ have algebraic Hilbert series when $M$ is Omega-algebraic,…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…
Several operations can be defined on the set of all linear recurrent sequences, such as the binomial convolution (Hurwitz product) or the multinomial convolution (Newton product). Using elementary techniques, we prove that this set equipped…
Motivated by recent investigations \cite{Costakis, Bonilla} on the notion of recurrence in linear dynamics, we deepen into the notions of recurrence and frequent recurrence in the setting of dissipative composition operators with bounded…