One of the most natural approaches to the study of regular semigroups is to impose restrictions on the partial ordering of their idempotents (erg/^e/—jfe==e). The principal object of this note is to describe the structure of the classes of regular semigroups whose idempotents form a tree or a unitary tree, respectively (see Definition 1). We determine, among other things, a complete set of inva...

Abstract We extend the Burger–Mozes theory of closed, nondiscrete, locally quasiprimitive automorphism groups finite, connected graphs to semiprimitive case, and develop a generalization universal acting on regular tree $T_{d}$ degree $d\in \mathbb {N}_{\ge 3}$ . Three applications are given. First, we characterize types that quasicentre nondiscrete subgroup $\operatorname {\mathrm {Aut}}(T_{d}...

An action of Z by automorphisms of a k-graph induces an action of Z by automorphisms of the corresponding k-graph C∗-algebra. We show how to construct a (k + l)-graph whose C∗-algebra coincides with the crossed product of the original k-graph C∗-algebra by Z. We then investigate the structure of the crossed-product C∗-algebra.

An action of Z by automorphisms of a k-graph induces an action of Z by automorphisms of the corresponding k-graph C∗-algebra. We show how to construct a (k + l)-graph whose C∗-algebra coincides with the crossed product of the original k-graph algebra by Z. We then investigate the structure of the crossed-product C∗-algebra.

We extend the notion of the canonical extension of automorphisms of type III factors to the case of endomorphisms with finite statistical dimensions. Following the automorphism case, we introduce two notions for endomorphisms of type III factors: modular endomorphisms and Connes-Takesaki modules. Several applications to compact groups of automorphisms and subfactors of type III factors are give...

This article describes the use of permutation representations to obtain a partial solution to the Extensible Automorphisms Problem. It introduces a notion of permutation-extensibility and proves the equivalence of this notion with the notion of being subgroup-conjugating. 1. The problem we want to solve 1.1. Three big problems. A quick recall of three definitions: Definition. (1) An automorphis...

This article gives the proof of results announced in [Bla07a] and some description of automorphisms of rational surfaces. Given a finite abelian subgroup of the Cremona group of the plane, we give a way to decide whether this one is birationally conjugate to a group of automorphisms of a minimal surface. In particular, we prove that a finite cyclic group of birational transformations of the pla...

We prove two results. (1) There is an absolute constant D such that for any finite quasisimple group S, given 2D arbitrary automorphisms of S, every element of S is equal to a product of D ‘twisted commutators’ defined by the given automorphisms. (2) Given a natural number q, there exist C = C(q) and M = M(q) such that: if S is a finite quasisimple group with |S/Z(S)| > C, βj (j = 1, . . . ,M) ...

It is already shown that a Boolean function for a NP-complete problem can be computed by a polynomial-sized circuit if its variables have enough number of automorphisms. Looking at this previous study from the different perspective gives us the idea that the small number of automorphisms might be a barrier for a polynomial time solution for NP-complete problems. Here I show that by interpreting...

A class of structures C is said to have the extension property for partial automorphisms (EPPA) if, whenever C 1 and C 2 are structures in C, C 1 nite, C 1 C 2 , and p 1 , p 2 , : : :, p n are partial automorphisms of C 1 extending to automorphisms of C 2 , then there exist a nite structure C 3 in C and automorphisms 1 , 2 , : : :, n of C 3 extending the p i. We will prove that some classes of ...