31 search results - page 1 / 7 » Finite Posets and their Representation Algebras |
91
Voted
IJAC
2010
14 years 7 months ago
2010
A finite poset (P S) determines a finite dimensional algebra TP over the field over the field F of two elements, with an upper triangular representation. We determine the structure...
71
Voted
DM
2008
15 years 25 days ago
2008
The poset retraction problem for a poset P is whether a given poset Q containing P as a subposet admits a retraction onto P, that is, whether there is a homomorphism from Q onto P...
98
Voted
ORDER
2008
15 years 21 days ago
2008
For a Heyting algebra A, we show that the following conditions are equivalent: (i) A is profinite; (ii) A is finitely approximable, complete, and completely join-prime generated; (...
84
Voted
DM
1999
15 years 13 days ago
1999
Abstract. Given a partially ordered set P = (X; P ), a function F which assigns to each x 2 X a set F (x) so that x y in P if and only if F (x) F (y) is called an inclusion represe...
108
Voted
FUIN
2007
15 years 21 days ago
2007
The paper is concerned with algebras whose elements can be used to represent runs of a system, called processes. These algebras, called behaviour algebras, are categories with resp...