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 pseudocom
โฆ LIBER โฆ
Finite Posets in Uspec R[X]
โ Scribed by S. Mcadam
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 839 KB
- Volume
- 172
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Reducibility in Finite Posets
โ
V.S. Kharat; B.N. Waphare
๐
Article
๐
2001
๐
Elsevier Science
๐
English
โ 118 KB
R-Automorphisms of finite order in RใXใ
โ
Paul Eakin; Avinash Sathaye
๐
Article
๐
1980
๐
Elsevier Science
๐
English
โ 534 KB
The poset of conjugacy classes of subgro
โ
Volkmar Welker
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 788 KB
Matchings, cutsets, and chain partitions
โ
Jerrold R. Griggs
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 612 KB
Phenotype and X inactivation in 45,X/46,
โ
Leppig, Kathleen A. ;Sybert, Virginia P. ;Ross, Judith L. ;Cunniff, Christopher
๐
Article
๐
2004
๐
John Wiley and Sons
๐
English
โ 163 KB
๐ 1 views
Finite dimensional linear systems : R.E.
โ
Daniel Tabak
๐
Article
๐
1971
๐
Elsevier Science
๐
English
โ 102 KB
## Reviews knowledge, and its aim is not to achieve computational facility but to exhibit some of the interesting relations that exist in arithmetic. The book begins with a discussion of counting and its relation to physical measurement. The various historical number systems are considered, the su