Related papers: Encoding and Visualization in the Collatz Conjectu…

We investigate a type of a Sudoku variant called Sudo-Kurve, which allows bent rows and columns, and develop a new, yet equivalent, variant we call a Sudo-Cube. We examine the total number of distinct solution grids for this type with or…

We present a comprehensive structural analysis of the Collatz conjecture through ~1014 computational experiments yielding 630 formal results. By systematically deploying 29 distinct mathematical paradigms--including transfer operator…

The McCarty Conjecture states that any McCarty Matrix (an $n\times n$ matrix $A$ with positive integer entries and each of the $2n$ row and column sums equal to $n$), can be additively decomposed into two other matrices, $B$ and $C$, such…

One of the most promising structural approaches to resolving the Hadamard Conjecture uses the family of cocyclic matrices over ${\mathbb Z} _t \times {\mathbb Z}_2^2$. Two types of equivalence relations for classifying cocyclic matrices…

The paper demonstrates how a 2-dimensional recurrence problem can be reduced to a mono-dimensional recurrence problem where the Kogge and Stone algorithm is applicable, with the computation time - excluding the reduction step - becoming…

We propose a successive generation of cutting inequalities for binary quadratic optimization problems. Multiple cutting inequalities are successively generated for the convex hull of the set of the optimal solutions $\subset \{0, 1\}^n$,…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

In this paper, we prove that reduced dynamics on Collatz conjecture is periodical, and its period equals 2 to the power of the count of x/2 computation in the reduced dynamics. More specifically, if there exists reduced dynamics of x (that…

In this work, we introduce another extension U of the 3n+1 function to the real line. We propose a conjecture about the U-trajectories that generalizes the famous 3n+1 (or Collatz) conjecture. We then prove our main result about the…

Let S be a complex smooth projective surface and L be a line bundle on S. G\"ottsche conjectured that for every integer r, the number of r-nodal curves in |L| is a universal polynomial of four topological numbers when L is sufficiently…

By using properties of Markov homogeneous chains and Banach measure in $\mathrm{N}$, it is proved that a relative frequency of even numbers in the sequence of $n$-th coordinates of all Collatz sequences is equal to the number…

The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid graphs, under different input settings, in theories of bounded…

In this article, we give two different proofs of why the Collatz Conjecture is false.

A manifestly Lorentz-covariant calculus based on two matrix-coordinates and their associated derivatives is introduced. It allows formulating relativistic field theories in any even-dimensional spacetime. The construction extends a…

We consider the quantum implementations of the two classical iterative solvers for a system of linear equations, including the Kaczmarz method which uses a row of coefficient matrix in each iteration step, and the coordinate descent method…

Kaczmarz's alternating projection method has been widely used for solving a consistent (mostly over-determined) linear system of equations Ax=b. Because of its simple iterative nature with light computation, this method was successfully…

We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…

For all natural numbers a,b and d > 0, we consider the function f_{a,b,d} which associates n/d to any integer n when it is a multiple of d, and an + b otherwise; in particular f_{3,1,2} is the Collatz function. Coding in base a > 1 with b <…

We study rotation $r$-graphs and show that for every $r$-graph $G$ of odd regularity there is a simple rotation $r$-graph $G'$ such that $G$ can be obtained form $G'$ by a finite number of $2$-cut reductions. As a consequence, some hard…

We define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…