English
Related papers

Related papers: Bisector energy and few distinct distances

200 papers

Exceptional points~(EPs) appear as degeneracies in the spectrum of non-Hermitian matrices at which the eigenvectors coalesce. In general, an EP of order $n$ may find room to emerge if $2(n-1)$ real constraints are imposed. Our results show…

Quantum Physics · Physics 2022-07-29 Sharareh Sayyad , Flore K. Kunst

We investigate a discrete version of the M\"obius energy, that is of geometric interest in its own right and is defined on equilateral polygons with $n$ segments. We show that the $\Gamma$-limit regarding $L^{q}$ or $W^{1,q}$ convergence,…

Geometric Topology · Mathematics 2014-05-20 Sebastian Scholtes

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of…

Combinatorics · Mathematics 2021-01-26 Ilya D. Shkredov

Let $\gamma_1,\gamma_2$ be a pair of constant-degree irreducible algebraic curves in $\mathbb{R}^d$. Assume that $\gamma_i$ is neither contained in a hyperplane nor in a quadric surface in $\mathbb{R}^d$, for each $i=1,2$. We show that for…

Combinatorics · Mathematics 2023-04-17 Hadas Baer-Erenfeld , Orit E. Raz

This note shows that for each $n\geq 5$ with only $n\not= 6$, there exists a $2n$-dimensional specially omnioriented quasitoric manifold $M^{2n}$ which represents a nonzero element in $\Omega_*^U$. This provides the counterexamples of…

Algebraic Topology · Mathematics 2017-02-28 Zhi Lü , Wei Wang

An integer point in a polyhedron is called irreducible iff it is not the midpoint of two other integer points in the polyhedron. We prove that the number of irreducible integer points in $n$-dimensional polytope with radius $k$ given by a…

Combinatorics · Mathematics 2017-12-29 A. Yu. Chirkov , N. Yu. Zolotykh

We consider partitions of a point set into two parts, and the lengths of the minimum spanning trees of the original set and of the two parts. If $w(P)$ denotes the length of a minimum spanning tree of $P$, we show that every set $P$ of $n…

Computational Geometry · Computer Science 2024-01-02 Adrian Dumitrescu , János Pach , Géza Tóth

Let $n,$ $m \geq 2$ be integers, and let $R$ be a subring of $\mathbb R$ with field of fractions $F.$ In this article, we generalize the rational angle bisection problem previously proposed by the author to the following problem: which…

Number Theory · Mathematics 2026-04-09 Takashi Hirotsu

Let $G$ be a simple graph with $n$ vertices, $m$ edges having Laplacian eigenvalues $\mu_1, \mu_2, \dots, \mu_{n-1},\mu_n=0$. The Laplacian energy $LE(G)$ is defined as $LE(G)=\sum_{i=1}^{n}|\mu_i-\overline{d}|$, where…

Combinatorics · Mathematics 2021-07-21 Hilal A. Ganiea , Bilal A. Rather , S. Pirzada

In this paper we derive an almost explicit analytic formula for asymptotic eigenenergy expansion of arbitrary odd degree polynomial potentials of the form $V(x)=(ix)^{2N+1}+\beta _{1}x^{2N}+\beta _{2}x^{2N-1}+\cdot \cdot \cdot \cdot \cdot…

Mathematical Physics · Physics 2014-07-02 Asiri Nanayakkara , Thilagarajah Mathanaranjan

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

Metric Geometry · Mathematics 2016-07-20 János Pach , Frank de Zeeuw

We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…

Number Theory · Mathematics 2019-02-12 Gareth Boxall , Gareth Jones , Harry Schmidt

In the early 1980's Almgren developed a theory of Dirichlet energy minimizing multi-valued functions, proving that the Hausdorff dimension of the singular set (including branch points) of such a function is at most $(n-2),$ where $n$ is the…

Analysis of PDEs · Mathematics 2018-01-16 Brian Krummel , Neshan Wickramasekera

There is a very natural map from the configuration space of n distinct points in Euclidean 3-space into the flag manifold U(n)/U(1)^n, which is compatible with the action of the symmetric group. The map is well-defined for all…

High Energy Physics - Theory · Physics 2009-11-07 Michael Atiyah , Paul Sutcliffe

Given a set $P$ of $n$ points in $\mathbb{R}^3$, we show that, for any $\varepsilon >0$, there exists an $\varepsilon$-net of $P$ for halfspace ranges, of size $O(1/\varepsilon)$. We give five proofs of this result, which are arguably…

Computational Geometry · Computer Science 2014-10-14 Sariel Har-Peled , Haim Kaplan , Micha Sharir , Shakhar Smorodinsky

Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|^2$ with small doubling. It follows that the additive energy of $B.B$ is…

Number Theory · Mathematics 2015-02-13 Dmitry Zhelezov

Given a non-negative $n \times n$ matrix viewed as a set of distances between $n$ points, we consider the property testing problem of deciding if it is a metric. We also consider the same problem for two special classes of metrics, tree…

Discrete Mathematics · Computer Science 2024-11-15 Yiqiao Bao , Sampath Kannan , Erik Waingarten

According to a result of Arkin~\etal~(2016), given $n$ point pairs in the plane, there exists a simple polygonal cycle that separates the two points in each pair to different sides; moreover, a $O(\sqrt{n})$-factor approximation with…

Computational Geometry · Computer Science 2019-12-04 Adrian Dumitrescu

The "Perpendicular Bisectors Construction" is a natural way to seek a replacement for the circumcenter of a noncyclic quadrilateral in the plane. In this paper, we generalize this iterative construction to a construction on polytopes with…

Metric Geometry · Mathematics 2012-03-30 Emmanuel Tsukerman

Let $P$ be a set of $n$ points in the plane that determines at most $n/5$ distinct distances. We show that no line can contain more than $O(n^{43/52}{\rm polylog}(n))$ points of $P$. We also show a similar result for rectangular distances,…

Combinatorics · Mathematics 2016-07-14 Orit E. Raz , Oliver Roche-Newton , Micha Sharir