English
Related papers

Related papers: Acute sets of exponentially optimal size

200 papers

Given $n$ lines in general position in the plane, how many bounded triangular faces can the arrangement have? We construct a straight-line affine arrangement of $19$ lines satisfying the conditions of the iterative construction by…

Combinatorics · Mathematics 2026-04-27 Roman Parpalak , Denis Utkin

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

Computational Complexity · Computer Science 2017-12-14 Anastasios Sidiropoulos , Kritika Singhal , Vijay Sridhar

Each non-zero point in $\mathbb{R}^d$ identifies a closest point $x$ on the unit sphere $\mathbb{S}^{d-1}$. We are interested in computing an $\epsilon$-approximation $y \in \mathbb{Q}^d$ for $x$, that is exactly on $\mathbb{S}^{d-1}$ and…

Computational Geometry · Computer Science 2017-07-27 Daniel Bahrdt , Martin P. Seybold

Euclidean spanners are important geometric structures, having found numerous applications over the years. Cornerstone results in this area from the late 80s and early 90s state that for any $d$-dimensional $n$-point Euclidean space, there…

Computational Geometry · Computer Science 2021-04-06 Hung Le , Shay Solomon

We establish new lower bounds for the Tur\'an and Zarankiewicz numbers of certain apex partite hypergraphs. Given a $(d-1)$-partite $(d-1)$-uniform hypergraph $\mathcal{H}$, let $\mathcal{H}(k)$ be the $d$-partite $d$-uniform hypergraph…

Combinatorics · Mathematics 2025-10-10 Qiyuan Chen , Hong Liu , Ke Ye

Richard Guy asked for the largest set of points which can be placed in the plane so that their pairwise distances are rational numbers. In this article, we consider such a set of rational points restricted to a given hyperbola. To be…

Number Theory · Mathematics 2011-08-04 Edray Herber Goins , Kevin Mugo

It was conjectured by Edoukou in 2008 that a non-degenerate Hermitian threefold in $\mathbb{P}^4 (\mathbb{F}_{q^2})$ has at most $d(q^5+q^2) + q^3 + 1$ points in common with a threefold of degree $d$ defined over $\mathbb{F}_{q^2}$. He…

Algebraic Geometry · Mathematics 2024-06-12 Mrinmoy Datta , Subrata Manna

We introduce the problem of constructing weighted complex projective 2-designs from the union of a family of orthonormal bases. If the weight remains constant across elements of the same basis, then such designs can be interpreted as…

Quantum Physics · Physics 2007-07-31 Aidan Roy , A. J. Scott

Let $1 \leq k \leq d$ and consider a subset $E\subset \mathbb{R}^d$. In this paper, we study the problem of how large the Hausdorff dimension of $E$ must be in order for the set of distinct noncongruent $k$-simplices in $E$ (that is,…

Classical Analysis and ODEs · Mathematics 2019-10-22 Jonathan DeWitt , Kevin Ford , Eli Goldstein , Steven J. Miller , Gwyneth Moreland , Eyvindur A. Palsson , Steven Senger

We consider the 3-state Potts model in $d\geq2$ dimensions. For $d$ less than the upper critical dimension $d_\text{crit}$, the model has a critical and a tricritical fixed point. In $d=2$, these fixed points are described by minimal…

High Energy Physics - Theory · Physics 2022-12-08 Shai M. Chester , Ning Su

We present a sharp extension of a result of Bourgain on finding configurations of $k+1$ points in general position in measurable subset of $\mathbb{R}^d$ of positive upper density whenever $d\geq k+1$ to all proper $k$-degenerate distance…

Classical Analysis and ODEs · Mathematics 2020-04-22 Neil Lyall , Akos Magyar

A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the…

Metric Geometry · Mathematics 2013-09-10 Masashi Shinohara

We consider the problem of estimating the Attention mechanism in small space, and prove the existence of coresets for it of nearly optimal size. Specifically, we show that for any set of unit-norm keys and values $(K,V)$ in $\mathbb{R}^d$,…

Data Structures and Algorithms · Computer Science 2026-05-08 Edo Liberty , Alexandr Andoni , Eldar Kleiner

A universal word (u-word) for $d$-dimensional permutations of length $n$ is a 2-dimensional word with $d-1$ rows, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$…

Combinatorics · Mathematics 2026-03-03 Sergey Kitaev , Dun Qiu

We say that the order of an algebraic number $A$ is the minimum of positive integers $k$ such that $A^k$ is rational. In this paper, we show that the number of algebraic numbers $A$ with order $k$ such that \[ A,\ A^A,\ A^{A^A},\ \ldots \]…

Number Theory · Mathematics 2020-01-08 Hirotaka Kobayashi , Kota Saito , Wataru Takeda

For $d\ge 3$ we first show that the Hausdorff dimension of the set of $A$-divergent on average points in the $(d-1)$-dimensional closed horosphere in the space of $d$-dimensional Euclidean lattices, where $A$ is the group of positive…

Dynamical Systems · Mathematics 2024-12-13 Wooyeon Kim

For every $d\geq 2$, we construct a subset $D\subseteq \{1,2,\dots,n\}^d$ of size $n-o(n)$ such that every affine hyperplane of $\mathbb{R}^d$ intersects $D$ in at most $d$ points, and every hypersphere of $\mathbb{R}^n$ intersects $D$ in…

Combinatorics · Mathematics 2025-11-06 Dávid R. Szabó

Let OT_d(n) be the smallest integer N such that every N-element point sequence in R^d in general position contains an order-type homogeneous subset of size n, where a set is order-type homogeneous if all (d+1)-tuples from this set have the…

Combinatorics · Mathematics 2014-01-14 Andrew Suk

Line systems passing through the origin of the $d$ dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least $2(d-1)(d-2)$, and this…

Metric Geometry · Mathematics 2019-10-15 Mikhail Ganzhinov , Ferenc Szöllősi

We examine sets of lines in PG(d,F) meeting each hyperplane in a generator set of points. We prove that such a set has to contain at least 1.5d lines if the field F has more than 1.5d elements, and at least 2d-1 lines if the field F is…

Combinatorics · Mathematics 2014-07-22 Szabolcs L. Fancsali , Péter Sziklai
‹ Prev 1 4 5 6 7 8 10 Next ›