Maximal chains in interval algebras

1990 ◽  
Vol 27 (1) ◽  
pp. 32-43 ◽  
Author(s):  
Sabine Koppelberg
Keyword(s):  
Maximal Chains

scholarly journals Traces Without Maximal Chains

10.37236/465 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Ta Sheng Tan
Keyword(s):  
Maximal Chain ◽  
Maximal Chains

The trace of a family of sets ${\cal A}$ on a set $X$ is ${\cal A}|_X=\{A\cap X:A\in {\cal A}\}$. If ${\cal A}$ is a family of $k$-sets from an $n$-set such that for any $r$-subset $X$ the trace ${\cal A}|_X$ does not contain a maximal chain, then how large can ${\cal A}$ be? Patkós conjectured that, for $n$ sufficiently large, the size of ${\cal A}$ is at most ${n-k+r-1\choose r-1}$. Our aim in this paper is to prove this conjecture.

scholarly journals Promotion and Evacuation

10.37236/75 ◽  
2009 ◽  
Vol 16 (2) ◽  
Author(s):  
Richard P. Stanley
Keyword(s):  
Vector Space ◽  
Hecke Algebra ◽  
Linear Extensions ◽  
Linear Transformations ◽  
Basic Properties ◽  
Finite Poset ◽  
Order Ideals ◽  
Maximal Chains

Promotion and evacuation are bijections on the set of linear extensions of a finite poset first defined by Schützenberger. This paper surveys the basic properties of these two operations and discusses some generalizations. Linear extensions of a finite poset $P$ may be regarded as maximal chains in the lattice $J(P)$ of order ideals of $P$. The generalizations concern permutations of the maximal chains of a wider class of posets, or more generally bijective linear transformations on the vector space with basis consisting of the maximal chains of any poset. When the poset is the lattice of subspaces of ${\Bbb F}_q^n$, then the results can be stated in terms of the expansion of certain Hecke algebra products.

scholarly journals Fixed Points of the Evacuation of Maximal Chains on Fuss Shapes

10.37236/6898 ◽  
2018 ◽  
Vol 25 (1) ◽  
Author(s):  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Hsiang-Chun Hsu ◽  
Yu-Pei Huang
Keyword(s):  
Fixed Point ◽  
Fixed Points ◽  
Hasse Diagram ◽  
Linear Extensions ◽  
Rectangular Shape ◽  
Explicit Characterization ◽  
Finite Poset ◽  
Maximal Chains

For a partition $\lambda$ of an integer, we associate $\lambda$ with a slender poset $P$ the Hasse diagram of which resembles the Ferrers diagram of $\lambda$. Let $X$ be the set of maximal chains of $P$. We consider Stanley's involution $\epsilon:X\rightarrow X$, which is extended from Schützenberger's evacuation on linear extensions of a finite poset. We present an explicit characterization of the fixed points of the map $\epsilon:X\rightarrow X$ when $\lambda$ is a stretched staircase or a rectangular shape. Unexpectedly, the fixed points have a nice structure, i.e., a fixed point can be decomposed in half into two chains such that the first half and the second half are the evacuation of each other. As a consequence, we prove anew Stembridge's $q=-1$ phenomenon for the maximal chains of $P$ under the involution $\epsilon$ for the restricted shapes.

scholarly journals A Decomposition of Parking Functions by Undesired Spaces

10.37236/5940 ◽  
2016 ◽  
Vol 23 (3) ◽  
Author(s):  
Melody Bruce ◽  
Michael Dougherty ◽  
Max Hlavacek ◽  
Ryo Kudo ◽  
Ian Nicolas
Keyword(s):  
Parking Functions ◽  
Partition Lattice ◽  
Self Duality ◽  
Noncrossing Partition ◽  
Symmetric Chain Decomposition ◽  
Order Complexes ◽  
Maximal Chains ◽  
Symmetric Chain ◽  
Noncrossing Partition Lattice

There is a well-known bijection between parking functions of a fixed length and maximal chains of the noncrossing partition lattice which we can use to associate to each set of parking functions a poset whose Hasse diagram is the union of the corresponding maximal chains. We introduce a decomposition of parking functions based on the largest number omitted and prove several theorems about the corresponding posets. In particular, they share properties with the noncrossing partition lattice such as local self-duality, a nice characterization of intervals, a readily computable Möbius function, and a symmetric chain decomposition. We also explore connections with order complexes, labeled Dyck paths, and rooted forests.

A companion to Grillet's Theorem on maximal chains and antichains

Order ◽  
1985 ◽  
Vol 1 (4) ◽  
pp. 371-375 ◽  
Author(s):  
Denis Higgs
Keyword(s):  
Maximal Chains

scholarly journals Automorphism groups of covering posets and of dense posets

1992 ◽  
Vol 35 (1) ◽  
pp. 115-120
Author(s):  
Gerhard Behrendt
Keyword(s):  
Automorphism Group ◽  
Automorphism Groups ◽  
Natural Homomorphism ◽  
Partially Ordered ◽  
Maximal Chains

Given a poset (X, ≦), the covering poset (C(X), ≦) consists of the set C(X) of covering pairs, that is, pairs (a, b)∈X2 with a<b such that there is no c∈X with a<c<b, partially ordered by (a, b)≦(a′, b′) if and only if (a, b) = (a′, b′) or b≦a′. There is a natural homomorphism v from the automorphism group of (X, ≦) into the automorphism group of (C(X), ≦). It is shown that given groups G, H and a homomorphism α from G into H there exists a poset (X, ≦) and isomorphisms φψ from G onto Aut(X, ≦), respectively from H onto Aut(C(X), ≦) such that φv = αψ. It is also shown that every group is isomorphic to the automorphism group of a poset all of whose maximal chains are isomorphic to the nationals.

scholarly journals A Jordan–Hölder type theorem for supercharacter theories

2020 ◽  
Vol 23 (3) ◽  
pp. 399-414 ◽  
Author(s):  
Shawn T. Burkett
Keyword(s):  
Finite Groups ◽  
Type Theorem ◽  
General Term ◽  
The One ◽  
Maximal Chains

AbstractThe Jordan–Hölder theorem is a general term given to a collection of theorems about maximal chains in suitably nice lattices. For example, the well-known Jordan–Hölder type theorem for chief series of finite groups has been rather useful in studying the structure of finite groups. In this paper, we present a Jordan–Hölder type theorem for supercharacter theories of finite groups, which generalizes the one for chief series of finite groups.

Sign in / Sign up

Export Citation Format

Share Document