Related papers: Fundamental groups of random clique complexes
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
We count the asymptotic number of triangles in uniform random graphs where the degree distribution follows a power law with degree exponent $\tau\in(2,3)$. We also analyze the local clustering coefficient $c(k)$, the probability that two…
In this paper we study the cokernels of various random integral matrix models, including random symmetric, random skew-symmetric, and random Laplacian matrices. We provide a systematic method to establish universality under very general…
The Fundamental Morphism Theorem is a categorical version of the First Noether Isomorphism Theorem for categories that do not have kernels or cokernels. We consider two categories of graphs. Both categories will admit graphs with multiple…
For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
We prove several results about three families of graphs. For queen graphs, defined from the usual moves of a chess queen, we find the edge-chromatic number in almost all cases. In the unproved case, we have a conjecture supported by a vast…
Scale-free networks contain many small cliques and cycles. We model such networks as inhomogeneous random graphs with regularly varying infinite-variance weights. For these models, the number of cliques and cycles have exact integral…
Some generalizations and variations of the Fintushel-Stern rim surgery are known to produce smoothly knotted surfaces. We show that if the fundamental groups of their complements are cyclic, then these surfaces are topologically unknotted.…
We describe the structure of the algebraic group of automorphisms of all simple finite dimensional Lie superalgebras. Using this and \'etale cohomology considerations, we list all different isomorphism classes of the corresponding twisted…
In previous papers, threshold probabilities for the properties of a random distance graph to contain strictly balanced graphs were found. We extend this result to arbitrary graphs and prove that the number of copies of a strictly balanced…
We study the higher (or sequential) topological complexity $\mathrm{TC}_s$ of manifolds with abelian fundamental group. We give sufficient conditions for $\mathrm{TC}_s$ to be non-maximal in both the orientable and non-orientable cases. In…
This paper investigates the $\mathrm{K}$-theory of twisted groupoid $\mathrm{C}^*$-algebras. It is shown that a homotopy of twists on an ample groupoid satisfying the Baum-Connes conjecture with coefficients gives rise to an isomorphism…
We study the structure of the \'etale fundamental groups of smooth curves over certain arithmetic schemes, and investigate the relative version of Grothendieck's anabelian conjecture in this setting. Consequently, every hyperbolic curve…
For any type of fundamental groupoid scheme, we construct an algebraic cohomology theory for varieties with coefficients in the base field. This is a minor variant of \'etale cohomology, involving neither de Rham complexes nor…
The Whitehead asphericity problem, regarded as a problem of combinatorial group theory, asks whether any subpresentation of an aspherical group presentation is also aspherical. We give a positive answer to this question by proving that if…
We provide new tools for the calculation of the torsion in the cohomology of congruence subgroups in the Bianchi groups : An algorithm for finding particularly useful fundamental domains, and an analysis of the equivariant spectral sequence…
In this paper we investigate the regimes where an Erdos-Renyi random graph has torsion free eulerian magnitude homology groups. To this end, we start be introducing the eulerian Asao-Izumihara complex - a quotient CW-complex whose homology…
We develop random graph models where graphs are generated by connecting not only pairs of vertices by edges but also larger subsets of vertices by copies of small atomic subgraphs of arbitrary topology. This allows the for the generation of…
We combine results about Whitehead groups of finite groups with results about genetic bases of finite $p$-groups to compute the Whitehead groups of some metacyclic $p$-groups. Let $C_{p^n}$ denote a cyclic group of order $p^n$ for $p$ an…