English
Related papers

Related papers: Covering Hypercube $mB^n$

200 papers

Given $m$ points and $n$ hyperplanes in $\mathbb{R}^d$, if there are many incidences, we expect to find a big cluster $K_{r,s}$ in their incidence graph. Apfelbaum and Sharir found lower and upper bounds for the largest size of $rs$, which…

Combinatorics · Mathematics 2018-10-04 Thao T. Do

Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…

Algebraic Geometry · Mathematics 2016-09-06 J. Maurice Rojas

In this paper we prove that a set of points $B$ of PG(n,2) is a minimal blocking set if and only if $<B>=PG(d,2)$ with $d$ odd and $B$ is a set of $d+2$ points of $PG(d,2)$ no $d+1$ of them in the same hyperplane. As a corollary to the…

Group Theory · Mathematics 2007-08-20 Alireza Abdollahi , M. J. Ataei , A. Mohammadi Hassanabadi

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…

Combinatorics · Mathematics 2020-06-23 Mozhgan Mirzaei , Andrew Suk

We study the size blow-up that is necessary to convert an algebraic circuit of product-depth $\Delta+1$ to one of product-depth $\Delta$ in the multilinear setting. We show that for every positive $\Delta = \Delta(n) = o(\log n/\log \log…

Computational Complexity · Computer Science 2018-04-10 Suryajith Chillara , Christian Engels , Nutan Limaye , Srikanth Srinivasan

In this note we prove that for any compact subset $S$ of a Busemann surface $({\mathcal S},d)$ (in particular, for any simple polygon with geodesic metric) and any positive number $\delta$, the minimum number of closed balls of radius…

Metric Geometry · Mathematics 2017-03-10 Victor Chepoi , Bertrand Estellon , Guyslain Naves

Let M be a (bounded or not) domain of C^n which is complete with respect to a K\"ahler metric, or more generally, a complete K\"ahler manifold with trivial canonical bundle. Let f be a linearly nondegenerate meromorphic map from M to the…

Complex Variables · Mathematics 2017-11-13 Do Duc Thai , Duc-Viet Vu

We show that, for any set of n points in d dimensions, there exists a hyperplane with regression depth at least ceiling(n/(d+1)). as had been conjectured by Rousseeuw and Hubert. Dually, for any arrangement of n hyperplanes in d dimensions…

Computational Geometry · Computer Science 2010-01-21 Nina Amenta , Marshall Bern , David Eppstein , Shang-Hua Teng

We study a topological method to calculate the first Milnor fiber cohomology of a defining polynomial of a reduced projective hyperplane arrangement $X$ of degree $d$. We can show the vanishing of a monodromy eigenspace of the first Milnor…

Algebraic Geometry · Mathematics 2021-05-26 Morihiko Saito

We show that Bertini theorems hold for $F$-signature and Hilbert--Kunz multiplicity. In particular, if $X \subseteq \mathbb{P}^n$ is normal and quasi-projective with $F$-signature greater than $\lambda$ (respectively the Hilbert--Kunz…

Algebraic Geometry · Mathematics 2022-03-01 Javier Carvajal-Rojas , Karl Schwede , Kevin Tucker

For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…

Combinatorics · Mathematics 2023-05-30 Alex Cohen , Cosmin Pohoata , Dmitrii Zakharov

In this paper, we study the Calabi-Yau conjectures for complete minimal hypersurfaces $\Sigma^{n}\subset \mathbb{R}^{n+1}$ in dimensions $n\ge 3$. These conjectures ask whether a complete minimal hypersurface must be unbounded, and more…

Differential Geometry · Mathematics 2026-03-02 Shrey Aryan , Alexander D. McWeeney

In this paper we prove that every bordered Riemann surface M admits a complete proper null holomorphic embedding into a ball of the complex Euclidean $3$-space $\mathbb{C}^3$. The real part of such an embedding is a complete conformal…

Complex Variables · Mathematics 2015-10-20 Antonio Alarcon , Franc Forstneric

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…

Discrete Mathematics · Computer Science 2024-05-22 Rishikesh Gajjala , Jayanth Ravi

Let $A \in \mathbb{R}^{n \times n}$ be invertible, $x \in \mathbb{R}^n$ unknown and $b =Ax $ given. We are interested in approximate solutions: vectors $y \in \mathbb{R}^n$ such that $\|Ay - b\|$ is small. We prove that for all $0<…

Numerical Analysis · Mathematics 2022-07-08 Stefan Steinerberger

We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…

Metric Geometry · Mathematics 2009-09-25 Gabor Fejes Tóth , Greg Kuperberg , Włodzimierz Kuperberg

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

Metric Geometry · Mathematics 2017-06-22 Simeon Ball

Let $X \subset \mathbf{P}_{\mathbf{Q}}^{n-1}$ be a cubic hypersurface cut out by the vanishing of a non-degenerate rational cubic form in $n$ variables. Let $N(X,B)$ denote the number of rational points on $X$ of height at most $B$. In this…

Number Theory · Mathematics 2024-05-09 V. Vinay Kumaraswamy , Nick Rome

We find the set of all universal minimum points of the potential of the $16$-point sharp code on $S^4$ and (more generally) of the demihypercube on $S^d$, $d\geq 5$, as well as of the $2_{41}$ polytope on $S^7$. We also extend known results…

Combinatorics · Mathematics 2023-01-18 Sergiy Borodachov

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

Computational Geometry · Computer Science 2017-11-16 Jakub Sosnovec
‹ Prev 1 8 9 10 Next ›