Related papers: On Cycles of Generalized Collatz Sequences

We use the fact that certain cosets of the stabilizer of points are pairwise conjugate in a symmetric group $S_n$ in order to construct recurrence relations for enumerating certain subsets of $S_n$. Occasionally one can find `closed form'…

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…

Let $g$ be a map from the set of positive integers into itself defined as follows: Let $x$ be a positive integer. If $x$ is odd, then $g(x)=3x+1$, and if $x$ is even, then $g(x)=x/2$. The $3x+1$ conjecture, also called the Collatz…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Let C be a projective Gorenstein curve over an algebraically closed field of characteristic 0. A generalized linear system on C is a pair (I,f) consisting of a torsion-free, rank-1 sheaf I on C and a map of vector spaces f to the space of…

The cyclic insertion conjecture of Borwein, Bradley, Broadhurst and Lison\v{e}k states that by inserting all cyclic permutations of some initial blocks of 2's into the multiple zeta value $ \zeta(1,3,\ldots,1,3) $ and summing, one obtains…

A recast of the standard residue-class analysis of the 3x+1 (Collatz) map in terms of two elementary operators on arithmetic progressions. The resulting calculus (i) splits any progression into its even and odd subsequences in a single…

The LS-sequences of points recently introduced by the author are a generalization of van der Corput sequences. They were constructed by reordering the points of the corresponding LS-sequences of partitions. Here we present another algorithm…

The Collatz variations pattern seems not to have any recurrence relation between numbers. But knowing that there is at least a natural number that converges after several iterations we construct a function $f_{X,Y}$ that is equal to the…

In this article we consider the cycle structure of compositions of pairs of involutions in the symmetric group S_n chosen uniformly at random. These can be modeled as modified 2-regular graphs, giving rise to exponential generating…

Generalized Wigner crystals (GWC) on triangular moir\'e superlattices, formed from stacking two layers of transition metal chalcogenides, have been observed at multiple fractional fillings [Nature 587, 214 - 218 (2020), Nat. Phys. 17, 715 -…

The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…

Synchronisation between coupled oscillatory systems is a common phenomenon in many natural as well as technical systems. Varying the strength of coupling often leads to qualitative changes in the complex dynamics of the mutually coupled…

In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…

This paper studies the proof of Collatz conjecture for some set of sequence of odd numbers with infinite number of elements. These set generalized to the set which contains all positive odd integers. This extension assumed to be the proof…

Generalized Coherent States (GCS) are constructed (and discussed) in order to study quasiclassical behaviour of quantum spin models of the Heisenberg type. Several such models are taken to their semiclassical limits, whose form depends on…

We define a generalized vector partition function and derive an identity for generating series of such functions associated with solutions of basic recurrence relation of combinatorial analysis. As a consequence, we obtain the generating…

Let $\sigma_n=\lfloor1+n\cdot\log_23\rfloor$. For the Collatz 3x + 1 function exists for each $n\in\mathbb{N}$ a set of different residue classes $(\text{mod}\ 2^{\sigma_n})$ of starting numbers $s$ with finite stopping time…

We study the concept of a code (or shift) space for a generalized iterated function system (GIFS in short). We prove that relations between GIFSs and their code spaces are analogous to the case of classical IFSs. As an application, we…