본문 바로가기

The Gold Partition Conjecture and the Lexicographic Sum of Posets

문서 유형
연구출판물 · 학술지 논문
등재
SCIEScopus
저널 순위
JCR Q4Scopus Q3
피인용
Web of Science 0Scopus 0
JCR IF
JCR 2024 0.3
ISSN
0167-8094

저자

  1. Dolores-Cuenca, Eric제1저자교신저자Yonsei Univ, Dept Math, 50 Yonsei Ro, Seoul 03722, South Korea
  2. Guzman-Saenz, AldoIBM Corp, Thomas J Watson Res Ctr, 1101 Kitchawan Rd, Yorktown Hts, NY 10598 USA
  3. 김상일Pusan Natl Univ, Dept Math, 2 Busandaehak Ro 63 Beon Gil, Pusan 46241, South Korea

초록

We prove that if a finite poset Q satisfies the Gold Partition Conjecture, and P is a finite poset, then for any i is an element of P the lexicographic sum P degrees(i) Q of P with Q on the point i, satisfies the Gold Partition Conjecture. Let L( P) be the set of linearizations of P, e( P) = # L( P), P(x < y) = #{f is an element of L(P)|x< (f) y}|/e(P), and delta(P) = max(x, y is an element of P) min{P(x < y), P(y < x)}. We describe the behavior of those numbers when P is a lexicographic sum. Namely, & prod;(n)(i=1) e( Q(i )) divides e( P(Q(1), . . . , Q(|P|))), and delta( P( Q(1), . . . , Q(n))) >= max(1 <= i <= n){delta( Q(i) )}.

키워드

Gold Partition Conjecture1/3-2/3 ConjectureLexicographic sumOrder theoryLINEAR EXTENSIONSORDERED SETSPAIRS

식별자

Scopus EID
2-s2.0-105052014603
WoS UID
001888501200001