English
Related papers

Related papers: Simplicial-like Identities for The Paths and The R…

200 papers

This paper proves that the homotopy type of a pointed, simply-connected, 2-reduced simplicial set is determined by the chain-complex augmented by functorial diagonal and higher diagonal maps (a simple generalization of the ones used to…

Algebraic Topology · Mathematics 2007-05-23 Justin R. Smith

In this paper, we study some relationships existing between some particular mathematical structures: discrete surfaces coming from discrete topology and mathematical morphology, poset-based connected manifolds coming from discrete topology,…

Algebraic Topology · Mathematics 2025-08-05 Nicolas Boutry

We consider the problem of classifying trajectories on a discrete or discretised 2-dimensional manifold modelled by a simplicial complex. Previous works have proposed to project the trajectories into the harmonic eigenspace of the Hodge…

Social and Information Networks · Computer Science 2025-05-22 Vincent P. Grande , Josef Hoppe , Florian Frantzen , Michael T. Schaub

In this paper, we construct and study derived character maps of finite-dimensional representations of $\infty$-groups. As models for $\infty$-groups we take homotopy simplicial groups, i.e. homotopy simplicial algebras over the algebraic…

Algebraic Topology · Mathematics 2025-01-01 Yuri Berest , Ajay C. Ramadoss

Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…

Combinatorics · Mathematics 2024-02-14 Benjamin Braun , Kaitlin Bruegge , Matthew Kahle

It is increasingly common for data to possess intricate structure, necessitating new models and analytical tools. Graphs, a prominent type of structure, can encode the relationships between any two entities (nodes). However, graphs neither…

Signal Processing · Electrical Eng. & Systems 2026-02-04 Madeline Navarro , Andrei Buciulea , Santiago Segarra , Antonio Marques

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

Logic in Computer Science · Computer Science 2021-12-20 Jonathan Prieto-Cubides

In this study, the soft usual topology compatible with the usual topology of $\mathbb{R}$ is defined, and using its subspace topology on the interval $[0,1]$, the concept of a soft path is introduced. Within this context, the notions of…

Category Theory · Mathematics 2025-11-18 Nazmiye Alemdar , Hürmet Fulya Akız , Halim Ayaz

Let $D$ be a large category which is cocomplete. We construct a model structure (in the sense of Quillen) on the category of small functors from $D$ to simplicial sets. As an application we construct homotopy localization functors on the…

Algebraic Topology · Mathematics 2007-05-23 Boris Chorny , William G. Dwyer

We give an alternative argument for the classification of real bundle pairs over smooth symmetric surfaces and extend this classification to nodal symmetric surfaces. We also classify the homotopy classes of automorphisms of real bundle…

Algebraic Geometry · Mathematics 2015-12-23 Penka Georgieva , Aleksey Zinger

We introduce a method to reduce the study of the topology of a simplicial complex to that of a simpler one. We give some applications of this method to complexes arising from graphs. As a consequence, we answer some questions raised in…

Combinatorics · Mathematics 2007-05-23 Mario Marietti , Damiano Testa

Local properties of the fundamental group of a path-connected topological space can pose obstructions to the applicability of covering space theory. A generalized covering map is a generalization of the classical notion of covering map…

Algebraic Topology · Mathematics 2020-04-14 Jeremy Brazas , Hanspeter Fischer

We prove analogues of classical results for higher homotopy groups and singular homology groups of pseudotopological spaces. Pseudotopological spaces are a generalization of (\v{C}ech) closure spaces which are in turn a generalization of…

Algebraic Topology · Mathematics 2024-09-30 Nikola Milićević , Nicholas A. Scoville

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

Algebraic Topology · Mathematics 2018-01-03 Shiquan Ren , Chengyuan Wu , Stephane Bressan , Jie Wu

There are a large number of theorems detailing the homological properties of the Stanley--Reisner ring of a simplicial complex. Here we attempt to generalize some of these results to the case of a simplicial poset. By investigating the…

Commutative Algebra · Mathematics 2017-10-17 Connor Sawaske

This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…

Algebraic Topology · Mathematics 2011-02-22 Inna Zakharevich

Given two points on a soup can or conical cup with lid, we find and classify all paths of minimal length connecting them. When the number of minimal paths is finite, there are at most four on a can and three on a cup. At worst, minimal…

Differential Geometry · Mathematics 2007-12-11 Joel B. Mohler , Ron Umble

The fine curve complex of a surface is a simplicial complex whose vertices are essential simple closed curves and whose $k$-simplices are collections of $k+1$ disjoint curves. We prove that the fine curve complex is homotopy equivalent to…

Geometric Topology · Mathematics 2026-02-11 Ryan Dickmann , Zachary Himes , Alexander Nolte , Roberta Shapiro

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences of rewrites', computational paths can be seen as the grounds on which the…

Logic in Computer Science · Computer Science 2015-09-23 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina de Oliveira

Given the set of paths through a digraph, the result of uniformly deleting some vertices and identifying others along each path is coherent in such a way as to yield the set of paths through another digraph, called a \emph{path abstraction}…

Combinatorics · Mathematics 2017-01-27 Steve Huntsman