✦ LIBER ✦

Reducibility in Finite Posets

✍ Scribed by V.S. Kharat; B.N. Waphare

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 118 KB
Volume: 22
Category: Article
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0432

No coin nor oath required. For personal study only.

✦ Synopsis

A notion of reducibility in finite posets is studied. Deletable elements in upper semimodular posets are characterized. Though it is known that the class of upper semimodular lattices is reducible, we construct an example of an upper semimodular poset that is not reducible. Reducibility of pseudocomplemented posets is studied.

📜 SIMILAR VOLUMES

Finite Posets in Uspec R[X]

✍ S. Mcadam 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 839 KB

Finite Posets and Ferrers Shapes

✍ Thomas Britz; Sergey Fomin 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 627 KB

(3.2) of the growth diagram for a permutation \_. The following theorem shows that the shape \* ij is uniquely determined by the shapes \* i1, j&1 , \* i, j&1 , and \* i&1, j , together with knowing whether \_(i)= j or not (i.e., whether (i, j) # P \_ or not). (2) If \* i, j&1 =\* i&1, j =\* i&1, j

Bipartite Posets of Finite Prinjective T

Bipartite Posets of Finite Prinjective Type

✍ Hans-Joachim von Höhne; Daniel Simson 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 351 KB

One of the main results of this paper is Theorem 1.2, which contains a characterization of finite bipartite posets I s IЈ j IЉ for which the category Ž . prin kI of prinjective modules over the incidence k-algebra kI of I is of finite representation type, where k is a field. In particular, it is sho

Algebraic properties and dismantlability

Algebraic properties and dismantlability of finite posets

✍ Benoit Larose; László Zádori 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 554 KB

We show that every finite connected poser which admits certain operations such as Gumm or J6nsson operations, or a near unanimity function is dismantlable. This result is used to prove that a finite poset admits Gumm operations if and only if it admits a near unanimity function. Finite connected pos

Representations of Finite Posets and Val

Representations of Finite Posets and Valuated Groups

✍ D. Arnold; F. Richman; C. Vinsonhaler 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 669 KB

Partitions of a finite three-complete po

Partitions of a finite three-complete poset

✍ Shiojenn Tseng; Muh-Chyi Horng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Let P be a finite poset covered by three nonempty disjoint chains 7"1, T2, and T3. Suppose that p and q are different members of P. Also, P has the property that if p and q are in different chains and p < q, then P ---above{p} u below{q}. D.E. Daykin and J.W. Daykin (1985) made the conjecture: "Ther