Results 101 to 110 of about 413 (140)

Cayley tables and associativity

The Mathematical Gazette, 1978
Some of the group axioms are easy to check. The entries within the table are those outside, so the set is closed under the operation. The first row and column inside the table copy the row and column at the top and side, so 1 is a two-sided identity.
openaire   +2 more sources

Gradient based fractal image compression using Cayley table

Measurement, 2019
Abstract Encoding complexity reduction is an active area of research in the field of fractal image compression. In this proposed method, affine transformation is predicted to reduce the computational complexity and score value is calculated to further minimise the number of computations in the exhaustive process of encoding.
K. Sheeba, M. Abdul Rahiman
openaire   +1 more source

Weak Cayley tables and generalized centralizer rings of finite groups

Mathematical Proceedings of the Cambridge Philosophical Society, 2012
AbstractFor a finite groupGwe study certain rings(k)Gcalledk-S-rings, one for eachk≥ 1, where(1)Gis the centraliser ringZ(ℂG) ofG. These rings have the property that(k+1)Gdetermines(k)Gfor allk≥ 1. We study the relationship of(2)Gwith the weak Cayley table ofG.
Humphries, Stephen P., Rode, Emma L.
openaire   +2 more sources

On the category of weak Cayley table morphisms between groups

Selecta Mathematica, 2007
Weak Cayley table functions between groups are generalized conjugacy-preserving homomorphisms, under which products of images are conjugate to images of products. There is a weak Cayley table bijection between two groups iff they have the same 2-characters.
K. W. Johnson, J. D. H. Smith
openaire   +1 more source

Weak Cayley Table Groups II: Alternating Groups and Finite Coxeter Groups

Communications in Algebra, 2015
A weak Cayley table isomorphism is a bijection φ: G → H of groups such that φ(xy) ∼ φ(x)φ(y) for all x, y ∈ G. Here ∼denotes conjugacy. When G = H the set of all weak Cayley table isomorphisms φ: G → G forms a group 𝒲(G) that contains the automorphism group Aut(G) and the inverse map I: G → G, x → x −1.
Stephen P. Humphries, Long Nguyen
openaire   +1 more source

The Cayley Addition Table of Z n

The American Mathematical Monthly, 1999
(1999). The Cayley Addition Table of Zn. The American Mathematical Monthly: Vol. 106, No. 6, pp. 584-585.
openaire   +1 more source

Efficiency of Computation of Cayley Tables of 2-Groups

Journal of the ACM, 1976
Two algorithms for computing the multiplication table of a 2-group are described and discussed. One of the algorithms works in an element-by-element fashion; the other works in terms of subgroups generated by initial subsequences of the given sequence of generators.
openaire   +2 more sources

Weak Cayley table groups III:PSL(2,q)

Communications in Algebra, 2016
ABSTRACTA weak Cayley table isomorphism is a bijection φ:G→H of groups such that φ(xy)∼φ(x)φ(y) for all x,y∈G. Here ∼ denotes conjugacy. When G = H the set of all weak Cayley table isomorphisms φ:G→G forms a group 𝒲(G) that contains the automorphism group Aut(G) and the inverse map I:G→G,x↦x−1.
Stephen P. Humphries, Long Nguyen
openaire   +1 more source

On the spectrum of Cayley graphs via character table

2014
A Cayley graph can be consider as an interpretation of group representation. This means that one can construct the Cayley graph Г = Cay(G, S) by having the vertex set to be the elements of G with g~h if and only if hg-1 e S. In this paper, we focus our attention on Cayley graphs with a normal symmetric subset.
Nowroozi, Farzaneh, Ghorbani, Modjtaba
openaire   +1 more source