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

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

Displaying 441 – 460 of 659

Showing per page

On the concreteness of quantum logics

Pavel Pták, John David Maitland Wright (1985)

Aplikace matematiky

It is shown that for any quantum logic L one can find a concrete logic K and a surjective homomorphism f from K onto L such that f maps the centre of K onto the centre of L . Moreover, one can ensure that each finite set of compatible elements in L is the image of a compatible subset of K . This result is “best possible” - let a logic L be the homomorphic image of a concrete logic under a homomorphism such that, if F is a finite subset of the pre-image of a compatible subset of L , then F is compatible....

On the construction and the realization of wild monoids

Pavel Růžička (2018)

Archivum Mathematicum

We develop elementary methods of computing the monoid 𝒱 ( R ) for a directly-finite regular ring R . We construct a class of directly finite non-cancellative refinement monoids and realize them by regular algebras over an arbitrary field.

On the construction of dense lattices with a given automorphisms group

Philippe Gaborit, Gilles Zémor (2007)

Annales de l’institut Fourier

We consider the problem of constructing dense lattices in n with a given non trivial automorphisms group. We exhibit a family of such lattices of density at least c n 2 - n , which matches, up to a multiplicative constant, the best known density of a lattice packing. For an infinite sequence of dimensions n , we exhibit a finite set of lattices that come with an automorphisms group of size n , and a constant proportion of which achieves the aforementioned lower bound on the largest packing density. The algorithmic...

On the distributive radical of an Archimedean lattice-ordered group

Ján Jakubík (2009)

Czechoslovak Mathematical Journal

Let G be an Archimedean -group. We denote by G d and R D ( G ) the divisible hull of G and the distributive radical of G , respectively. In the present note we prove the relation ( R D ( G ) ) d = R D ( G d ) . As an application, we show that if G is Archimedean, then it is completely distributive if and only if it can be regularly embedded into a completely distributive vector lattice.

On the dynamics of (left) orderable groups

Andrés Navas (2010)

Annales de l’institut Fourier

We develop dynamical methods for studying left-orderable groups as well as the spaces of orderings associated to them. We give new and elementary proofs of theorems by Linnell (if a left-orderable group has infinitely many orderings, then it has uncountably many) and McCleary (the space of orderings of the free group is a Cantor set). We show that this last result also holds for countable torsion-free nilpotent groups which are not rank-one Abelian. Finally, we apply our methods to the case of braid...

Currently displaying 441 – 460 of 659