Group polynomials over rings

2020 ◽  
Vol 30 (6) ◽  
pp. 357-364
Author(s):  
Aleksandr V. Akishin
Keyword(s):  
Prime Number ◽  
Latin Squares ◽  
Group Operation

AbstractWe consider polynomials over rings such that the polynomials represent Latin squares and define a group operation over the ring. We introduce the notion of a group polynomial, describe a number of properties of these polynomials and the groups generated. For the case of residue rings$\mathbb{Z}_{r^n},$where r is a prime number, we give a description of groups specified by polynomials and identify a class of group polynomials that can be used to construct controlled cryptographic transformations.

VBTree Tutorial: Automatic Completion of Group Operation on Structural Dataset

2020 ◽  
Author(s):  
Chen Zhang ◽  
Huakang Bian ◽  
Kenta Yamanaka ◽  
Akihiko Chiba
Keyword(s):  
Group Operation

scholarly journals A Discussion of a Cryptographical Scheme Based in F-Critical Sets of a Latin Square

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 285
Author(s):  
Laura M. Johnson ◽  
Stephanie Perkins
Keyword(s):  
Necessary Conditions ◽  
Latin Square ◽  
Latin Squares ◽  
Critical Sets ◽  
Long Cycles ◽  
The Given

This communication provides a discussion of a scheme originally proposed by Falcón in a paper entitled “Latin squares associated to principal autotopisms of long cycles. Applications in cryptography”. Falcón outlines the protocol for a cryptographical scheme that uses the F-critical sets associated with a particular Latin square to generate access levels for participants of the scheme. Accompanying the scheme is an example, which applies the protocol to a particular Latin square of order six. Exploration of the example itself, revealed some interesting observations about both the structure of the Latin square itself and the autotopisms associated with the Latin square. These observations give rise to necessary conditions for the generation of the F-critical sets associated with certain autotopisms of the given Latin square. The communication culminates with a table which outlines the various access levels for the given Latin square in accordance with the scheme detailed by Falcón.

scholarly journals Sign changes in the prime number theorem

2021 ◽  
Author(s):  
Thomas Morrill ◽  
Dave Platt ◽  
Tim Trudgian
Keyword(s):  
Prime Number ◽  
Prime Number Theorem ◽  
Sign Changes

3126. A Prime Number Conjecture

1965 ◽  
Vol 49 (369) ◽  
pp. 299
Author(s):  
T. Mitsopoulos
Keyword(s):  
Prime Number

Pointwise bound for ℓ-torsion in class groups: Elementary abelian extensions

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Jiuya Wang
Keyword(s):  
Galois Group ◽  
Prime Number ◽  
Finite Groups ◽  
Upper Bound ◽  
Abelian Groups ◽  
Class Groups ◽  
Abelian Extensions ◽  
Pointwise Bound ◽  
First Case

AbstractElementary abelian groups are finite groups in the form of {A=(\mathbb{Z}/p\mathbb{Z})^{r}} for a prime number p. For every integer {\ell>1} and {r>1}, we prove a non-trivial upper bound on the {\ell}-torsion in class groups of every A-extension. Our results are pointwise and unconditional. This establishes the first case where for some Galois group G, the {\ell}-torsion in class groups are bounded non-trivially for every G-extension and every integer {\ell>1}. When r is large enough, the unconditional pointwise bound we obtain also breaks the previously best known bound shown by Ellenberg and Venkatesh under GRH.

Latin squares from multiplication tables

2021 ◽  
Author(s):  
Michał Dębski ◽  
Jarosław Grytczuk
Keyword(s):  
Latin Squares ◽  
Multiplication Tables

scholarly journals The restricted Burnside problem for Moufang loops

2021 ◽  
pp. 1-11
Author(s):  
ALEXANDER GRISHKOV ◽  
LIUDMILA SABININA ◽  
EFIM ZELMANOV
Keyword(s):  
Prime Number ◽  
Burnside Problem ◽  
Moufang Loops ◽  
Restricted Burnside Problem ◽  
Positive Integers

Abstract We prove that for positive integers $m \geq 1, n \geq 1$ and a prime number $p \neq 2,3$ there are finitely many finite m-generated Moufang loops of exponent $p^n$ .

Sign in / Sign up

Export Citation Format

Share Document