✦ LIBER ✦

Algorithms for Finite Near-rings and theirN-groups

✍ Scribed by Franz Binder; Peter Mayr

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 337 KB
Volume: 32
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0449

No coin nor oath required. For personal study only.

✦ Synopsis

In this note, we present algorithms to deal with finite near-rings, the appropriate algebraic structure to study non-linear functions on finite groups. Just as rings (of matrices) operate on vector spaces, near-rings operate on groups. In our approach, we have developed efficient algorithms for a variety of problems that involve the structure of the operation of a near-ring on a group. From this, we retrieve information about the near-ring itself.

📜 SIMILAR VOLUMES

Algorithmic Methods for Finitely Generat

Algorithmic Methods for Finitely Generated Abelian Groups

✍ Henri Cohen; Francisco Diaz Y Diaz; Michel Olivier 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 357 KB

We describe algorithmic tools to compute with exact sequences of Abelian groups. Although simple in nature, these are essential for a number of applications such as the determination of the structure of (Z K /m) \* for an ideal m of a number field K, of ray class groups of number fields, and of cond

Finite Groups over Arithmetical Rings an

Finite Groups over Arithmetical Rings and Globally Irreducible Representations

✍ F. Van Oystaeyen; A.E. Zalesski ĭ 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 142 KB

Given the ring of integers R of an algebraic number field K, for which natural Ž . number n is there a finite group G ; GL n, R such that RG, the R-span of G, Ž . Ž . Ž . coincides with M n, R , the ring of n = n -matrices over R? Given G ; GL n, R Ž . we show that RG s M n, R if and only if the Bra

Finite Affine Groups: Cycle Indices, Hal

Finite Affine Groups: Cycle Indices, Hall–Littlewood Polynomials, and Probabilistic Algorithms

✍ Jason Fulman 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The study of asymptotic properties of the conjugacy class of a random element of the finite affine group leads one to define a probability measure on the set of all partitions of all positive integers. Four different probabilistic understandings of this measure are given-three using symmetric functi

The iterative group implicit algorithm f

The iterative group implicit algorithm for parallel transient finite element analysis

✍ Sukomal Modak; Elisa D. Sotelino 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB 👁 2 views

The Iterative Group Implicit (IGI) algorithm is developed for the parallel solution of general structural dynamic problems. In this method the original structure is partitioned into a number of a subdomains. Each subdomain is solved independently and therefore concurrently, using any traditional dir

Algorithms for Matrix Groups and the Tit

Algorithms for Matrix Groups and the Tits Alternative

✍ Robert Beals 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 224 KB

Tits has shown that a finitely generated matrix group either contains a nonabelian free group or has a solvable subgroup of finite index. We give a polynomial time algorithm for deciding which of these two conditions holds for a given finitely generated matrix group over an algebraic number field. N

Finitely Determined Members of Varieties

Finitely Determined Members of Varieties of Groups and Rings

✍ Oleg Belegradek 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 138 KB

A finitely generated algebra A in a variety V V is called finitely determined in V V if there exists a finite V V-consistent set of equalities and inequalities in an alphabet containing the generating set of A, which, together with the identities of V V , yields all relations and non-relations of A.