Heden, O., On the modular n-queen problem, Discrete Mathematics 102 (1992) 155-161. Let M(n) denote the maximum number of queens on a modular chessboard such that no two attack each other. We prove that if 4 or 6 divides n then M(n) c n -2 and if gcd(n, 24) = 8 then M(n) 2 n -2. We also show that M
On the n-Coupling Problem
✍ Scribed by Ludger Rüschendorf; Ludger Uckelmann
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 148 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0047-259X
No coin nor oath required. For personal study only.
✦ Synopsis
In this paper we obtain based on an idea of M. Knott and C. S. Smith (1994, Linear Algebra Appl. 199, 363-371) characterizations of solutions of three-coupling problems by reduction to the construction of optimal couplings of each of the variables to the sum. In the case of normal distributions this leads to a complete solution. Under a technical condition this idea also works for general distributions and one obtains explicit results. We extend these results to the n-coupling problem and derive a characterization of optimal n-couplings by several 2-coupling problems. This leads to some constructive existence results for Monge solutions.
📜 SIMILAR VOLUMES
In the end, the zombie apocalypse was nothing more than a waste disposal problem. Burn them in giant ovens? Bad optics. Bury them in landfill sites? The first attempt created acres of twitching, roiling mud. The acceptable answer is to jettison the millions of immortal automatons into orbit. Soon ea
The following problem of Yuzvinsky is solved here: how many vertices of the n-cube must be removed from it in order that no connected component of the rest contains an antipodal pair of vertices? Some further results and problems are described as well.