Related papers: Arnoux-Rauzy Subshifts: Linear Recurrence, Powers,…
In this paper the variant supercurrents based on consistency and completion in off-shell N=1 supergravity are studied. We formulate the embedding relations for supersymmetric current and energy tensor into supercurrent multiplet.…
Various recurrence relations between formal orthogonal polynomials can be used to derive Lanczos-type algorithms. In this paper, we consider recurrence relation $A_{12}$ for the choice $U_i(x)=P_i(x)$, where $U_i$ is an auxiliary family of…
We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…
We consider a class of singularly perturbed elliptic problems with nonautonomous asymptotically linear nonlinearities. The dependence on the spatial coordinates comes from the presence of a potential and of a function representing a…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
If we change the upper and lower density in the definition of distributional chaos of a continuous linear operator on Banach space by the Banach upper and Banach lower density, respectively, we obtain Li-Yorke chaos. Motivated by this fact,…
We address combinatorial problems that can be formulated as minimization of a partially separable function of discrete variables (energy minimization in graphical models, weighted constraint satisfaction, pseudo-Boolean optimization, 0-1…
It was recently conjectured that every component of a discrete-time rational dynamical system is a solution to an algebraic difference equation that is linear in its highest-shift term (a quasi-linear equation). We prove that the conjecture…
This study introduces a novel approach to ensure the existence and uniqueness of optimal parameters in neural networks. The paper details how a recurrent neural networks (RNN) can be transformed into a contraction in a domain where its…
In this work, the Ginzburg-Landau theory is represented on a symplectic manifold with a phase space content. The order parameter is defined by a quasi-probability amplitude, which gives rise to a quasi-probability distribution function,…
We investigate the sequence $(P_{n}(z))_{n=0}^{\infty}$ of random polynomials generated by the three-term recurrence relation $P_{n+1}(z)=z P_{n}(z)-a_{n} P_{n-1}(z)$, $n\geq 1$, with initial conditions $P_{\ell}(z)=z^{\ell}$, $\ell=0, 1$,…
We study unitarity and renormalizability in the Lifshitz scalar field theory, which is characterized by an anisotropic scaling between the space and time directions. Without the Lorentz symmetry, both the unitarity and the renormalizability…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
The computational properties of neural systems are often thought to be implemented in terms of their network dynamics. Hence, recovering the system dynamics from experimentally observed neuronal time series, like multiple single-unit (MSU)…
We present an abstract result on removing regularization for singular potentials which are not semibounded from below. The relation between ``right'' regularizations and ``right'' self-adjoint extensions of the perturbed Schr\"odinger…
Artificial Neural Networks (NNWs) are appealing functions to substitute high dimensional and non-linear history-dependent problems in computational mechanics since they offer the possibility to drastically reduce the computational time.…
Enhancing a recent result of Bayart and Ruzsa we obtain a Birkhoff-type characterization of upper frequently hypercyclic operators and a corresponding Upper Frequent Hypercyclicity Criterion. As an application we characterize upper…
In this manuscript, we introduce (symmetric) Tetranacci polynomials $\xi_j$ as a twofold generalization of ordinary Tetranacci numbers, by considering both non unity coefficients and generic initial values in their recursive definition. The…
Consider the higher order parabolic operator $\partial_t+(-\Delta_x)^m$ and the higher order Schr\"{o}dinger operator $i^{-1}\partial_t+(-\Delta_x)^m$ in $X=\{(t,x)\in\mathbb{R}^{1+n};~|t|<A,|x_n|<B\}$, where $m$ and $n$ are any positive…
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…