相关论文: Discrete Morse theory and graph braid groups

We study the derangement graph $\Gamma_n$ whose vertex set consists of all permutations of $\{1,\ldots,n\}$, where two vertices are adjacent if and only if their corresponding permutations differ at every position. It is well-known that…

Let $\Gamma$ be the fundamental group of a finite connected graph $\mathcal G$. Let $\mathfrak M$ be an abelian group. A {\it distribution} on the boundary $\partial\Delta$ of the universal covering tree $\Delta$ is an $\mathfrak M$-valued…

Let $\Gamma$ be a finitely generated cocompact lattice of a totally disconnected locally compact group $G$, and $C$ a dense subgroup of $G$ that contains and commensurates $\Gamma$. We study the problem of describing all finitely generated…

This paper is devoted to the proof of a structural theorem, concerning certain homomorphic images of Artin braid group on $n$ strands in finite symmetric groups. It is shown that any one of these permutation groups is an extension of the…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

Let $H^n$ be the hyperbolic n-space with $n\geq 2$. Suppose that $\Gamma<Isom H^n$ is a discrete, torsion free subgroup and $a$ is a point in the domain of discontinuity $\Omega(\Gamma)$. Let $p$ be the projection map from $H^n$ to the…

We define invariants of braids rather than invariants of conjugacy classes of braids. For any pure three-braid we give effective upper and lower bounds for these invariants. This is done in terms of a natural syllable decomposition of the…

According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…

We classify the large $N$ limits of four-dimensional supersymmetric gauge theories with simple gauge groups that flow to superconformal fixed points. We restrict ourselves to the ones without a superpotential and with a fixed flavor…

Let $G$ be an undirected simple connected graph. We say a vertex $u$ is eccentric to a vertex $v$ in $G$ if $d(u,v)=\max\{d(v,w): w\in V(G)\}$. The eccentric graph, $E(G)$ of $G$ is a graph defined on the same vertex set as of $G$ and two…

A graph $G$ is weakly $\gamma$-closed if every induced subgraph of $G$ contains one vertex $v$ such that for each non-neighbor $u$ of $v$ it holds that $|N(u)\cap N(v)|<\gamma$. The weak closure $\gamma(G)$ of a graph, recently introduced…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Given a finite group $G$, denote by $\Gamma(G)$ the simple undirected graph whose vertices are the distinct sizes of noncentral conjugacy classes of $G$, and set two vertices of $\Gamma(G)$ to be adjacent if and only if they are not coprime…

A planar pure braid consists of $n$ descending smooth arcs, each connecting a point on one horizontal line $\ell_{1}$ to a point on a horizontal line $\ell_{2}$, which is required to be directly below the first point. Two arcs are allowed…

Without recourse to the sophisticated machinery of twisted group algebras, projective character tables and explicit values of 2-cocycles, we here present a simple algorithm to study the gauge theory data of D-brane probes on a generic…

The {\it 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 element of $G$ of order…

A Mumford group is a discontinuous subgroup $\Gamma$ of PGL(2,K), where K denotes a non archimedean valued field, such that the quotient by $\Gamma$ is a curve of genus 0. As abstract group $\Gamma$ is an amalgam of a finite tree of finite…

Let G be a chordal graph, X(G) the complement of the associated complex arrangement and Gamma(G) the fundamental group of X(G). We show that Gamma(G) is a limit of colored braid groups over the poset of simplices of G. When G = G_T is the…

In this article we calculate the n-string braid groups of certain non-contractible graphs. We use techniques from the work of A. Abrams, F. Connolly and M. Doig combined with Van Kampen's Theorem to prove these results.

The Pathwidth Theorem states that if a class of graphs has unbounded pathwidth, then it contains all trees as graph minors. We prove a similar result for dense graphs. More precisely, we give a finite family of tree-like patterns and prove…