Page 1 Next

Displaying 1 – 20 of 43

Showing per page

A computation of positive one-peak posets that are Tits-sincere

Marcin Gąsiorek, Daniel Simson (2012)

Colloquium Mathematicae

A complete list of positive Tits-sincere one-peak posets is provided by applying combinatorial algorithms and computer calculations using Maple and Python. The problem whether any square integer matrix A ( ) is ℤ-congruent to its transpose A t r is also discussed. An affirmative answer is given for the incidence matrices C I and the Tits matrices C ̂ I of positive one-peak posets I.

Combinatorial trees in Priestley spaces

Richard N. Ball, Aleš Pultr, Jiří Sichler (2005)

Commentationes Mathematicae Universitatis Carolinae

We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting n -crowns with n 3 does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.

Commutative directoids with sectional involutions

Ivan Chajda (2007)

Discussiones Mathematicae - General Algebra and Applications

The concept of a commutative directoid was introduced by J. Ježek and R. Quackenbush in 1990. We complete this algebra with involutions in its sections and show that it can be converted into a certain implication algebra. Asking several additional conditions, we show whether this directoid is sectionally complemented or whether the section is an NMV-algebra.

Compact pospaces

Venu G. Menon (2003)

Commentationes Mathematicae Universitatis Carolinae

Posets with property DINT which are compact pospaces with respect to the interval topologies are characterized.

Definition of Flat Poset and Existence Theorems for Recursive Call

Kazuhisa Ishida, Yasunari Shidama, Adam Grabowski (2014)

Formalized Mathematics

This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to provide formal apparatus which eanbles to work with recursive calls within the Mizar langauge. To achieve this...

Directoids with sectionally switching involutions

Ivan Chajda (2006)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

It is shown that every directoid equipped with sectionally switching mappings can be represented as a certain implication algebra. Moreover, if the directoid is also commutative, the corresponding implication algebra is defined by four simple identities.

Discriminator order algebras

Ivan Chajda (2008)

Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica

We prove that an order algebra assigned to a bounded poset with involution is a discriminator algebra.

Currently displaying 1 – 20 of 43

Page 1 Next