The 3x+1 problem: New lower bounds on nontrivial cycle lengths

DOI10.1016/0012-365X(93)90052-UzbMATH Open0786.11012DBLPjournals/dm/Eliahou93WikidataQ63353519 ScholiaQ63353519MaRDI QIDQ685592FDOQ685592

Authors: Shalom Eliahou 

Publication date: 2 November 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Theoretical and computational bounds for m-cycles of the 3n+1-problem
• On the nonexistence of $2$-cycles for the $3x+1$ problem
• On Schelp's problem for three odd long cycles
• The \(3x+1\) problem: a lower bound hypothesis
• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• A lower bound in the problem of realization of cycles
• Cycles and new bounds for the chromatic number
• New length bounds for cycle bases
• The set of rational cycles for the 3x+1 problem

zbMATH Keywords

trajectorycycles\(3x+1\)-conjectureCollatz functionone-sided diophantine approximation of \(\log_ 2(3)\)

Mathematics Subject Classification ID

Special sequences and polynomials (11B83)

Cites Work

• On the "3x + 1" Problem
• The 3x + 1 Problem and Its Generalizations
• The Collatz problem
• Continued Fractions without Tears

Cited In (24)

• On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture
• On generalized circuit of the Collatz conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective polynomial upper bounds to perigees and numbers of (3x+d)-cycles of a given oddlength
• A simple (inductive) proof for the non-existence of 2-cycles of the \(3x+1\) problem
• Linear dynamics of an operator associated to the Collatz map
• Bounds for the 3x+1 problem using difference inequalities
• Cyclemaster matrices and Collatz cycles
• On the (non-)existence of m-cycles for generalized Syracuse sequences
• The \(3x+1\) problem: a lower bound hypothesis
• Maximum excursion and stopping time record-holders for the problem: Computational results
• A new statistic for the \(3x+1\) problem
• Collatz cycles with few descents
• The autoconjugacy of the \(3x+1\) function.
• On a class of 2-adic functions related to the ``\(3x+1\)-problem
• Title not available (Why is that?)
• Is the Syracuse falling time bounded by 12?
• Title not available (Why is that?)
• HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
• Theoretical and computational bounds for m-cycles of the 3n+1-problem
• A Dual-Radix Approach to Steiner’s 1-Cycle Theorem
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685592)