English
Related papers

Related papers: Minimal simplicial spherical mappings with a given…

200 papers

We introduce and investigate numerically a minimal class of dynamical triangulations of two-dimensional gravity on the sphere in which only vertices of order five, six or seven are permitted. We show firstly that this restriction of the…

High Energy Physics - Theory · Physics 2009-10-30 M. J. Bowick , S. M. Catterall , G. Thorleifsson

We introduce a class of minimal submanfolds $M^n$, $n\geq 3$, in spheres $\mathbb{S}^{n+2}$ that are ruled by totally geodesic spheres of dimension $n-2$. If simply-connected, such a submanifold admits a one-parameter associated family of…

Differential Geometry · Mathematics 2016-03-10 Marcos Dajczer , Theodoros Vlachos

Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log…

Distributed, Parallel, and Cluster Computing · Computer Science 2012-11-06 Danny Dolev , Christoph Lenzen , Shir Peled

In this article, we study the necessary and sufficient conditions for the existence of solutions in $W_0^{1,\infty}(\Omega;\mathbb R^n)$ in the minimal dimension of $\textrm{span }E$ for the following problem: \begin{equation*} P(D)u\in E…

Analysis of PDEs · Mathematics 2025-12-10 Nurun Nesha

In this article we study the following question: What can be the measure of the minimal solid angle of a simplex in $\mathbb{R}^d$? We show that in dimensions three it is not greater than the solid angle of the regular simplex. And in…

Metric Geometry · Mathematics 2016-04-07 Arseniy Akopyan , Roman Karasev

For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…

Algebraic Geometry · Mathematics 2016-03-18 Claus Scheiderer

Let $M$ be any compact four-dimensional PL-manifold with or without boundary (e.g. the four-dimensional sphere or ball). Consider the space $T(M)$ of all simplicial isomorphism classes of triangulations of $M$ endowed with the metric…

Geometric Topology · Mathematics 2017-06-23 Boris Lishak , Alexander Nabutovsky

Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperbolic surface of genus $g$ has a simplicial Delaunay…

Computational Geometry · Computer Science 2020-11-20 Matthijs Ebbens , Hugo Parlier , Gert Vegter

The intersection matrix of a simplicial complex has entries equal to the rank of the intersection of its facets. In [1] the authors prove the intersection matrix is enough to determine a triangulation of a surface up to isomorphism. In this…

Geometric Topology · Mathematics 2021-03-01 Jorge L. Arocha , Jorge Fernández-Hidalgo

Given a polytope $\mathcal{P}$ in $\mathbb{R}^d$ and a subset $U$ of its vertices, is there a triangulation of $\mathcal{P}$ using $d$-simplices that all contain $U$? We answer this question by proving an equivalent and easy-to-check…

Metric Geometry · Mathematics 2018-03-09 Michael Kerber , Robert Tichy , Mario Weitzer

Let $N_{g,n}$ be a genus $g$ compact non-orientable surface with $n$ boundaries. We explain about relations on the level $d$ mapping class group $\mathcal{M}_d(N_{g,0})$ of $N_{g,0}$ and the level $d$ principal congruence subgroup…

Geometric Topology · Mathematics 2024-04-17 Ryoma Kobayashi

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.

Combinatorics · Mathematics 2007-07-23 Tamon Stephen , Hugh Thomas

Let $d$ and $k$ be integers with $1 \leq k \leq d-1$. Let $\Lambda$ be a $d$-dimensional lattice and let $K$ be a $d$-dimensional compact convex body symmetric about the origin. We provide estimates for the minimum number of $k$-dimensional…

Combinatorics · Mathematics 2018-01-04 Martin Balko , Josef Cibulka , Pavel Valtr

A $d$-angulation is a planar map with faces of degree $d$. We present for each integer $d\geq 3$ a bijection between the class of $d$-angulations of girth $d$ (i.e., with no cycle of length less than $d$) and a class of decorated plane…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

We extend Smale's singular bridge principle [Ann. of Math. 130 (1989), 603-642] for $n$-dimensional strictly stable minimal cones in $\mathbb{R}^{n+1}$ $(n \geq 7$) to arbitrary codimension and each $n \geq 3$. We then apply the procedure…

Differential Geometry · Mathematics 2025-03-10 Bryan Dimler

For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular…

Geometric Topology · Mathematics 2007-05-23 Sergei Anisov

We study partitions on three dimensional manifolds which minimize the total geodesic perimeter. We propose a relaxed framework based on a $\Gamma$-convergence result and we show some numerical results. We compare our results to those…

Optimization and Control · Mathematics 2016-06-10 Beniamin Bogosel , Edouard Oudet

Let \Delta be a (d-1)-dimensional homology sphere on n vertices with m minimal non-faces. We consider the invariant \alpha := m - (n-d) and prove that for a given value of \alpha, there are only finitely many homology spheres that cannot be…

Combinatorics · Mathematics 2012-08-07 Lukas Katthän

We prove a minimum degree version of the Kruskal--Katona theorem: given $d\ge 1/4$ and a triple system $F$ on $n$ vertices with minimum degree at least $d\binom n2$, we obtain asymptotically tight lower bounds for the size of its shadow.…

Combinatorics · Mathematics 2022-07-19 Zoltán Füredi , Yi Zhao

An n-simplex is said to be n-well-centered if its circumcenter lies in its interior. We introduce several other geometric conditions and an algebraic condition that can be used to determine whether a simplex is n-well-centered. These…

Computational Geometry · Computer Science 2009-12-17 Evan VanderZee , Anil N. Hirani , Damrong Guoy , Vadim Zharnitsky , Edgar Ramos