English
Related papers

Related papers: A Structural Condition on Point Sets with Few Dist…

200 papers

We consider the minimal distance between orbits of measure preserving dynamical systems. In the spirit of dynamical shrinking target problems we identify distance rates for which almost sure asymptotic closeness properties can be ensured.…

Dynamical Systems · Mathematics 2025-10-16 Maxim Kirsebom , Philipp Kunde , Tomas Persson , Mike Todd

In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…

Data Structures and Algorithms · Computer Science 2015-03-17 Tobias Brunsch , Heiko Roeglin

We investigate the problem of constructing unextendible product bases in the qubit case - that is, when each local dimension equals 2. The cardinality of the smallest unextendible product basis is known in all qubit cases except when the…

Quantum Physics · Physics 2013-11-15 Nathaniel Johnston

Let $p_1,p_2,p_3$ be three non-collinear points in the plane, and let $P$ be a set of $n$ other points in the plane. We show that the number of distinct distances between $p_1,p_2,p_3$ and the points of $P$ is $\Omega(n^{6/11})$, improving…

Combinatorics · Mathematics 2019-02-20 Micha Sharir , Jozsef Solymosi

Probabilistic models are proposed for bounding the forward error in the numerically computed inner product (dot product, scalar product) between of two real $n$-vectors. We derive probabilistic perturbation bounds, as well as probabilistic…

Numerical Analysis · Mathematics 2019-06-26 Ilse C. F. Ipsen , Hua Zhou

We develop a technique for counting the number of stress tensor multiplets in a 4D $\mathcal{N}=2$ SCFT. This provides a simple diagnostic for when an isolated (non-Lagrangian) SCFT is a product of two (or more) such theories. In class-S,…

High Energy Physics - Theory · Physics 2017-11-15 Jacques Distler , Behzat Ergun , Fei Yan

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

Recall that a subset $X$ of a group $G$ is 'product-free' if $X^2\cap X=\varnothing$, ie if $xy\notin X$ for all $x,y\in X$. Let $G$ be a group definable in a distal structure. We prove there are constants $c>0$ and $\delta\in(0,1)$ such…

Combinatorics · Mathematics 2023-04-20 Atticus Stonestrom

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. Babai conjectured that if a primitive…

Combinatorics · Mathematics 2021-10-27 Bohdan Kivva

Boros and Furedi (for d=2) and Barany (for abritrary d) proved that there exists a positive real number c_d such that for every set P of n points in R^d in general position, there exists a point of R^d contained in at least c_d…

Combinatorics · Mathematics 2012-03-22 Daniel Kral , Lukas Mach , Jean-Sebastien Sereni

It is known that the Kronecker coefficient of three partitions is a bounded and weakly increasing sequence if one increases the first part of all three partitions. Furthermore if the first parts of partitions \lambda,\mu are big enough then…

Combinatorics · Mathematics 2010-09-16 Christian Gutschwager

Constructing a discretization of a given set is a major problem in various theoretical and applied disciplines. An offset discretization of a set $X$ is obtained by taking the integer points inside a closed neighborhood of $X$ of a certain…

Discrete Mathematics · Computer Science 2018-08-10 Boris Brimkov , Valentin E. Brimkov

Let $F$ be a field and a finite $A\subset F$ be sufficiently small in terms of the characteristic $p$ of $F$ if $p>0$. We strengthen the "threshold" sum-product inequality $$|AA|^3 |A\pm A|^2 \gg |A|^6\,,\;\;\;\;\mbox{hence} \;\;…

Combinatorics · Mathematics 2018-09-27 Misha Rudnev , George Shakan , Ilya Shkredov

Let $R$ be a finite valuation ring of order $q^r$ where $q$ is odd and $A$ be a subset of $R$. In the present paper, we prove that there exists a point $u$ in the Cartesian product set $A\times A\subset R^2$ such that the size of the pinned…

Combinatorics · Mathematics 2020-08-24 Esen Aksoy Yazici

We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

Data Structures and Algorithms · Computer Science 2016-01-22 Clément L. Canonne , Ilias Diakonikolas , Themis Gouleakis , Ronitt Rubinfeld

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer $d$ there is a constant $c_d > 0$ such that whenever $X_1,..., X_{d+1}$ are $n$-element subsets of $\mathbb{R}^d$, then we…

Metric Geometry · Mathematics 2015-10-20 Roman Karasev , Jan Kynčl , Pavel Paták , Zuzana Patáková , Martin Tancer

In a recent breakthrough, Adiprasito, Avvakumov, and Karasev constructed a triangulation of the $n$-dimensional real projective space with a subexponential number of vertices. They reduced the problem to finding a small downward closed…

Combinatorics · Mathematics 2022-08-17 Peter Frankl , János Pach , Dömötör Pálvölgyi

We study point configurations on the torus $\mathbb T^d$ that minimize interaction energies with tensor product structure which arise naturally in the context of discrepancy theory and quasi-Monte Carlo integration. Permutation sets on…

Metric Geometry · Mathematics 2025-10-30 Dmitriy Bilyk , Nicolas Nagel , Ian Ruohoniemi

We study the minimum diameter problem for a set of inexact points. By inexact, we mean that the precise location of the points is not known. Instead, the location of each point is restricted to a contineus region ($\impre$ model) or a…

Computational Geometry · Computer Science 2017-04-03 Mohammad Ghodsi , Hamid Homapour , Masoud Seddighin

Consider the vanishing locus of a real analytic function on $\mathbb{R}^n$ restricted to $[0,1]^n$. We bound the number of rational points of bounded height that approximate this set very well. Our result is formulated and proved in the…

Number Theory · Mathematics 2016-08-17 P. Habegger
‹ Prev 1 8 9 10 Next ›