Related papers: Recurrence Structures, Finite State Decomposition,…
The mechanism which discriminates the pattern classes at the same $\lambda$, is found. It is closely related to the structure of the rule table and expressed by the numbers of the rules which break the strings of the quiescent states. It is…
Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…
Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the…
In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…
Driving a quantum system periodically in time can profoundly alter its long-time correlations and give rise to exotic quantum states of matter. The complexity of the combination of many-body correlations and dynamic manipulations has the…
Understanding the periodic and structural properties of permutation maps over residue rings such as $\mathbb{Z}_{p^k}$ is a foundational challenge in algebraic dynamics and pseudorandom sequence analysis. Despite notable progress in…
We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…
Any modality in homotopy type theory gives rise to an orthogonal factorization system of which the left class is stable under pullbacks. We show that there is a second orthogonal factorization system associated to any modality, of which the…
Let $(Q, \mathfrak{n})$ be a regular local ring and let $f_1, \ldots, f_c \in \mathfrak{n}^2$ be a $Q$-regular sequence. Set $(A, \mathfrak{m}) = (Q/(\mathbf{f}), \mathfrak{n}/(\mathbf{f}))$. Further assume that the initial forms $f_1^*,…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
The determinants of modular Collatz graphs and the modular Conway amusical permutation graph are determined, and some interesting number theoretic properties are described.
We analyze within a semiclassical approximation the form factor for the fluctuations of quantum matrix elements around their classical average. We find two contributions: one is proportional to the form factor for the density of states,…
The generalized Fibonacci sequences are sequences $\{f_n\}$ which satisfy the recurrence $f_n(s, t) = sf_{n - 1}(s, t) + tf_{n - 2}(s, t)$ ($s, t \in \mathbb{Z}$) with initial conditions $f_0(s, t) = 0$ and $f_1(s, t) = 1$. In a recent…
We consider composite $n$ satisfying the congruence $$n \cdot \sigma_k(n) \equiv 2 \pmod{\phi(n)},$$ and show a "flanking" structure: $14$ appears in both $S_{k-1}$ and $S_{k+1}$ whenever certain values of $n$ appear in $S_k$; and,…
Iterative methods play an important role in science and engineering applications, with uses ranging from linear system solvers in finite element methods to optimization solvers in model predictive control. Recently, a new computational…
The primary paradigm in Neural Combinatorial Optimization (NCO) are construction methods, where a neural network is trained to sequentially add one solution component at a time until a complete solution is constructed. We observe that the…
In this paper we are shown the following facts: The probability of increased $ A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) $, and the probability of decrease $B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0}))$ in step $ k $ of a Collataz procedure…
This paper is a numerical evaluation of some trajectories of the Collatz function. Specifically, I assess the coalescence points of each integer $n\equiv 0 (\bmod{2})$ and $n\equiv 2(\bmod{3})$ through a sophisticated algorithm that has…
Let $c\phi_{k}(n)$ be the number of $k$-colored generalized Frobenius partitions of $n$. We establish some infinite families of congruences for $c\phi_{3}(n)$ and $c\phi_{9}(n)$ modulo arbitrary powers of 3, which refine the results of…
We study log-concavity properties of real sequences $(a_n)_{n \ge 0}$ satisfying a $d$-th order linear recurrence whose coefficients are linear functions of $n$; the so-called P-recursive (or holonomic) sequences. Writing the recurrence in…