Results 1  10
of
20
Partial Functions in ACL2
 Journal of Automated Reasoning
"... We describe a macro for introducing \partial functions" into ACL2, i.e., functions not dened everywhere. The function \denitions" are actually admitted via the encapsulation principle. We discuss the basic issues surrounding partial functions in ACL2 and illustrate theorems that can be ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
We describe a macro for introducing \partial functions" into ACL2, i.e., functions not dened everywhere. The function \denitions" are actually admitted via the encapsulation principle. We discuss the basic issues surrounding partial functions in ACL2 and illustrate theorems that can be proved about such functions.
Lagarias, Lower bounds for the total stopping time of 3x +1 iterates
 Math. Comp
"... Abstract. The total stopping time σ∞(n) of a positive integer n is the minimal number of iterates of the 3x + 1 function needed to reach the value 1, and is + ∞ if no iterate of n reaches 1. It is shown that there are infinitely many positive integers n having a finite total stopping time σ∞(n) such ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Abstract. The total stopping time σ∞(n) of a positive integer n is the minimal number of iterates of the 3x + 1 function needed to reach the value 1, and is + ∞ if no iterate of n reaches 1. It is shown that there are infinitely many positive integers n having a finite total stopping time σ∞(n) such that σ∞(n)> 6.14316 log n. The proof involves a search of 3x + 1 trees to depth 60, A heuristic argument suggests that for any constant γ<γBP ≈ 41.677647, a search of all 3x + 1 trees to sufficient depth could produce a proof that there are infinitely many n such that σ∞(n)> γlog n. It would require a very large computation to search 3x + 1 trees to a sufficient depth to produce a proof that the expected behavior of a “random ” 3x + 1 iterate, which is γ = 2 ≈ 6.95212, occurs infinitely often. log 4/3 1.
Theoretical and Computational Bounds for MCycles of the 3n + 1 Problem
, 2004
"... An mcycle of the 3n+1problem is defined as a periodic orbit with m local minima. In this article we derive lower and upper bounds for the cycle length and the elements of (hypothetical) mcycles. ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
An mcycle of the 3n+1problem is defined as a periodic orbit with m local minima. In this article we derive lower and upper bounds for the cycle length and the elements of (hypothetical) mcycles.
On the nonexistence of 2cycles for the 3x + 1 problem
 Mathematics of Computation
"... Abstract. This article generalizes a proof of Steiner for the nonexistence of 1cycles for the 3x + 1 problem to a proof for the nonexistence of 2cycles. A lower bound for the cycle length is derived by approximating the ratio between numbers in a cycle. An upper bound is found by applying a result ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. This article generalizes a proof of Steiner for the nonexistence of 1cycles for the 3x + 1 problem to a proof for the nonexistence of 2cycles. A lower bound for the cycle length is derived by approximating the ratio between numbers in a cycle. An upper bound is found by applying a result of Laurent, Mignotte, and Nesterenko on linear forms in logarithms. Finally numerical calculation of convergents of log2 3 shows that 2cycles cannot exist. 1.
The 3x + 1 problem and directed graphs
 Fibonacci Quarterly
"... Let Z denote the set of integers, P denote the positive integers, and N denote the nonnegative integers. Define the Collatz mapping T: 2N +1> 2N +1 by T(x) = (3x +1) / 2 J, where V \3x +1 but 2 / ' +1 3x + l. The famous 3x + l Conjecture, or Collatz Problem, asserts that, for any x e 2 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Let Z denote the set of integers, P denote the positive integers, and N denote the nonnegative integers. Define the Collatz mapping T: 2N +1> 2N +1 by T(x) = (3x +1) / 2 J, where V \3x +1 but 2 / ' +1 3x + l. The famous 3x + l Conjecture, or Collatz Problem, asserts that, for any x e 2N + 1, there exists k eN satisfying T k (x) = 1, where T k
Natural orbital networks
"... Abstract. These are some informal remarks on quadratic orbital networks over finite fields Zp. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We prove that for d = 1 generators, the Euler characteristic is always nonnegative and for d = ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. These are some informal remarks on quadratic orbital networks over finite fields Zp. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We prove that for d = 1 generators, the Euler characteristic is always nonnegative and for d = 2 and large enough p the Euler characteristic is negative. While for d = 1, all networks are planar, we suspect that for d ≥ 2 and large enough p, all networks are nonplanar. As a consequence on bounds for the number of complete subgraphs of a fixed dimension, the inductive dimension of all these networks goes 1 as p → ∞. [December 23 update: longer runs] 1. Polynomial orbital networks Given a field R = Zp, we study orbital graphs G = (V, E) defined by polynomials Ti which generate a monoid T acting on R. We think of (R, T) as a dynamical system where positive time T is given by the monoid of words w = w1w2... wk using the generators wk ∈ A = {T1,..., Td} as alphabet and where {T w x  w ∈ R} is the orbit of x. The orbital network [1, 3, 4] is the finite simple graph G where V = R is the set of vertices and where two vertices x, y ∈ V are connected if there exists Ti such that Ti(x) = y or Ti(y) = x. The network generated by the system consists of the union of all orbits. As custom in dynamics, one is interested in invariant components of the system and especially forward attractors Ω(x) of a point x as well as the garden of eden, the set of points which are not in the image of any Ti. We are also interested in the inductive dimension of the network. This relates to the existence and number of cliques, which are complete subgraphs of G.
unknown title
, 2006
"... First of all, let’s fix some notations. As usual, R, Q and Z will denote the sets of all real, rational and integer numbers, respectively. Put R1 = {x ∈ R: x ≥ 1}, Q1 = Q∩R1 and N1 = Z∩R1 = {1, 2, 3,...}. ..."
Abstract
 Add to MetaCart
First of all, let’s fix some notations. As usual, R, Q and Z will denote the sets of all real, rational and integer numbers, respectively. Put R1 = {x ∈ R: x ≥ 1}, Q1 = Q∩R1 and N1 = Z∩R1 = {1, 2, 3,...}.
THE SUFFICIENCY OF ARITHMETIC PROGRESSIONS FOR THE 3x +1 CONJECTURE
"... Abstract. Define T: Z + → Z + by T (x) = (3x+1)/2 if x is odd and T (x) =x/2 ifxis even. The 3x+1 Conjecture states that the Torbit of every positive integer contains 1. A set of positive integers is said to be sufficient if the Torbit of every positive integer intersects the Torbit of an elemen ..."
Abstract
 Add to MetaCart
Abstract. Define T: Z + → Z + by T (x) = (3x+1)/2 if x is odd and T (x) =x/2 ifxis even. The 3x+1 Conjecture states that the Torbit of every positive integer contains 1. A set of positive integers is said to be sufficient if the Torbit of every positive integer intersects the Torbit of an element of that set. Thus to prove the 3x+1 Conjecture it suffices to prove it on some sufficient set. Andaloro proved that the sets 1 + 2nN are sufficient for n ≤ 4andasked if 1 + 2nN is also sufficient for larger values of n. We answer this question in the affirmative by proving the stronger result that A + BN is sufficient for any nonnegative integers A and B with B ̸ = 0, i.e. every nonconstant arithmetic sequence forms a sufficient set. We then prove analagous results for the Divergent Orbits Conjecture and Nontrivial Cycles Conjecture.