中文
相关论文

相关论文: Pushing disks apart - The Kneser-Poulsen conjectur…

200 篇论文

Let $N$ balls of the same radius be given in a $d$-dimensional real normed vector space, i.e., in a Minkowski $d$-space. Then apply a uniform contraction to the centers of the $N$ balls without changing the common radius. Here a uniform…

度量几何 · 数学 2020-05-12 Károly Bezdek

The aim of this paper is to prove that if a planar set $A$ has a difference set $\Delta(A)$ satisfying $\Delta(A)\subset \Z^++s$ for suitable $s$ than $A$ has at most 3 elements. This result is motivated by the conjecture that the disk has…

经典分析与常微分方程 · 数学 2009-09-02 Alex Iosevich , Philippe Jaming

One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995). Consider a plane partition $P$ in an $a \times b \times c$ box ${\sf B}$. Let $\Psi(P)$…

组合数学 · 数学 2020-12-08 Rebecca Patrias , Oliver Pechenik

It is shown that a separated sequence of points in the unit disc of the complex plane is in fact uniformly separated, if there exists a certain intermediate sequence whose separated subsequences are uniformly separated. This property is…

经典分析与常微分方程 · 数学 2018-10-01 Janne Gröhn , Artur Nicolau

We consider the problem of identifying n points in the plane using disks, i.e., minimizing the number of disks so that each point is contained in a disk and no two points are in exactly the same set of disks. This problem can be seen as an…

离散数学 · 计算机科学 2017-06-01 Valentin Gledel , Aline Parreau

In this note we show that a bounded degree planar triangulation is recurrent if and only if the set of accumulation points of some/any circle packing of it is polar (that is, planar Brownian motion avoids it with probability 1). This…

概率论 · 数学 2015-06-02 Ori Gurel-Gurevich , Asaf Nachmias , Juan Souto

We prove a long standing conjecture concerning the fencing problem in the plane: among planar convex sets of given area, prove that the disc, and only the disc maximizes the length of the shortest area-bisecting curve. Although it may look…

最优化与控制 · 数学 2010-11-30 L. Esposito , V. Ferone , B. Kawohl , C. Nitsch , C. Trombetti

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$ is a concave (resp.…

度量几何 · 数学 2024-02-08 Bushra Basit , Zsolt Lángi

When the plane is pie-sliced in $n\leq 4$ parts (with nonempty interior and common vertex at the origin) our main result provides a sufficient condition for any map $L$, that is continuous and piecewise linear relatively to this slicing, to…

经典分析与常微分方程 · 数学 2011-10-07 Laura Poggiolini , Marco Spadini

Two sets $A$ and $B$ of points in the plane are \emph{mutually avoiding} if no line generated by any two points in $A$ intersects the convex hull of $B$, and vice versa. In 1994, Aronov, Erd\H os, Goddard, Kleitman, Klugerman, Pach, and…

组合数学 · 数学 2020-06-23 Mozhgan Mirzaei , Andrew Suk

Given a planar pentagon, construct two new pentagons: the vertices of the first one are the intersection points of the diagonals of the original pentagon, and the vertices of the second one are the tangency points of the conic inscribed in…

度量几何 · 数学 2017-07-31 Serge Tabachnikov

For a planar point-set $P$, let D(P) be the minimum number of pairwise-disjoint empty disks such that each point in $P$ lies on the boundary of some disk. Further define D(n) as the maximum of D(P) over all n-element point sets. Hosono and…

组合数学 · 数学 2012-07-31 Adrian Dumitrescu , Minghui Jiang

Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…

度量几何 · 数学 2007-05-23 Greg Martin

A classical result of Dowker (Bull. Amer. Math. Soc. 50: 120-122, 1944) states that for any plane convex body $K$ in the Euclidean plane, the areas of the maximum (resp. minimum) area convex $n$-gons inscribed (resp. circumscribed) in $K$…

度量几何 · 数学 2024-03-26 Bushra Basit , Zsolt Lángi

Let $\{p_1, \ldots , p_n \} \subset {\Bbb{R}}^2$ be a separated point set, i.e., any two points have a distance at least $1$. Let $k \ge 1$ be an integer, and $1 \le t_1 < \ldots < t_k$ be real numbers. Let $\delta > 0$. Suppose for all $1…

组合数学 · 数学 2025-10-08 P. Erdős , E. Makai, , J. Pach

A rational distance set in the plane is a point set which has the property that all pairwise distances between its points are rational. Erd\H os and Ulam conjectured in 1945 that there is no dense rational distance set in the plane. In this…

数论 · 数学 2018-04-23 Jafar Shaffaf

We consider the situation where one is given a set S of points in the plane and a collection D of unit disks embedded in the plane. We show that finding a minimum cardinality subset of D such that any path between any two points in S is…

计算几何 · 计算机科学 2013-03-13 Rainer Penninger , Ivo Vigan

This paper presents two general criteria to determine spaceability results in the complements of unions of subspaces. The first criterion applies to countable unions of subspaces under specific conditions and is closely related to the…

泛函分析 · 数学 2024-11-15 Gustavo Araújo , Anderson Barbosa , Anselmo Raposo , Geivison Ribeiro

A previous work introduced pair space, which is spanned by the center of mass of a system and the relative positions (pair positions) of its constituent bodies. Here, I show that in the $N$-body Newtonian problem, a configuration that does…

数学物理 · 物理学 2024-10-22 Alon Drory

In the papers from Chui and Parnes (1971) and Luh (1972), as well on the paper from V.Nestoridis (1996) on the Universal Taylor series, it is used, without proof, that the union of two compact sets in $\mathbb{R} ^2$ with connected…

一般拓扑 · 数学 2015-12-16 Yeorgios Dossidis