Related papers: Curve Selection Lemma for semianalytic sets and co…

Let $G$ be a complex reductive algebraic group, $g$ its Lie algebra and $h$ a reductive subalgebra of $g$, $n$ a positive integer. Consider the diagonal actions $G:g^n, N_G(h):h^n$. We study a relation between the algebra $C[h^n]^{N_G(h)}$…

We give a notably simpler and shorter proof of H. B. Neumann's result which is stated, cursorly, like this. For any well-ordered subset, A, of a totally ordered semigroup, the set of products of any finite number of elements of A is itself…

We classify the spherical birational sheets in a complex simple simply-connected algebraic group. We use the classification to show that, when $G$ is a connected reductive complex algebraic group with simply-connected derived subgroup, two…

Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…

Many results have been established that show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper is to show several results about solvability concerning the…

Given a conjugacy class $\mathcal{C}$ in a group $G$ we define a new graph, $\Gamma(\mathcal{C})$, whose vertices are elements of $\mathcal{C}$; two vertices $g,h\in \mathcal{C}$ are connected in $\Gamma(\mathcal{C})$ if $[g,h]=1$ and…

Let $G\in\{p,q\}^*$ be a finite group with trivial center, where $p,q\in\pi(G)$ and $p>q>5$. In the present paper it is proved that $|G|_{\{p,q\}}=|G||_{\{p,q\}}$; in particular $C_G(g)\cap C_G(h)=1$ for every $p$-element $g$ and every…

We prove that every finitely presentable group G arises as the fundamental group of an orientable 3-complex obtained from a hyperbolic link complement, by coning each boundary torus of the link exterior to a distinct point. We define the…

We extend classical results on the classification of reversible elements of the group $\mathrm{GL}(n, \mathbb{C})$ (and $\mathrm{GL}(n, \mathbb{R})$) to $\mathrm{GL}(n, \mathbb{H})$ using an infinitesimal version of the classical…

Let $G$ denote a connected semisimple and simply connected algebraic group over an algebraically closed field $k$ of positive characteristic and let $g$ denote a regular element of $G$. Let $X$ denote any equivariant embedding of $G$. We…

We added an additional result (theorem 1.6) that strengthenns our main theorem in the G=GL-case by establishing an equivalence of tensor categories.

In a group $G$, elements $a$ and $b$ are conjugate if there exists $g\in G$ such that $g^{-1} ag=b$. This conjugacy relation, which plays an important role in group theory, can be extended in a natural way to inverse semigroups: for…

For a finite group $G,$ we define the concept of $G$-partial permutation and use it to show that the structure coefficients of the center of the wreath product $G\wr \mathcal{S}_n$ algebra are polynomials in $n$ with non-negative integer…

A digraph $\mathbb G$ is called weakly connected, strongly connected, and extremely connected if any two vertices of $\mathbb G$ are connected respectively by an oriented, a directed, and a symmetric path in $\mathbb G$. We investigate the…

Let $G$ be the complex symplectic or special orthogonal group and $\g$ its Lie algebra. With every point $x$ of the maximal torus $T\subset G$ we associate a highest weight module $M_x$ over the Drinfeld-Jimbo quantum group $U_q(\g)$ and a…

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

Composition and lattice join (transitive closure of a union) of equivalence relations are operations taking pairs of decidable equivalence relations to relations that are semi-decidable, but not necessarily decidable. This article addresses…

We consider the complexity of Green's relations when the semigroup is given by transformations on a finite set. Green's relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then…

Let G be an affine algebraic group over an algebraically closed field such that the identity component G^0 of G is reductive. Let W be the Weyl group of G and let D be a connected component of G whose image in G/G^0 is a unipotent element.…

A group $G$ is called subgroup conjugacy separable if for every pair of non-conjugate finitely generated subgroups of $G$, there exists a finite quotient of $G$ where the images of these subgroups are not conjugate. We prove that limit…