PRIMITIVE POSITIVE FORMULAS PREVENTING A FINITE BASIS OF QUASI-EQUATIONS

2009 ◽  
Vol 19 (07) ◽  
pp. 925-935 ◽  
Author(s):  
DAVID CASPERSON ◽  
JENNIFER HYNDMAN
Keyword(s):  
Finite Group ◽  
Finite Basis ◽  
Unary Algebra ◽  
Group Operation ◽  
Positive Formula ◽  
Primitive Positive Formula ◽  
A Finite Group

A finite unary algebra with a primitive positive formula that defines the graph of a finite group operation does not have a finite basis for its quasi-equations.

ON THE IDENTITIES OF REPRESENTATIONS OF FINITE GROUPS OVER COMMUTATIVE RINGS

1992 ◽  
Vol 02 (01) ◽  
pp. 103-116
Author(s):  
SAMUEL M. VOVSI
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Noetherian Ring ◽  
Commutative Rings ◽  
Finite Basis ◽  
Finitely Based ◽  
Commutative Noetherian Ring ◽  
Representations Of Finite Groups ◽  
A Finite Group ◽  
Finite Exponent

Let K be a commutative noetherian ring. It is proved that a representation of a finite group on a K-module of finite length or on a K-module of finite exponent has a finite basis for its identities. In particular, this implies an earlier result of Nguyen Hung Shon and the author stating that every representation of a finite group over a field is finitely based. The problem whether every representation of a finite group over a commutative noetherian ring is finitely based still remains open.

Verifying the Associative Property for Finite Groups

1968 ◽  
Vol 61 (2) ◽  
pp. 136-139
Author(s):  
Arnold Hammel
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Multiplication Table ◽  
Group Element ◽  
Group Operation ◽  
Associative Property ◽  
A Finite Group

Many of the group axiom for the operation o of a finite group can be checked by referring to the multiplication table for the group. This table is an n-by-n array constructed by listing the elements of the group along the left side and along the top. If r is the element heading theith row and s is the element heading the jth column, then the contents of the box in the ith row and jth column is the group element r o s. Throughout this paper the group operation o will be written as ordinary multiplication. Thus r o s will be written as rs.

ON HIGHER FROBENIUS–SCHUR INDICATORS

2021 ◽  
pp. 1-11
Author(s):  
YANJUN LIU ◽  
WOLFGANG WILLEMS
Keyword(s):  
Finite Group ◽  
Representation Theory ◽  
Irreducible Characters ◽  
A Finite Group

Abstract Similarly to the Frobenius–Schur indicator of irreducible characters, we consider higher Frobenius–Schur indicators $\nu _{p^n}(\chi ) = |G|^{-1} \sum _{g \in G} \chi (g^{p^n})$ for primes p and $n \in \mathbb {N}$ , where G is a finite group and $\chi $ is a generalised character of G. These invariants give answers to interesting questions in representation theory. In particular, we give several characterisations of groups via higher Frobenius–Schur indicators.

scholarly journals Finite groups with some weakly pronormal subgroups

2020 ◽  
Vol 18 (1) ◽  
pp. 1742-1747
Author(s):  
Jianjun Liu ◽  
Mengling Jiang ◽  
Guiyun Chen
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
A Finite Group

Abstract A subgroup H of a finite group G is called weakly pronormal in G if there exists a subgroup K of G such that G = H K G=HK and H ∩ K H\cap K is pronormal in G. In this paper, we investigate the structure of the finite groups in which some subgroups are weakly pronormal. Our results improve and generalize many known results.

scholarly journals Random additions in urns of integers

2021 ◽  
Vol 58 (2) ◽  
pp. 335-346
Author(s):  
Mackenzie Simper
Keyword(s):  
Finite Group ◽  
Random Process ◽  
Uniform Distribution ◽  
Discrete Time ◽  
Random Variable ◽  
Urn Model ◽  
Infinite Type ◽  
The Mean ◽  
A Finite Group ◽  
Proof Of Convergence

AbstractConsider an urn containing balls labeled with integer values. Define a discrete-time random process by drawing two balls, one at a time and with replacement, and noting the labels. Add a new ball labeled with the sum of the two drawn labels. This model was introduced by Siegmund and Yakir (2005) Ann. Prob.33, 2036 for labels taking values in a finite group, in which case the distribution defined by the urn converges to the uniform distribution on the group. For the urn of integers, the main result of this paper is an exponential limit law. The mean of the exponential is a random variable with distribution depending on the starting configuration. This is a novel urn model which combines multi-drawing and an infinite type of balls. The proof of convergence uses the contraction method for recursive distributional equations.

𝒫-characters and the structure of finite solvable groups

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiakuan Lu ◽  
Kaisun Wu ◽  
Wei Meng
Keyword(s):  
Finite Group ◽  
Maximal Subgroup ◽  
Solvable Group ◽  
Irreducible Character ◽  
Solvable Groups ◽  
Irreducible Constituent ◽  
A Finite Group

AbstractLet 𝐺 be a finite group. An irreducible character of 𝐺 is called a 𝒫-character if it is an irreducible constituent of (1_{H})^{G} for some maximal subgroup 𝐻 of 𝐺. In this paper, we obtain some conditions for a solvable group 𝐺 to be 𝑝-nilpotent or 𝑝-closed in terms of 𝒫-characters.

ON THE REGULAR GRAPH RELATED TO THE G-CONJUGACY CLASSES

2021 ◽  
pp. 1-5
Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Regular Graph ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
A Finite Group

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .

Sign in / Sign up

Export Citation Format

Share Document