Page 1 Next

Displaying 1 – 20 of 103

Showing per page

A transvection decomposition in GL(n,2)

Clorinda De Vivo, Claudia Metelli (2002)

Colloquium Mathematicae

An algorithm is given to decompose an automorphism of a finite vector space over ℤ₂ into a product of transvections. The procedure uses partitions of the indexing set of a redundant base. With respect to tents, i.e. finite ℤ₂-representations generated by a redundant base, this is a decomposition into base changes.

Adjoint Semilattice and Minimal Brouwerian Extensions of a Hilbert Algebra

Jānis Cīrulis (2012)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

Let A : = ( A , , 1 ) be a Hilbert algebra. The monoid of all unary operations on A generated by operations α p : x ( p x ) , which is actually an upper semilattice w.r.t. the pointwise ordering, is called the adjoint semilattice of A . This semilattice is isomorphic to the semilattice of finitely generated filters of A , it is subtractive (i.e., dually implicative), and its ideal lattice is isomorphic to the filter lattice of A . Moreover, the order dual of the adjoint semilattice is a minimal Brouwerian extension of A , and the...

Boolean matrices ... neither Boolean nor matrices

Gabriele Ricci (2000)

Discussiones Mathematicae - General Algebra and Applications

Boolean matrices, the incidence matrices of a graph, are known not to be the (universal) matrices of a Boolean algebra. Here, we also show that their usual composition cannot make them the matrices of any algebra. Yet, later on, we "show" that it can. This seeming paradox comes from the hidden intrusion of a widespread set-theoretical (mis) definition and notation and denies its harmlessness. A minor modification of this standard definition might fix it.

Class preserving mappings of equivalence systems

Ivan Chajda (2004)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

By an equivalence system is meant a couple 𝒜 = ( A , θ ) where A is a non-void set and θ is an equivalence on A . A mapping h of an equivalence system 𝒜 into is called a class preserving mapping if h ( [ a ] θ ) = [ h ( a ) ] θ ' for each a A . We will characterize class preserving mappings by means of permutability of θ with the equivalence Φ h induced by h .

Compatible Idempotent Terms in Universal Algebra

Ivan Chajda, Antonio Ledda, Francesco Paoli (2014)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

In universal algebra, we oftentimes encounter varieties that are not especially well-behaved from any point of view, but are such that all their members have a “well-behaved core”, i.e. subalgebras or quotients with satisfactory properties. Of special interest is the case in which this “core” is a retract determined by an idempotent endomorphism that is uniformly term definable (through a unary term t ( x ) ) in every member of the given variety. Here, we try to give a unified account of this phenomenon....

Congruence lattices of intransitive G-Sets and flat M-Sets

Steve Seif (2013)

Commentationes Mathematicae Universitatis Carolinae

An M-Set is a unary algebra X , M whose set M of operations is a monoid of transformations of X ; X , M is a G-Set if M is a group. A lattice L is said to be represented by an M-Set X , M if the congruence lattice of X , M is isomorphic to L . Given an algebraic lattice L , an invariant Π ( L ) is introduced here. Π ( L ) provides substantial information about properties common to all representations of L by intransitive G-Sets. Π ( L ) is a sublattice of L (possibly isomorphic to the trivial lattice), a Π -product lattice. A Π -product...

Definability for equational theories of commutative groupoids

Jaroslav Ježek (2012)

Czechoslovak Mathematical Journal

We find several large classes of equations with the property that every automorphism of the lattice of equational theories of commutative groupoids fixes any equational theory generated by such equations, and every equational theory generated by finitely many such equations is a definable element of the lattice. We conjecture that the lattice has no non-identical automorphisms.

Disjoint and complete unions of incidence structures

František Machala, Marek Pomp (1997)

Mathematica Bohemica

Some decompositions of general incidence structures with regard to distinguished components (modular or simple) are considered and several structure theorems for them are deduced.

Currently displaying 1 – 20 of 103

Page 1 Next