English
Related papers

Related papers: Regular Polygon Surfaces

200 papers

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

Commutative Algebra · Mathematics 2021-08-20 Arvind Kumar

Rigidity is the property of a structure that does not flex. It is well studied in discrete geometry and mechanics, and has applications in material science, engineering and biological sciences. A bar-and-joint framework is a pair $(G,p)$ of…

Combinatorics · Mathematics 2021-03-02 Sebastian M. Cioabă , Sean Dewar , Xiaofeng Gu

The logarithmic Riemann surface Sigma_{log} is a classical holomorphic 1-manifold. It lives into R^4 and induces a covering space of C - 0 defined by exp. This paper suggests a geometric construction of it, derived as the limit of a…

Differential Geometry · Mathematics 2007-05-23 Nikolaos I. Katzourakis

In this paper, we prove a general halfspace theorem for constant mean curvature surfaces. Under certain hypotheses, we prove that, in an ambient space M^3, any constant mean curvature H_0 surface on one side of a constant mean curvature H_0…

Differential Geometry · Mathematics 2011-02-21 Laurent Mazet

Let $M$ be a closed oriented Riemannian manifold of dimension $2 \leq d \leq 7$, and let $\rho \in H^{d - 1}(M, \mathbb R)$ have unit norm. We construct a lamination $\lambda_\rho$ whose leaves are exactly the minimal hypersurfaces which…

Differential Geometry · Mathematics 2026-01-19 Aidan Backus

In this paper we give several criteria for the edge polytope of a fundamental FHM-graph to possess a regular unimodular triangulation in terms of some simple data of the the graph. We further apply our criteria to several examples of graphs…

Combinatorics · Mathematics 2016-12-02 Ginji Hamano

A realization of a graph $G=(V,E)$ is a map $v\colon V\to\Bbb R^d$ that assigns to each vertex a point in $d$-dimensional Euclidean space. We study graph realizations from the perspective of representation theory (expressing certain…

Combinatorics · Mathematics 2020-09-04 Martin Winter

Given a convex n-gon P in the Euclidean plane, it is well known that the simplicial complex \theta(P) with vertex set given by diagonals in P and facets given by triangulations of P is the boundary complex of a polytope of dimension n-3. We…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun , Richard Ehrenborg

A regular contact manifold is a manifold $M$ equipped with a globally defined contact form $\eta$ such that the topological space $M/\mathcal{R}$ of orbits (trajectories) of the Reeb vector field $\mathcal{R}$ of $\eta$ carries a smooth…

Symplectic Geometry · Mathematics 2023-07-27 Katarzyna Grabowska , Janusz Grabowski

For the given regular plane polygon and an arbitrary point in the plane of the polygon, the distances from the point to the vertices of the polygon are defined. We proved that there is one more non-congruent regular polygon having the…

General Mathematics · Mathematics 2022-02-01 Mamuka Meskhishvili

The line graph $\Gamma$ of a multi-graph $\Delta$ is the graph whose vertices are the edges of $\Delta$, where two such edges are adjacent if and only if they meet in a single vertex of $\Delta$. We provide several characterizations of such…

Combinatorics · Mathematics 2021-05-19 Hans Cuypers

In this paper we consider a set $E\subset\Omega$ with prescribed mean curvature $f\in C(\Omega)$ and Euclidean Lipschitz boundary $\partial E=\Sigma$ inside a three-dimensional contact sub-Riemannian manifold $M$. We prove that if $\Sigma$…

Differential Geometry · Mathematics 2016-02-10 Matteo Galli

We study a fundamental question from graph drawing: given a pair $(G,C)$ of a graph $G$ and a cycle $C$ in $G$ together with a simple polygon $P$, is there a straight-line drawing of $G$ inside $P$ which maps $C$ to $P$? We say that such a…

Computational Geometry · Computer Science 2021-03-15 Tim Ophelders , Ignaz Rutter , Bettina Speckmann , Kevin Verbeek

Let $\Gamma$ be a triangulation of a connected closed $2$-dimensional (not necessarily orientable) surface. Using zigzags (closed left-right paths), for every face of $\Gamma$ we define the $z$-monodromy which acts on the oriented edges of…

Combinatorics · Mathematics 2018-11-06 Mark Pankov , Adam Tyc

We classify topological $4$-manifolds with boundary and fundamental group $\mathbb{Z}$, under some assumptions on the boundary. We apply this to classify surfaces in simply-connected $4$-manifolds with $S^3$ boundary, where the fundamental…

Geometric Topology · Mathematics 2024-08-21 Anthony Conway , Lisa Piccirillo , Mark Powell

In 1966, P. Guenther proved the following result: Given a continuous function f on a compact surface M of constant curvature -1 and its periodic lift g to the universal covering, the hyperbolic plane, then the averages of the lift g over…

Combinatorics · Mathematics 2008-07-15 Femke Douma

In this paper we consider an inverse problem of determining a minimal surface embedded in a Riemannian manifold. We show under a topological condition that if $\Sigma$ is a $2$-dimensional embedded minimal surface, then the knowledge of the…

Analysis of PDEs · Mathematics 2023-10-24 Cătălin I. Cârstea , Matti Lassas , Tony Liimatainen , Leo Tzou

An ideal triangulation of a singular flat surface is a geodesic triangulation such that its vertex set is equal to the set of singular points of the surface. Using the fact that each pair of points in a surface has a finite number of…

Metric Geometry · Mathematics 2020-12-01 İsmail Sağlam

Let $M$ be a convex body and let $K$ be a closed convex surface $K$ both contained in the Euclidean space $\mathbb{E}^3$. What can we say about $M$ if $K$ encloses $M$ and if from all the points in $K$ the body $M$ looks the same? In this…

Metric Geometry · Mathematics 2026-02-03 Efren Morales Amaya

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Combinatorics · Mathematics 2023-07-07 Benjamin Braun , Kaitlin Bruegge