Related papers: Anti-recurrence sequences
We prove two main results concerning mesoprimary decomposition of monoid congruences, as introduced by Kahle and Miller. First, we identify which associated prime congruences appear in every mesoprimary decomposition, thereby completing the…
We investigate questions related to the presence of primitive words and Lyndon words in automatic and linearly recurrent sequences. We show that the Lyndon factorization of a k-automatic sequence is itself k-automatic. We also show that the…
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…
Which combinatorial sequences correspond to moments of probability measures on the real line? We present a generating function, in the form of a continued fraction, for a fourteen-parameter family of such sequences and interpret these in…
This note considers linear recurrences (also called linear difference equations) in unknowns indexed by the integers. We characterize a unique \emph{reduced} linear recurrence with the same solutions as a given linear recurrence, and…
Contraction analysis uses a local criterion to prove the long-term behaviour of a dynamical system. A contraction metric is a Riemannian metric with respect to which the distance between adjacent solutions contracts. If adjacent solutions…
We formulate a precise conjecture that, if true, extends the converse theorem of Hecke without requiring hypotheses on twists by Dirichlet characters or an Euler product. The main idea is to linearize the Euler product, replacing it by…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for…
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
We construct a combinatorial model that is described by the cube recurrence, a nonlinear recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in $\mathbb{Z}^3$. In the process, we prove…
In this paper, we establish sublinear and linear convergence of fixed point iterations generated by averaged operators in a Hilbert space. Our results are achieved under a bounded H\"older regularity assumption which generalizes the…
Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…
A permutation sequence $(\sigma_n)_{n \in \mathbb{N}}$ is said to be convergent if, for every fixed permutation $\tau$, the density of occurrences of $\tau$ in the elements of the sequence converges. We prove that such a convergent sequence…
In an automatic search, we found conjectural recurrences for some sequences in the OEIS that were not previously recognized as being D-finite. In some cases, we are able to prove the conjectured recurrence. In some cases, we are not able to…
Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, G\"odel incompleteness theorems, inconsistency provability for set theory, constructive…
Action convergence provides a limit theory for linear bounded operators $A_n:L^{\infty}(\Omega_n)\longrightarrow L^1(\Omega_n)$ where $\Omega_n$ are potentially different probability spaces. This notion of convergence emerged in graph…
In this paper, the recently introduced M&m sequences and associated mean-median map are studied. These sequences are built by adding new points to a set of real numbers by balancing the mean of the new set with the median of the original.…
The multitime multiple recurrences are common in analysis of algorithms, computational biology, information theory, queueing theory, filters theory, statistical physics etc. The theoretical part about them is little or not known. That is…
We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…