Related papers: Digital Fundamental Groups and Edge Groups of Cliq…
Given a smooth complex surface S, and a compact connected global normal crossings divisor $D = \cup_i D_i$, we consider the local fundamental group, i.e., the fundamental group Gamma of T-D, where T is a good tubular neighbourhood of D. One…
We study a natural model of random 2-dimensional cubical complex which is a subcomplex of an n-dimensional cube, and where every possible square $2$-face is included independently with probability p. Our main result is to exhibit a sharp…
Introducing the notion of stabilized fundamental group for the complement of a branch curve in $CP^2$, we define effectively computable invariants of symplectic 4-manifolds that generalize those previously introduced by Moishezon and…
We study structural and enumerative aspects of pure simplicial complexes and clique complexes. We prove a necessary and sufficient condition for any simplicial complex to be a clique complex that depends only on the list of facets. We also…
We define an integer-valued invariant of special cube complexes called the genus, and prove that having genus one characterizes special cube complexes with abelian fundamental group. Using the genus, we obtain a new proof that the…
Recently there has been growing interest in discrete homotopies and homotopies of graphs beyond treating graphs as 1-dimensional simplicial spaces. One such type of homotopy is $\times$-homotopy. Recent work by Chih-Scull has developed a…
The proalgebraic fundamental group of a connected topological space $X$, recently introduced by the first author, is an affine group scheme whose representations classify local systems of finite-dimensional vector spaces on $X$. In this…
We provide an intrinsic definition of the fundamental group of a linear category over a ring as the automorphism group of the fibre functor on Galois coverings. If the universal covering exists, we prove that this group is isomorphic to the…
We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…
In this paper we prove results relating to four homology theories developed in the topology of digital images: a simplicial homology theory by Arslan et al which is the homology of the clique complex, a singular simplicial homology theory…
The Gruenberg-Kegel graph of a group is the undirected graph whose vertices are those primes which occur as the order of an element of the group, and distinct vertices $p$, $q$ are joined by an edge whenever the group has an element of…
Many real-world networks were found to be highly clustered, and contain a large amount of small cliques. We here investigate the number of cliques of any size k contained in a geometric inhomogeneous random graph: a scale-free network model…
Most complex systems can be captured by graphs or networks. Networks connect nodes (e.g.\ neurons) through edges (synapses), thus summarizing the system's structure. A popular way of interrogating graphs is community detection, which…
A metric space (X,d) is declared to be natural if (X,d) determines an up to isomorphism unique group structure (X,+) on the set X such that all the group translations and group inversion are isometries. A group is called natural if it…
We characterize when a generalized Baumslag-Solitar group is linear, and extend the result to the fundamental groups of a graph of groups with infinite virtually cyclic vertex and edge groups.
In this paper we prove results relating to two homotopy relations and four homology theories developed in the topology of digital images. We introduce a new type of homotopy relation for digitally continuous functions which we call "strong…
We prove that various classical conformal diffeomorphism groups, which are known to be essential [1], are in fact properly essential. This is a consequence of a local criterion on a conformal diffeomorphism in the form of a cohomological…
The smallest number of cliques, covering all edges of a graph $ G $, is called the (edge) clique cover number of $ G $ and is denoted by $ cc(G) $. It is an easy observation that for every line graph $ G $ with $ n $ vertices, $cc(G)\leq n…
The Gruenberg-Kegel graph (or the prime graph) $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an…
The Seifert-van Kampen theorem computes the fundamental group of a space from the fundamental groups of its constituents. We develop a modular SVK framework within the setting of computational paths - an approach to equality where witnesses…