English
Related papers

Related papers: Essential dimension and the flats spanned by a poi…

200 papers

We consider four related problems. (1) Obtaining dimension estimates for the set of exceptional vantage points for the pinned Falconer distance problem. (2) Nonlinear projection theorems, in the spirit of Kaufman, Bourgain, and Shmerkin.…

Classical Analysis and ODEs · Mathematics 2024-02-27 Orit E. Raz , Joshua Zahl

A family of $k$ point sets in $d$ dimensions is well-separated if the convex hulls of any two disjoint subfamilies can be separated by a hyperplane. Well-separation is a strong assumption that allows us to conclude that certain kinds of…

Computational Geometry · Computer Science 2022-09-07 Helena Bergold , Daniel Bertschinger , Nicolas Grelier , Wolfgang Mulzer , Patrick Schnider

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

Combinatorics · Mathematics 2018-01-04 Martin Balko , Josef Cibulka , Pavel Valtr

Let $\mathbb{F}_q^d$ be the $d$-dimensional vector space over the finite field with $q$ elements. For a subset $E\subseteq \mathbb{F}_q^d$ and a fixed nonzero $t\in \mathbb{F}_q$, let $\mathcal{H}_t(E)=\{h_y: y\in E\}$, where $h_y$ is the…

We prove the existence theorem for basic elements in the quasi-projective case, extending results of Eisenbud-Evans and Bruns from the affine case. We give several geometric applications. For example, we show that every local complete…

Algebraic Geometry · Mathematics 2020-06-02 Mengyuan Zhang

The notion of synthetic dimensions has expanded the realm of topological physics to four dimensional (4D) space lately. In this work, non-Hermiticity is used as a synthetic parameter in PT-symmetric photonic crystals to study the…

Optics · Physics 2020-01-16 Qiang Wang , Kun Ding , Hui Liu , Shining Zhu , C. T. Chan

We establish new exponential in dimension lower bounds for the Maximum Halfspace Discrepancy problem, which models linear classification. Both are fundamental problems in computational geometry and machine learning in their exact and…

Computational Geometry · Computer Science 2026-03-20 Alexander Munteanu , Simon Omlor , Jeff M. Phillips

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Combinatorics · Mathematics 2025-12-02 Nikolai Avdeev

We establish sufficient conditions for existence of curves minimizing length as measured with respect to a degenerate metric on the plane while enclosing a specified amount of Euclidean area. Non-existence of minimizers can occur and…

Differential Geometry · Mathematics 2016-07-29 Jiri Dadok , Peter Sternberg

Let $n,p,r$ be positive integers with $n \geq p\geq r$. A rank-$\overline{r}$ subset of $n$ by $p$ matrices (with entries in a field) is a subset in which every matrix has rank less than or equal to $r$. A classical theorem of Flanders…

Rings and Algebras · Mathematics 2016-04-21 Clément de Seguins Pazzis

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

Computational Geometry · Computer Science 2015-02-18 Panos Giannopoulos , Christian Knauer , Gunter Rote , Daniel Werner

We give upper bounds on the essential dimension of (quasi-)simple algebraic groups over an algebraically closed field that hold in all characteristics. The results depend on showing that certain representations are generically free. In…

Group Theory · Mathematics 2016-07-26 Skip Garibaldi , Robert M. Guralnick

We prove that if $E \subset {\Bbb F}_q^d$, $d \ge 2$, $F \subset \operatorname{Graff}(d-1,d)$, the set of affine $d-1$-dimensional planes in ${\Bbb F}_q^d$, then $|\Delta(E,F)| \ge \frac{q}{2}$ if $|E||F|>q^{d+1}$, where $\Delta(E,F)$ the…

Combinatorics · Mathematics 2017-11-15 P. Birklbauer , A. Iosevich , T. Pham

Let A be an asymptotic basis for N_0 of some order. By an essentiality of A one means a subset P such that A\P is no longer an asymptotic basis of any order and such that P is minimal among all subsets of A with this property. A finite…

Number Theory · Mathematics 2008-04-15 Peter Hegarty

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

Metric Geometry · Mathematics 2020-02-25 Martin Balko , Attila Pór , Manfred Scheucher , Konrad Swanepoel , Pavel Valtr

Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…

Combinatorics · Mathematics 2010-01-07 Jan Kratochvil , Boris Horvat , Tomaz Pisanski

Let F(X) be the set of finite nonempty subsets of a set X. We have found the necessary and sufficient conditions under which for a given function f:F(X)-->R there is an ultrametric on X such that f(A)=diam A for every A\in F(X). For finite…

Metric Geometry · Mathematics 2011-11-01 D. Dordovskyi , O. Dovgoshey , E. Petrov

Let $1\leq m \leq n$ be integers with $m|n$ and $\cat{Alg}_{n,m}$ the class of central simple algebras of degree $n$ and exponent dividing $m$. In this paper, we find new, improved upper bounds for the essential dimension and 2-dimension of…

Rings and Algebras · Mathematics 2014-02-26 Sanghoon Baek

A finite subset $X$ of the Euclidean space is called an $m$-distance set if the number of distances between two distinct points in $X$ is equal to $m$. An $m$-distance set $X$ is said to be maximal if any vector cannot be added to $X$ while…

Combinatorics · Mathematics 2020-07-28 Hiroshi Nozaki , Masashi Shinohara

Depth measures quantify central tendency in the analysis of statistical and geometric data. Selecting a depth measure that is simple and efficiently computable is often important, e.g., when calculating depth for multiple query points or…

Computational Geometry · Computer Science 2024-11-12 Amirhossein Mashghdoust , Stephane Durocher