Related papers: A new conjecture equivalent to Collatz conjecture
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…
The famous (3n + 1) or Collatz conjecture has admitted some progress over the last several decades towards the conclusion that the conjecture is true (i.e. that all Collatz sequences will eventually reach a value of one), but has stubbornly…
An analog of Picard's little theorem for entire functions of matrices is proved.
As already noted by Niels Borne and Michel Emsalem, there is a natural generalization of the section conjecture for proper orbicurves. Combined with the reformulation by Niels Borne and Angelo Vistoli of the conjecture in terms of the…
This paper presents a new, significantly simpler proof of one of the main results of applied pi-calculus: the theorem that the concepts of observational and labeled equivalence of extended processes in applied pi-calculus coincide.
We propose a conjugate logic that can capture the behavior of quantum and quantum-like systems. The proposal is similar to the more generic concept of epistemic logic: it encodes knowledge or perhaps more correctly, predictions about…
A skeleton of the category with finite coproducts D freely generated by a single object has a subcategory isomorphic to a skeleton of the category with finite products C freely generated by a countable set of objects. As a consequence, we…
In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results
Collatz Conjecture sequences increase and decrease in seemingly random fashion. By identifying and analyzing the forms of numbers, we discover that Collatz sequences are governed by very specific, well-defined rules, which we call cascades.
Inspired by work done for systems of polynomial exponential equations, we study systems of equations involving the modular $j$ function. We show general cases in which these systems have solutions, and then we look at certain situations in…
Let A be a simple, unital, exact, and finite C*-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup obtained from the Elliott invariant…
Identities involving Mobius function values (u(j),u(k)) are used to generate a Riemann Hypothesis equivalent.
Let $g$ be a map from the set of positive integers into itself defined as follows: Let $x$ be a positive integer. If $x$ is odd, then $g(x)=3x+1$, and if $x$ is even, then $g(x)=x/2$. The $3x+1$ conjecture, also called the Collatz…
Every one knows that an equation is equivalent to a multivariate function. Generally speaking, there are more than one unknown x in this multivariate function and it is not easy to reduce the number of unknown x to one. In this paper we…
We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice…
We survey various results and conjectures concerning multiple polylogarithms and the multiple zeta function. Among the results, we announce our resolution of several conjectures on multiple zeta values. We also provide a new integral…
We consider the conjecture of Brutman and Pasow on a totality divided differences and prove the conjecture for continuous functions.
In the paper, we give partition-theoretic results for the coefficients of some mock theta functions and prove their congruence properties. Some recurrence relations connecting the coefficients of the mock theta functions with certain…
This paper relates the well-known Linear Temporal Logic with the logic of propositional schemata introduced by the authors. We prove that LTL is equivalent to a class of schemata in the sense that polynomial-time reductions exist from one…
We show that there can be no algorithm to decide whether infinite recursively described acyclic aspherical 2-complexes are contractible. We construct such a complex that is contractible if and only if the Collatz conjecture holds.