相关论文: Construction du coeur compact d'un arbre r\'eel pa…

The main goal of this paper is a calculation of the integral (co)homology of the group of symmetric automorphisms of a free product. We proceed by giving a geometric interpretation of symmetric automorphisms via a moduli space of certain…

Motivated by the Bruhat and Cartan decompositions of general linear groups over local fields, double cosets of the group of label preserving automorphisms of a label-regular tree over the fixator of an end of the tree and over maximal…

We construct a model for the space of automorphisms of a connected p-compact group in terms of the space of automorphisms of its maximal torus normalizer and its root datum. As a consequence we show that any homomorphism to the outer…

In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this middle paper, we adapt a…

Let Gamma be a connected, locally finite graph of finite tree width and G be a group acting on it with finitely many orbits and finite node stabilizers. We provide an elementary and direct construction of a tree T on which G acts with…

We prove that a "random" free group outer automorphism is an ageometric fully irreducible outer automorphism whose ideal Whitehead graph is a union of triangles. In particular, we show that its attracting (and repelling) tree is a…

In this work a composition-decomposition technique is presented that correlates tree eigenvectors with certain eigenvectors of an associated so-called skeleton forest. In particular, the matching properties of a skeleton determine the…

We obtain a complete classification of hypercomplex manifolds, on which a compact group of automorphisms acts transitively. The description of the spaces as well as the proofs of our results use only the structure theory of reductive…

We study dynamical systems arising from word maps on simple groups. We develop a geometric method based on the classical trace map for investigating periodic points of such systems. These results lead to a new approach to the search of…

A cohomology theory of root systems emerges naturally in the context of Automorphic Lie Algebras, where it helps formulating some structure theory questions. In particular, one can find concrete models for an Automorphic Lie Algebra by…

This article is an expanded version of the talks given by the authors at the Arbeitsgemeinschaft "Totally Disconnected Groups", held at Oberwolfach in October 2014. We recall the basic theory of automorphisms of trees and Tits' simplicity…

Tree covering is a technique for decomposing a tree into smaller-sized trees with desirable properties, and has been employed in various succinct data structures. However, significant hurdles stand in the way of a practical implementation…

A wired tree is a graph obtained from a tree by collapsing the leaves to a single vertex. We describe a pair of short exact sequences relating the sandpile group of a wired tree to the sandpile groups of its principal subtrees. In the case…

We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…

This paper introduces a method to extract a hierarchical tree representation from 3D unorganized polygonal data. The proposed approach first extracts a graph representation of the surface, which serves as the foundation for structural…

This paper uses combinatorics and group theory to answer questions about the assembly of icosahedral viral shells. Although the geometric structure of the capsid (shell) is fairly well understood in terms of its constituent subunits, the…

We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…

Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political…

The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…

We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"{\i}ss\'{e} limit over a finite relational language is simple. As a prototypical case, the group of automorphism of the Rado…