Results 31 to 40 of about 32,895 (317)
GENERALISING GROUP ALGEBRAS [PDF]
This paper has been ...
openaire +4 more sources
Intuitionistic fuzzy group algebra [PDF]
This paper introduces the concept of an intuitionistic fuzzy group algebra associated with a finite group G and an intuitionistic fuzzy group A on G.
Poonam Kumar Sharma
doaj +1 more source
A Tauberian Group Algebra [PDF]
Let G be the group of real matrices \[ ( x , y ) = ( e x
openaire +1 more source
Algebraic automorphism groups of pro-affine algebraic groups [PDF]
We study the maximum connected algebraic subgroup of automorphisms of certain pro-affine algebraic groups.
openaire +2 more sources
Universal Framework for Quantum Error-Correcting Codes
We present a universal framework for quantum error-correcting codes, i.e., a framework that applies to the most general quantum error-correcting codes. This framework is based on the group algebra, an algebraic notation associated with nice error bases ...
Zhuo Li, Lijuan Xing
doaj +1 more source
Codes in Dihedral Group Algebra
Robert McEliece developed an asymmetric encryption algorithm based on the use of binary Goppa codes in 1978 and no effective key attacks has been described yet.
Kirill V. Vedenev, Vladimir M. Deundyak
doaj +1 more source
Speed of convergence of complementary probabilities on finite group
Let function P be a probability on a finite group G, i.e. $P(g)\geq0\ $ $(g\in G),\ \sum\limits_{g}P(g)=1$ (we write $\sum\limits_{g}$ instead of $\sum\limits_{g\in G})$.
Alexander Vyshnevetskiy
doaj +1 more source
Let \(KG\) be the group ring of a group \(G\) over a ring \(K\). An element \(\alpha\in KG\) is said to be algebraic over \(K\) if there exists a non-constant polynomial \(f(x)\in K[x]\) such that \(f(\alpha)=0\). In this paper the author makes a survey of the main results in the theory of group rings for algebraic elements which are obtained in recent
openaire +2 more sources
On Coloring of Fractional Powers of Star, Wheel, Friendship, and Fan Graphs
Let G be a simple, connected, and undirected graph. For m, n ∈ ℕ, the fractional power Gm/n = (G1/n)m of G is constructed by taking the n-subdivision of G (replacing each edge by a path of length n), and then raising the resulting graph to the m-th power
Farisan Hafizh +4 more
doaj +1 more source

