Related papers: Fundamental Groups of Simplicial Complexes

We construct a map from fundamental groups of complements to some plane configurations to the groups $G_{n}^{k}$ for large $k$. We discuss connection between the groups $G_{n}^{k}$ for different $G_{n}^{k}$ and their geometric realization.

In this paper we introduce a path complex that can be regarded as a generalization of the notion of a simplicial complex. The main motivation for considering path complexes comes from directed graphs(digraphs). We obtain a new notion of the…

Often a localization functor (in the category of groups) sends a finite simple group to another finite simple group. We study when such a localization also induces a localization between the automorphism groups and between the universal…

We advocate an account of dualities between physical theories: the basic idea is that dual theories are isomorphic representations of a common core. We defend and illustrate this account, which we call a Schema, in relation to symmetries.…

We introduce a distance function between simplicial complexes and study several of its properties.

This expository article presents a self-contained introduction to simplicial homology for finite simplicial complexes, emphasizing concrete computation and geometric intuition. Beginning with orientations of simplices and the construction…

For every countable group G we construct a compact path connected subspace K of R^4 whose fundamental group is isomorphic to G. Our construction is much simpler than the one found recently by Virk.

As an alternative to Kripke models, simplicial complexes are a versatile semantic primitive on which to interpret epistemic logic. Given a set of vertices, a simplicial complex is a downward closed set of subsets, called simplexes, of the…

To any finite simplicial complex X, we associate a natural filtration starting from Chari and Joswig's discrete Morse complex and abutting to the matching complex of X. This construction leads to the definition of several homology theories,…

We define a subgroup of the universal sofic group, obtained as the normaliser of a separable abelian subalgebra. This subgroup can be obtained as an extension by the group of automorphisms on a standard probability space. We show that each…

In the paper we present a description of complex systems in terms of self-organization processes of prime integer relations. A prime integer relation is an indivisible element made up of integers as the basic constituents following a single…

A graph $G$ is called well-covered if all maximal independent sets of vertices have the same cardinality. A simplicial complex $\Delta$ is called pure if all of its facets have the same cardinality. Let $\mathcal G$ be the class of graphs…

In this article it is determined which integral reflection representations of the symmetric groups and the primitive complex reflection groups of degree $2$ have rings of invariants which are isomorphic to polynomial rings.

Given a relation on $ X \times Y $, we can construct two abstract simplicial complexes called Dowker complexes. The geometric realizations of these simplicial complexes are homotopically equivalent. We show that if two relations are…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

We find families of simplicial complexes where the simplicial chromatic polynomials defined by Cooper--de Silva--Sazdanovic \cite{CdSS} are Hilbert series of Stanley--Reisner rings of auxiliary simplicial complexes. As a result, such…

Take a bounded symmetric domain $D$ and an arithmetic subgroup $\Gamma$ of ${\rm Aut}(D)$. Take the quotient $D/\Gamma$, compactify and resolve the singularities. We study the fundamental group of the compact complex manifolds that result…

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

We introduce and investigate generalizations of interval and proper interval graphs to simplicial complexes, including strong interval, unit interval, and under closed variants. Through equivalent combinatorial and algebraic…