相关论文: Rewriting the check of 8-rewritability for $A_5$

Let $\chi$ be an irreducible character of a group $G,$ and $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi)$ be the sum of the codegrees of the irreducible characters of $G.$ Write ${\rm fcod} (G)=\frac{S_c(G)}{|G|}.$ We aim to explore…

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

A subgroup $A$ of a group~$G$ is said to be {\sl NS-supplemented} in $G$, if there exists a subgroup~$B$ of $G$ such that $G=AB$ and whenever $X$~is a normal subgroup of~$A$ and $p\in \pi(B)$, there exists a Sylow $p$-subgroup~$B_p$ of~$B$…

We present a renormalization group (RG) procedure which works naturally on a wide class of interacting one-dimension models based on perturbed (possibly strongly) continuum conformal and integrable models. This procedure integrates Kenneth…

Let G be any abelian group and {a_sG_s}_{s=1}^k be a finite system of cosets of subgroups G_1,...,G_k. We show that if {a_sG_s}_{s=1}^k covers all the elements of G at least m times with the coset a_tG_t irredundant then [G:G_t]\le 2^{k-m}…

Suppose that R is an ordered ring, G_n(R) is a subsemigroup of $GL_n(R)$, consisting of all matrices with nonnegative elements. A.V. Mikhalev and M.A. Shatalova described all automorphisms of G_n(R), where R is a linearly ordered skewfield…

Let $G$ be a finite group. For all $a \in \Z$, such that $(a,|G|)=1$, the function $\rho_a: G \to G$ sending $g$ to $g^a$ defines a permutation of the elements of $G$. Motivated by a recent generalization of Zolotarev's proof of classic…

Given a group $G$ and $n\geq 0$, let $W(G,n)$ be the associated iterated wreath product -- unrestricted when $G$ is infinite -- viewed as a permutation group on $G^n$. We prove that the normalizer of $W(G,n)$ in the symmetric group $S(G^n)$…

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $\sigma(G)$. Determining $\sigma(G)$ is an open…

Let $H$ be a permutation group on a set $\Lambda$, which is permutationally isomorphic to a finite alternating or symmetric group $A_n$ or $S_n$ acting on the $k$-element subsets of points from $\{1,\ldots,n\}$, for some arbitrary but fixed…

Let $H, K$ be subgroups of the permutation group $G$ of degree $n$ with $K\trianglelefteq G$ and $\sigma$ be a partition of the set of all different prime divisors of $|G/K|$. We prove that in polynomial time (in $n$) one can check $G/K$…

In this note, we determine the irreducible characters for the simple algebraic groups of type $A_5$ over an algebraically closed field $K$ of characteristic 3, by using a theorem of Xi Nanhua and the Matlab software. In order to obtain…

For nonempty subsets $X$ and $Y$ of a group $G$, we say that $(X,Y)$ is a tiling of $G$ if every element of $G$ can be uniquely expressed as $xy$ for some $x\in X$ and $y\in Y$. In 1966, Rothaus and Thompson studied whether the symmetric…

Let $G=G(K)$ be a simple algebraic group defined over an algebraically closed field $K$ of characteristic $p>0$. A subgroup $X$ of $G$ is said to be $G$-completely reducible if, whenever it is contained in a parabolic subgroup of $G$, it is…

We show that every algebraic group scheme over a field with at least 8 elements can be realized as the group of automorphisms of a nonassociative algebra. This is only a modest improvement of the theorem of Gordeev and Popov (2003), but it…

It is proved that, given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. To achieve this, the following…

A skew-morphism of a finite group $G$ is a permutation $\sigma$ on $G$ fixing the identity element, and for which there exists an integer function $\pi$ on $G$ such that $\sigma(xy)=\sigma(x)\sigma^{\pi(x)}(y)$ for all $x,y\in G$. It has…

We study the groups $G$ with the curious property that there exists an element $k\in G$ and a function $f\colon G\to G$ such that $f(xk)=xf(x)$ holds for all $x\in G$. This property arose from the study of near-rings and input-output…

Satisfiability is a classic problem in computational complexity theory, in which one wishes to determine whether an assignment of values to a collection of Boolean variables exists in which all of a collection of clauses composed of logical…

We give a construction that takes a simple linear algebraic group $G$ over a field and produces a commutative, unital, and simple non-associative algebra $A$ over that field. Two attractions of this construction are that (1) when $G$ has…