English
Related papers

Related papers: Density of Collatz Trajectories

200 papers

In the Lorentz mirror walk in dimension $d\geq 2$, mirrors are randomly placed on the vertices of $\mathbb{Z}^d$ at density $p\in[0,1]$. A light ray is then shot from the origin and deflected through the various mirrors in space. The object…

Probability · Mathematics 2025-07-03 Dor Elboim , Antoine Gloria , Felipe Hernández

Let $1 < p < \infty$, $p\neq 2$. We prove that if $d\geq d_p$ is sufficiently large, and $A\subs\R^d$ is a measurable set of positive upper density then there exists $\la_0=\la_0(A)$ such for all $\la\geq\la_0$ there are $x,y\in\R^d$ such…

Combinatorics · Mathematics 2017-06-07 Brian Cook , Ákos Magyar , Malabika Pramanik

We discuss the classical problem of measuring the regularity of distribution of sets of $N$ points in $\mathbb{T}^d$. A recent line of investigation is to study the cost ($=$ mass $\times$ distance) necessary to move Dirac measures placed…

Classical Analysis and ODEs · Mathematics 2020-09-29 Louis Brown , Stefan Steinerberger

We consider a random sequential adsorption process on the one-dimensional lattice with nearest-neighbor exclusion. In this model, each site $s \in \mathbb{Z}$ starts empty and we will try to occupy it in time $t_s$, where…

Probability · Mathematics 2023-11-22 Charles S. do Amaral , Diogo C. dos Santos

A new variational method for studying the equilibrium states of an interacting particles system has been proposed. The statistical description of the system is realized by means of a density matrix. This method is used for description of…

General Physics · Physics 2014-12-19 Boris Bondarev

Many authors have studied the phenomenon of typically Gaussian marginals of high-dimensional random vectors; e.g., for a probability measure on $\R^d$, under mild conditions, most one-dimensional marginals are approximately Gaussian if $d$…

Probability · Mathematics 2011-04-22 Elizabeth Meckes

We consider four problems. Rogers proved that for any convex body $K$, we can cover ${\mathbb R}^d$ by translates of $K$ of density very roughly $d\ln d$. First, we extend this result by showing that, if we are given a family of positive…

Metric Geometry · Mathematics 2017-03-09 Nóra Frankl , János Nagy , Márton Naszódi

We study the effects of disorder on strongly coupled compressible matter in 2+1 dimensions. Our system consists of a D3/D5 intersection at finite temperature and in the presence of a disordered chemical potential. We first study the impact…

High Energy Physics - Theory · Physics 2016-08-24 Mario Araujo , Daniel Arean , Javier M. Lizana

The Collatz problem with $3x+k$ is revisited. Positive and negative limit cycles are given up to k=9997 starting with $x_0=-2\cdot10^7...+2\cdot10^7$. A simple relation between the probability distribution for the Syracuse iterates for…

Dynamical Systems · Mathematics 2021-01-21 Franz Wegner

In the framework of density functional theory a formalism to describe electronic transport in the steady state is proposed which uses the density on the junction and the {\em steady current} as basic variables. We prove that, in a finite…

Mesoscale and Nanoscale Physics · Physics 2016-01-12 G. Stefanucci , S. Kurth

We present a generating function and a closed counting formula in two variables that enumerate a family of classes of permutations that avoid or contain an increasing pattern of length three and have a prescribed number of occurrences of…

Combinatorics · Mathematics 2009-12-25 Hilmar Gudmundsson

One of the basic problems in discrete geometry is to determine the most efficient packing of congruent replicas of a given convex set $K$ in the plane or in space. The most commonly used measure of efficiency is density. Several types of…

Metric Geometry · Mathematics 2016-08-14 András Bezdek , Włodzimierz Kuperberg

Given a positive rational $q$, we consider Dyck paths having height at most two with some constraints on the number of consecutive peaks and consecutive valleys, depending on $q$. We introduce a general class of Dyck paths, called rational…

Combinatorics · Mathematics 2024-10-01 Elena Barcucci , Antonio Bernini , Stefano Bilotta , Renzo Pinzani

We obtain various new well-posedness results for continuity and transport equations, among them an existence and uniqueness theorem (in the class of strongly continuous solutions) in the case of nearly incompressible vector fields, possibly…

Analysis of PDEs · Mathematics 2009-10-01 Luigi Ambrosio , Gianluca Crippa , Alessio Figalli , Laura V. Spinolo

The Collatz Conjecture (also known as the 3x+1 Problem) proposes that the following algorithm will, after a certain number of iterations, always yield the number 1: given a natural number, multiply by three and add one if the number is odd,…

Number Theory · Mathematics 2020-01-28 Matt Hohertz , Bahman Kalantari

When conducting bonds are occupied randomly in a two-dimensional square lattice, the conductivity of the system increases continuously as the density of those conducting bonds exceeds the percolation threshold. Such a behavior is well known…

Statistical Mechanics · Physics 2014-11-03 Seongmin Kim , Y. S. Cho , N. A. M. Araujo , B. Kahng

We survey results on the problem of covering the space ${\mathbb R}^n$, or a convex body in it, by translates of a convex body. Our main goal is to present a diverse set of methods. A theorem of Rogers is a central result, according to…

Metric Geometry · Mathematics 2016-03-16 Márton Naszódi

In this work, we use the JKO scheme to approximate a general class of diffusion problems generated by Darcy's law. Although the scheme is now classical, if the energy density is spatially inhomogeneous or irregular, many standard methods…

Analysis of PDEs · Mathematics 2020-06-18 Matt Jacobs , Inwon Kim , Jiajun Tong

Let $S(x)$ be the number of $n \leq x$ for which a Hadamard matrix of order $n$ exists. Hadamard's conjecture states that $S(x)$ is about $x/4$. From Paley's constructions of Hadamard matrices, we have that \[ S(x) = \Omega(x/\log x). \] In…

Combinatorics · Mathematics 2010-04-28 Warwick de Launey , Daniel M. Gordon

We introduce a notion of Dyck paths with coloured ascents. For several ways of colouring, we establish bijections between sets of such paths and other combinatorial structures, such as non-crossing trees, dissections of a convex polygon,…

Combinatorics · Mathematics 2007-05-23 Andrei Asinowski , Toufik Mansour