Related papers: Generalizing Zeckendorf's Theorem to Homogeneous L…

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

We consider real sequences $(f_n)$ that satisfy a linear recurrence with constant coefficients. We show that the density of the positivity set of such a sequence always exists. In the special case where the sequence has no positive…

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

We study the generalized forward-reflected-backward (GFRB) method, an extension of the forward-reflected-backward (FRB) scheme due to Malitsky and Tam, for solving monotone inclusion problems in real Hilbert spaces. We first analyze GFRB…

For a spectrally positive and strictly stable process with index in (1,2), a series representation is obtained for the joint distribution of the "first passage triple" that consists of the time of first passage and the undershoot and the…

The celebrated $3x+1$ problem is reformulated via the use of an analytic expression of the trailing zeros sequence resulting in a single branch formula $f(x)+1$ with a unique fixed point. The resultant formula $f(x)$ is also found to…

We consider k-step recurrences of the form $z_{n+k} = A(z)/B(z)$, where A and B are linear functions of $z_n, z_{n+1}, ..., z_{n+k-1}$, which we call k-step linear fractional recurrences. The first Theorem in this paper shows that for each…

We study generalized Fibonacci sequences $F_{n+1}=PF_n-QF_{n-1}$ with initial values $F_0=0$ and $F_1=1$. Let $P,Q$ be nonzero integers such that $P^2-4Q$ is not a perfect square. We show that if $Q=\pm 1$ then the sequence…

A sequence of integers $ \{ s_n \}_{n \in \mathbb{N}} $ is called a T-sequence if there exists a Hausdorff group topology on $ \mathbb{Z} $ such that $ \{ s_n \}_{n \in \mathbb{N}} $ converges to zero. For every finite set of primes $ S $…

We reconsider the problem of regularizing the divergent series $\sum_{n=1}^{\infty}n^{\alpha}$ for $\operatorname{Re}\alpha>-1$, and offer a regularization prescription that yields the Riemann zeta regularization as a special case. The…

The long run behaviour of linear dynamical systems is often studied by looking at eventual properties of matrices and recurrences that underlie the system. A basic problem that lies at the core of many questions in this setting is the…

We investigate the homology representation of the symmetric group on rank-selected subposets of subword order. We show that the homology module for words of bounded length, over an alphabet of size $n,$ decomposes into a sum of tensor…

A series of works has established rewriting as an essential tool in order to prove coherence properties of algebraic structures, such as MacLane's coherence theorem for monoidal categories, based on the observation that, under reasonable…

By the classic results of Fricke and Klein, for every word $w$ in the free group $F(a,b)$ there exists a unique integer \it{trace polynomial} $f_w(x,y,z)\in Z[x,y,z]$ such that $Tr(w(A,B))=f_w(Tr A,Tr B,Tr AB)$. for all $A,B\in SL(2,C)$. We…

The recursively-constructed family of Mandelbrot matrices $M_n$ for $n=1$, $2$, $\ldots$ have nonnegative entries (indeed just $0$ and $1$, so each $M_n$ can be called a binary matrix) and have eigenvalues whose negatives $-\lambda = c$…

We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential…

Does a given system of linear equations with nonnegative constraints have an integer solution? This is a fundamental question in many areas. In statistics this problem arises in data security problems for contingency table data and also is…

The strong recurrence is equivalent to the Riemann hypothesis. On the other hand, the generalized strong recurrence holds for any irrational number. In this paper, we show the generalized strong recurrence for all non-zero rational numbers.…