The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying 561 – 580 of 659

Showing per page

On uniform dimensions of finite groups

J. Krempa, A. Sakowicz (2001)

Colloquium Mathematicae

Let G be any finite group and L(G) the lattice of all subgroups of G. If L(G) is strongly balanced (globally permutable) then we observe that the uniform dimension and the strong uniform dimension of L(G) are well defined, and we show how to calculate these dimensions.

On unique factorization semilattices

Pedro V. Silva (2000)

Discussiones Mathematicae - General Algebra and Applications

The class of unique factorization semilattices (UFSs) contains important examples of semilattices such as free semilattices and the semilattices of idempotents of free inverse monoids. Their structural properties allow an efficient study, among other things, of their principal ideals. A general construction of UFSs from arbitrary posets is presented and some categorical properties are derived. The problem of embedding arbitrary semilattices into UFSs is considered and complete characterizations...

On varieties of pseudo M V -algebras

Ján Jakubík (2003)

Czechoslovak Mathematical Journal

In this paper we investigate the relation between the lattice of varieties of pseudo M V -algebras and the lattice of varieties of lattice ordered groups.

One-way communication complexity of symmetric boolean functions

Jan Arpe, Andreas Jakoby, Maciej Liśkiewicz (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study deterministic one-way communication complexity of functions with Hankel communication matrices. Some structural properties of such matrices are established and applied to the one-way two-party communication complexity of symmetric Boolean functions. It is shown that the number of required communication bits does not depend on the communication direction, provided that neither direction needs maximum complexity. Moreover, in order to obtain an optimal protocol, it is in any case sufficient...

Currently displaying 561 – 580 of 659