Related papers: Stars of Empty Simplices

For a finite set $X$ of $n$ points from $\mathbb{R}^M$, the degree of an $M$-element subset $\{x_1,\dots,x_M\}$ of $X$ is defined as the number of $M$-simplices that can be constructed from this $M$-element subset using an additional point…

Given a finite point set $X$ in the plane, the degree of a pair $\{x,y\} \subset X$ is the number of empty triangles $t=conv\{x,y,z\}$, where empty means $t\cap X=\{x,y,z\}$. Define $deg X$ as the maximal degree of a pair in $X$. Our main…

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

Let $k$ be any field. Let $X \subset \mathbb{P}_k^N$ be a degree $d \geq 2$ hypersurface. Under some conditions, we prove that if $X(K) \neq \emptyset$ for some extension $K/k$ with $n:=[K:k] \geq 2$ and $\gcd(n,d)=1$, then $X(L) \neq…

Let $X$ be a simplicial complex with $n$ vertices. A missing face of $X$ is a simplex $\sigma\notin X$ such that $\tau\in X$ for any $\tau\subsetneq \sigma$. For a $k$-dimensional simplex $\sigma$ in $X$, its degree in $X$ is the number of…

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. A subset $I$ of $V(G)$ is an independent vertex subset if no two vertices in $I$ are adjacent in $G$. We study the number, $\sigma_1(G)$, of all subsets of $v(G)$ that contain…

For a fixed positive integer $k$, a set $S$ of vertices of a graph or multigraph is called a $k$-independent set if the subgraph induced by $S$ has maximum degree less than $k$. The well-known algorithm MAX finds a maximal $k$-independent…

Let $\Delta$ be an $n$-dimensional lattice polytope. The smallest non-negative integer $i$ such that $k \Delta$ contains no interior lattice points for $1 \leq k \leq n - i$ we call the degree of $\Delta$. We consider lattice polytopes of…

An important theorem by Timofte states that nonnegativity of real $n$-variate symmetric polynomials of degree $d$ can be decided at test sets given by all points with at most $\lfloor\frac{d}{2}\rfloor$ distinct components. However, if the…

Let $k$ be an infinite field of characteristic 0, and $X$ a del Pezzo surface of degree $d$ with at least one $k$-rational point. Various methods from algebraic geometry and arithmetic statistics have shown the Zariski density of the set…

Let $G$ be a finite abelian group of order $n$ and let $\Delta_{n-1}$ denote the $(n-1)$-simplex on the vertex set $G$. The sum complex $X_{A,k}$ associated to a subset $A \subset G$ and $k < n$, is the $k$-dimensional simplicial complex…

For $n\ge 1$, let $T_n$ be a random recursive tree on the vertex set $[n]=\{1,\ldots,n\}$. Let $\mathrm{deg}_{T_n}(v)$ be the degree of vertex $v$ in $T_n$, that is, the number of children of $v$ in $T_n$. Devroye and Lu showed that the…

Let $d,n\in \mathbb{N}$ be such that $d=\omega(1)$, and $d\le n^{1-a}$ for some constant $a>0$. Consider a $d$-regular graph $G=(V, E)$ and the random graph process that starts with the empty graph $G(0)$ and at each step $G(i)$ is obtained…

We strengthen, in various directions, the theorem of Garnett that every $\sigma$-compact, completely regular space $X$ occurs as a Gleason part for some uniform algebra. In particular, we show that the uniform algebra can always be chosen…

Let X be a projective hypersurface in P_k^n of degree d <= n. In this paper we study the relation between the class [X] in K_0(Var_k) and the existence of k-rational points. Using elementary geometric methods we show, for some particular X,…

A set of vertices is $k$-sparse if it induces a graph with a maximum degree of at most $k$. In this missive, we consider the order of the largest $k$-sparse set in a triangle-free graph of fixed order. We show, for example, that every…

We study $k$-star decompositions, that is, partitions of the edge set into disjoint stars with $k$ edges, in the uniformly random $d$-regular graph model $\mathcal{G}_{n,d}$. Using the small subgraph conditioning method, we prove an…

For a finite point set in $\mathbb{R}^d$, we consider a peeling process where the vertices of the convex hull are removed at each step. The layer number $L(X)$ of a given point set $X$ is defined as the number of steps of the peeling…

We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by $n$ points in 3-space, and in general in $d$ dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by $n$…