Searcharxiv⌕ Search

arXiv subjects

Csaba Schneider

Publications and source records attributed to Csaba Schneider.

At least 37 records · Page 2Linked to original sources
arXiv2014

The rank of the semigroup of transformations stabilising a partition of a finite set

Let $\mathcal{P}$ be a partition of a finite set $X$. We say that a full transformation $f:X\to X$ preserves (or stabilizes) the partition $\mathcal{P}$ if for all $P\in \mathcal{P}$ there exists $Q\in \mathcal{P}$ such that $Pf\subseteq Q$. Let $T(X,\mathcal{P})$ denote the semigroup of all full transformations of $X$ that preserve the partition $\mathcal{P}$. In 2005 Huisheng found an upper bound for the minimum size of the generating sets of $T(X,\mathcal{P})$, when $\mathcal{P}$ is a partition in which all of its parts have the same size. In addition, Huisheng conjectured that his bound was exact. In 2009 the first and last authors used representation theory to completely solve Hisheng's conjecture. The goal of this paper is to solve the much more complex problem of finding the minimum size of the generating sets of $T(X,\mathcal{P})$, when $\mathcal{P}$ is an arbitrary partition. Again we use representation theory to find the minimum number of elements needed to generate the wreath product of finitely many symmetric groups, and then use this result to solve the problem. The paper ends with a number of problems for experts in group and semigroup theories.

math.GR↗
arXiv2013

Cliques and colorings in generalized Paley graphs and an approach to synchronization

Given a finite field, one can form a directed graph using the field elements as vertices and connecting two vertices if their difference lies in a fixed subgroup of the multiplicative group. If -1 is contained in this fixed subgroup, then we obtain an undirected graph that is referred to as a generalized Paley graph. In this paper we study generalized Paley graphs whose clique and chromatic numbers coincide and link this theory to the study of the synchronization property in 1-dimensional primitive affine permutation groups.

math.GR↗
arXiv2012

Partial transformation monoids preserving a uniform partition

The objective of this paper is to study the monoid of all partial transformations of a finite set that preserve a uniform partition. In addition to proving that this monoid is a quotient of a wreath product with respect to a congruence relation, we show that it is generated by 5 generators, we compute its order and determine a presentation on a minimal generating set.

math.GR↗
arXiv2011

Embedding permutation groups into wreath products in product action

The wreath product of two permutation groups G < Sym(Gamma) and H < Sym(Delta) can be considered as a permutation group acting on the set Pi of functions from Delta to Gamma. This action, usually called the product action, of a wreath product plays a very important role in the theory of permutation groups, as several classes of primitive or quasiprimitive groups can be described as subgroups of such wreath products. In addition, subgroups of wreath products in product action arise as automorphism groups of graph products and codes. In this paper we consider subgroups X of full wreath products Sym(Gamma) wr Sym(Delta) in product action. Our main result is that, in a suitable conjugate of X, the subgroup of Sym(Gamma) induced by a stabilizer of a coordinate delta in Delta only depends on the orbit of delta under the induced action of X on Delta. Hence, if the action of X on Delta is transitive, then X can be embedded into a much smaller wreath product. Further, if this X-action is intransitive, then X can be embedded into a direct product of such wreath products where the factors of the direct product correspond to the X-orbits in Delta. We offer an application of the main theorems to error-correcting codes in Hamming graphs.

math.GR↗
arXiv2010

p-groups having a unique proper non-trivial characteristic subgroup

We consider the structure of finite $p$-groups $G$ having precisely three characteristic subgroups, namely $1$, $Φ(G)$ and $G$. The structure of $G$ varies markedly depending on whether $G$ has exponent $p$ or $p^2$, and, in both cases, the study of such groups raises deep problems in representation theory. We present classification theorems for 3- and 4-generator groups, and we also study the existence of such $r$-generator groups with exponent $p^2$ for various values of $r$. The automorphism group induced on the Frattini quotient is, in various cases, related to a maximal linear group in Aschbacher's classification scheme.

math.GR↗
arXiv2010

Constructive membership testing in black-box classical groups

The research described in this note aims at solving the constructive membership problem for the class of quasisimple classical groups. Our algorithms are developed in the black-box group model; that is, they do not require specific characteristics of the representations in which the input groups are given. The elements of a black-box group are represented, not necessarily uniquely, as bit strings of uniform length. We assume the existence of oracles to compute the product of two elements, the inverse of an element, and to test if two strings represent the same element. Solving the constructive membership problem for a black-box group $G$ requires to write every element of $G$ as a word in a given generating set. In practice we write the elements of $G$ as straight-line programs (SLPs) which can be viewed as a compact way of writing words.

math.GR↗
arXiv2010

The isomorphism problem for universal enveloping algebras of nilpotent Lie algebras

In this paper we study the isomorphism problem for the universal enveloping algebras of nilpotent Lie algebras. We prove that if the characteristic of the underlying field is not~2 or~3, then the isomorphism type of a nilpotent Lie algebra of dimension at most~6 is determined by the isomorphism type of its universal enveloping algebra. Examples show that the restriction on the characteristic is necessary.

math.RA↗
arXiv2009

Groups that together with any transformation generate regular semigroups or idempotent generated semigroups

Let $a$ be a non-invertible transformation of a finite set and let $G$ be a group of permutations on that same set. Then $\genset{G, a}\setminus G$ is a subsemigroup, consisting of all non-invertible transformations, in the semigroup generated by $G$ and $a$. Likewise, the conjugates $a^g=g^{-1}ag$ of $a$ by elements $g\in G$ generate a semigroup denoted $\genset{a^g | g\in G}$. We classify the finite permutation groups $G$ on a finite set $X$ such that the semigroups $\genset{G,a}$, $\genset{G, a}\setminus G$, and $\genset{a^g | g\in G}$ are regular for all transformations of $X$. We also classify the permutation groups $G$ on a finite set $X$ such that the semigroups $\genset{G, a}\setminus G$ and $\genset{a^g | g\in G}$ are generated by their idempotents for all non-invertible transformations of $X$.

math.GR↗
arXiv2008

The Rank of the Endomorphism Monoid of a Partition

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a finite set that leave a non-trivial uniform partition invariant. That involves proving that the rank of a wreath product of two symmetric groups is two and then use the fact that the endomorphism monoid of a partition is isomorphic to a wreath product of two full transformation semigroups. The calculation of the rank of these semigroups solves an open question.

math.GR↗
arXiv2008

Primitive flag-transitive generalized hexagons and octagons

Suppose that an automorphism group $G$ acts flag-transitively on a finite generalized hexagon or octagon $\cS$, and suppose that the action on both the point and line set is primitive. We show that $G$ is an almost simple group of Lie type, that is, the socle of $G$ is a simple Chevalley group.

math.CO↗
arXiv2005

Generalised sifting in black-box groups

We present a generalisation of the sifting procedure introduced originally by Sims for computation with finite permutation groups, and now used for many computational procedures for groups, such as membership testing and finding group orders. Our procedure is a Monte Carlo algorithm, and is presented and analysed in the context of black-box groups. It is based on a chain of subsets instead of a subgroup chain. Two general versions of the procedure are worked out in detail, and applications are given for membership tests for several of the sporadic simple groups. Our major objective was that the procedures could be proved to be Monte Carlo algorithms, and their costs computed. In addition we explicitly determined suitable subset chains for six of the sporadic groups, and we implemented the algorithms involving these chains in the {\sf GAP} computational algebra system. It turns out that sample implementations perform well in practice. The implementations will be made available publicly in the form of a {\sf GAP} package.

math.GR↗
arXiv2005

The derived series of a finite p-group

Let $G$ be a finite $p$-group, and let $\der Gd$ denote the $d$-th term of the derived series of $G$. We show, for $p\geq 5$, that $\der Gd\neq 1$ implies $\log_p\ord G\geq 2^d+3d-6$, and hence we improve a recent result by Mann.

math.GR↗
arXiv2005

Small derived quotients in finite p-groups

More than 70 years ago, P. Hall showed that if $G$ is a finite $p$-group such that a term $\der G{d+1}$ of the derived series is non-trivial, then the order of the quotient $\der Gd/\der G{d+1}$ is at least $p^{2^d+1}$. Recently Mann proved that, in a finite $p$-group, Hall's lower bound can be taken for at most two distinct $d$. We improve this result and show that if $p$ is odd, then it can only be taken for two distinct $d$ in a group with order $p^6$.

math.GR↗
arXiv2004

Quasiprimitive groups and blow-up decompositions

The blow-up construction by L. G. Kovács has been a very useful tool to study embeddings of finite primitive permutation groups into wreath products in product action. In the present paper we extend the concept of a blow-up to finite quasiprimitive permutation groups, and use it to study embeddings of finite quasiprimitive groups into wreath products.

math.GR↗
arXiv2004

Three types of inclusions of innately transitive permutation groups into wreath products in product action

A permutation group is innately transitive if it has a transitive minimal normal subgroup, and this subgroup is called a plinth. In this paper we study three special types of inclusions of innately transitive permutation groups in wreath products in product action. This is achieved by studying the natural Cartesian decomposition of the underlying set that correspond to the product action of a wreath product. Previously we identified six classes of Cartesian decompositions that can be acted upon transitively by an innately transitive group with a non-abelian plinth. The inclusions studied in this paper correspond to three of the six classes. We find that in each case the isomorphism type of the acting group is restricted, and some interesting combinatorial structures are left invariant. We also show how to construct examples of inclusions for each type.

math.GR↗