English
Related papers

Related papers: Representations of relatively free profinite semig…

200 papers

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

Formal Languages and Automata Theory · Computer Science 2025-02-19 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter

Necessary and sufficient conditions are given for the endomorphism monoid of a profinite semigroup to be profinite. A similar result is established for the automorphism group.

Group Theory · Mathematics 2010-03-22 Benjamin Steinberg

We give necessary and sufficient conditions on the graph of a right-angled Artin group that determine whether the group is subgroup separable or not. Moreover, we investigate the profinite topology of the direct product of two free groups.…

Group Theory · Mathematics 2009-05-11 V. Metaftsis , E. Raptis

This article explores the relationship between Hessenberg varieties associated with semisimple operators with two eigenvalues and orbit closures of a spherical subgroup of the general linear group. We establish the specific conditions under…

Algebraic Geometry · Mathematics 2023-09-13 Mahir Bilen Can , Martha Precup , John Shareshian , Özlem Uğurlu

In the paper we study irreducible representations of some nilpotent groups of finite abelian total rank. The main result of the paper states that if a torsion-free minimax group $G$ of nilpotency class 2 admits a faithful irreducible…

Representation Theory · Mathematics 2024-12-30 Anatolii V. Tushev

Suppose that $\tilde{G}$ is a connected reductive group defined over a field $k$, and $\Gamma$ is a finite group acting via $k$-automorphisms of $\tilde{G}$ satisfying a certain quasi-semisimplicity condition. Then the connected part of the…

Representation Theory · Mathematics 2014-07-28 Jeffrey D. Adler , Joshua M. Lansky

We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…

Group Theory · Mathematics 2015-01-08 Martin R. Bridson

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the ``order formula'' of D. Testerman…

Representation Theory · Mathematics 2007-05-23 George J. McNinch

In this paper, our aim is twofold: First, by using the technique of gluing semigroups, we give infinitely many families of a projective closure with the Cohen-Macaulay (Gorenstein) property. Also, we give an effective technique for…

Commutative Algebra · Mathematics 2023-11-21 Sanjay Kumar Singh , Pranjal Srivastava

We prove that there exist finitely presented, residually finite groups that are profinitely rigid in the class of all finitely presented groups but not in the class of all finitely generated groups. These groups are of the form $\Gamma…

Group Theory · Mathematics 2025-04-15 M. R. Bridson , A. W. Reid , R. Spitler

We construct a correspondence between the cohomology groups of a group $G$ relative to a family of subgroups $\famS$ and the classes of `relative extensions' of $G$ by abelian groups, modulo a certain equivalence relation. We establish this…

Group Theory · Mathematics 2022-09-15 Gareth Wilkes

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

Group Theory · Mathematics 2024-10-23 Julian Wykowski

In this article, we first prove that the type of an affine semigroup ring is equal to the number of maximal elements of the Ap\'ery set with respect to the set of exponents of the monomials, which form a maximal regular sequence. Further,…

Commutative Algebra · Mathematics 2026-03-02 Om Prakash Bhardwaj , Carmelo Cisto

We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties in terms of "forbidden" semigroups. We also describe residually completely 0-simple varieties of…

Group Theory · Mathematics 2011-06-01 Stanislav Kublanovsky

We discuss the Bohr compactification of a pseudofinite group, motivated by a question of Boris Zilber. Basically referring to results in the literature we point out (i) the Bohr compactification of an ultraproduct of finite simple groups is…

Logic · Mathematics 2015-09-10 Anand Pillay

The purpose of this paper is to contribute to the theory of profinite semigroups by considering the special class consisting of those all of whose finitely generated closed subsemigroups are countable, which are said to be locally…

Group Theory · Mathematics 2023-01-31 Jorge Almeida , Ondrej Klíma

We classify semisimple rigid monoidal categories with two isomorphism classes of simple objects over the field of complex numbers. In the appendix written by P.Etingof it is proved that the number of semisimple Hopf algebras with a given…

Quantum Algebra · Mathematics 2007-05-23 Viktor Ostrik

We classify the quasi-finite irreducible highest weight modules over the infinite rank Lie superalgebras $\hgltwo$, $\hC$ and $\hD$, and determine the necessary and sufficient conditions for quasi-finite irreducible highest weight modules…

Quantum Algebra · Mathematics 2007-05-23 N. Lam , R. B. Zhang

We present a new notion of non-positively curved groups: the collection of discrete countable groups acting (AU-)acylindrically on finite products of $\delta$-hyperbolic spaces with general type factors. Inspired by the classical theory of…

Group Theory · Mathematics 2025-12-30 Sahana Balasubramanya , Talia Fernos

We study automaton structures, i.e. groups, monoids and semigroups generated by an automaton, which, in this context, means a deterministic finite-state letter-to-letter transducer. Instead of considering only complete automata, we…

Formal Languages and Automata Theory · Computer Science 2020-07-17 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter
‹ Prev 1 3 4 5 6 7 10 Next ›