Related papers: Lifting graph automorphisms along solvable regular…
For any right-angled Artin group, we show that its outer automorphism group contains either a finite-index nilpotent subgroup or a nonabelian free subgroup. This is a weak Tits alternative theorem. We find a criterion on the defining graph…
We show that certain graphs of groups with cyclic edge groups are aTmenable. In particular, this holds when each vertex group is either virtually special or acts properly and semisimply on $\mathbb{H}^n$.
A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class…
We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…
The fine curve graph of a surface is the graph whose vertices are simple closed essential curves in the surface and whose edges connect disjoint curves. In this paper, we prove that the automorphism group of the fine curve graph of a…
Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…
We develop technics of birational geometry to study automorphisms of affine surfaces admitting many distinct rational fibrations, with a particular focus on the interactions between automorphisms and these fibrations. In particular, we…
It is well known that each nonnegative integral flow on a graph can be decomposed into a sum of nonnegative graphic circuit flows, which cannot be further decomposed into nonnegative integral sub-flows. This is equivalent to saying that the…
We introduce and investigate the solvable graph $\Gamma_\mathfrak{S}(L)$ of a finite-dimensional Lie algebra $L$ over a field $F$. The vertices are the elements outside the solvabilizer $\sol(L)$, and two vertices are adjacent whenever they…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
We show that the resolution graph of a plane curve singularity admits a canonical decomposition into elementary graphs.
The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…
Criteria for a diffeomorphism of a smooth manifold $M$ to be lifted to a linear automorphism of a given real vector bundle $p\colon V\rightarrow M$, are stated. Examples are included and the metric and complex vector-bundle cases are also…
In this article we use the combinatorial and geometric structure of manifolds with embedded cylinders in order to develop an adiabatic decomposition of the Hodge cohomology of these manifolds. We will on the one hand describe the adiabatic…
We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…
It is well known that every locally compact abelian group L can be decomposed as L_1 \oplus R^n, where L_1 contains a compact-open subgroup. In this paper, we use this decomposition to study the topological group Aut(L) of automorphisms of…
The associahedron is a convex polytope whose face poset is based on nonintersecting diagonals of a convex polygon. In this paper, given an arbitrary simple polygon P, we construct a polytopal complex analogous to the associahedron based on…
An automorphism of a group is said to be normal if it preserves each normal subgroup. In this paper, we determine the normal automorphisms of a free metabelian nilpotent group.
In this paper we develop three characterizations for isomorphism of graphs. The first characterization is obtained by associating certain bitableaux with the graphs. We order these bitableaux by suitably defined lexicographic order and…
Flip graphs of combinatorial and geometric objects are at the heart of many deep structural insights and connections between different branches of discrete mathematics and computer science. They also provide a natural framework for the…