Related papers: Density of Collatz Trajectories

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 address the problem of reconstructing a set of points on a line or a loop from their unassigned noisy pairwise distances. When the points lie on a line, the problem is known as the turnpike; when they are on a loop, it is known as the…

We show that for any set $S\subseteq \mathbb{Z}$, $|S|=4$ there exists a 3-coloring of $\mathbb{Z}$ in which every translate of $S$ receives all three colors. This implies that $S$ has a codensity of at most $1/3$, proving a conjecture of…

This paper is a numerical evaluation of some trajectories of the Collatz function. Specifically, I assess the coalescence points of each integer $n\equiv 0 (\bmod{2})$ and $n\equiv 2(\bmod{3})$ through a sophisticated algorithm that has…

Cover-inclusive Dyck tilings are tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths, in which tiles are no larger than the tiles they cover. These tilings arise in the study of certain statistical physics models and…

Recent experiments on atomic-scale metallic contacts have shown that the quantization of the conductance appears clearly only after the average of the experimental results. Motivated by these results we have analyzed a simplified model…

For a compact set $K\subset \mathbb{R}^m$, we have two indexes given under simple parameters of the set $K$ (these parameters go back to Besicovitch and Taylor in the late 50's). In the present paper we prove that with the exception of a…

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…

We provide generating functions for the popularity and the distribution of patterns of length at most three over the set of Dyck paths having a first return decomposition constrained by height.

In this paper, we study the traveling wave solutions to the density-suppressed motility model describing the ``self-trapping'' mechanism that induces spatio-temporal pattern formations observed in the experiment. We establish the existence…

For a set of $n$ points in $\Re^d$, and parameters $k$ and $\eps$, we present a data structure that answers $(1+\eps,k)$-\ANN queries in logarithmic time. Surprisingly, the space used by the data-structure is $\Otilde (n /k)$; that is, the…

Some problems related to the transition density u(t,x) of the diffusion on the Sierpinski gasket are considerd, based on recent rigorous results and detailed numerical calculations. The main contents are an extension of Flory's formula for…

The aim of this paper is to extend the concept of measure density introduced by Buck for finite unions of arithmetic progressions, to arbitrary subsets of N defined by a given system of decompositions. This leads to a variety of new…

In this paper we prove that given two sets $E_1,E_2 \subset \mathbb{Z}$ of positive density, there exists $k \geq 1$ which is bounded by a number depending only on the densities of $E_1$ and $E_2$ such that $k\mathbb{Z} \subset…

We describe a new algorithm for verifying the Collatz conjecture for all n < 2^N for some fixed N. The algorithm takes less than twice as long to verify convergence for all n < 2^{N+1} as it does to verify convergence for all n < 2^N. We…

The effective action for the current and density is shown to satisfy an evolution equation, the functional generalization of Callan-Symanzik equation. The solution describes the dependence of the one-particle irreducible vertex functions on…

We study the phenomenon of real space condensation in the steady state of a class of one dimensional mass transport models. We derive the criterion for the occurrence of a condensation transition and analyse the precise nature of the shape…

We consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice. We assume that once walks meet, they coalesce. In $2d$, we classify the collective behavior of these walks under mild…

A path independent measure in order parameter space is introduced such that, when integrated along any closed contour in a three dimensional nematic phase, it yields the topological charge of any line defects encircled by the contour. A…

\textsc{Densest $k$-Subgraph} is the problem to find a vertex subset $S$ of size $k$ such that the number of edges in the subgraph induced by $S$ is maximized. In this paper, we show that \textsc{Densest $k$-Subgraph} is fixed parameter…