English
Related papers

Related papers: Automorphism groups of superextensions of finite m…

200 papers

We consider endomorphism actions of arbitrary discrete semigroups on a connected metrizable topological group G. We give necessary and sufficient conditions for expansiveness of such actions when G is a Lie group or a compact…

Dynamical Systems · Mathematics 2007-05-23 Siddhartha Bhattacharya

We give a new computer-assisted proof of the classification of maximal subgroups of the simple group ${}^2E_6(2)$ and its extensions by any subgroup of the outer automorphism group $S_3$. This is not a new result, but no earlier proof…

Group Theory · Mathematics 2018-01-26 Robert A. Wilson

We introduce a new class of semigroups arising from a restricted class of asynchronous automata. We call these semigroups "expanding automaton semigroups." We show that the class of synchronous automaton semigroups is strictly contained in…

Group Theory · Mathematics 2010-11-11 David McCune

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Group Theory · Mathematics 2025-08-11 Peice Hua

We generalise the notion of a separating intersection of links (SIL) to give necessary and sufficient criteria on the defining graph $\Gamma$ of a right-angled Coxeter group $W_\Gamma$ so that its outer automorphism group is large: that is,…

Group Theory · Mathematics 2017-06-27 Andrew Sale , Tim Susse

We study maximal subsemigroups of the monoid T(X) of all full transformations on the set X=N of natural numbers containing a given subsemigroup W of T(X) where each element of a given set $U$ is a generator of T(X) modulo W. This note…

Rings and Algebras · Mathematics 2012-01-17 Jorg Koppitz , Tiwadee Musunthia

A semigroup is completely simple if it has no proper ideals and contains a primitive idempotent. We say that a completely simple semigroup $S$ is a homogeneous completely simple semigroup if any isomorphism between finitely generated…

Rings and Algebras · Mathematics 2019-10-23 Thomas Quinn-Gregson

Let $X$ be a quasi-affine algebraic variety isomorphic to the complement of a closed subvariety of dimension at most $n-3$ in $\C^n$. We find some conditions under which an isomorphism of two closed subvarieties of $X$ can be extended to an…

Algebraic Geometry · Mathematics 2018-12-03 Shulim Kaliman

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

Logic · Mathematics 2007-05-23 Michael Pinsker

Let $G$ be either a profinite or a connected compact group, and $\Gamma, \Lambda$ be finitely generated dense subgroups. Assuming that the left translation action of $\Gamma$ on $G$ is strongly ergodic, we prove that any cocycle for the…

Dynamical Systems · Mathematics 2020-09-17 Damien Gaboriau , Adrian Ioana , Robin Tucker-Drob

A maximal commutative subalgebra is a substructure in algebra with the greatest commutative property. By studying the lengths of maximal commutative subalgebras, one can more clearly characterize the structure of commutative subalgebras in…

Rings and Algebras · Mathematics 2025-05-15 Chengjie Wang

We study two different types of (maximal) almost disjoint families: very mad families and (maximal) cofinitary groups. For the very mad families we prove the basic existence results. We prove that MA implies there exist many pairwise…

Logic · Mathematics 2009-10-05 Bart Kastermans

We show that the set of realizations of a given dimension of a max-plus linear sequence is a finite union of polyhedral sets, which can be computed from any realization of the sequence. This yields an (expensive) algorithm to solve the…

Data Structures and Algorithms · Computer Science 2011-03-14 Vincent Blondel , Stéphane Gaubert , Natacha Portier

We determine the automorphism group for some well known constructions of finite semifields. In particular, we compute the automorphism group of Sandler's semifields and in certain cases the automorphism groups of the Hughes-Kleinfeld and…

Rings and Algebras · Mathematics 2013-05-23 Andrew Steele

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…

Logic · Mathematics 2012-01-16 Özlem Beyarslan , Ehud Hrushovski

In this paper, we introduce notions of partitionability and characteristic sets of homogeneous polynomials and give a complete classification of groups faithfully acting on smooth cubic fivefolds. Specifically, we prove that there exist 20…

Algebraic Geometry · Mathematics 2024-08-15 Song Yang , Xun Yu , Zigang Zhu

Let $\mathcal C$ be a class of Hausdorff topological semigroups which contains all zero-dimensional Hausdorff topological semigroups. A semigroup $X$ is called $\mathcal C$-$closed$ if $X$ is closed in each topological semigroup $Y\in…

Commutative Algebra · Mathematics 2022-02-08 Taras Banakh , Serhii Bardyla

We show that the automorphism group of a linking system associated to a saturated fusion system $\mathcal{F}$ depends only on $\mathcal{F}$ as long as the object set of the linking system is $\mathrm{Aut}(\mathcal{F})$-invariant. This was…

Group Theory · Mathematics 2023-06-22 Ellen Henke

Let $V$ be a left vector space over a division ring and let ${\mathcal P}(V)$ be the associated projective space. We describe all finite subsets $X\subset V$ such that every permutation on $X$ can be extended to a linear automorphism of $V$…

Group Theory · Mathematics 2012-06-28 Mark Pankov

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

Artificial Intelligence · Computer Science 2012-07-24 Hung Hai Bui , Tuyen N. Huynh , Sebastian Riedel
‹ Prev 1 3 4 5 6 7 10 Next ›