Related papers: Discrete Morse theory and graph braid groups

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Graphene is a new material that exhibits remarkable properties from both fundamental and applied issues. This is a 2D matter system whose physical and mechanical features have been approached by using tight binding model, first principle…

We present an alternative application of discrete Morse theory for two-particle graph configuration spaces. In contrast to previous constructions, which are based on discrete Morse vector fields, our approach is through Morse functions,…

The arboricity $\Gamma(G)$ of an undirected graph $G = (V,E)$ is the minimal number such that $E$ can be partitioned into $\Gamma(G)$ forests. Nash-Williams' formula states that $k = \lceil \gamma(G) \rceil$, where $\gamma(G)$ is the…

Detection of a planted dense subgraph in a random graph is a fundamental statistical and computational problem that has been extensively studied in recent years. We study a hypergraph version of the problem. Let $G^r(n,p)$ denote the…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

A drawing in the plane ($\mathbb{R}^2$) of a graph $G=(V,E)$ equipped with a function $\gamma: V \rightarrow \mathbb{N}$ is \emph{$x$-bounded} if (i) $x(u) <x(v)$ whenever $\gamma(u)<\gamma(v)$ and (ii) $\gamma(u)\leq\gamma(w)\leq…

Let $D_n$ denote the $n$-punctured disk in the complex plane, where the punctures are on the real axis. An $n$-braid $\alpha$ is said to be \emph{reducible} if there exists an essential curve system $\C$ in $D_n$, called a \emph{reduction…

We construct a group $\Gamma_{n}^{4}$ corresponding to the motion of points in $\mathbb{R}^{3}$ from the point of view of Delaunay triangulations. We study homomorphisms from pure braids on $n$ strands to the product of copies of…

An unorthodox unified theory is developed to describe external and internal attributes and symmetries of fundamental fermions, quarks and leptons. Basic ingredients of the theory are an algebra which consists of all the…

The pure braid group \Gamma of a quadruply-punctured Riemann sphere acts on the SL(2,C)-moduli M of the representation variety of such sphere. The points in M are classified into \Gamma-orbits. We show that, in this case, the monodromy…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the (nontrivial) elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. In this paper we…

Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in…

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…

Graphs are a fundamental abstraction in computer science and discrete mathematics, where information is encoded in their combinatorial structure. Graph-reduction techniques aim at simplifying graphs while preserving selected structural…

We study Morse representations of discrete subgroups in higher rank semi-simple Lie groups defined by M. Kapovich, B. Leeb and J. Porti. We show that, if a sequence of Morse representations $\rho_n : \Gamma \rightarrow G$ is (strongly)…

We consider subgroups of the braid groups which are generated by $k$-th powers of the standard generators and prove that any infinite intersection (with even $k$) is trivial. This is motivated by some conjectures of Squier concerning the…

Consider $n$ points distributed uniformly in $[0,1]^d$. Form a graph by connecting two points if their mutual distance is no greater than $r(n)$. This gives a random geometric graph, $\gnrn$, which is connected for appropriate $r(n)$. We…

A graph-theoretic method is introduced for analyzing fermion mass spectra in latticized theory-space models, including chain models arising from dimensional deconstruction. Fermion mass terms are mapped to bipartite graphs, with fields as…