Combinatorics of Spreads and Parallelisms covers all known finite and infinite parallelisms as well as the planes comprising them. It also presents a complete analysis of general spreads and partitions of vector spaces that provide groups enabling the construction of subgeometry partitions of projective spaces.
The book describes general partitions of finite and infinite vector spaces, including Sperner spaces, focal-spreads, and their associated geometries. Since retraction groups provide quasi-subgeometry and subgeometry partitions of projective spaces,...
Combinatorics of Spreads and Parallelisms covers all known finite and infinite parallelisms as well as the planes comprising them....
This collection of articles is dedicated to Frank Spitzer on the occasion of his 65th birthday. The articles, written by a group of his friends, colleagues, former students and coauthors, are intended to demonstrate the major influence Frank has had on probability theory for the last 30 years and most likely will have for many years to come. Frank has always liked new phenomena, clean formulations and elegant proofs. He has created or opened up several research areas and it is not surprising that many people are still working out the consequences of his inventions. By way of introduction we...
This collection of articles is dedicated to Frank Spitzer on the occasion of his 65th birthday. The articles, written by a group of his friends, colle...
First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory,...
First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally used to provide a polynomial-time algorithm fo...
4 
