๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Another Proof of Gluck's Theorem

โœ Scribed by Hiroshi Matsuyama


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
56 KB
Volume
247
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

โœฆ Synopsis


In this article, G is a permutation group on a finite set . We write permutations on the right, so that ฮฑg is the image of ฮฑ โˆˆ by the action of g โˆˆ G. A subset S of is said to be G-regular if the stabilizer g โˆˆ G Sg = S is the identity.

Our purpose is to give a direct short proof of the following theorem by Gluck [3, Corollary 3.3].

Gluck's Theorem. Let G be a permutation group of odd order on a finite set . Then G has a regular subset in .


๐Ÿ“œ SIMILAR VOLUMES


Another Algebraic Proof of Bondy's Theor
โœ Andreas Winter ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 88 KB

Bondy proved in 1972 that, given a family of n distinct substes of a set X of n elements, one can delete an element of X such that the truncated sets remain distinct. We give a linear algebraic proof of this result and generalize it to codes of minimal distance d.

Another Simple Proof of a Theorem of Mil
โœ A.D Scott ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 74 KB

In this note we give a short proof of a theorem of Milner concerning intersecting Sperner systems. ## 1999 Academic Press An intersecting Sperner system on [n]=[1, ..., n] is a collection of subsets of [n], no pair of which is either disjoint or nested. Milner [2] proved that an intersecting Sperner

Another Proof of a Theorem of J. A. Gree
โœ Kenichi Yamauchi ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 53 KB

DEDICATED TO PROFESSORS EIICHI BANNAI AND ETSUKO BANNAI J. A. Green proved a theorem which is the converse of a theorem of R. Brauer ลฝ . 1955, Proc. Camb. Philos. Soc. 51, 237แސ239 . The present author gave another proof of the theorem by making an application of the characteristic class functions of

A Proof of Shirshov's Theorem
โœ Giuseppe Pirillo ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 188 KB

Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo

More proofs of menger's theorem
โœ C. St. J. A. Nash-Williams; W. T. Tutte ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 231 KB

## Abstract Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph __G__ if it holds for the graphs obtained from __G__ by deleting and contracting the same edge. The other two prove the directed version of

A simple proof of Moser's theorem
โœ Zhu, Xuding ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 243 KB ๐Ÿ‘ 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.