English
Related papers

Related papers: The layer number of $\alpha$-evenly distributed po…

200 papers

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

Number Theory · Mathematics 2013-11-13 Samuel Holmin

We define the excess degree $\xi(P)$ of a $d$-polytope $P$ as $2f_1-df_0$, where $f_0$ and $f_1$ denote the number of vertices and edges, respectively. This parameter measures how much $P$ deviates from being simple. It turns out that the…

Combinatorics · Mathematics 2018-02-16 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$ is $t$-tolerant if it remains a Tverberg partition after…

Computational Geometry · Computer Science 2015-05-28 Wolfgang Mulzer , Yannik Stein

Given a set of points $P$ and axis-aligned rectangles $\mathcal{R}$ in the plane, a point $p \in P$ is called \emph{exposed} if it lies outside all rectangles in $\mathcal{R}$. In the \emph{max-exposure problem}, given an integer parameter…

Computational Geometry · Computer Science 2021-02-09 Neeraj Kumar , Stavros Sintos , Subhash Suri

A cutset is a non-empty finite subset of $\mathbb{Z}^d$ which is both connected and co-connected. A cutset is odd if its vertex boundary lies in the odd bipartition class of $\mathbb{Z}^d$. Peled suggested that the number of odd cutsets…

Combinatorics · Mathematics 2016-09-06 Ohad Noy Feldheim , Yinon Spinka

We study the contact process on layered networks in which each layer is unidirectionally coupled to the next layer. Each layer has elements sitting on i) Erd{\"o}s-R{\'e}yni network, ii) a $d$-dimensional lattice. The layer at the top which…

Statistical Mechanics · Physics 2022-07-20 Manoj C. Warambhe , Ankosh D. Deshmukh , Prashant M. Gade

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

Number Theory · Mathematics 2016-09-07 Vidmantas Bentkus , Friedrich Götze

The objective is to find a Cellular Automata rule that can form a 2D point pattern with a maximum number of points (1-cells). Points are not allowed to touch each other, they have to be separated by 0-cells, and every 0-cell can find at…

Computational Geometry · Computer Science 2022-02-15 Rolf Hoffmann

In a quadruply imaged lens system the angular distribution of images around the lens center is completely described by three relative angles. We show empirically that in the 3D space of these angles, spanning 180 x 180 x 90 degrees, quads…

Cosmology and Nongalactic Astrophysics · Physics 2015-06-03 Addishiwot G. Woldesenbet , Liliya L. R. Williams

We consider all totally asymmetric simple exclusion processes (TASEPs) whose transition probabilities are given in the Sch\"utz-type formulas and which jump with homogeneous rates. We show that the multi-point distribution of particle…

Probability · Mathematics 2023-01-10 Yuta Arai

We examine the moments of the number of lattice points in a fixed ball of volume $V$ for lattices in Euclidean space which are modules over the ring of integers of a number field $K$. In particular, denoting by $\omega_K$ the number of…

Number Theory · Mathematics 2024-02-19 Nihar Gargava , Vlad Serban , Maryna Viazovska

We define a family of asymmetric processes for particles on a one-dimensional lattice, depending on a continuous parameter $\lambda \in [0,1] $, interpolating between the completely asymmetric processes [1] (for $\lambda =1$) and the n=1…

Condensed Matter · Physics 2009-10-31 M. Alimohammadi , V. Karimipour , M. Khorrami

Consider the classical $(2+1)$-dimensional Solid-On-Solid model above a hard wall on an $L\times L$ box of $\bbZ^2$. The model describes a crystal surface by assigning a non-negative integer height $\eta_x$ to each site $x$ in the box and 0…

Probability · Mathematics 2013-02-28 Pietro Caputo , Eyal Lubetzky , Fabio Martinelli , Allan Sly , Fabio Lucio Toninelli

In this paper we consider a simple model of random graph process with {\it hard} copying as follows: At each time step $t$, with probability $0<\alpha\leq 1$ a new vertex $v_t$ is added and $m$ edges incident with $v_t$ are added in the…

Probability · Mathematics 2008-08-05 Gao-Rong Ning , Xian-Yuan Wu , Kai-Yuan Cai

The statistics of transmission through random 1D media are generally presumed to be universal and to depend only upon a single dimensionless parameter-the ratio of the sample length and the mean free path, s = L/l. Here, we show in…

Disordered Systems and Neural Networks · Physics 2024-07-31 Jongchul Park , Matthieu Davy , Victor A. Gopar , Azriel Z. Genack

The random beta polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1-\|x\|^2)^\beta$ on the $d$-dimensional unit ball, where $\beta>-1$ is a parameter. Similarly, the random beta'…

Probability · Mathematics 2021-07-15 Zakhar Kabluchko

Consider the set of functions $f_{\theta}(x)=|\theta -x|$ on $\mathbb{R}$. Define a Markov process that starts with a point $x_0 \in \mathbb{R}$ and continues with $x_{k+1}=f_{\theta_{k+1}}(x_{k})$ with each $\theta _{k+1}$ picked from a…

Probability · Mathematics 2025-06-30 Aaron Abrams , Henry Landau , Zeph Landau , James Pommersheim , Eric Zaslow

For natural numbers $n$ and $l > d \geq 2$, let $ES_d(l,n)$ be the minimum $N$ such that any set of at least $N$ points in $\mathbb{R}^d$ contains either $l$ points contained in a common $(d-1)$-dimensional hyperplane or $n$ points in…

Combinatorics · Mathematics 2025-06-02 Koki Furukawa

$\delta$-Covering, for some covering range $\delta>0$, is a continuous facility location problem on undirected graphs where all edges have unit length. The facilities may be positioned on the vertices as well as on the interior of the…

Data Structures and Algorithms · Computer Science 2024-08-09 Tim A. Hartmann , Tom Janßen

The existence of a uniform upper bound for the maximum number of limit cycles of planar piecewise linear differential systems with two zones separated by a straight line has been subject of interest of hundreds of papers. After more than 30…

Dynamical Systems · Mathematics 2022-11-28 Victoriano Carmona , Fernando Fernández-Sánchez , Douglas D. Novaes