DOCSLIB.ORG

Cover Graphs and Order Dimension

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Cover Graphs and Order Dimension Cover Graphs and Order Dimension vorgelegt von M. Sc.{Mathematiker Veit Wiechert aus L¨ubz Von der Fakult¨atII Mathematik und Naturwissenschaften der Technischen Universit¨atBerlin zur Erlangung des akademischen Grades Doktor der Naturwissenschaften { Dr. rer. nat. { genehmigte Dissertation Promotionsausschuss: Vorsitzender: Prof. Dr. J¨orgLiesen Berichter: Prof. Dr. Stefan Felsner Prof. Dr. Tibor Szab´o Dr. Piotr Micek Tag der wissenschaftlichen Aussprache: 23. Februar 2017 Berlin 2017 Acknowledgments This dissertation is the result of three years of research within the Discrete Mathe- matics Group at TU Berlin. I like to express my greatest gratitude to my advisor Stefan Felsner for introducing me to the world of order dimension and for every kind of support. I enjoyed big freedom under his supervision and was always free to choose my favorite research problem. Stefan is also the reason why his working group is known for its relaxed and productive atmosphere. I also like to thank my (former) colleagues from this group for the fantastic time here: Andrea Hoffkamp, Kolja Knauer, Daniel Heldt, Torsten Ueckerdt, Irina Mustat¸ˇa,Nieke Aerts, Udo Hoffmann, Linda Kleist, and Torsten M¨utze. Special thanks go to my office mate Linda for the many funny moments we shared over the last six months. Another important person of my academic career is Tom Trotter. He is pushing and contributing to dimension theory for many decades now. Still, he seems to be as enthusiastic about posets and their dimension as he was from the beginning on. I am grateful to him for sharing this enthusiasm in the numerous discussions we had. I also would like to thank him for giving me the opportunity to speak at the minisymposium he organized around the SIAM Conference on Discrete Mathematics in Halifax in 2012. This event plays a special role in my career as it strongly influenced my research interests. I would like to thank my colleagues and friends Gwena¨elJoret and Piotr Micek for many exciting research sessions. Especially the week we spent together in Brussels in 2015 was a wonderful experience. We worked an uncountable number of hours on two of our papers; needless to say that I learned a lot about writing mathematics from Gwen and Piotr. While his 2-years stay at our working group, Piotr introduced me to many interesting math problems. I am grateful to him for our regular morning sessions, which led to several joint publications. Last and not least, I very much want to thank Johanna and our daughter Helena for the beautiful time besides the academic world. Thank you all, Veit Contents Introduction and Overview 1 1 Preliminaries 7 1.1 Posets, Cover Graphs, and Dimension .................. 7 1.2 Graph Minors ............................... 12 2 Essential Tools for Dimension 15 2.1 Min-Max Reduction ........................... 16 2.2 Unfolding Posets and Cores ....................... 17 2.3 Zig-Zag Paths ............................... 22 3 Planar Posets 26 3.1 Planar Posets with Support ....................... 28 3.2 A Linear Upper Bound on the Dimension . 45 3.3 New Lower Bound Constructions .................... 53 4 Tree-width, Path-width, and Tree-depth 55 4.1 Cover Graphs with Bounded Tree-depth . 57 4.2 Cover Graphs with Tree- or Path-width 2 . 59 4.3 Cover Graphs with Path-width at most p . 66 4.4 Lower Bound Constructions ....................... 70 5 Cover Graphs with Excluded Topological Minor 76 5.1 First Case: Posets of Bounded Height . 77 5.2 Second Case: (k + k)-free Posets .................... 85 6 Sparsity and Dimension 90 6.1 Classes with Bounded Expansion and Nowhere Dense Classes .......................... 92 6.2 Weak Coloring Numbers and Dimension . 95 6.3 Application: Boxicity of Graphs . 103 Conclusions and Open Problems 106 Bibliography 111 Index 117 Introduction and Overview The goal of this dissertation is to study the various connections between the dimen- sion of posets and graph theoretic properties of their cover graphs. The dimension of a poset P is the least number of linear extensions of P whose intersection gives rise to P . This parameter was introduced in 1941 by Dushnik and Miller [17] and turned out to be one of the most important concepts when studying the combinatorics of posets. Computing the dimension is a classical computationally hard problem. The decision problem whether the dimension of a poset is at most k, for some fixed k, was posed as one of the twelve problems on Garey's and Johnson's famous list of problems with unknown complexity in 1979. While it is decidable in polynomial time whether a poset has dimension at most 2, the problem becomes NP-complete once k is at least 3, as shown by Yannakakis in 1982 [77]. The problem even remains NP-complete if only posets of height 2 are under consideration (Felsner et al. [25]). Giving good approximations is hard as well: Chalermsook et al. [10] argued that it is unlikely that there exists a polynomial-time algorithm that approximates the 1 dimension within a factor of (n − ), where n denotes the number of elements in the poset. O Despite all these hardness results, we want to understand this parameter and try to find sufficient conditions and witnesses of large-dimensional posets. On the other hand, we want to determine properties that are necessarily satisfied by them. A number of such properties are known; for instance, Hiraguchi showed that every n-dimensional poset (n > 3) has to contain at least 2n elements [36]. Moreover, when n is large, then some of the poset elements must be involved in many compa- rabilities (R¨odl,Trotter [67]; F¨uredi,Kahn [30]). Another such property is a simple consequence of a classic theorem of Dilworth [15]: the width of a poset, which is the maximum size of a contained antichain, is at least as large as the dimension of the poset. This fact can be rephrased as follows: Large-dimensional posets have to be wide. The situation is different for the height of a poset, which is maximum size of a chain in the poset. The so-called standard example of order n has dimension n, while its height is only 2; Figure 1 (left) illustrates such an example of order 4. Therefore, large-dimensional posets need not be tall. In the following we discuss structural graph properties that are necessarily sat- isfied in cover graphs of posets with large dimension. Cover Graphs. Posets are usually visualized by their Hasse diagrams, in which every cover relation is represented by a y-monotone curve. The abstract undirected graph behind the Hasse diagram is the cover graph of the poset. Another graph that we associate with a poset is its comparability graph, where two elements are joined by an edge if they are comparable. Those two graphs behave differently in 1 b4 b1 b2 b3 b4 b3 b2 b1 a1 a2 a3 a4 a1 ai < bj iff i = j a 6 2 a3 a4 Figure 1: Standard example (left), and Kelly's example containing it as an induced subposet (right). many aspects: While width, height, and also dimension are invariant on posets with the same comparability graph, this is not true for cover graphs. The dimension of posets with the same cover graph may even differ by an arbitrary number. However, there are structural properties of graphs G that yield valuable information about the dimension of (all) posets whose cover graphs are isomorphic to G. Another fun- damental difference between these two graph concepts is given by the computational complexity of their corresponding decision problems: It is well known that deciding whether a graph is a comparability graph can be done in polynomial time. On the other hand, testing whether a graph is a cover graph is an NP-complete problem as shown by Neˇsetˇriland R¨odl[58], and Brightwell [9]. Why studying cover graphs? First of all, these are the ones that we use to visual- ize posets and hence they encode the topology of posets. Another important reason to consider cover graphs is that they are usually sparser than comparability graphs, and this sparsity may admit the existence of an underlying topological structure that can be used to give good estimations on the dimension. An example where such a structure can be exploited is given by the class of planar posets. A poset is planar if its Hasse diagram can be drawn without any edge crossings. In 1972, Baker, Fishburn, and Roberts proved that planar posets with a single minimal element and a single maximal element have dimension at most 2 [2]. The first result in this context that is using only the structural properties of cover graphs is due to Moore and Trotter; they show that posets with trees as cover graphs have dimension at most 3 [75]. Dimension versus Height. These early results led to the question whether the dimension of planar posets is bounded by a constant. It was answered in the neg- ative by Kelly in 1981, who constructed an explicit family of planar posets that contain arbitrarily large standard examples and hence have unbounded dimension; see Figure 1 (right). After Kelly's discovery, researchers in the field lost interest in studying connections between the topological structure of cover graphs and di- mension for decades. Probably, the main reason here was that Kelly's result broke a possible analogy between order dimension and chromatic number: While planar graphs have chromatic number at most 4, there is no such constant bound on the dimension of planar posets. This interest got renewed only after Felsner, Li, and Trotter [24] discovered in 2010 that the dimension of height-2 posets with planar 2 cover graphs is at most 4.
Load more

Recommended publications
  • On Treewidth and Graph Minors
    On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx.
    [Show full text]
  • On the Tree–Depth of Random Graphs Arxiv:1104.2132V2 [Math.CO] 15 Feb 2012
    On the tree–depth of random graphs ∗ G. Perarnau and O.Serra November 11, 2018 Abstract The tree–depth is a parameter introduced under several names as a measure of sparsity of a graph. We compute asymptotic values of the tree–depth of random graphs. For dense graphs, p n−1, the tree–depth of a random graph G is a.a.s. td(G) = n − O(pn=p). Random graphs with p = c=n, have a.a.s. linear tree–depth when c > 1, the tree–depth is Θ(log n) when c = 1 and Θ(log log n) for c < 1. The result for c > 1 is derived from the computation of tree–width and provides a more direct proof of a conjecture by Gao on the linearity of tree–width recently proved by Lee, Lee and Oum [?]. We also show that, for c = 1, every width parameter is a.a.s. constant, and that random regular graphs have linear tree–depth. 1 Introduction An elimination tree of a graph G is a rooted tree on the set of vertices such that there are no edges in G between vertices in different branches of the tree. The natural elimination scheme provided by this tree is used in many graph algorithmic problems where two non adjacent subsets of vertices can be managed independently. One good example is the Cholesky decomposition of symmetric matrices (see [?, ?, ?, ?]). Given an elimination tree, a distributed algorithm can be designed which takes care of disjoint subsets of vertices in different parallel processors. Starting arXiv:1104.2132v2 [math.CO] 15 Feb 2012 by the furthest level from the root, it proceeds by exposing at each step the vertices at a given depth.
    [Show full text]
  • Randomly Coloring Graphs of Logarithmically Bounded Pathwidth Shai Vardi
    Randomly coloring graphs of logarithmically bounded pathwidth Shai Vardi To cite this version: Shai Vardi. Randomly coloring graphs of logarithmically bounded pathwidth. 2018. hal-01832102 HAL Id: hal-01832102 https://hal.archives-ouvertes.fr/hal-01832102 Preprint submitted on 6 Jul 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Randomly coloring graphs of logarithmically bounded pathwidth Shai Vardi∗ Abstract We consider the problem of sampling a proper k-coloring of a graph of maximal degree ∆ uniformly at random. We describe a new Markov chain for sampling colorings, and show that it mixes rapidly on graphs of logarithmically bounded pathwidth if k ≥ (1 + )∆, for any > 0, using a new hybrid paths argument. ∗California Institute of Technology, Pasadena, CA, 91125, USA. E-mail: [email protected]. 1 Introduction A (proper) k-coloring of a graph G = (V; E) is an assignment σ : V ! f1; : : : ; kg such that neighboring vertices have different colors. We consider the problem of sampling (almost) uniformly at random from the space of all k-colorings of a graph.1 The problem has received considerable attention from the computer science community in recent years, e.g., [12, 17, 24, 26, 33, 44, 45].
    [Show full text]
  • Testing Isomorphism in the Bounded-Degree Graph Model (Preliminary Version)
    Electronic Colloquium on Computational Complexity, Revision 1 of Report No. 102 (2019) Testing Isomorphism in the Bounded-Degree Graph Model (preliminary version) Oded Goldreich∗ August 11, 2019 Abstract We consider two versions of the problem of testing graph isomorphism in the bounded-degree graph model: A version in which one graph is fixed, and a version in which the input consists of two graphs. We essentially determine the query complexity of these testing problems in the special case of n-vertex graphs with connected components of size at most poly(log n). This is done by showing that these problems are computationally equivalent (up to polylogarithmic factors) to corresponding problems regarding isomorphism between sequences (over a large alphabet). Ignoring the dependence on the proximity parameter, our main results are: 1. The query complexity of testing isomorphism to a fixed object (i.e., an n-vertex graph or an n-long sequence) is Θ(e n1=2). 2. The query complexity of testing isomorphism between two input objects is Θ(e n2=3). Testing isomorphism between two sequences is shown to be related to testing that two distributions are equivalent, and this relation yields reductions in three of the four relevant cases. Failing to reduce the problem of testing the equivalence of two distribution to the problem of testing isomorphism between two sequences, we adapt the proof of the lower bound on the complexity of the first problem to the second problem. This adaptation constitutes the main technical contribution of the current work. Determining the complexity of testing graph isomorphism (in the bounded-degree graph model), in the general case (i.e., for arbitrary bounded-degree graphs), is left open.
    [Show full text]
  • Minimal Acyclic Forbidden Minors for the Family of Graphs with Bounded Path-Width
    Discrete Mathematics 127 (1994) 293-304 293 North-Holland Minimal acyclic forbidden minors for the family of graphs with bounded path-width Atsushi Takahashi, Shuichi Ueno and Yoji Kajitani Department of Electrical and Electronic Engineering, Tokyo Institute of Technology. Tokyo, 152. Japan Received 27 November 1990 Revised 12 February 1992 Abstract The graphs with bounded path-width, introduced by Robertson and Seymour, and the graphs with bounded proper-path-width, introduced in this paper, are investigated. These families of graphs are minor-closed. We characterize the minimal acyclic forbidden minors for these families of graphs. We also give estimates for the numbers of minimal forbidden minors and for the numbers of vertices of the largest minimal forbidden minors for these families of graphs. 1. Introduction Graphs we consider are finite and undirected, but may have loops and multiple edges unless otherwise specified. A graph H is a minor of a graph G if H is isomorphic to a graph obtained from a subgraph of G by contracting edges. A family 9 of graphs is said to be minor-closed if the following condition holds: If GEB and H is a minor of G then H EF. A graph G is a minimal forbidden minor for a minor-closed family F of graphs if G#8 and any proper minor of G is in 9. Robertson and Seymour proved the following deep theorems. Theorem 1.1 (Robertson and Seymour [15]). Every minor-closed family of graphs has a finite number of minimal forbidden minors. Theorem 1.2 (Robertson and Seymour [14]).
    [Show full text]
  • Practical Verification of MSO Properties of Graphs of Bounded Clique-Width
    Practical verification of MSO properties of graphs of bounded clique-width Ir`ene Durand (joint work with Bruno Courcelle) LaBRI, Universit´ede Bordeaux 20 Octobre 2010 D´ecompositions de graphes, th´eorie, algorithmes et logiques, 2010 Objectives Verify properties of graphs of bounded clique-width Properties ◮ connectedness, ◮ k-colorability, ◮ existence of cycles ◮ existence of paths ◮ bounds (cardinality, degree, . ) ◮ . How : using term automata Note that we consider finite graphs only 2/33 Graphs as relational structures For simplicity, we consider simple,loop-free undirected graphs Extensions are easy Every graph G can be identified with the relational structure (VG , edgG ) where VG is the set of vertices and edgG ⊆VG ×VG the binary symmetric relation that defines edges. v7 v6 v2 v8 v1 v3 v5 v4 VG = {v1, v2, v3, v4, v5, v6, v7, v8} edgG = {(v1, v2), (v1, v4), (v1, v5), (v1, v7), (v2, v3), (v2, v6), (v3, v4), (v4, v5), (v5, v8), (v6, v7), (v7, v8)} 3/33 Expression of graph properties First order logic (FO) : ◮ quantification on single vertices x, y . only ◮ too weak ; can only express ”local” properties ◮ k-colorability (k > 1) cannot be expressed Second order logic (SO) ◮ quantifications on relations of arbitrary arity ◮ SO can express most properties of interest in Graph Theory ◮ too complex (many problems are undecidable or do not have a polynomial solution). 4/33 Monadic second order logic (MSO) ◮ SO formulas that only use quantifications on unary relations (i.e., on sets). ◮ can express many useful graph properties like connectedness, k-colorability, planarity... Example : k-colorability Stable(X ) : ∀u, v(u ∈ X ∧ v ∈ X ⇒¬edg(u, v)) Partition(X1,..., Xm) : ∀x(x ∈ X1 ∨ .
    [Show full text]
  • Harary Polynomials
    numerative ombinatorics A pplications Enumerative Combinatorics and Applications ECA 1:2 (2021) Article #S2R13 ecajournal.haifa.ac.il Harary Polynomials Orli Herscovici∗, Johann A. Makowskyz and Vsevolod Rakitay ∗Department of Mathematics, University of Haifa, Israel Email: [email protected] zDepartment of Computer Science, Technion{Israel Institute of Technology, Haifa, Israel Email: [email protected] yDepartment of Mathematics, Technion{Israel Institute of Technology, Haifa, Israel Email: [email protected] Received: November 13, 2020, Accepted: February 7, 2021, Published: February 19, 2021 The authors: Released under the CC BY-ND license (International 4.0) Abstract: Given a graph property P, F. Harary introduced in 1985 P-colorings, graph colorings where each color class induces a graph in P. Let χP (G; k) counts the number of P-colorings of G with at most k colors. It turns out that χP (G; k) is a polynomial in Z[k] for each graph G. Graph polynomials of this form are called Harary polynomials. In this paper we investigate properties of Harary polynomials and compare them with properties of the classical chromatic polynomial χ(G; k). We show that the characteristic and the Laplacian polynomial, the matching, the independence and the domination polynomials are not Harary polynomials. We show that for various notions of sparse, non-trivial properties P, the polynomial χP (G; k) is, in contrast to χ(G; k), not a chromatic, and even not an edge elimination invariant. Finally, we study whether the Harary polynomials are definable in monadic second-order Logic. Keywords: Generalized colorings; Graph polynomials; Courcelle's Theorem 2020 Mathematics Subject Classification: 05; 05C30; 05C31 1.
    [Show full text]
  • Confluent Hasse Diagrams
    Confluent Hasse diagrams David Eppstein Joseph A. Simons Department of Computer Science, University of California, Irvine, USA. October 29, 2018 Abstract We show that a transitively reduced digraph has a confluent upward drawing if and only if its reachability relation has order dimension at most two. In this case, we construct a confluent upward drawing with O(n2) features, in an O(n) × O(n) grid in O(n2) time. For the digraphs representing series-parallel partial orders we show how to construct a drawing with O(n) fea- tures in an O(n) × O(n) grid in O(n) time from a series-parallel decomposition of the partial order. Our drawings are optimal in the number of confluent junctions they use. 1 Introduction One of the most important aspects of a graph drawing is that it should be readable: it should convey the structure of the graph in a clear and concise way. Ease of understanding is difficult to quantify, so various proxies for readability have been proposed; one of the most prominent is the number of edge crossings. That is, we should minimize the number of edge crossings in our drawing (a planar drawing, if possible, is ideal), since crossings make drawings harder to read. Another measure of readability is the total amount of ink required by the drawing [1]. This measure can be formulated in terms of Tufte’s “data-ink ratio” [22,35], according to which a large proportion of the ink on any infographic should be devoted to information. Thus given two different ways to present information, we should choose the more succinct and crossing-free presentation.
    [Show full text]
  • Minor-Closed Graph Classes with Bounded Layered Pathwidth
    Minor-Closed Graph Classes with Bounded Layered Pathwidth Vida Dujmovi´c z David Eppstein y Gwena¨elJoret x Pat Morin ∗ David R. Wood { 19th October 2018; revised 4th June 2020 Abstract We prove that a minor-closed class of graphs has bounded layered pathwidth if and only if some apex-forest is not in the class. This generalises a theorem of Robertson and Seymour, which says that a minor-closed class of graphs has bounded pathwidth if and only if some forest is not in the class. 1 Introduction Pathwidth and treewidth are graph parameters that respectively measure how similar a given graph is to a path or a tree. These parameters are of fundamental importance in structural graph theory, especially in Roberston and Seymour's graph minors series. They also have numerous applications in algorithmic graph theory. Indeed, many NP-complete problems are solvable in polynomial time on graphs of bounded treewidth [23]. Recently, Dujmovi´c,Morin, and Wood [19] introduced the notion of layered treewidth. Loosely speaking, a graph has bounded layered treewidth if it has a tree decomposition and a layering such that each bag of the tree decomposition contains a bounded number of vertices in each layer (defined formally below). This definition is interesting since several natural graph classes, such as planar graphs, that have unbounded treewidth have bounded layered treewidth. Bannister, Devanny, Dujmovi´c,Eppstein, and Wood [1] introduced layered pathwidth, which is analogous to layered treewidth where the tree decomposition is arXiv:1810.08314v2 [math.CO] 4 Jun 2020 required to be a path decomposition.
    [Show full text]
  • Excluding a Ladder
    EXCLUDING A LADDER TONY HUYNH, GWENAEL¨ JORET, PIOTR MICEK, MICHALT. SEWERYN, AND PAUL WOLLAN Abstract. A ladder is a 2 × k grid graph. When does a graph class C exclude some ladder as a minor? We show that this is the case if and only if all graphs G in C admit a proper vertex coloring with a bounded number of colors such that for every 2-connected subgraph H of G, there is a color that appears exactly once in H. This type of vertex coloring is a relaxation of the notion of centered coloring, where for every connected subgraph H of G, there must be a color that appears exactly once in H. The minimum number of colors in a centered coloring of G is the treedepth of G, and it is known that classes of graphs with bounded treedepth are exactly those that exclude a fixed path as a subgraph, or equivalently, as a minor. In this sense, the structure of graphs excluding a fixed ladder as a minor resembles the structure of graphs without long paths. Another similarity is as follows: It is an easy observation that every connected graph with two vertex-disjoint paths of length k has a path of length k + 1. We show that every 3-connected graph which contains as a minor a union of sufficiently many vertex-disjoint copies of a 2 × k grid has a 2 × (k + 1) grid minor. Our structural results have applications to poset dimension. We show that posets whose cover graphs exclude a fixed ladder as a minor have bounded dimension.
    [Show full text]
  • Interval Reductions and Extensions of Orders: Bijections To
    Interval Reductions and Extensions of Orders Bijections to Chains in Lattices Stefan Felsner Jens Gustedt and Michel Morvan Freie Universitat Berlin Fachbereich Mathematik und Informatik Takustr Berlin Germany Email felsnerinffub erlinde Technische Universitat Berlin Fachbereich Mathematik Strae des Juni MA Berlin Germany Email gustedtmathtub erlinde LIAFA Universite Paris Denis Diderot Case place Jussieu Paris Cedex France Email morvanliafajussieufr Abstract We discuss bijections that relate families of chains in lattices asso ciated to an order P and families of interval orders dened on the ground set of P Two bijections of this typ e havebeenknown The bijection b etween maximal chains in the antichain lattice AP and the linear extensions of P A bijection between maximal chains in the lattice of maximal antichains A P and minimal interval extensions of P M We discuss two approaches to asso ciate interval orders to chains in AP This leads to new bijections generalizing Bijections and As a consequence wechar acterize the chains corresp onding to weakorder extensions and minimal weakorder extensions of P Seeking for a way of representing interval reductions of P bychains wecameup with the separation lattice S P Chains in this lattice enco de an interesting sub class of interval reductions of P Let S P b e the lattice of maximal separations M in the separation lattice Restricted to maximal separations the ab ove bijection sp ecializes to a bijection whic h nicely complementsand A bijection between maximal
    [Show full text]
  • Dyck Paths and Positroids from Unit Interval Orders (Extended Abstract)
    Dyck Paths and Positroids from Unit Interval Orders (Extended Abstract) Anastasia Chavez 1 and Felix Gotti 2 ∗ 1Department of Mathematics, UC Berkeley, Berkeley CA 94720 2 Department of Mathematics, UC Berkeley, Berkeley CA 94720 . Abstract. It is well known that the number of non-isomorphic unit interval orders on [n] equals the n-th Catalan number. Using work of Skandera and Reed and work of Postnikov, we show that each unit interval order on [n] naturally induces a rank n positroid on [2n]. We call the positroids produced in this fashion unit interval positroids. We characterize the unit interval positroids by describing their associated decorated permutations, showing that each one must be a 2n-cycle encoding a Dyck path of length 2n. 1 Introduction A unit interval order is a partially ordered set that captures the order relations among a collection of unit intervals on the real line. Unit interval orders were introduced by Luce [8] to axiomatize a class of utilities in the theory of preferences in economics. Since then they have been systematically studied (see [3,4,5,6, 14] and references therein). These posets exhibit many interesting properties; for example, they can be characterized as the posets that are simultaneously (3 + 1)-free and (2 + 2)-free. Moreover, it is well 1 2n known that the number of non-isomorphic unit interval orders on [n] equals n+1 ( n ), the n-th Catalan number (see [3, Section 4] or [15, Exercise 2.180]). In [14], motivated by the desire to understand the f -vectors of various classes of posets, Skandera and Reed showed that one can canonically label the elements of a unit interval order from 1 to n so that its n × n antiadjacency matrix is totally nonnegative (i.e., has all its minors nonnegative) and its zero entries form a right-justified Young diagram located strictly above the main diagonal and anchored in the upper-right corner.
    [Show full text]