Related papers: Discrete Morse theory and graph braid groups

We introduce the Hermitian-invariant group $\Gamma_f$ of a proper rational map $f$ between the unit ball in complex Euclidean space and a generalized ball in a space of typically higher dimension. We use properties of the groups to define…

A celebrated result of Otter says the number of distinct unlabelled spanning trees in $K_n$ is $\alpha^n$ up to subexponential factors for an absolute constant $\alpha>0$. In this note, we prove that for every $0<\varepsilon<\alpha$, there…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

Deformation K-theory associates to each discrete group G a spectrum built from spaces of finite dimensional unitary representations of G. In all known examples, this spectrum is 2-periodic above the rational cohomological dimension of G…

We study orbifold group actions on locally defined fields upon M-theory branes in a three-form C-fields background. We derive some constraints from the consistency of the orbifold group actions. We show the possibility of the existence of…

Many multivariate data such as social and biological data exhibit complex dependencies that are best characterized by graphs. Unlike sequential data, graphs are, in general, unordered structures. This means we can no longer use classic,…

Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

An algebraic description of basic discrete symmetries (space inversion P, time reversal T, charge conjugation C and their combinations PT, CP, CT, CPT) is studied. Discrete subgroups {1,P,T,PT} of orthogonal groups of multidimensional…

We present a novel framework for discrete multiresolution analysis of graph signals. The main analytical tool is the samplet transform, originally defined in the Euclidean framework as a discrete wavelet-like construction, tailored to the…

For finite connected graphs $\Gamma$ and $G$, with $\Gamma$ admitting a free involution $\tau$, we characterize the based homotopy classes $\alpha\in[\Gamma,G]$ for which the Borsuk-Ulam property holds in the sense of Gon\c{c}alves, Guaschi…

Let $N$ be a closed nonorientable surface with or without marked points. In this paper we prove that, for every finite full subgraph $\Gamma$ of $\mathcal{C}^{\mathrm{two}}(N)$, the right-angled Artin group on $\Gamma$ can be embedded in…

The space of unordered configurations of distinct points in the plane is aspherical, with Artin's braid group as its fundamental group. Remarkably enough, the space of ordered configurations of distinct points on the real projective line,…

A monoid is said to be special if it admits a presentation in which all defining relations are of the form $w = 1$. Groups are familiar examples of special monoids. This article studies the geometric and structural properties of the Cayley…

Let $\Gamma$ be a discrete group. Assuming rational injectivity of the Baum-Connes assembly map, we provide new lower bounds on the rank of the positive scalar curvature bordism group and the relative group in Stolz' positive scalar…

We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…

The topology of the matching complex for the $2\times n$ grid graph is mysterious. We describe a discrete Morse matching for a family of independence complexes $\mathrm{Ind}(\Delta_n^m)$ that include these matching complexes. Using this…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

Suppose $G$ is a controllable graph of order $n$ with adjacency matrix $A$. Let $W=[e,Ae,\ldots,A^{n-1}e]$ ($e$ is the all-one vector) and $\Delta=\prod_{i>j}(\alpha_i-\alpha_j)^2$ ($\alpha_i$'s are eigenvalues of $A$) be the walk matrix…

The theory of {\Gamma}-species is developed to allow species-theoretic study of quotient structures in a categorically rigorous fashion. This new approach is then applied to two graph-enumeration problems which were previously unsolved in…