Related papers: Asymptotic homology of graph braid groups

We compute numerically the homology of several graph complexes in low loop orders, extending previous results.

We determine the image of the braid groups inside the Iwahori-Hecke algebras of type A, when defined over a finite field, in the semisimple case, and for suitably large (but controlable) order of the defining (quantum) parameter.

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

We consider admissible random walks on hyperbolic graphs. For a given harmonic function on such a graph, we prove that asymptotic properties of non-tangential boundedness and non-tangential convergence are almost everywhere equivalent. The…

We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…

We give formulae for the first homology of the $n$-braid group and the pure 2-braid group over a finite graph in terms of graph theoretic invariants. As immediate consequences, a graph is planar if and only if the first homology of the…

This article is dedicated to the computation of an explicit presentation of some asymptotically rigid mapping class groups, namely the braided Higman-Thompson groups. To do so, we use the action of these groups on the spine complex, a…

This paper studies graphical analogs of symmetric products and unordered configuration spaces in topology. We do so from the perspective of the discrete homotopy theory introduced by Barcelo et al. Our first result is a combinatorial…

The rational homology of unordered configuration spaces of points on any surface was studied by Drummond-Cole and Knudsen. We compute the rational cohomology of configuration spaces on a closed orientable surface, keeping track of the mixed…

Homology groups of spaces of nonsingular polynomial embeddings ${\bf R}^1 \to {\bf R}^n$ of degrees $\le 4$ are calculated. A general algebraic technique of such calculations for spaces of polynomial knots of arbitrary degrees is described.

We discuss heuristic asymptotic formulae for the number of pairing-friendly abelian varieties over prime fields, generalizing previous work of one of the authors arXiv:math1107.0307

Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…

We consider a finite simplicial complex $K$ together with its successive barycentric subdivisions $Sd^d(K), d\geq0,$ and study the expected topology of a random subcomplex in $Sd^d(K), d\gg0$. We get asymptotic upper and lower bounds for…

Let $G$ be a finitely generated abelian group, and let $S = A[x_1, ..., x_n]$ be a $G$-graded polynomial ring over a commutative ring $A$. Let $I_1, ..., I_s$ be $G$-homogeneous ideals in $S$, and let $M$ be a finitely generated $G$-graded…

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…

We consider Thompson's groups from the perspective of mapping class groups of surfaces of infinite type. This point of view leads us to the braided Thompson groups, which are extensions of Thompson's groups by infinite (spherical) braid…

The total Betti number of the independence complex of a graph is an intriguing graph invariant. Kalai and Meshulam have raised the question on its relation to cycles and the chromatic number of a graph, and a recent conjecture on that theme…

We prove a collection of asymptotic density results for several interesting classes of the $I$-graphs. Specifically, we quantify precisely the proportion of $I$-graphs that are generalised Petersen graphs as well as those that are…

We propose a refinement of the Betti numbers and of the homology with coefficients in a field of a compact ANR in the presence of a continuous real valued function. The refinement of Betti numbers consists of finite configurations of points…