English
Related papers

Related papers: Stars of Empty Simplices

200 papers

Given a set $P$ of $n$ points in the plane, in general position, denote by $N_\Delta(P)$ the number of empty triangles with vertices in $P$. In this paper we investigate by how much $N_\Delta(P)$ changes if a point $x$ is removed from $P$.…

Discrete Mathematics · Computer Science 2024-02-13 Bhaswar B. Bhattacharya , Sandip Das , Sk Samim Islam , Saumya Sen

In this paper, we study dot-product sets and $k$-simplices in vector spaces over finite rings. We show that if $E$ is sufficiently large then the dot-product set of $E$ covers the whole ring. In higher dimensional cases, if $E$ is…

Combinatorics · Mathematics 2020-08-12 Nguyen Van The , Le Anh Vinh

We study the cohomology groups $H^1(X,\Theta_X(-mK_X))$, for $m\geq1$, where $X$ is a smooth minimal complex surface of general type, $\Theta_X$ its holomorphic tangent bundle, and $K_X$ its canonical divisor. One of the main results is a…

Algebraic Geometry · Mathematics 2011-11-23 Daniel Naie , Igor Reider

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

Logic · Mathematics 2021-10-14 Denis R. Hirschfeldt , Asher M. Kach , Antonio Montalbán

We study the extremal function $S^k_d(n)$, defined as the maximum number of regular $(k-1)$-simplices spanned by $n$ points in $\mathbb{R}^d$. For any fixed $d\geq2k\geq6$, we determine the asymptotic behavior of $S^k_d(n)$ up to a…

Combinatorics · Mathematics 2025-07-29 Felix Christian Clemen , Adrian Dumitrescu , Dingyuan Liu

An n-dimensional simplex \Delta in \R^n is called empty lattice simplex if \Delta \cap\Z^n is exactly the set of vertices of \Delta . A theorem of G. K. White shows that if n=3 then any empty lattice simplex \Delta \subset\R^3 is isomorphic…

Combinatorics · Mathematics 2010-04-21 Victor Batyrev , Johannes Hofscheier

In this paper we improve the upper bound of the number $N_{K, n}(X)$ of degree $n$ extensions of a number field $K$ with absolute discriminant bounded by $X$. This is achieved by giving a short $\mathcal{O}_K$-basis of an order of an…

Number Theory · Mathematics 2021-06-04 Jungin Lee

Resolvent degree is an invariant measuring the complexity of algebraic and geometric phenomena, including the complexity of finite groups. To date, the resolvent degree of a finite simple group $G$ has only been investigated when $G$ is a…

Algebraic Geometry · Mathematics 2024-02-29 Claudio Gómez-Gonzáles , Alexander J. Sutherland , Jesse Wolfson

A Dirichlet $k$-partition of a domain $U \subseteq \mathbb{R}^d$ is a collection of $k$ pairwise disjoint open subsets such that the sum of their first Laplace-Dirichlet eigenvalues is minimal. A discrete version of Dirichlet partitions has…

Statistics Theory · Mathematics 2017-08-21 Braxton Osting , Todd Harry Reeb

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong

We determine, up to a multiplicative constant, the optimal number of random edges that need to be added to a $k$-graph $H$ with minimum vertex degree $\Omega(n^{k-1})$ to ensure an $F$-factor with high probability, for any $F$ that belongs…

Combinatorics · Mathematics 2021-03-24 Yulin Chang , Jie Han , Yoshiharu Kohayakawa , Patrick Morris , Guilherme Oliveira Mota

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Combinatorics · Mathematics 2015-12-14 Eran Nevo , Guillermo Pineda-Villavicencio , David R. Wood

We study the real rank of points with respect to a real variety $X$. This is a generalization of various tensor ranks, where $X$ is in a specific family of real varieties like Veronese or Segre varieties. The maximal real rank can be…

Algebraic Geometry · Mathematics 2015-11-24 Grigoriy Blekherman , Rainer Sinn

We prove that for any fixed $k$, the probability that a random vertex of a random increasing plane tree is of rank $k$, that is, the probability that a random vertex is at distance $k$ from the leaves, converges to a constant $c_k$ as the…

Combinatorics · Mathematics 2022-08-09 Miklós Bóna , Boris Pittel

Consider a random simplex $[X_1,\ldots,X_n]$ defined as the convex hull of independent identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^{n-1}$ with the following beta density: $$ f_{n-1,\beta} (x) \propto…

Probability · Mathematics 2020-07-14 Zakhar Kabluchko

The \emph{regular independence number}, introduced by Albertson and Boutin in 1990, is the maximum cardinality of an independent set of $G$ in which all vertices have equal degree in $G$. Recently, Caro, Hansberg and Pepper introduced the…

Combinatorics · Mathematics 2015-09-01 Zhiwei Guo , Haixing Zhao , Hongjian Lai , Yaping Mao

The k-core of a graph is its maximal subgraph with minimum degree at least k. In this paper, we address robustness questions about k-cores. Given a k-core, remove one edge uniformly at random and find its new k-core. We are interested in…

Combinatorics · Mathematics 2012-09-12 Cristiane M. Sato

Given a perfect field $k$ with algebraic closure $\overline{k}$ and a variety $X$ over $\overline{k}$, the field of moduli of $X$ is the subfield of $\overline{k}$ of elements fixed by field automorphisms…

Algebraic Geometry · Mathematics 2022-12-07 Giulio Bresciani , Angelo Vistoli

Let $\Delta$ denote a non-degenerate $k$-simplex in $\mathbb{R}^k$. The set $\text{Sim}(\Delta)$ of simplices in $\mathbb{R}^k$ similar to $\Delta$ is diffeomorphic to $O(k)\times [0,\infty)\times \mathbb{R}^k$, where the factor in $O(k)$…

Geometric Topology · Mathematics 2022-06-08 Jason Cantarella , Elizabeth Denne , John McCleary

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

Algebraic Geometry · Mathematics 2011-11-10 J. Maurice Rojas