Related papers: Parity vectors and paradoxical sequences in the ac…
The investigation of the pair correlation statistics of sequences was initially motivated by questions concerning quasi-energy-spectra of quantum systems. However, the subject has been developed far beyond its roots in mathematical physics,…
The Kolakoski sequence is the unique infinite sequence with values in $\{1, 2\}$ and first term twems $1, 2, \ldots$ which equals the sequence of run-lengths of itself, we call this $K(1, 2).$ We define $K(m, n)$ similarly for $m+n$ odd. A…
An interesting result of Veech more than 50 years ago is a parity, or mod $2$, version of the Kronecker--Weyl equidistribution theorem concerning the irrational rotation sequence $\{q\alpha\}$, $q=0,1,2,3,\ldots.$ If $\alpha$ is badly…
The Graceful Tree Conjecture of Rosa from 1967 asserts that the vertices of each tree T of order n can be injectively labelled by using the numbers {1,2,...,n} in such a way that the absolute differences induced on the edges are pairwise…
This short note reports a master theorem on tight asymptotic solutions to divide-and-conquer recurrences with more than one recursive term: for example, T(n) = 1/4 T(n/16) + 1/3 T(3n/5) + 4 T(n/100) + 10 T(n/300) + n^2.
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…
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
Let $\mathcal P:=\mathcal P_{m\times n}$ denote the quantized coordinate ring of the space of $m\times n$ matrices, equipped with natural actions of the quantized enveloping algebras $U_q(\mathfrak{gl}_m)$ and $U_q(\mathfrak{gl}_n)$. Let…
Detecting parity violation on cosmological scales would provide a striking clue to new physics. Large-scale structure offers the raw statistical power -- many three-dimensional modes -- to make such tests. However, for scalar observables,…
Fox's conjecture from 1962, that the absolute values of the coefficients of the Alexander polynomial of an alternating link are trapezoidal, has remained stubbornly open to this date. Recently Fox's conjecture was settled for all special…
Very recently, Qi and Cui extended the Perron-Frobenius theory to dual number matrices with primitive and irreducible nonnegative standard parts and proved that they have Perron eigenpair and Perron-Frobenius eigenpair. The Collatz method…
The problem of counting plane trees with $n$ edges and an even or an odd number of leaves was studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and…
We present tracial analogs of the classical results of Curto and Fialkow on moment matrices. A sequence of real numbers indexed by words in non-commuting variables with values invariant under cyclic permutations of the indexes, is called a…
Folsom, Males, Rolen, and Storzer recently proved Andrews' Conjecture~4 for the coefficients of \[ v_1(q)=\sum_{n\ge 0}\frac{q^{n(n+1)/2}}{(-q^2;q^2)_n}=\sum_{n\ge 0}V_1(n)q^n. \] They also proved a refined density-one version of Andrews'…
We investigate the problems related to the Collatz map $T$ from the point of view of functional analysis. We associate with $T$ certain linear operator $\mathcal{T}$ and show that cycles and (hypothetical) diverging trajectory (generated by…
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.
It is well known that the Collatz Conjecture can be reinterpreted as the Collatz Graph with root vertex 1, asking whether all positive integers are within the tree generated. It is further known that any cycle in the Collatz Graph can be…
Collatz conjecture is generalized to $3n+3^k$ ($k\in N$). Operating as usual, every sequence seems to reach $3^k$ and end up in the loop $3^k, 4.3^k, 2.3^k,3^k$. The usual $3n+1$ conjecture is recovered for $k=0$. For $k>0$, we noticed the…
Let $A$ be a reciprocal matrix of order $n$ and $w$ be its Perron eigenvector. To infer the efficiency of $w$ for $A$, based on the principle of Pareto optimal decisions, we study the strong connectivity of a certain digraph associated with…
We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…