Generalised Semiplanes and Certain Divisible Partial Designs.
Generalization of one Baer's theorem for nets
Generalizations of Cole's Systems
There are four resolvable Steiner triple systems on fifteen elements. Some generalizations of these systems are presented here.
Generalizations of partial difference sets from cyclotomy to nonelementary Abelian -groups.
Generalized indices of Boolean matrices
We obtain upper bounds for generalized indices of matrices in the class of nearly reducible Boolean matrices and in the class of critically reducible Boolean matrices, and prove that these bounds are the best possible.
Generalized Weisner designs and quasigroups.
Generalized Whitney partitions
We prove that the upper Minkowski dimension of a compact set Λ is equal to the convergence exponent of any packing of the complement of Λ with polyhedra of size not smaller than a constant multiple of their distance from Λ.
Generating functions for directed animals convex following their direction.
Generating quasigroups for cryptographic applications
A method of generating a practically unlimited number of quasigroups of a (theoretically) arbitrary order using the computer algebra system Maple 7 is presented. This problem is crucial to cryptography and its solution permits to implement practical quasigroup-based endomorphic cryptosystems. The order of a quasigroup usually equals the number of characters of the alphabet used for recording both the plaintext and the ciphertext. From the practical viewpoint, the most important quasigroups are of...
Generating random elements of finite distributive lattices.
Generating sets in Steiner triple systems
Génération automatique de mots circulaires et équilibres
Generation of optimal packings from optimal packings.
Geometric algorithms and combinatorial optimization [Book]
Geometric algorithms and combinatorial optimization [Book]
Geometric hyperquasigroups and line spaces
Geometrie und Kombinatorik.
Géométries combinatoires finies
Geometry and combinatorics related to vector partition functions
Going down in (semi)lattices of finite Moore families and convex geometries
In this paper we first study what changes occur in the posets of irreducible elements when one goes from an arbitrary Moore family (respectively, a convex geometry) to one of its lower covers in the lattice of all Moore families (respectively, in the semilattice of all convex geometries) defined on a finite set. Then we study the set of all convex geometries which have the same poset of join-irreducible elements. We show that this set—ordered by set inclusion—is a ranked join-semilattice and we...