English
Related papers

Related papers: Obtuse almost-equiangular sets

200 papers

Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…

Combinatorics · Mathematics 2019-11-20 Boris Bukh , Alfredo Hubard

The hypercube Q_n is the graph whose vertex set is {0,1}^n and where two vertices are adjacent if they differ in exactly one coordinate. For any subgraph H of the cube, let ex(Q_n, H) be the maximum number of edges in a subgraph of Q_n…

Combinatorics · Mathematics 2010-05-05 David Conlon

Frequently, data in scientific computing is in its abstract form a finite point set in space, and it is sometimes useful or required to compute what one might call the ``shape'' of the set. For that purpose, this paper introduces the formal…

Combinatorics · Mathematics 2016-09-06 Herbert Edelsbrunner , Ernst Mücke

Fix an integer $n\ge 2$. To each non-zero point $\mathbf{u}$ in $\mathbb{R}^n$, one attaches several numbers called exponents of Diophantine approximation. However, as Khintchine first observed, these numbers are not independent of each…

Number Theory · Mathematics 2019-05-07 Damien Roy

The Bollob\'as set pairs inequality is a fundamental result in extremal set theory with many applications. In this paper, for $n \geq k \geq t \geq 2$, we consider a collection of $k$ families $\mathcal{A}_i: 1 \leq i \leq k$ where…

Combinatorics · Mathematics 2020-06-09 Jason O'Neill , Jacques Verstraete

For positive integers $s,t,m$ and $n$, the Zarankiewicz number $z(m,n;s,t)$ is the maximum number of edges in a subgraph of $K_{m,n}$ that has no complete bipartite subgraph containing $s$ vertices in the part of size $m$ and $t$ vertices…

Combinatorics · Mathematics 2025-12-16 Sara Davies , Peter Gill , Daniel Horsley

For a Riemannian manifold $M^{n+1}$ and a compact domain $\Omega \subset M^{n+1}$ bounded by a hypersurface $\partial \Omega$ with normal curvature bounded below, estimates are obtained in terms of the distance from $O$ to $\partial \Omega$…

Differential Geometry · Mathematics 2015-06-12 Alexander Borisenko , Kostiantyn Drach

We prove a lower bound of $\Omega(n^2/\log^2 n)$ on the size of any syntactically multilinear arithmetic circuit computing some explicit multilinear polynomial $f(x_1, \ldots, x_n)$. Our approach expands and improves upon a result of Raz,…

Computational Complexity · Computer Science 2017-11-03 Noga Alon , Mrinal Kumar , Ben Lee Volk

Let $n$ and $t$ be positive integers with $t<n$, and let $q$ be a prime power. A partial $(t-1)$-spread of ${\rm PG}(n-1,q)$ is a set of $(t-1)$-dimensional subspaces of ${\rm PG}(n-1,q)$ that are pairwise disjoint. Let $r\equiv n\pmod{t}$…

Combinatorics · Mathematics 2017-07-05 Esmeralda Nastase , Papa Sissokho

We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most $t$ sets. We give an algorithm that finds a coloring with discrepancy $O((t \log n \log s)^{1/2})$ where $s$ is the…

Data Structures and Algorithms · Computer Science 2016-02-03 Nikhil Bansal , Shashwat Garg

The approximation constant $\lambda_{k}(\zeta)$ is defined as the supremum of real $\eta$ such that $\Vert \zeta^{j}x\Vert\leq x^{-\eta}$ for $1\leq j\leq k$ has infinitely many integer solutions $x$. Here $\Vert.\Vert$ denotes the distance…

Number Theory · Mathematics 2016-05-12 Johannes Schleischitz

Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with…

Number Theory · Mathematics 2022-05-31 Daniel E. Martin

Quantum contextuality is usually revealed by the non-contextual inequality, which can always be associated with an exclusivity graph. The quantum upper bound of the inequality is nothing but the Lov\'asz number of the graph. In this work,…

Quantum Physics · Physics 2016-04-04 Zhen-Peng Xu , Jing-Ling Chen

We resolve the space complexity of single-pass streaming algorithms for approximating the classic set cover problem. For finding an $\alpha$-approximate set cover (for any $\alpha= o(\sqrt{n})$) using a single-pass streaming algorithm, we…

Data Structures and Algorithms · Computer Science 2016-03-21 Sepehr Assadi , Sanjeev Khanna , Yang Li

Sublinear time algorithms for approximating maximum matching size have long been studied. Much of the progress over the last two decades on this problem has been on the algorithmic side. For instance, an algorithm of Behnezhad [FOCS'21]…

Data Structures and Algorithms · Computer Science 2022-11-30 Soheil Behnezhad , Mohammad Roghani , Aviad Rubinstein

The spectral analogue of the Tur\'{a}n type problem for hypergraphs is to determine the maximum spectral radius for the hypergraphs of order $n$ that do not contain a given hypergraph. For the hypergraphs among the set of the connected…

Combinatorics · Mathematics 2023-12-04 Wen-Huan Wang , Lou-Jun Yu

In this paper we construct families of bounded domains $\Omega_\varepsilon$ and solutions $u_\varepsilon$ of \[\begin{cases} -\Delta u_\varepsilon=1&\text{ in }\ \Omega_\varepsilon\\ u_\varepsilon=0&\text{ on }\ \partial\Omega_\varepsilon…

Analysis of PDEs · Mathematics 2021-04-08 Francesca Gladiali , Massimo Grossi

By Northcott's Theorem there are only finitely many algebraic points in affine $n$-space of fixed degree over a given number field and of height at most $X$. For large $X$ the asymptotics of these cardinalities have been investigated by…

Number Theory · Mathematics 2015-08-18 Martin Widmer

We prove that hypersurfaces of $\R^{n+1}$ which are almost extremal for the Reilly inequality on $\lambda_1$ and have $L^p$-bounded mean curvature ($p>n$) are Hausdorff close to a sphere, have almost constant mean curvature and have a…

Differential Geometry · Mathematics 2010-11-29 Erwann Aubry , Jean-Francois Grosjean , Julien Roth

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