نتایج جستجو برای: s posets

تعداد نتایج: 712805  

Journal: :Discrete Applied Mathematics 2005
Yi Wang

A long-standing conjecture states that all LYM posets possess nested chain partitions. We verify this conjecture for posets of rank 2. © 2004 Elsevier B.V. All rights reserved.

Journal: :Electr. J. Comb. 2004
Petter Brändén

We generalize the notion of graded posets to what we call sign-graded (labeled) posets. We prove that the W -polynomial of a sign-graded poset is symmetric and unimodal. This extends a recent result of Reiner and Welker who proved it for graded posets by associating a simplicial polytopal sphere to each graded poset. By proving that the W -polynomials of sign-graded posets has the right sign at...

Journal: :Electronic Journal of Combinatorics 2021

We define posets of types B, C, and D. These encode the matrix forms certain Lie algebras which lie between upper-triangular diagonal matrices. Our primary concern is index spectral theories such type-B, D poset algebras. For an important restricted class, we develop combinatorial formulas and, in particular, characterize corresponding to Frobenius In this latter case show that spectrum binary;...

2005
Katarína Lendelová

The aim of this paper is to create the probability theory on L-posets. We show some known examples of L-posets and their probabilities and observables.

Journal: :Discrete Math., Alg. and Appl. 2013
Proceso L. Fernandez Lenwood S. Heath Naren Ramakrishnan Michael Tan John Paul C. Vergara

There has been much research on the combinatorial problem of generating the linear extensions of a given poset. This paper focuses on the reverse of that problem, where the input is a set of linear orders, and the goal is to construct a poset or set of posets that generates the input. Such a problem finds applications in computational neuroscience, systems biology, paleontology, and physical pl...

Journal: :Formalized Mathematics 2014
Kazuhisa Ishida Yasunari Shidama Adam Grabowski

This text includes the definition and basic notions of product of posets, chain-complete and flat posets, flattening operation, and the existence theorems of recursive call using the flattening operator. First part of the article, devoted to product and flat posets has a purely mathematical quality. Definition 3 allows to construct a flat poset from arbitrary non-empty set [12] in order to prov...

2004
Piotr Rudnicki

(2) Let L, S, T be complete non empty posets, f be a CLHomomorphism of L, S, and g be a CLHomomorphism of S, T . Then g · f is a CLHomomorphism of L, T . (3) For every non empty relational structure L holds idL is infs-preserving. (4) For every non empty relational structure L holds idL is directed-sups-preserving. (5) For every complete non empty poset L holds idL is a CLHomomorphism of L, L. ...

Journal: :Mathematical Structures in Computer Science 2008
Francesca Cagliari Sandra Mantovani

Given a map f in the category ω-Cpo of ω-complete posets, exponentiability of f in ω-Cpo easily implies exponentiability of f in the category Pos of posets, while the converse is not true. We find then the extra conditions needed on f exponentiable in Pos to be exponentiable in ω-Cpo, showing the existence of partial products of the two-point ordered set S = {0 < 1} (Theorem 1.8). Using this ch...

Journal: :Journal of Combinatorial Theory, Series A 1993

Journal: :Discrete & Computational Geometry 2004

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید