Related papers: Arnoux-Rauzy Subshifts: Linear Recurrence, Powers,…
We study continuum Schr\"odinger operators on the real line whose potentials are comprised of two compactly supported square-integrable functions concatenated according to an element of the Fibonacci substitution subshift over two letters.…
We study Schr\"odinger operators on the real line whose potentials are generated by an underlying ergodic subshift over a finite alphabet and a rule that replaces symbols by compactly supported potential pieces. We first develop the…
Everybody has certainly heard about palindromes: words that stay the same when read backwards. For instance kayak, radar, or rotor. Mathematicians are interested in palindromic numbers: positive integers whose expansion in a certain integer…
Unitary recurrent neural networks (URNNs) have been proposed as a method to overcome the vanishing and exploding gradient problem in modeling data with long-term dependencies. A basic question is how restrictive is the unitary constraint on…
We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several…
Recurrent representations for an electron transmission and reflection amplitudes for a one-dimensional chain are obtained. The linear differential equations for scattering amplitudes of an arbitrary potential are found.
Real linear operators emerge in a range of mathematical physics applications. In this paper spectral questions of compact real linear operators are addressed. A Lomonosov-type invariant subspace theorem for antilinear compact operators is…
We study the one-loop renormalization of high-energy Lorentz violating four fermion models. We derive general formulas and then consider a number of specific models. We study the conditions for asymptotic freedom and give a practical method…
A sum of a large-dimensional random matrix polynomial and a fixed low-rank matrix polynomial is considered. The main assumption is that the resolvent of the random polynomial converges to some deterministic limit. A formula for the limit of…
We examine the behavior of a one-dimensional superconducting wire exposed to an applied electric current. We use the time-dependent Ginzburg-Landau model to describe the system and retain temperature and applied current as parameters.…
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…
In these lectures, we discuss different types of renormalization problems in QCD and their non-perturbative solution in the framework of the lattice formulation. In particular the recursive finite size methods to compute the…
We analyze, mainly using bifurcation methods, an elliptic superlinear problem in one-dimension with periodic boundary conditions. One of the main novelties is that we follow for the first time a bifurcation approach, relying on a…
We study a class of combinatorial scheduling problems characterized by a particular type of constraint often associated with electrical power or gas energy. This constraint appears in several practical applications and is expressed as a sum…
We study Schr\"odinger operators on the real line whose potentials are generated by the Fibonacci substitution sequence and a rule that replaces symbols by compactly supported potential pieces. We consider the case in which one of those…
The Burchnall-Chaundy polynomials $P_n(z)$ are determined by the differential recurrence relation $$P_{n+1}'(z)P_{n-1}(z)-P_{n+1}(z)P_{n-1}'(z)=P_n(z)^2$$ with $P_{-1}=P_0(z)=1.$ The fact that this recurrence relation has all solutions…
Classical methods of solving spatiotemporal dynamical systems include statistical approaches such as autoregressive integrated moving average, which assume linear and stationary relationships between systems' previous outputs. Development…
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…
We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…
The document tries to put focus on sequences with certain properties and periods leading to the first value smaller than the starting value in the Collatz problem. With the idea that, if all starting numbers lead ultimately to a smaller…