Related papers: Lower bounds on the $g$-numbers of spheres without…

For each integer $g\geq 1$ we use variational methods to construct in the unit $3$-ball $B$ a free boundary minimal surface $\Sigma_g$ of symmetry group $\mathbb{D}_{g+1}$. For $g$ large, $\Sigma_g$ has three boundary components and genus…

We construct non-constructible simplicial $d$-spheres with $d+10$ vertices and non-constructible, non-realizable simplicial $d$-balls with $d+9$ vertices for $d\geq 3$.

A finite simple graph G is declared to have positive curvature if every in G embedded wheel graph has five or six vertices. A d-graph is a finite simple graph G for which every unit sphere is a (d-1)-sphere. A d-sphere is a d-graph G for…

Despite a full characterization of the face vectors of simple and simplicial polytopes, the face numbers of general polytopes are poorly understood. Around 1997, B\'ar\'any asked whether for all convex $d$-polytopes $P$ and all $0 \leq k…

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

We give a survey on the recent results and problems on the face enumeration of flag complexes and flag simplicial spheres, with an emphasis on the characterization of face vectors of flag complexes, several lower-bound type of conjectures…

Stanley proved that for any centrally symmetric simplicial $d$-polytope $P$ with $d\geq 3$, $g_2(P) \geq {d \choose 2}-d$. We provide a characterization of centrally symmetric $d$-polytopes with $d\geq 4$ that satisfy this inequality as…

Suppose a group $G$ acts properly on a simplicial complex $\Gamma$. Let $l$ be the number of $G$-invariant vertices and $p_1, p_2, ... p_m$ be the sizes of the $G$-orbits having size greater than 1. Then $\Gamma$ must be a subcomplex of…

Let $\mathsf{r}_k$ be the unique positive root of $x^k - (x+1)^{k-1} = 0$. We prove the best known bounds on the number $n_{g,d}$ of $d$-dimensional generalized numerical semigroups, in particular that \[n_{g,d} > C_d^{g^{(d-1)/d}}…

If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…

We establish a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (abbreviated as a $d$-polytope) with $2d+2$ vertices, extending the previously known case for $k=1$. We identify all…

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$.…

A well known consequence of the Borsuk-Ulam theorem is that if the $d$-dimensional sphere $S^d$ is covered with less than $d+2$ open sets, then there is a set containing a pair of antipodal points. In this paper we provide lower and upper…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

Motivated by problems on apparent horizons in general relativity, we prove the following theorem on minimal surfaces: Let $g$ be a metric on the three-sphere $S^3$ satisfying $Ric(g) \geq 2 g$. If the volume of $(S^3, g)$ is no less than…

We provide a simple characterization of simplicial complexes on few vertices that embed into the $d$-sphere. Namely, a simplicial complex on $d+3$ vertices embeds into the $d$-sphere if and only if its non-faces do not form an intersecting…

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

Let X be an algebraic curve, defined over a perfect field, and G a divisor on X. If X has sufficiently many points, we show how to construct a divisor D on X such that l(2D-G)=0, of essentially any degree such that this is compatible the…

Nevo, Santos, and Wilson constructed $2^{\Omega(N^d)}$ combinatorially distinct simplicial $(2d-1)$-spheres with $N$ vertices. We prove that all spheres produced by one of their methods are shellable. Combining this with prior results of…

A remarkable and important property of face numbers of simplicial polytopes is the generalized lower bound inequality, which says that the $h$-numbers of any simplicial polytope are unimodal. Recently, for balanced simplicial $d$-polytopes,…