相关论文: Combing Euclidean buildings

We construct a class of II_1 factors M that admit unclassifiably many Cartan subalgebras in the sense that the equivalence relation of being conjugate by an automorphism of M is complete analytic, in particular non Borel. We also construct…

An automorphism of a spherical building is called \textit{domestic} if it maps no chamber onto an opposite chamber. This paper forms a significant part of a large project classifying domestic automorphisms of spherical buildings of…

We study manifolds endowed with an (almost) even Clifford (hermitian) structure and admitting a large automorphism group. We classify them when they are simply connected and the dimension of the automorphism group is maximal, and also prove…

Combinatorial topology is used in distributed computing to model concurrency and asynchrony. The basic structure in combinatorial topology is the simplicial complex, a collection of subsets called simplices of a set of vertices, closed…

Consider a holomorphic automorphism which acts hyperbolically on some invariant compact set. Then for every point in the compact set there exists a stable manifold, which is a complex manifold diffeomorphic to real Euclidean space. If the…

We introduce a topological property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a particular finite presentation. We also define…

The simplest prescription for building a patterned structure from its constituents is to add particles, one at a time, to an appropriate template. However, self-organizing molecular and colloidal systems in nature can evolve in much more…

A type system combining type application, constants as types, union types (associative, commutative and idempotent) and recursive types has recently been proposed for statically typing path polymorphism, the ability to define functions that…

We prove some new properties of fidelity (transition probability) and concurrence, the latter defined by straightforward extension of Wootters notation. Choose a conjugation and consider the dependence of fidelity or of concurrence on…

We present a new simple proof of the fact that certain group manifolds as well as certain homogeneous spaces G/H of dimension 4n admit a quaternionic triple of integrable complex structures that are covariantly constant with respect to the…

We show that either of the two reasonable choices for the category of compact quantum groups is nice enough to allow for a plethora of universal constructions, all obtained "by abstract nonsense" via the adjoint functor theorem. This…

Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

In previous work, we have introduced and studied a lifting property in congruence--distributive universal algebras which we have defined based on the Boolean congruences of such algebras, and which we have called the Congruence Boolean…

The notion of a complete Boolean algebra, although completely legitimate in constructive mathematics, fails to capture some natural structures such as the lattice of subsets of a given set. Sambin's notion of an overlap algebra, although…

We give an amalgamation construction of free multiple trees with a strongly transitive automorphism group. The construction shows that any partial codistance function on a tuple of finite trees can be extended to yield multiple trees.

We consider the structures given by repeatedly generalising the definition of finite state automata by symmetry considerations, and constructing analogues of transition monoids at each step. This approach first gives us non-deterministic…

The Lie product and the order relation are viewed as defining structures for Hamiltonian dynamical systems. Their admissible combinations are singled out by the requirement that the group of the Lie automorphisms be contained in the group…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

Bialgebras and Hopf (bi)modules are typical algebraic structures with several interacting operations. Their structural and homological study is therefore quite involved. We develop the machinery of braided systems, tailored for handling…