中文
相关论文

相关论文: The layer number of $\alpha$-evenly distributed po…

200 篇论文

We provide a logarithmic upper bound for the disentangling number on unordered lists of leaf labeled trees. This results is useful for analyzing phylogenetic mixture models. The proof depends on interpreting multisets of trees as high…

组合数学 · 数学 2011-07-15 Seth Sullivant

Consider a set $X\subseteq \mathbb{R}^d$ which is 1-dense, namely, it intersects every unit ball. We show that we can get from any point to any other point in $\mathbb{R}^d$ in $n$ steps so that the intermediate points are in $X$, and the…

组合数学 · 数学 2023-11-03 Endre Csóka

For a L\'evy process $X$ on a finite time interval consider the probability that it exceeds some fixed threshold $x>0$ while staying below $x$ at the points of a regular grid. We establish exact asymptotic behavior of this probability as…

概率论 · 数学 2022-01-05 Krzysztof Bisewski , Jevgenijs Ivanovs

We study the occurrence of number rigidity and deletion singularity in a class of point processes that we call {\it projected perturbed lattices}. These are generalizations of processes of the form…

概率论 · 数学 2025-11-14 Youssef Djellouli , Pierre Yves Gaudreau Lamarre

In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of…

计算复杂性 · 计算机科学 2019-10-15 Ioannis Katsikarelis , Michael Lampis , Vangelis Th. Paschos

For a finite set $A\subset \mathbb{R}^d$, let $\Delta(A)$ denote the spread of $A$, which is the ratio of the maximum pairwise distance to the minimum pairwise distance. For a positive integer $n$, let $\gamma_d(n)$ denote the largest…

组合数学 · 数学 2022-12-20 Adrian Dumitrescu , Csaba D. Tóth

In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…

计算复杂性 · 计算机科学 2018-11-13 Ioannis Katsikarelis , Michael Lampis , Vangelis Th. Paschos

An upper bound of the expected order of magnitude is established for the number of rational points of bounded height on Ch\^atelet surfaces defined over the rationals.

数论 · 数学 2009-06-18 T. D. Browning

We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…

度量几何 · 数学 2022-07-01 Henry Cohn , David de Laat , Andrew Salmon

We describe a new family of $k$-uniform hypergraphs with independent random edges. The hypergraphs have a high probability of being peelable, i.e. to admit no sub-hypergraph of minimum degree $2$, even when the edge density (number of edges…

数据结构与算法 · 计算机科学 2019-07-11 Martin Dietzfelbinger , Stefan Walzer

The epitaxial growth process of a high symmetry surface occurs because adatoms meet and nucleate new islands, that eventually coalesce and complete atomic layers. During multilayer growth, nucleation usually takes place on top of terraces…

统计力学 · 物理学 2007-05-23 Paolo Politi , Claudio Castellano

We construct a point set in the Euclidean plane that elucidates the relationship between the fine-scale statistics of the fractional parts of $\sqrt n$ and directional statistics for a shifted lattice. We show that the randomly rotated, and…

数论 · 数学 2024-12-17 Jens Marklof

We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/sqrt(d) pivot steps on any simple d-polytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a…

组合数学 · 数学 2008-07-15 Bernd Gärtner , Volker Kaibel

We estimate the distribution of relatively $r$-prime lattice points in number fields $K$ with their components having a norm less than $x$. In the previous paper we obtained uniform upper bounds as $K$ runs through all number fields under…

数论 · 数学 2017-09-04 Wataru Takeda

Consider a configuration of pebbles distributed on the vertices of a connected graph of order $n$. A pebbling step consists of removing two pebbles from a given vertex and placing one pebble on an adjacent vertex. A distribution of pebbles…

组合数学 · 数学 2012-04-12 Melody Chan , Anant P. Godbole

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

度量几何 · 数学 2022-11-10 Yihan Zhang , Shashank Vatedka

We present a new multi-layer peeling technique to cluster points in a metric space. A well-known non-parametric objective is to embed the metric space into a simpler structured metric space such as a line (i.e., Linear Arrangement) or a…

数据结构与算法 · 计算机科学 2023-05-03 Yossi Azar , Danny Vainstein

Consider a convex body $C \subset \mathbb{R}^d$. Let $X$ be a random point with uniform distribution in $[0,1]^d$. Define $X_C$ as the number of lattice points in $\mathbb{Z}^d$ inside the translated body $C + X$. It is well known that…

概率论 · 数学 2025-07-15 Aleksandr Tokmachev

We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance, we can obtain an arrangement of points such that no pair of…

计算几何 · 计算机科学 2023-08-15 Fedor V. Fomin , Petr A. Golovach , Tanmay Inamdar , Saket Saurabh , Meirav Zehavi

Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in the $p$-random subset of $\mathbb{F}_q^d$. In this note, we determine the order of magnitude of $\alpha(\mathbb{F}_q^{3},p)$ up to a…

组合数学 · 数学 2026-01-15 József Balogh , Haoran Luo