scholarly journals On the Relationship between Pipe Dreams and Permutation Words

10.37236/2902 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Cameron Marcott
Keyword(s):  
Distributive Lattice ◽  
Partial Order ◽  
Simplicial Complexes ◽  
Canonical Mapping ◽  
Triangular Shape ◽  
Schubert Polynomials ◽  
Shifted Tableaux ◽  
The Relationship

Pipe dreams represent permutations pictorially as a series of crossing pipes. Recent applications of pipe dreams include the calculation of Schubert polynomials, fillings of moon polyominoes, and in the combinatorics of antidiagonal simplicial complexes. These applications associate pipe dreams to words of elementary symmetric transpositions via a canonical mapping. However, this canonical mapping is by no means the only way of mapping pipe dreams to permutation words. We define sensical mappings from pipe dreams to words and prove sensical mappings are in bijection with standard shifted tableaux of triangular shape. We characterize the set of pipe dreams associated to a given word (under any sensical map) using step ladder moves. These moves induce a partial order on the set of pipe dreams mapping to a given word, yielding a distributive lattice.

Undirected Graphs Realizable as Graphs of Modular Lattices

1965 ◽  
Vol 17 ◽  
pp. 923-932 ◽  
Author(s):  
Laurence R. Alvarez
Keyword(s):  
Distributive Lattice ◽  
Partial Order ◽  
Directed Graph ◽  
Undirected Graph ◽  
Single Edge ◽  
Undirected Graphs ◽  
Modular Lattices

If (L, ≥) is a lattice or partial order we may think of its Hesse diagram as a directed graph, G, containing the single edge E(c, d) if and only if c covers d in (L, ≥). This graph we shall call the graph of (L, ≥). Strictly speaking it is the basis graph of (L, ≥) with the loops at each vertex removed; see (3, p. 170).We shall say that an undirected graph Gu can be realized as the graph of a (modular) (distributive) lattice if and only if there is some (modular) (distributive) lattice whose graph has Gu as its associated undirected graph.

scholarly journals On the relation of a distributive lattice to its lattice of ideals

1972 ◽  
Vol 7 (3) ◽  
pp. 377-385 ◽  
Author(s):  
Herbert S. Gaskill
Keyword(s):  
Distributive Lattice ◽  
Related Result ◽  
Distributive Lattices ◽  
Relationship Of ◽  
The Relationship ◽  
Finite Distributive Lattices ◽  
Lattice Of Ideals

In this note we examine the relationship of a distributive lattice to its lattice of ideals. Our main result is that a distributive lattice and its lattice of ideals share exactly the same collection of finite sublattices. In addition we give a related result characterizing those finite distributive lattices L which can be embedded in a lattice L′ whenever they can be embedded in its lattice of ideals T(L′).

On a generalization of Jensen's □κ, and strategic closure of partial orders

1983 ◽  
Vol 48 (4) ◽  
pp. 1046-1052 ◽  
Author(s):  
Dan Velleman
Keyword(s):  
Lower Bound ◽  
Partial Order ◽  
Recent Work ◽  
Partial Orders ◽  
Closure Condition ◽  
Forcing Axioms ◽  
Combinatorial Principles ◽  
The Relationship ◽  
Mahlo Cardinals ◽  
Forcing Axiom

It is well known that many statements provable from combinatorial principles true in the constructible universe L can also be shown to be consistent with ZFC by forcing. Recent work by Shelah and Stanley [4] and the author [5] has clarified the relationship between the axiom of constructibility and forcing by providing Martin's Axiom-type forcing axioms equivalent to ◊ and the existence of morasses. In this paper we continue this line of research by providing a forcing axiom equivalent to □κ. The forcing axiom generalizes easily to inaccessible, non-Mahlo cardinals, and provides the motivation for a corresponding generalization of □κ.In order to state our forcing axiom, we will need to define a strategic closure condition for partial orders. Suppose P = 〈P, ≤〉 is a partial order. For each ordinal α we will consider a game played by two players, Good and Bad. The players choose, in order, the terms in a descending sequence of conditions 〈pβ∣β < α〉 Good chooses all terms pβ for limit β, and Bad chooses all the others. Bad wins if for some limit β<α, Good is unable to move at stage β because 〈pγ∣γ < β〉 has no lower bound. Otherwise, Good wins. Of course, we will be rooting for Good.

scholarly journals Lattices of homomorphisms

1986 ◽  
Vol 40 (3) ◽  
pp. 364-406 ◽  
Author(s):  
B. A. Davey ◽  
H. A. Priestley
Keyword(s):  
Distributive Lattice ◽  
Order Isomorphism ◽  
Ordered Algebras ◽  
The Relationship

AbstractGiven a variety K of lattice-ordered algebras, A ∈ K is catalytic if for all B ∈ K, K(A, B) is a lattice for the pointwise order. The catalytic objects are determined for various varieties of distributive-lattice-ordered algebras. The characterisations obtained do not show an overall unity and exhibit diverse behaviour. Duality is employed extensively. Its usefulness in this context depends on the existence of an order-isomorphism between K(A, B) and the corresponding dual horn-set. Criteria for the existence of such an order-isomorphism are investigated for dualities of the Davey-Werner type. The relationship between catalytic objects and colattices is also discussed.

scholarly journals Stratifications on the Ran Space

Order ◽  
2021 ◽  
Author(s):  
Jānis Lazovskis
Keyword(s):  
Simplicial Complex ◽  
Partial Order ◽  
Metric Space ◽  
Product Space ◽  
Simplicial Complexes ◽  
Real Numbers

AbstractWe describe a partial order on finite simplicial complexes. This partial order provides a poset stratification of the product of the Ran space of a metric space and the nonnegative real numbers, through the Čech simplicial complex. We show that paths in this product space respecting its stratification induce simplicial maps between the endpoints of the path.

scholarly journals Back to the Coordinated Attack Problem

2020 ◽  
Vol 30 (10) ◽  
pp. 1089-1113 ◽  
Author(s):  
Emmanuel Godard ◽  
Eloi Perdereau
Keyword(s):  
Simplicial Complexes ◽  
Necessary Condition ◽  
Combinatorial Approach ◽  
Topological Characterization ◽  
Topological Approach ◽  
Consensus Algorithms ◽  
Distributed Computability ◽  
Specific Assumption ◽  
The Relationship ◽  
The Way

AbstractWe consider the well-known Coordinated Attack Problem, where two generals have to decide on a common attack, when their messengers can be captured by the enemy. Informally, this problem represents the difficulties to agree in the presence of communication faults. We consider here only omission faults (loss of message), but contrary to previous studies, we do not to restrict the way messages can be lost, i.e., we make no specific assumption, we use no specific failure metric. In the large subclass of message adversaries where the double simultaneous omission can never happen, we characterize which ones are obstructions for the Coordinated Attack Problem. We give two proofs of this result. One is combinatorial and uses the classical bivalency technique for the necessary condition. The second is topological and uses simplicial complexes to prove the necessary condition. We also present two different Consensus algorithms that are combinatorial (resp. topological) in essence. Finally, we analyze the two proofs and illustrate the relationship between the combinatorial approach and the topological approach in the very general case of message adversaries. We show that the topological characterization gives a clearer explanation of why some message adversaries are obstructions or not. This result is a convincing illustration of the power of topological tools for distributed computability.

scholarly journals Maximal Fillings of Moon Polyominoes, Simplicial Complexes, and Schubert Polynomials

10.37236/1167 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Luis Serrano ◽  
Christian Stump
Keyword(s):  
Simplicial Complex ◽  
Simplicial Complexes ◽  
Canonical Connection ◽  
Cyclic Sieving Phenomenon ◽  
North East ◽  
Schubert Polynomials ◽  
Dyck Paths ◽  
Vertex Decomposable ◽  
Cyclic Sieving

We exhibit a canonical connection between maximal $(0,1)$-fillings of a moon polyomino avoiding north-east chains of a given length and reduced pipe dreams of a certain permutation. Following this approach we  show that the simplicial complex of such maximal fillings is a vertex-decomposable, and thus shellable, sphere. In particular, this implies a positivity result for Schubert polynomials. Moreover, for Ferrers shapes we construct a bijection to maximal fillings avoiding south-east chains of the same length which specializes to a bijection between $k$-triangulations of the $n$-gon and $k$-fans of Dyck paths of length $2(n-2k)$. Using this, we translate a conjectured cyclic sieving phenomenon for $k$-triangulations with rotation to the language of $k$-flagged tableaux with promotion.

scholarly journals The Sorting Order on a Coxeter Group

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Drew Armstrong
Keyword(s):  
Distributive Lattice ◽  
Partial Order ◽  
Coxeter Group ◽  
Bruhat Order ◽  
Distributive Lattices ◽  
Coxeter System ◽  
Maximal Lattice ◽  
International Audience ◽  
The Way

International audience Let $(W,S)$ be an arbitrary Coxeter system. For each sequence $\omega =(\omega_1,\omega_2,\ldots) \in S^{\ast}$ in the generators we define a partial order― called the $\omega \mathsf{-sorting order}$ ―on the set of group elements $W_{\omega} \subseteq W$ that occur as finite subwords of $\omega$ . We show that the $\omega$-sorting order is a supersolvable join-distributive lattice and that it is strictly between the weak and strong Bruhat orders on the group. Moreover, the $\omega$-sorting order is a "maximal lattice'' in the sense that the addition of any collection of edges from the Bruhat order results in a nonlattice. Along the way we define a class of structures called $\mathsf{supersolvable}$ $\mathsf{antimatroids}$ and we show that these are equivalent to the class of supersolvable join-distributive lattices.

scholarly journals Partial Order Games

Games ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 2
Author(s):  
Valeria Zahoransky ◽  
Julian Gutierrez ◽  
Paul Harrenstein ◽  
Michael Wooldridge
Keyword(s):  
Partial Order ◽  
Imperfect Information ◽  
Compact Representation ◽  
Game Model ◽  
Extensive Form ◽  
Dependence Relation ◽  
Extensive Form Games ◽  
Extensive Form Game ◽  
The Cost ◽  
The Relationship

We introduce a non-cooperative game model in which players’ decision nodes are partially ordered by a dependence relation, which directly captures informational dependencies in the game. In saying that a decision node v is dependent on decision nodes v1,…,vk, we mean that the information available to a strategy making a choice at v is precisely the choices that were made at v1,…,vk. Although partial order games are no more expressive than extensive form games of imperfect information (we show that any partial order game can be reduced to a strategically equivalent extensive form game of imperfect information, though possibly at the cost of an exponential blowup in the size of the game), they provide a more natural and compact representation for many strategic settings of interest. After introducing the game model, we investigate the relationship to extensive form games of imperfect information, the problem of computing Nash equilibria, and conditions that enable backwards induction in this new model.

Embedding Regular Semigroups into Idempotent Generated Ones

2010 ◽  
Vol 17 (02) ◽  
pp. 229-240 ◽  
Author(s):  
Mario Petrich
Keyword(s):  
Regular Semigroup ◽  
Partial Order ◽  
Natural Partial Order ◽  
Regular Semigroups ◽  
Completely Regular ◽  
Close Relationship ◽  
Completely Regular Semigroups ◽  
Relationship Of ◽  
And Inversion ◽  
The Relationship

Any semigroup S can be embedded into a semigroup, denoted by ΨS, having some remarkable properties. For general semigroups there is a close relationship between local submonoids of S and of ΨS. For a number of usual semigroup properties [Formula: see text], we prove that S and ΨS simultaneously satisfy [Formula: see text] or not. For a regular semigroup S, the relationship of S and ΨS is even closer, especially regarding the natural partial order and Green's relations; in addition, every element of ΨS is a product of at most four idempotents. For completely regular semigroups S, the relationship of S and ΨS is still closer. On the lattice [Formula: see text] of varieties of completely regular semigroups [Formula: see text] regarded as algebras with multiplication and inversion, by means of ΨS, we define an operator, denoted by Ψ. We compare Ψ with some of the standard operators on [Formula: see text] and evaluate it on a small sublattice of [Formula: see text].

Sign in / Sign up

Export Citation Format

Share Document