相关论文: Iteration of functions and contractibility of acyc…

We present a Morse-theoretic characterization of collapsibility for 2-dimensional acyclic simplicial complexes by means of the values of normalized optimal combinatorial Morse functions.

Whitehead aspherical conjecture says that every connected subcomplex of every aspherical 2-complex is aspherical. By an argument on ribbon sphere-links, it is confirmed that the conjecture is true for every contractible finite 2-complex. In…

The Collatz conjecture implies that an iterated function sequence under a certain linear operator, beginning with a certain complex valued function, must converge to a certain complex function.

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,…

For a matrix $A$ which satisfies Crouzeix's conjecture, we construct several classes of matrices from $A$ for which the conjecture will also hold. We discover a new link between cyclicity and Crouzeix's conjecture, which shows that…

We show that the finite simply connected 2-complexes of nonpositive planar sectional curvature are collapsible. Moreover, we show that each finite connected 2-complex with negative planar sectional curvature and fundamental group…

The acyclic system conjecture of Ardila and Ceballos can be interpreted as saying the following: "Every triangulation of the 3-skeleton of a product of two simplices can be extended to a triangulation of the whole product". We show a…

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…

The Collatz conjecture is one of the easiest mathematical problems to state and yet it remains unsolved. For each $n\ge 2$ the Collatz iteration is mapped to a binary sequence and a corresponding unique integer which can recreate the…

The Collatz function is defined as C(n) = n / 2 if n is even and C(n) = 3n + 1 if n is odd. The Collatz conjecture states that every sequence generated by the Collatz function ends with the cycle (4, 2, 1) after a finite number of…

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

We show that the order complex of the poset of all cosets of all proper subgroups of a finite group $G$ is never $\mathbb{F}_{2}$-acyclic and therefore never contractible. This settles a question of K. S. Brown.

The Collatz hypothesis is a theorem of the algorithmic theory of natural numbers. We prove the (algorithmic) formula that expresses the halting property of Collatz algorithm. The observation that Collatz's theorem cannot be proved in any…

In general a contractible complex need not be collapsible. Moreover, there exist complexes which are collapsible but even so admit a collapsing sequence where one "gets stuck", that is one can choose the collapses in such a way that one…

Let $G$ be a finite group and $\mathcal{A}_p(G)$ be the poset of nontrivial elementary abelian $p$-subgroups of $G$. Quillen conjectured that $O_p(G)$ is nontrivial if $\mathcal{A}_p(G)$ is contractible. We prove that $O_p(G)\neq 1$ for any…

We construct an algorithm that, given a pair of homomorphisms between polycyclic-by-finite groups, determines whether their Reidemeister number is finite, and if so returns a set of representatives of the twisted conjugacy classes.…

A finite connected 2-complex K whose fundamental group is of cohomological dimension 2 is aspherical iff the subgroup \Sigma_K of H_2(K) consisting of spherical 2-cycles is zero. A finite connected subcomplex of an aspherical 2-complex is…

We obtain a complete characterization of all orbits of a quadratic Collatz-type recursion called the divide-or-choose-2 rule. Each orbit either ends in a cycle whose period depends on the initial value or it goes to infinity. We specify…

It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…

Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…