Related papers: Is the Syracuse falling time bounded by 12?
The time to failure, $T$, of dynamical models of fracture for a hierarchical load-transfer geometry is studied. Using a probabilistic strategy and juxtaposing hierarchical structures of height $n$, we devise an exact method to compute $T$,…
In this paper, we show that if the numbers in the range $[1,2^n]$ satisfy Collatz conjecture, then almost all integers in the range $[2^n+1,2^{n+1}]$ will satisfy the conjecture as $n \to \infty$. The previous statement is equivalent to…
The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…
Define $|n|$ to be the complexity of $n$, the smallest number of 1's needed to write $n$ using an arbitrary combination of addition and multiplication. John Selfridge showed that $|n|\ge 3\log_3 n$ for all $n$. Define the defect of $n$,…
When a lump of matter falls into a black hole it is expected that a marginally trapped tube when hit moves outwards everywhere, even in regions not yet in causal contact with the infalling matter. But to describe this phenomenon…
We consider first-passage percolation on the two-dimensional triangular lattice $\mathcal{T}$. Each site $v\in\mathcal{T}$ is assigned independently a passage time of either $0$ or $1$ with probability $1/2$. Denote by $B^+(0,n)$ the upper…
From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…
We introduce real log canonical threshold and real jumping numbers for real algebraic functions. A real jumping number is a root of the $b$-function up to a sign if its difference with the minimal one is less than 1. The real log canonical…
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…
We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…
Let $d=\frac{(3^{2k}+1)^{2}}{20}$, where $k$ is an odd integer. We show that the magnitude of the cross-correlation values of a ternary $m$-sequence $\{s_{t}\}$ of period $3^{4k}-1$ and its decimated sequence $\{s_{dt}\}$ is upper bounded…
The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…
We propose the existence of an infinite class of exact analogues of the 3x+1 conjecture for rational numbers with fixed denominators. For some other denominators, there are several attracting cycles, which exhibit scaling and covariance…
The Collatz process is defined on natural numbers by iterating the map $T(x) = T_0(x) = x/2$ when $x\in\mathbb{N}$ is even and $T(x)=T_1(x) =(3x+1)/2$ when $x$ is odd. In an effort to understand its dynamics, and since Generalised Collatz…
We consider a random walk $S$ in the domain of attraction of a standard normal law $Z$, \textit{ie} there exists a positive sequence $a_n$ such that $S_n/a_n$ converges in law towards $Z$. The main result of this note is that the rescaled…
The current paper presents a new quantum algorithm for finding multicollisions, often denoted by $\ell$-collisions, where an $\ell$-collision for a function is a set of $\ell$ distinct inputs that are mapped by the function to the same…
We explore potential uses of physics formulated in Kleinian (i.e., $2+2$) signature spacetimes as a tool for understanding properties of physics in Lorentzian (i.e., $3+1$) signature. Much as Euclidean (i.e., $4+0$) signature quantities can…
Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…
Consider an oracle which takes a point $x$ and returns the minimizer of a convex function $f$ in an $\ell_2$ ball of radius $r$ around $x$. It is straightforward to show that roughly $r^{-1}\log\frac{1}{\epsilon}$ calls to the oracle…
We show that a randomly chosen 3-CNF formula over n variables with clauses-to-variables ratio at least 4.4898 is, as n grows large, asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506.…