Some finite congruence lattices, I
On the structure of quasi-ordering lattices
Representing lattices by homotopy groups of graphs
In this paper we represent every lattice by subgroups of free groups using the concept of the homotopy group of a graph.
A simple geometric proof of a theorem on
On a question of K. Leeb
On infinite partition representations and their finite quotients
On the number of binary signed digit representations of a given weight
Binary signed digit representations (BSDR’s) of integers have been studied since the 1950’s. Their study was originally motivated by multiplication and division algorithms for integers and later by arithmetics on elliptic curves. Our paper is motivated by differential cryptanalysis of hash functions. We give an upper bound for the number of BSDR’s of a given weight. Our result improves the upper bound on the number of BSDR’s with minimal weight stated by Grabner and Heuberger in On the number of...
Announcements of new results
Every finite lattice can be embedded in the lattice of all equivalences over a finite set (Preliminary communication)
Congruence lattices of free lattices in non-distributive varieties
Remarks on equational theories of semilattices with operators
Note on homomorphism interpolation theorem
Matematické hlavolamy a základy teorie grup
Page 1