Economical Coverings of Sets of Lattice Points.
Edge-coloured designs with block size four.
Edon- – an efficient implementation of Edon- family of cryptographic hash functions
We have designed three fast implementations of a recently proposed family of hash functions Edon–. They produce message digests of length bits and project security of hash computations for finding collisions and hash computations for finding preimages and second preimages. The design is not the classical Merkle-Damgård but can be seen as wide-pipe iterated compression function. Moreover the design is based on using huge quasigroups of orders , and that are constructed by using only bitwise...
Efficient covering designs of the complete graph.
Efficient packing of unit squares in a square.
Eigenvalues of nonsingular matices and combinatorial applications
Ein Extremalproblem für Matrizen aus Nullen und Eisen.
Eine Charakterisierung der (i, j)-Pläne.
Eine gemeinsame Verallgemeinerung von Boses's erster und zweiter Differenzenmethode.
Eine homologische Interpretation gewisser Inzidenzmatrizen mod p.
Einige einfache fahnenhomogene 3-Blockpläne.
El diámetro de ciertos digrafos circulantes de triple paso.
This paper studies some diameter-related properties of the 3-step circulant digraphs with set of vertices V≡ZN and steps (± a,b). More precisely, it concentrates upon maximizing their order N for any fixed value of their diameter k. In the proposed geometrical approach, each digraph is fully represented by a T-shape tile which tessellates periodically the plane. The study of these tiles leads to the optimal solutions.
Elliptic semiplanes and group divisible designs with orthogonal resolutions.
Embedding -homogeneous latin trades into abelian -groups
Let be a partial latin square and be a latin square with . We say that is a latin trade if there exists a partial latin square with such that is a latin square. A -homogeneous latin trade is one which intersects each row, each column and each entry either or times. In this paper, we show the existence of -homogeneous latin trades in abelian -groups.
Embedding properties of endomorphism semigroups
Denote by PSelf Ω (resp., Self Ω) the partial (resp., full) transformation monoid over a set Ω, and by Sub V (resp., End V) the collection of all subspaces (resp., endomorphisms) of a vector space V. We prove various results that imply the following: (1) If card Ω ≥ 2, then Self Ω has a semigroup embedding into the dual of Self Γ iff . In particular, if Ω has at least two elements, then there exists no semigroup embedding from Self Ω into the dual of PSelf Ω. (2) If V is infinite-dimensional, then...
Empilements de cercles et théorème de Liouville (d'après T. Dubejko)
Empilements de sphères
Endliche minkowskische Ebenen von Charakteristik ... 2.
e-Nets and Simplex Range Queries.
Enumeration of permutations by rises and cycle structure.