Related papers: Crossed simplicial groups and structured surfaces
Simplicial complexes are a popular tool used to model higher-order interactions between elements of complex social and biological systems. In this paper, we study some combinatorial aspects of a class of simplicial complexes created by a…
Let $N$ be a connected finite type nonorientable surface with or without boundary components and punctures. We prove that the graph of nonseparating curves of $N$ is connected and Gromov hyperbolic with a constant which does not depend on…
We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…
We discuss nonabelian bundle gerbes and their differential geometry using simplicial methods. Associated to any crossed module there is a simplicial group NC, the nerve of the 1-category defined by the crossed module and its geometric…
A real form $G_0$ of a complex semisimple Lie group $G$ has only finitely many orbits in any given compact $G$-homogeneous projective algebraic manifold $Z=G/Q$. A maximal compact subgroup $K_0$ of $G_0$ has special orbits $C$ which are…
Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
It is well-known that every vertex-transitive graph admits a representation as a coset graph. In this paper, we extend this construction by introducing monodromy graphs defined through double cosets. Our main result establishes that every…
We propose representation of configurational physical quantities and microscopic structures for multicomponent system on lattice, by extending a concept of generalized Ising model (GIM) to graph theory. We construct graph Laplacian (and…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
In this paper we describe a classifying theory for families of simplicial topological groups. If $B$ is a topological space and $G$ is a simplicial topological group, then we can consider the non-abelian cohomology $H(B,G)$ of $B$ with…
A new category of algebro-geometric objects is defined. This construction is a vast generalization of existing F1-theories, as it contains the the theory of monoid schemes on the one hand and classical algebraic theory, e.g. Grothendieck…
In recent works, [20],[21], descendent integrals on the moduli space of Riemann surfaces with boundary were defined. It was conjectured in [20] that the generating function of these integrals satisfies the open KdV equations. In this paper…
This paper introduces a notion of presentation for locally inverse semigroups and develops a graph structure to describe the elements of locally inverse semigroups given by these presentations. These graphs will have a role similar to the…
A beautifully simple free generating set for the commutator subgroup of a free group was constructed by Tomaszewski. We give a new geometric proof of his theorem, and show how to give a similar free generating set for the commutator…
The simplicial complexity is an invariant for finitely presentable groups that was recently introduced by Babenko, Balacheff and Bulteau to study systolic area. The simplicial complexity $\kappa(G)$ was proved to be a good approximation of…
We give a functorial definition of $G$-gerbes over a simplicial complex when the local symmetry group $G$ is non-Abelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a…
Given a graph G, we construct a convex polytope whose face poset is based on marked subgraphs of G. Dubbed the graph multiplihedron, we provide a realization using integer coordinates. Not only does this yield a natural generalization of…
Splitting invariants describe how a plane curve "splits" by the pull-back under a Galois cover over the projective plane whose branch locus contains no component of the plane curve. They enable us to distinguish the embedded topology of…
The authors have used generalised Galois Theory to construct a homotopy double groupoid of a surjective fibration of Kan simplicial sets. Here we apply this to construct a new homotopy double groupoid of a map of spaces, which includes…