Related papers: The Collatz conjecture and De Bruijn graphs

Using $p$-adic numbers, we partially categorize the cycles of a sizable class of polynomial dynamical systems. In turn, we prove a few results related to the non-trivial cycles of the $\textit{Collatz map}$ $\text{Col} : \mathbb{Z}_+ \to…

In this article we investigate the structure of uniformly $k$-connected and uniformly $k$-edge-connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We…

It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…

Andrei et al. have shown in 2000 that the graph $\boldsymbol{\mathrm{C}}$ of the Collatz function starting with root $8$ after the initial loop is an infinite binary tree $\boldsymbol{A}(8)$. According to their result they gave a…

The concept and the construction of modular graph functions are generalized from genus-one to higher genus surfaces. The integrand of the four-graviton superstring amplitude at genus-two provides a generating function for a special class of…

In this article we present set of infinite natural numbers which satisfies the conjecture $3n+1$.

In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…

The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…

We build a variant of Collatz Conjecture for polynomials over $\mathbb{F}_2$ and we prove that it is solved. By the way, we give several examples.

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

We represent the generalized Collatz function with the recursive ruler function r(2n) = r(n) + 1 and r(2n + 1) = 1. We generate even-only and odd-only Collatz subsequences that contain significantly fewer elements term by term, to 2 and 1,…

This paper has three main objectives: (i) To establish an isomorphism between Jacobi forms of index $D_{2n+1}$ (lattice index) and elliptic modular forms of level $2$. (ii) To provide an explicit formula for the Fourier coefficients of…

The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…

Sequence of numbers generated by the recurrence relation based on the Collatz conjecture is investigated. An arithmetic operation on the Collatz conjecture is called descending operation, and ascending operation is carried out reversely to…

We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than…

In this paper we study the structure of the graphs associated with the iterations of the map $x \mapsto x+x^{-1}$ over finite fields of characteristic two. Formulas are given for the length of the cycles and the depth of the trees relying…

A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected $2$-complex every link graph of which is 3-connected…

In this paper, we develop the theory of bimodules over von Neumann algebras, with an emphasis on categorical aspects. We clarify the relationship between dualizability and finite index. We also show that, for von Neumann algebras with…

Traces of singular moduli were introduced and studied by Zagier in 1998. Being simultaneously the (traces of) values of a modular function ($j$-invariant) and Fourier coefficients of modular forms - which constitutes Zagier's duality -…