Related papers: Linear conjugacy

Two $G$-sets ($G$ a finite group) are called linearly equivalent over a commutative ring $k$ if the permutation representations $k[X]$ and $k[Y]$ are isomorphic as modules over the group algebra $kG$. Pairs of linearly equivalent…

Let $K$ be a field, and let $\Aut \,K^2$ be the group of polynomial automorphisms of $K^2$. We investigate which subgroups are linear or not. In characteristic zero, there are small nonlinear subgroups and some big linear subgroups. When…

Brin and Squier described how to classify the elements of the group of piecewise linear homeomorphisms of the real line according to conjugacy. We supply a short account of the key step in their classification. The results in this document…

An element of a group is said to be reversible if it is conjugate to its inverse. We characterise the reversible elements in the group of diffeomorphisms of the real line, and in the subgroup of order preserving diffeomorphisms.

We determine the structure of the semisimple group algebra of certain groups over the rationals and over those finite fields where the Wedderburn decompositions have the least number of simple components. We apply our work to obtain similar…

We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of the general linear group on the variety of nilpotent matrices in its Lie algebra. Lie-theoretically, it is natural to wonder about the number of orbits of…

A general definition of a linear connection in noncommutative geometry has been recently proposed. Two examples are given of linear connections in noncommutative geometries which are based on matrix algebras. They both possess a unique…

In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…

An element of a group is \emph{reversible} if it is conjugate to its own inverse, and it is \emph{strongly reversible} if it is conjugate to its inverse by an involution. A group element is strongly reversible if and only if it can be…

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

In this paper we give an algebraic characterization of assemblies in terms of bands of groups. We also consider substructures and homomorphisms of assemblies. We give many examples and counterexamples.

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behaviour of conjugacy length…

In this paper we study a classification of linear systems on Lie groups with respect to the conjugacy of the corresponding flows. We also describe stability according to Lyapunov exponents.

We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…

Let $G$ be a semisimple affine algebraic group defined over a field $k$ of characteristic zero. We describe all the maximal connected solvable subgroups of $G$, defined over $k$, up to conjugation by rational points of $G$.

We prove that, except for a few cases, stable linearizability of finite subgroups of the plane Cremona group implies linearizability.

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…

For the finite groups GU(3), SU(3), GL(3), SL(3) over a finite field we solve the class product problem, i.e., we give a complete list of $m$-tuples of conjugacy classes whose product does not contain the identity matrix.

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…