• Title/Summary/Keyword: Subgroup orders

Search Result 4, Processing Time 0.015 seconds

ON THE SOLVABILITY OF A FINITE GROUP BY THE SUM OF SUBGROUP ORDERS

  • Tarnauceanu, Marius
    • Bulletin of the Korean Mathematical Society
    • /
    • v.57 no.6
    • /
    • pp.1475-1479
    • /
    • 2020
  • Let G be a finite group and ${\sigma}_1(G)={\frac{1}{{\mid}G{\mid}}}\;{\sum}_{H{\leq}G}\;{\mid}H{\mid}$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of G, we prove that if ${\sigma}_1(G)<{\frac{117}{20}}$, then G is solvable. This partially solves an open problem posed in [9].

ADDITIVE SELF-DUAL CODES OVER FIELDS OF EVEN ORDER

  • Dougherty, Steven T.;Kim, Jon-Lark;Lee, Nari
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.2
    • /
    • pp.341-357
    • /
    • 2018
  • We examine various dualities over the fields of even orders, giving new dualities for additive codes. We relate the MacWilliams relations and the duals of ${\mathbb{F}}_{2^{2s}}$ codes for these various dualities. We study self-dual codes with respect to these dualities and prove that any subgroup of order $2^s$ of the additive group is a self-dual code with respect to some duality.

Group Orders That Imply a Nontrivial p-Core

  • Rafael, Villarroel-Flores
    • Kyungpook Mathematical Journal
    • /
    • v.62 no.4
    • /
    • pp.769-772
    • /
    • 2022
  • Given a prime number p and a natural number m not divisible by p, we propose the problem of finding the smallest number r0 such that for r ≥ r0, every group G of order prm has a non-trivial normal p-subgroup. We prove that we can explicitly calculate the number r0 in the case where every group of order prm is solvable for all r, and we obtain the value of r0 for a case where m is a product of two primes.

ORDERED GROUPS IN WHICH ALL CONVEX JUMPS ARE CENTRAL

  • Bludov, V.V.;Glass, A.M.W.;Rhemtulla, Akbar H.
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.2
    • /
    • pp.225-239
    • /
    • 2003
  • (G, <) is an ordered group if'<'is a total order relation on G in which f < g implies that xfy < xgy for all f, g, x, y $\in$ G. We say that (G, <) is centrally ordered if (G, <) is ordered and [G,D] $\subseteq$ C for every convex jump C $\prec$ D in G. Equivalently, if $f^{-1}g f{\leq} g^2$ for all f, g $\in$ G with g > 1. Every order on a torsion-free locally nilpotent group is central. We prove that if every order on every two-generator subgroup of a locally soluble orderable group G is central, then G is locally nilpotent. We also provide an example of a non-nilpotent two-generator metabelian orderable group in which all orders are central.