English
Related papers

Related papers: Isometric embedding with nonnegative Gauss curvatu…

200 papers

We study relations between geometric embeddings of graphs and the spectrum of associated matrices, focusing on outerplanar embeddings of graphs. For a simple connected graph $G=(V,E)$, we define a "good" $G$-matrix as a $V\times V$ matrix…

Combinatorics · Mathematics 2021-02-17 László Lovász , Alexander Schrijver

An isoradial graph is a planar graph in which each face is inscribable into a circle of common radius. We study the 2-dimensional perfect matchings on a bipartite isoradial graph, obtained from the union of an isoradial graph and its…

Probability · Mathematics 2020-05-12 Zhongyang Li

We prove the existence of $C^{1,1}$ isometric immersions of several classes of metrics on surfaces $(\mathcal{M},g)$ into the three-dimensional Euclidean space $\mathbb{R}^3$, where the metrics $g$ have strictly negative curvature. These…

Analysis of PDEs · Mathematics 2020-03-13 Siran Li

Let $G$ be a plane bipartite graph and $\mathcal{M}(G)$ be the set of all perfect matchings of $G$. The resonance graph $R(G)$ is a graph whose vertex set is $\mathcal{M}(G)$, and two perfect matchings are adjacent in $R(G)$ if their…

Combinatorics · Mathematics 2024-10-11 Zhongyuan Che

Using a method introduced by R. Bamler to study the behavior of scalar curvature under continuous deformations of Riemannian metrics, we prove that if a sequence of smooth Riemannian metrics gi on a fixed compact manifold M has isotropic…

Differential Geometry · Mathematics 2018-01-26 Thomas Richard

A graph G is intrinsically S^1-linked if for every embedding of the vertices of G into S^1, vertices that form the endpoints of two disjoint edges in G form a non-split link in the embedding. We show that a graph is intrinsically S^1-linked…

Geometric Topology · Mathematics 2007-07-25 Chris Cicotta , Joel Foisy , Tom Reilly , Sara Revzi , Ben Wang , Alice Wilson

In this article, given two finite simplicial graphs $\Gamma_1$ and $\Gamma_2$, we state and prove a complete description of the possible morphisms $C(\Gamma_1) \to C(\Gamma_2)$ between the right-angled Coxeter groups $C(\Gamma_1)$ and…

Group Theory · Mathematics 2019-10-25 Anthony Genevois

Let $I(G)$ be the edge ideal of a bicyclic graph. In this paper, we characterize the Castelnuovo-Mumford regularity of $I(G)$ in terms of the induced matching number of $G$. For the base case of this family of graphs, i.e. dumbbell graph,…

Commutative Algebra · Mathematics 2018-10-18 Yairon Cid-Ruiz , Sepehr Jafari , Navid Nemati , Beatrice Picone

We show that a nontrivial graph isomorphism problem of two undirected graphs, and more generally, the permutation similarity of two given $n\times n$ matrices, is equivalent to equalities of volumes of the induced three convex bounded…

Computational Complexity · Computer Science 2009-11-10 Shmuel Friedland

In this note, we construct new solutions to the heterotic $\mathrm{G}_2$-system with non-abelian gauge group, both compact and non-compact, on certain $2$-step nilmanifolds and $3$-Sasakian manifolds. Our approach is based on an ansatz that…

Differential Geometry · Mathematics 2026-05-08 Viviana del Barco , Udhav Fowdar , Andrés J. Moreno

We construct isometric and conformally isometric embeddings of some gravitational instantons in $\mathbb{R}^8$ and $\mathbb{R}^7$. In particular we show that the embedding class of the Einstein--Maxwell instanton due to Burns is equal to…

High Energy Physics - Theory · Physics 2023-01-09 Maciej Dunajski , Paul Tod

It is well known in Riemannian geometry that the metric components have the best regularity in harmonic coordinates. These can be used to characterize the most regular element in the isometry class of a rough Riemannian metric. In this…

Differential Geometry · Mathematics 2025-11-04 Rodrigo Avalos , Albachiara Cogo , Andoni Royo Abrego

The isometric immersion of two-dimensional Riemannian manifolds or surfaces in the three-dimensional Euclidean space is a fundamental problem in differential geometry. When the Gauss curvature is negative, the isometric immersion problem is…

Differential Geometry · Mathematics 2016-06-27 Wentao Cao , Feimin Huang , Dehua Wang

The isometric immersion of two-dimensional Riemannian manifold with negative Gauss curvature into the three-dimensional Euclidean space is considered through the Gauss-Codazzi equations for the first and second fundamental forms. The large…

Analysis of PDEs · Mathematics 2015-12-22 Wentao Cao , Feimin Huang , Dehua Wang

If a class of finitely generated groups Curly(G) is closed under isometric amalgamations along free subgroups, then every G in Curly(G) can be quasi-isometrically embedded in a group Hat(G) in Curly(G) that has no proper subgroups of finite…

Group Theory · Mathematics 2007-05-23 Martin R. Bridson

Let $D=(G,\mathcal{O},w)$ be a weighted oriented graph whose edge ideal is $I(D)$. In this paper, we characterize the unmixed property of $I(D)$ for each one of the following cases: $G$ is an $SCQ$ graph; $G$ is a chordal graph; $G$ is a…

Combinatorics · Mathematics 2021-10-12 Lourdes Cruz , Yuriko Pitones , Enrique Reyes

We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with $k$-dilation. Suppose $U$ is an open set in $\mathbb{R}^n$ diffeomorphic to a Euclidean $n$-ball. We show that in…

Differential Geometry · Mathematics 2022-12-29 Elia Portnoy

Let $\Pi$ be a polar space of type $\textsf{D}_{n}$. Denote by ${\mathcal G}_{\delta}(\Pi)$, $\delta\in \{+,-\}$ the associated half-spin Grassmannians and write $\Gamma_{\delta}(\Pi)$ for the corresponding half-spin Grassmann graphs. In…

Combinatorics · Mathematics 2014-01-14 Mark Pankov

We show that any isometric immersion of a flat plane domain into $\mathbb R^3$ is developable provided it enjoys the little H\"older regulairty $c^{1,2/3}$. In particular, isometric immersions of local $C^{1,\alpha}$ regularity with $\alpha…

Analysis of PDEs · Mathematics 2024-04-05 Camillo De Lellis , Mohammad Reza Pakzad

We show that if $G$ is a simple triangle-free graph with $n\geq 3$ vertices, without a perfect matching, and having a minimum degree at least $\frac{n-1}{2}$, then $G$ is isomorphic either to $C_5$ or to $K_{\frac{n-1}{2},\frac{n+1}{2}}$.

Discrete Mathematics · Computer Science 2015-03-17 Vahan V. Mkrtchyan , Petros A. Petrosyan