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.
An Algebraic Proof of Barlet's Join Theorem
โ Scribed by John Dalbec
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 289 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0885-064X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let A=(a i, j ) be an n\_n 0-1 matrix. Let S be the set of permutations \_ of [n] such that a i, \_(i) =1 for i=1, 2, ..., n. Then, the permanent of A is perm(A) = def |S|. For a pair of random variables (X, Y ) (with some joint distribution) and x # support[X ], let Y x be a random variable such t
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 t
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
## 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