Related papers: Bonded Trajectories of the $3x+\gamma$ Problem
We consider pairing of itinerant fermions in a metal near a quantum-critical point (QCP) towards some form of particle-hole order (nematic, spin-density-wave, charge-density-wave, etc). At a QCP, the dominant interaction between fermions…
In this paper; we prove that all sequences can be broken up in cycles. Each cycle follows the same pattern: 1) Upward trajectory. Odd and even numbers alternate until the cycle reaches an upper bound 2) Downward trajectory. Two or more…
Special arithmetic series $f(x)=\sum_{n=0}^{\infty}c_nx^n$, whose coefficients $c_n$ are normally given as certain binomial sums, satisfy "self-replicating" functional identities. For example, the equation…
Let $a, b, c,$ and $n$ be integers, with $a$ nonzero and $n$ at least two. Necessary and sufficient conditions on these parameters are derived which guarantee that all solutions of the congruence \[ ax^2+bx+c \equiv 0\ \textrm{mod}\ n \]…
Fillmore Theorem says that if A is an nxn complex non-scalar matrix and {\gamma}_1,...,{\gamma}_{n} are complex numbers with {\gamma}_1+...+{\gamma}_{n}=trA, then there exists a matrix B similar to A with diagonal entries…
Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…
For a set $A$, let $P(A)$ be the set of all finite subset sums of $A$. In this paper, for a sequence of integers $B=\{1<b_1<b_2<\cdots\}$ and $3b_1+5\leq b_2\leq 6b_1+10$, we determine the critical value for $b_3$ such that there exists an…
We show the validity of Nachman's procedure (Ann. Math. 128(3):531-576, 1988) for reconstructing a conductivity function $\gamma$ in a smooth bounded domain $\Omega \subset \mathbb{R}^n$ ($n\geq 3$) from its Dirichlet-to-Neumann map…
The famous 3x + 1 problem of L. Collatz needs no introduction; however, this paper concerns a lesser-known, but similarly unresolved, precursor problem : the Original Collatz Conjecture, or OCC. We demonstrate that the core arithmetic…
A sequence in the additive group ${\mathbb Z}_n$ of integers modulo $n$ is called $n$-zero-free if it does not contain subsequences with length $n$ and sum zero. The article characterizes the $n$-zero-free sequences in ${\mathbb Z}_n$ of…
We consider a class of pattern matching problems where a normalising transformation is applied at every alignment. Normalised pattern matching plays a key role in fields as diverse as image processing and musical information processing…
Define the Ducci function $D: \mathbb{Z}_m^n \to \mathbb{Z}_m^n$ so \[D(x_1,x_2, ...,x_n)=(x_1+x_2 \;\text{mod} \; m, x_2+x_3 \; \text{mod} \; m, ..., x_n+x_1 \; \text{mod} \; m).\] Call $\{D^{\alpha}(\mathbf{u})\}_{\alpha=0}^{\infty}$ the…
In this article, we define a very important sequence of functions, all the functions of this sequence present behaviors very close to that of the Collatz function. The study of such functions allows us to obtain very interesting results…
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…
Fix natural numbers $n \geq 1$, $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. In previous work with A. Ayyer (J. Alg., 2022), we studied the factorization of specialized irreducible characters of $\text{GL}_{tn}$,…
Within the scope of elementary number theory, we prove that, as the main result, if $1 \leq x < y < z$ are integers such that at least one of $y, z, x+y$ is prime then $x^{n}+y^{n} \neq z^{n}$ for every odd integer $n \geq 3$. This result…
Let $T$ be the map defined on $\N=\{1,2,3, ...\}$ by $T(n) = \frac{n}{2} $ if $n$ is even and by $T(n) = \frac{3n+1}{2}$ if $n$ is odd. Consider the dynamical system $(\N, 2^{\N}, T,\mu)$ where $\mu$ is the counting measure. This dynamical…
We study generalized circular chord graphs $\mathcal C^{(k)}_n$, formed from a cycle $C_n$ by adding fixed-offset chords of length $k$ and, for even $n$, diameters. Using transfer matrix methods, we derive exact formulas for 3-colorings…
For a non-negative integer $m$, let $S(m)$ denote the sum given by $$S(m):=\sum_{n=0}^{m}\frac{(-1)^n(8n+1)}{n!^3}\left(\frac{1}{4}\right)_n^3.$$ Using the powerful WZ-method, for a prime $p\equiv 3$ $($mod $4)$ and an odd integer $r>1$, we…