English
Related papers

Related papers: Fixing a hole

200 papers

Let $\Delta=\Delta_1\times\ldots\times \Delta_d\subseteq\mathbb{R}^n$, where $\mathbb{R}^n=\mathbb{R}^{n_1}\times\cdots\times\mathbb{R}^{n_d}$ with each $\Delta_i\subseteq\mathbb{R}^{n_i}$ a non-degenerate simplex of $n_i$ points. We prove…

Combinatorics · Mathematics 2023-01-27 Neil Lyall , Akos Magyar

We consider static black holes, which are bosonic solutions of supersymmetric theories. We will show that supersymmetry provides a natural framework for a discussion of various properties of such static black holes. The most fundamental…

High Energy Physics - Theory · Physics 2008-02-03 Renata Kallosh

A domain $S\subset{\mathbb{R}}^d$ is said to fulfill the Poincar\'{e} cone property if any point in the boundary of $S$ is the vertex of a (finite) cone which does not otherwise intersects the closure $\bar{S}$. For more than a century,…

Statistics Theory · Mathematics 2014-03-24 Alejandro Cholaquidis , Antonio Cuevas , Ricardo Fraiman

Let $G/\Gamma$ be the quotient of a semisimple Lie group by an arithmetic lattice. We show that for reductive subgroups $H$ of $G$ that is large enough, the orbits of $H$ on $G/\Gamma$ intersect nontrivially with a fixed compact set. As a…

Dynamical Systems · Mathematics 2021-11-04 Han Zhang , Runlin Zhang

Let $\mathcal{C}$ be a small, connected category with finite hom-sets. We show that if the embedding of a connected subcategory $\mathcal{J}$ is both initial and final, then the restriction of any $\mathcal{C}$-module along $\mathcal{J}$…

Representation Theory · Mathematics 2026-04-14 Thomas Brüstle , Justin Desrochers , Samuel Leblanc

Every homomorphism from finite index subgroups of a universal lattices to mapping class groups of orientable surfaces (possibly with punctures), or to outer automorphism groups of finitely generated nonabelian free groups must have finite…

Group Theory · Mathematics 2011-06-21 Masato Mimura

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

Combinatorics · Mathematics 2024-10-23 Martin Bohnert , Justus Springer

We prove that the number of "hole elements" $H(K)$ in the infrastructure of a hyperelliptic function field $K$ of genus $g$ with finite constant field $\F_q$ with $n + 1$ places at infinity, of whom $n' + 1$ are of degree one, satisfies…

Number Theory · Mathematics 2009-11-25 Felix Fontein

A Kakeya set $S \subset (\mathbb{Z}/N\mathbb{Z})^n$ is a set containing a line in each direction. We show that, when $N$ is any square-free integer, the size of the smallest Kakeya set in $(\mathbb{Z}/N\mathbb{Z})^n$ is at least…

Combinatorics · Mathematics 2021-12-28 Manik Dhar , Zeev Dvir

Given any polytope $P$ and any generic linear functional ${\bf c} $, one obtains a directed graph $G(P,{\bf c})$ from the 1-skeleton of $P$ by orienting each edge $e(u,v)$ from $u$ to $v$ for ${\bf c} (u) < {\bf c} ( v)$. For $P$ a simple…

Combinatorics · Mathematics 2023-08-10 Patricia Hersh

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

Symbolic Computation · Computer Science 2018-06-22 Cordian Riener , Mohab Safey El Din

It is elementary and well-known that if an element x of a bounded modular lattice L has a complement in L then x has a relative complement in every interval [a,b] containing x. We show that the relatively strong assumption of modularity of…

Combinatorics · Mathematics 2021-07-13 Ivan Chajda , Helmut Länger

We prove that (1) for any complete lattice $L$, the set $\mathcal{D}(L)$ of all nonempty saturated compact subsets of the Scott space of $L$ is a complete Heyting algebra (with the reverse inclusion order); and (2) if the Scott space of a…

General Topology · Mathematics 2019-03-05 Xiaoquan Xu , Xiaoyong Xi , Dongsheng Zhao

In this work, using a new geometrical approach we study to the existence of the fixed-point of mappings that independence of the smoothness, and also of their single-values or multi-values. This work proved the theorems that generalize in…

Analysis of PDEs · Mathematics 2022-03-22 Kamal N. Soltanov

Let $K, L$ be convex sets in the plane. For normalization purposes, suppose that the area of $K$ is $1$. Suppose that a set $K_n$ of $n$ points are chosen independently and uniformly over $K$, and call a subset of $K$ a {\em hole} if it…

Metric Geometry · Mathematics 2015-06-16 Octavio Arizmendi , Gelasio Salazar

This note proves that only a linear number of holes in a \v{C}ech complex of $n$ points in $\mathbb{R}^d$ can persist over an interval of constant length. Specifically, for any fixed dimension $p < d$ and fixed $\varepsilon > 0$, the number…

Combinatorics · Mathematics 2026-02-24 Herbert Edelsbrunner , Matthew Kahle , Shu Kanazawa

Let $\mathcal{W}^{n}$ be the class of $C^{\infty }$ complete simply connected $n-$dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let $% W\in…

Differential Geometry · Mathematics 2019-12-05 Sameh Shenawy

Let $P_1, P_2,\ldots, P_{d+1}$ be pairwise disjoint $n$-element point sets in general position in $d$-space. It is shown that there exist a point $O$ and suitable subsets $Q_i\subseteq P_i \; (i=1, 2, \ldots, d+1)$ such that $|Q_i|\geq…

Combinatorics · Mathematics 2016-09-06 János Pach

The cycle space of a graph $G$, denoted $C(G)$, is a vector space over ${\mathbb F}_2$, spanned by all incidence vectors of edge-sets of cycles of $G$. If $G$ has $n$ vertices, then $C_n(G)$ is the subspace of $C(G)$, spanned by the…

Combinatorics · Mathematics 2025-07-08 Dan Hefetz , Michael Krivelevich

Erd\H{o}s and Hajnal conjectured that, for every graph $H$, there exists a constant $c_H$ such that every graph $G$ on $n$ vertices which does not contain any induced copy of $H$ has a clique or a stable set of size $n^{c_H}$. We prove that…

Discrete Mathematics · Computer Science 2014-08-12 Marthe Bonamy , Nicolas Bousquet , Stéphan Thomassé