English
Related papers

Related papers: A discrete Gauss-Bonnet type theorem

200 papers

Topological invariants such as winding numbers and linking numbers appear as charges of topological solitons in diverse nonlinear physical systems described by a unit vector field defined on two and three dimensional manifolds. While the…

Pattern Formation and Solitons · Physics 2024-01-23 Radha Balakrishnan , Rossen Dandoloff , Avadh Saxena

As a continuation of \cite{NSY:local}, we mainly discuss the global structure of two-dimensional locally compact geodesically complete metric spaces with curvature bounded above. We first obtain the result on the Lipschitz homotopy…

Metric Geometry · Mathematics 2023-09-01 Koichi Nagano , Takashi Shioya , Takao Yamaguchi

Woess \cite{Woess98} introduced a curvature notion on the set of edges of a planar graph, called $\Psi$-curvature in our paper, which is stable under the planar duality. We study geometric and combinatorial properties for the class of…

Combinatorics · Mathematics 2019-09-18 Yohji Akama , Bobo Hua , Yanhui Su , Lili Wang

The Hopf sign conjecture states that a compact Riemannian 2d-manifold M of positive curvature has Euler characteristic X(M)>0 and that in the case of negative curvature X(M) (-1)^d >0. The Hopf product conjecture asks whether a positive…

Differential Geometry · Mathematics 2020-01-07 Oliver Knill

The goal of this work is to generalize the Gauss-Bonnet and Poincar\'{e}-Hopf Theorems to the case of orbifolds with boundary. We present two such generalizations, the first in the spirit of Satake. In this case, the local data (i.e.…

Differential Geometry · Mathematics 2008-06-09 Christopher Seaton

Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…

Combinatorics · Mathematics 2022-07-21 Julien Baste , Dimitrios M. Thilikos

For any graph $G$ of order $n$ with degree sequence $d_{1}\geq\cdots\geq d_{n}$, we define the double Slater number $s\ell_{\times2}(G)$ as the smallest integer $t$ such that $t+d_{1}+\cdots+d_{t-e}\geq2n-p$ in which $e$ and $p$ are the…

Combinatorics · Mathematics 2022-03-29 Babak Samadi , Nasrin Soltankhah , Doost Ali Mojdeh

While Euler characteristic X(G)=sum_x w(x) super counts simplices, Wu characteristics w_k(G) = sum_(x_1,x_2,...,x_k) w(x_1)...w(x_k) super counts simultaneously pairwise interacting k-tuples of simplices in a finite abstract simplicial…

Combinatorics · Mathematics 2018-03-20 Oliver Knill

In this paper we shall study smooth submanifolds immersed in a k-step Carnot group G of homogeneous dimension Q. Among other results, we shall prove an isoperimetric inequality for the case of a $C^2$-smooth compact hypersurface S with - or…

Analysis of PDEs · Mathematics 2009-10-30 F. Montefalcone

In this work we show that Einstein gravity in four dimensions can be consistently obtained from the compactification of a generic higher curvature Lovelock theory in dimension $D=4+p$, being $p\geq1$. The compactification is performed on a…

High Energy Physics - Theory · Physics 2021-08-18 Fabrizio Canfora , Adolfo Cisterna , Sebastian Fuenzalida , Carla Henriquez-Baez , Julio Oliva

Let S be a complete surface of constant curvature K = + 1 or -1, i.e. the sphere S^2 or the Lobachevskij plane L^2, and D a bounded convex subset of S. If S = S^2, assume also diameter (D) < pi/2. It is proved that the length of any…

Classical Analysis and ODEs · Mathematics 2015-03-13 Cristina Giannotti , Andrea Spiro

Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…

Combinatorics · Mathematics 2020-06-09 Suryaprakash Nagoji Rao

We study topological properties of random closed curves on an orientable surface $S$ of negative Euler characteristic. Letting $\gamma_{n}$ denote the conjugacy class of the $n^{th}$ step of a simple random walk on the Cayley graph driven…

Geometric Topology · Mathematics 2022-11-17 Tarik Aougab , Jonah Gaster

We consider surfaces immersed in three-dimensional pseudohermitian manifolds. We define the notion of (p-)mean curvature and of the associated (p-)minimal surfaces, extending some concepts previously given for the (flat) Heisenberg group.…

Differential Geometry · Mathematics 2008-04-16 Jih-Hsin Cheng , Jenn-Fang Hwang , Andrea Malchiodi , Paul Yang

The curvature tensor of a pseudo-Riemannian metric, and its covariant derivatives, satisfy certain identities that hold on any manifold of dimension less or equal than $n$. In this paper, we re-elaborate recent results by…

Differential Geometry · Mathematics 2014-11-11 Alberto Navarro , Jose Navarro

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…

Combinatorics · Mathematics 2025-01-07 Paul C. Kainen

Let $S$ be an orientable surface with negative Euler characteristic. For $k \in \mathbb{N}$, let $\mathcal{C}_{k}(S)$ denote the $\textit{k-curve graph}$, whose vertices are isotopy classes of essential simple closed curves on $S$, and…

Geometric Topology · Mathematics 2015-11-17 Tarik Aougab

We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define $G(p)$ to be a random subgraph of $G$ obtained by retaining each edge of $G$ independently with probability $p \in…

Combinatorics · Mathematics 2025-07-08 Peter Allen , Julia Böttcher , Yoshiharu Kohayakawa , Mihir Neve

Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…

Metric Geometry · Mathematics 2019-06-26 Oleg R. Musin

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all…

Metric Geometry · Mathematics 2008-01-08 Adrian Dumitrescu , Annette Ebbers-Baumann , Ansgar Grüne , Rolf Klein , Günter Rote
‹ Prev 1 3 4 5 6 7 10 Next ›