Results 101 to 110 of about 619 (166)
Let \(P\) be a poset with \(n\) elements and fixed labeling of the elements of \(P\) (i.e. a bijection \(f\) from \(P\) to \(\{1,2,\dots,n\}\)). One may consider the linear extensions (of the partial ordering) of \(P\) as permutations of the labeling.
openaire +1 more source
Study on web pillar failure mechanism during auger mining and its associated risk assessment. [PDF]
Jiang J +5 more
europepmc +1 more source
Arrow Contraction and Expansion in Tropical Diagrams. [PDF]
Matveev R, Portegies JW.
europepmc +1 more source
Implication in finite posets with pseudocomplemented sections. [PDF]
Chajda I, Länger H.
europepmc +1 more source
Forcing axioms and the complexity of non-stationary ideals. [PDF]
Cox S, Lücke P.
europepmc +1 more source
Parametrized topological complexity of poset-stratified spaces. [PDF]
Tanaka K.
europepmc +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Couceiro M, Duffus D.
europepmc +1 more source
Thin Posets, CW Posets, and Categorification
Motivated by generalizing Khovanov's categorification of the Jones polynomial, we study functors $F$ from thin posets $P$ to abelian categories $\mathcal{A}$. Such functors $F$ produce cohomology theories $H^*(P,\mathcal{A},F)$. We find that CW posets, that is, face posets of regular CW complexes, satisfy conditions making them particularly suitable ...
openaire +2 more sources
The structure of κ-maximal cofinitary groups. [PDF]
Fischer V, Switzer CB.
europepmc +1 more source
Poset games are two-player impartial combinatorial games, with normal play convention. Starting with any poset, the players take turns picking an element of the poset, and removing that and all larger elements from the poset. Examples of poset games include Chomp, Nim, Hackendot, Subset-Takeaway, and others. We prove a general theorem about poset games,
openaire +2 more sources

