Related papers: Generalized 3x + 1 Mappings : counting cycles
This article presents a variety of algebraic proofs of Steiner's $1$-Cycle Theorem. It also demonstrates that, under an exponential upper-bound on the iterates, the only $1$-cycles in the (accelerated) $3x-1$ dynamical system are $(1)$ and…
In this article we present set of infinite natural numbers which satisfies the conjecture $3n+1$.
We propose the existence of an infinite class of exact analogues of the 3x+1 conjecture for rational numbers with fixed denominators. For some other denominators, there are several attracting cycles, which exhibit scaling and covariance…
The $3x+1$ map $T$ is defined on the $2$-adic integers $\mathbb{Z}_2$ by $T(x)=x/2$ for even $x$ and $T(x)=(3x+1)/2$ for odd $x$. It is still unproved that under iteration of $T$ the trajectory of any rational $2$-adic integer is eventually…
We study geometrically finite one-dimensional mappings. These are a subspace of $C^{1+\alpha}$ one-dimensional mappings with finitely many, critically finite critical points. We study some geometric properties of a mapping in this subspace.…
The study of the dynamics of a continuous observable and non-controllable three-dimensional symmetric piecewise linear system with three zones can be reduced to the study of the existence of limit cycles for the piecewise differential…
In this paper, we discuss the well known 3x+1 conjecture in form of the accelerated Collatz function T defined on the positive odd integers. We present a sequence of quotient spaces and an invertible map that are intrinsically related to…
Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.
We describe a finite presentation of $ \mathcal{T}_{g,r} $ for $g \geq 3$. % or $(g,r)=(2,0)$. Here $\mathcal{T}_{g,r} $ is the universal central extension of the mapping class group of the surface of genus $g$ with $r$-boundaries. We also…
We compute the projective dimension and regularity of $3$-path ideals of arbitrary graphs with at most one cycle.
Let $G$ be a finite connected simple graph with $n$ vertices and $m$ edges. We show that, when $G$ is not bipartite, the number of $4$-cycles contained in $G$ is at most $\binom{m-n+1}{2}$. We further provide a short combinatorial proof of…
The main objective of this paper is to study the number of limit cycles in a family of polynomial systems. Using bifurcation methods, we obtain the maximal number of limit cycles in global bifurcation.
We discuss and prove a number of results for calculating characteristic cycles, or graded, enriched characteristic cycles. We concentrate particularly on results related to hypersurfaces.
We consider a sequence of complex rational maps (f_n) of a fixed degree d at least 2. Building on the seminal work of Kiwi, we introduce the notion of generalized rescaling limits. These are rational maps possibly defined over a…
A universal cycle is a cyclic sequence in which each object of a combinatorial family appears exactly once as a contiguous window. While such cycles are well understood for many discrete structures and linear subspaces, the case of affine…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
In this paper we determine the chromatic number of graphs with two odd cycle lengths. Let $G$ be a graph and $L(G)$ be the set of all odd cycle lengths of $G$. We prove that: (1) If $L(G)=\{3,3+2l\}$, where $l\geq 2$, then…
In this paper, the global qualitative analysis of planar quadratic dynamical systems is established and a new geometric approach to solving Hilbert's Sixteenth Problem in this special case of polynomial systems is suggested. Using geometric…
Paul Erdos claimed that mathematics is not yet ready to settle the 3x+1 conjecture. I agree, but very soon it will be! With the exponential growth of computer-generated mathematics, we (or rather our silicon brethrern) would have a shot at…
We show that there exists an infinite family of cubic $2$-connected non-hamiltonian graphs with girth $5$ containing a unique longest cycle.