𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bases for permutation groups and matroids

✍ Scribed by P.J Cameron; D.G Fon-Der-Flaass

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
474 KB
Volume
16
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Bases for Primitive Permutation Groups a
Bases for Primitive Permutation Groups and a Conjecture of Babai
✍ David Gluck; Ákos Seress; Aner Shalev πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 171 KB

A base of a permutation group G is a sequence B of points from the permutation domain such that only the identity of G fixes B pointwise. We show that primitive permutation groups with no alternating composition factors of degree greater than d and no classical composition factors of rank greater th

A Constructive Description of SAGBI Base
A Constructive Description of SAGBI Bases for Polynomial Invariants of Permutation Groups
✍ Manfred GΓΆbel πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 482 KB

This note presents a detailed analysis and a constructive combinatorial description of SAGBI bases for the R-algebra of G-invariant polynomials. Our main result is a ground ring independent characterization of all rings of polynomial invariants of permutation groups G having a finite SAGBI basis.

A Random Base Change Algorithm for Permu
A Random Base Change Algorithm for Permutation Groups
✍ Gene Cooperman; Larry Finkelstein πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 549 KB

A new random base change algorithm is presented for a permutation group \(G\) acting on \(n\) points whose worst case asymptotic running time is better for groups with a small to moderate size base than any known deterministic algorithm. To achieve this time bound, the algorithm requires a random ge