相关论文: Classification of Element Systems over Finite Comm…

We introduce a generalisation of norm relations in the group algebra Q[G], where G is a finite group. We give some properties of these relations, and use them to obtain relations between the S-unit groups of different subfields of the same…

Considering a finite group $G$, for any element $x\in G$, the solvabilizer of $x$ in $G$ is defined as $Sol_G(x)=\{y \in G : \langle x, y \rangle \text{ is solvable}\}$. In this paper, we introduce $Solv(G)$ as the number of distinct…

We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…

The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…

We present new classes of permutation polynomials over finite fields.

In this paper we introduce and study the concept of cyclic subgroup commutativity degree of a finite group $G$. This quantity measures the probability of two random cyclic subgroups of $G$ commuting. Explicit formulas are obtained for some…

This article takes the form of a tutorial on the use of a particular class of mixed finite element methods, which can be thought of as the finite element extension of the C-grid staggered finite difference method. The class is often…

Assume $\mathbf{G}$ is a connected reductive algebraic group defined over an algebraic closure $\mathbb{K} = \overline{\mathbb{F}}_p$ of the finite field of prime order $p>0$. Furthermore, assume that $F : \mathbf{G} \to \mathbf{G}$ is a…

Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…

We use a combinatorial approach to compute the number of non-isomorphic choices on four elements that can be explained by models of bounded rationality.

We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…

Let G be a group which acts on a commutative ring k. We exhibit an induction formula which expresses an element x_G with tr_G(x_G)=1 by elements x_P with tr_P(x_P)=1, where P varies over prime order subgroups of P.

Let $G$ be a finite group admitting a coprime automorphism $\alpha$ of order $e$. Denote by $I_G(\alpha)$ the set of commutators $g^{-1}g^\alpha$, where $g\in G$, and by $[G,\alpha]$ the subgroup generated by $I_G(\alpha)$. We study the…

After recalling some basic facts about F-wound commutative unipotent algebraic groups over an imperfect field F we study their regular integral models over Dedekind schemes of positive characteristic and compute the group of isomorphisms…

Let $V$ be a finite-dimensional vector space over the complex numbers and let $G\leq \operatorname{SL}(V)$ be a finite group. We describe the class group of a minimal model (that is, $\mathbb Q$-factorial terminalization) of the linear…

We describe a purely group-theoretic condition on an element g of a finite group G which implies that g has coefficient zero in every central idempotent element of the group ring RG, provided that R is a ring of prime characteristic. We use…

We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using…

The generalized order $e_G(g)$ of an element $g$ of a group $G$ is the smallest positive integer $k$ such that there exist $x_1,\ldots,x_k \in G$ such that $g^{x_1} \ldots g^{x_k}=1$, where $g^x=x^{-1}gx$. Let $e(G) = \max \{e_G(g)\ |\ g…

We explore a natural class of semigroups that have word problem decidable by finite state automata. Among the main results are invariance of this property under change of generators, invariance under basic algebraic constructions and…

We consider 9 infinite families of finite $p$-groups, for $p$ a prime, and we settle the isomorphism problem that arises when the parameters that define these groups are modified.