English
Related papers

Related papers: Generalized 3x + 1 Mappings : counting cycles

200 papers

We treat three cubic recurrences, two of which generalize the famous iterated map $x \mapsto x (1-x)$ from discrete chaos theory. A feature of each asymptotic series developed here is a constant, dependent on the initial condition but…

Dynamical Systems · Mathematics 2025-07-16 Steven Finch

An examples of solutions of the equation for curvature of congruence of cycles are constructed. Their properties are discussed.

Exactly Solvable and Integrable Systems · Physics 2007-10-09 Valerii Dryuma

With the $[0,1,2]$-family of cyclic triangulations we introduce a rich class of vertex-transitive triangulations of surfaces. In particular, there are infinite series of cyclic $q$-equivelar triangulations of orientable and non-orientable…

Combinatorics · Mathematics 2010-01-19 Frank H. Lutz

The aim of this paper is to unify the theory of ends of finitely generated groups with that of ends of locally compact, metrizable and connected topological groups. In both theories one proves that, if the number of ends is finite, then it…

Metric Geometry · Mathematics 2021-09-22 Yuankui Ma , Hussain Rashed , Jerzy Dydak

This paper gives a simple proof of the Wirsching-Goodwin representation of integers connected to 1 in the $3x+1$ problem (see \cite{Wirsching} and \cite{Goodwin}). This representation permits to compute all the ascending Collatz sequences…

Number Theory · Mathematics 2018-06-01 Jean-Jacques Daudin , Laurent Pierre

Let $G$ be a 3-partite graph with $k$ vertices in each part and suppose that between any two parts, there is no cycle of length four. Fischer and Matou\u{s}ek asked for the maximum number of triangles in such a graph. A simple construction…

Combinatorics · Mathematics 2017-02-07 Robert S. Coulter , Rex W. Matthews , Craig Timmons

In this paper, we consider a planar dynamical system with a piecewise linear function containing an arbitrary number (but finite) of dropping sections and approximating some continuous nonlinear function. Studying all possible local and…

Dynamical Systems · Mathematics 2008-03-05 Valery A. Gaiko , Wim T. van Horssen

An open problem about finite geometric progressions in syndetic sets leads to a family of diophantine equations related to the commutativity of translation and multiplication by squares.

Number Theory · Mathematics 2020-09-17 Melvyn B. Nathanson

Using the theory of resolving classes, we show that if $X$ is a CW complex of finite type such that $\map_*(X, S^{2n+1})\sim *$ for all sufficiently large $n$, then $\map_*(X, K) \sim *$ for every simply-connected finite-dimensional CW…

Algebraic Topology · Mathematics 2012-05-04 Jeffrey Strom

Motivated by the constructions of binary sequences by utilizing the cyclic elliptic function fields over the finite field $\mathbb{F}_{2^{n}}$ by Jin \textit{et al.} in [IEEE Trans. Inf. Theory 71(8), 2025], we extend the construction to…

Information Theory · Computer Science 2026-05-11 Xiaofeng Liu , Jun Zhang , Fang-Wei Fu

We study a counting version of Cycle Double Cover Conjecture. We discuss why it is more interesting to count circuits (i.e., graphs isomorphic to $C_k$ for some $k$) instead of cycles (graphs with all degrees even). We give an…

Combinatorics · Mathematics 2024-09-12 Radek Hušek , Robert Šámal

We show that there exists a sequence of genus three curves defined over the rationals in which the height of a canonical Gross-Schoen cycle tends to infinity.

Number Theory · Mathematics 2022-07-13 Robin de Jong

Each connected component of a mapping $\{1,2,...,n\}\rightarrow\{1,2,...,n\}$ contains a unique cycle. The largest such component can be studied probabilistically via either a delay differential equation or an inverse Laplace transform. The…

Combinatorics · Mathematics 2022-05-12 Steven Finch

The $3x+k$ function $T_{k}(n)$ sends $n$ to $(3n+k)/2$ resp. $n/2,$ according as $n$ is odd, resp. even, where $k \equiv \pm 1~(\bmod \, 6)$. The map $T_k(\cdot)$ sends integers to integers, and for $m \ge 1$ let $n \rightarrow m$ mean that…

Complex Variables · Mathematics 2015-10-27 Jason P. Bell , Jeffrey C. Lagarias

The polynomial $x^n+1$ over finite fields has been of interest due to its applications in the study of negacyclic codes over finite fields. In this paper, a rigorous treatment of the factorization of $x^n+1$ over finite fields is given as…

Number Theory · Mathematics 2020-09-22 Arunwan Boripan , Somphong Jitman

A Universal Cycle for t-multisets of [n]={1,...,n} is a cyclic sequence of $\binom{n+t-1}{t}$ integers from [n] with the property that each t-multiset of [n] appears exactly once consecutively in the sequence. For such a sequence to exist…

Combinatorics · Mathematics 2024-02-27 Glenn Hurlbert , Tobias Johnson , Joshua Zahl

In this short note we determine the maximum number, over all $n$-vertex graphs $G$, of orientations of $G$ containing no strongly connected cycle $C_{2k+1}$. This answers a part of a recent question of Araujo, Botler and Mota.

Combinatorics · Mathematics 2020-06-03 M. Bucić , B. Sudakov

We show that for any set of n distinct points in the complex plane, there exists a polynomial p of degree at most n+1 so that the corresponding Newton map, or even the relaxed Newton map, for p has the given points as a super-attracting…

Dynamical Systems · Mathematics 2012-08-29 James T. Campbell , Jared T. Collins

The aim of the current paper is to introduce a new class of contractive mappings, which are contracting (a feature of) triangles. We prove that maps contracting triangles are continuous and give the fixed point result for such mappings. We…

General Topology · Mathematics 2024-03-29 Ovidiu Popescu , Cristina Maria Pacurar

It has recently been shown that infinite matroids can be axiomatized in a way that is very similar to finite matroids and permits duality. This was previously thought impossible, since finitary infinite matroids must have non-finitary…

Combinatorics · Mathematics 2012-07-12 Henning Bruhn , Reinhard Diestel
‹ Prev 1 4 5 6 7 8 10 Next ›