Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2106.13586

Homotopic Nerve Complexes with Free Group Presentations

J. F. Peters
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces homotopic nerve complexes in a planar Whitehead CW space and their Rotman free group presentations. Nerve complexes were introduced by P.S. Alexandrov during the 1930s and recently given a formal structure from a computational topology perspective by H. Edelsbrunner and J.L. Harer in 2010. A homotopic nerve results from the nonvoid intersection of a collection of homotopic 1-cycles. Briefly, a 1-cycle is a finite sequence of path-connected vertexes with no end vertex and with a nonvoid interior. A homotopic 1-cycle has the structure of a 1-cycle in a CW space in which cycle edges are replaced by homotopic maps. A group $G(V,+)$ containing a basis $\mathcal{B}$ is {\em free}, provided every member of $V$ can be written as a linear combination of elements (generators) of the basis $\mathcal{B}\subset V$. Let $\bigtriangleup$ be the members $v$ of $V$, each written as a linear combination of the basis elements of $\mathcal{B}$. A presentation of $G(V,+)$ is a mapping $\mathcal{B}\times \bigtriangleup\to G(\left\{v\in V:=sum_{k\in \mathbb{Z}\atop g\in \mathcal{B}}{kg}\right\},+)$. The main results in this paper are (1) Every homotopic vortex nerve has a free group presentation and (2) For a vortex nerve that consists of a finite collection of closed, convex sets in Euclidean space, the nerve and union of sets in the nerve have the same homotopy type.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

J. F. Peters. 2021-06-23. Homotopic Nerve Complexes with Free Group Presentations. https://arxiv.org/abs/2106.13586

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗