Incidence poset

In mathematics, an incidence poset or incidence order is a type of partially ordered set that represents the incidence relation between vertices and… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Let A be finite relational structure of finite type, and let CSP (A) denote the following decision problem: if I is a given… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
Beginning from only a countable dense set of events and the causality relation, it is possible to reconstruct a globally… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This correspondence presents three algebraic methods for constructing low-density parity-check (LDPC) codes. These methods are… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e., that all maximal faces have… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1986
1986
Nitrogen fixing trees and shrubs may be useful in revegetation efforts. The possibility that soil and environmental factors may… (More)
  • table 1
  • table 2
  • table 4
  • table 3
  • table 5
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The Bruhat posets (arising from Weyl groups) which are lattices are classified. Seshadri's standard monomial result for miniscule… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In this paper we study shellable posets (partially ordered sets), that is, finite posets such that the simplicial complex of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Highly Cited
1976
A standard problem in combinatorial theory is to characterize structures which satisfy a certain property by providing a minimum… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 4
Is this relevant?