Related papers: Density of Collatz Trajectories
The Collatz conjecture, which posits that any positive integer will eventually reach 1 through a specific iterative process, is a classic unsolved problem in mathematics. This research focuses on designing an efficient algorithm to compute…
We propose a fast and scalable algorithm to project a given density on a set of structured measures defined over a compact 2D domain. The measures can be discrete or supported on curves for instance. The proposed principle and algorithm are…
We make quantitative improvements to recently obtained results on the structure of the image of a large difference set under certain quadratic forms and other homogeneous polynomials. Previous proofs used deep results of Benoist-Quint on…
Let $(X, \mathcal{B},\mu,T)$ be an ergodic measure preserving system, $A \in \mathcal{B}$ and $\epsilon>0$. We study the largeness of sets of the form \begin{equation*} \begin{split} S = \left\{ n\in\mathbb{N}\colon\mu(A\cap…
This work presents a new method to quantify connectivity in transportation networks. Inspired by the field of topological data analysis, we propose a novel approach to explore the robustness of road network connectivity in the presence of…
In this paper, we study the steady-states of a large class of stationary radiative transfer equations in a $C^1$ convex bounded domain. Namely, we consider the case in which both absorption-emission and scattering coefficients depend on the…
We establish a density variant of the Frankl-R\"{o}dl theorem on the sphere $\mathbb{S}^{n-1}$, which concerns avoiding pairs of vectors with a specific distance, or equivalently, a prescribed inner product. In particular, we establish…
With the rise of the Internet of Things, strategies for effectively processing big data are essential for discovering meaningul insights. The time series datasets produced by groups of interconnected devices contain valuable underlying…
Tunneling conductance in diffusive normal metal / insulator / s-wave superconductor (DN/I/S) junctions is calculated for various situations by changing the magnitudes of the resistance and Thouless energy in DN and the transparency of the…
We prove a density version of the Carlson--Simpson Theorem. Specifically we show the following. For every integer $k\geq 2$ and every set $A$ of words over $k$ satisfying \[\limsup_{n\to\infty} \frac{|A\cap [k]^n|}{k^n}>0\] there exist a…
A general density-matrix formulation of quantum-transport phenomena in semiconductor nanostructures is presented. More specifically, contrary to the conventional single-particle correlation expansion, we shall investigate separately the…
Density functional theory is used to study colloidal hard-rod fluids near an individual right-angled wedge or edge as well as near a hard wall which is periodically patterned with rectangular barriers. The Zwanzig model, in which the…
A fairly general procedure is studied to perturbate a multivariate density satisfying a weak form of multivariate symmetry, and to generate a whole set of non-symmetric densities. The approach is general enough to encompass a number of…
The S-measure construction from nonstandard analysis is used to prove an extension of a result on the intersection of sets in a finitely-additive measure space. This is then used to give a density-limit version of a representation theorem…
A new proof following a suggestion of Kaplansky to use a result of Dixmier, and in this way avoid unbounded nets of operators, is given of the Kaplansky density theorem.
We introduce the notion of pattern in the context of lattice paths, and investigate it in the specific case of Dyck paths. Similarly to the case of permutations, the pattern-containment relation defines a poset structure on the set of all…
In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different…
The Collatz conjecture can be stated in terms of the reduced Collatz function R(x) = (3x+1)/2^m (where 2^m is the larger power of 2 that divides 3x+1). The conjecture is: Starting from any odd positive integer and repeating R(x) we…
We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…
We prove new bijections between different variants of Dyck paths and integer compositions, which give combinatorial explanations of their simple counting formula $4^{n-1}$. These give relations between different statistics, such as the…