English
Related papers

Related papers: Generating naturally labeled posets through matrix…

200 papers

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…

Combinatorics · Mathematics 2016-11-22 Leonard Kwuida , Erkko Lehtonen

We investigate Grothendieck topologies (in the sense of sheaf theory) on a poset $\P$ that are generated by some subset of $\P$. We show that such Grothendieck topologies exhaust all possibilities if and only if $\P$ is Artinian. If $\P$ is…

Category Theory · Mathematics 2014-12-04 Bert Lindenhovius

Given a finite poset $\mathcal P$, we say that a family $\mathcal F$ of subsets of $[n]$ is $\mathcal P$-saturated if $\mathcal F$ does not contain an induced copy of $\mathcal P$, but adding any other set to $\mathcal F$ creates an induced…

Combinatorics · Mathematics 2026-05-26 Maria-Romina Ivan , Sean Jaffe

We introduce a class of posets, which includes both ribbon posets (skew shapes) and $d$-complete posets, such that their number of linear extensions is given by a determinant of a matrix whose entries are products of hook lengths. We also…

Combinatorics · Mathematics 2020-02-25 Alexander Garver , Stefan Grosser , Jacob P. Matherne , Alejandro H. Morales

A causal set is a countably infinite poset in which every element is above finitely many others; causal sets are exactly the posets that have a linear extension with the order-type of the natural numbers -- we call such a linear extension a…

Combinatorics · Mathematics 2012-01-31 Graham Brightwell , Malwina Luczak

Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the…

In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…

Discrete Mathematics · Computer Science 2010-06-15 Nicolas Madrid Labrador , Umberto Straccia

One introduces here the natural join $P \os Q$ of graded posets $< P,\leq_P >$ and $< Q,\leq_Q >$ with correspondingly maximal and minimal sets being identical as expressed by ordinal sum $P\oplus Q$ apart from other definition and due to…

Combinatorics · Mathematics 2009-07-31 A. K. Kwasniewski

Let $(R, \sim )$ be the Rado graph, $Emb (R)$ the monoid of its self-embeddings, $\Pi (R)=\{ f[R]: f\in Emb (R)\}$ the set of copies of $R$ contained in $R$, and ${\mathcal I}_R$ the ideal of subsets of $R$ which do not contain a copy of…

Logic · Mathematics 2017-09-26 Miloš S. Kurilić , Stevo Todorčević

Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…

Combinatorics · Mathematics 2020-05-06 Andrew Claussen

Tesler matrices are certain integral matrices counted by the Kostant partition function and have appeared recently in Haglund's study of diagonal harmonics. In 2014, Drew Armstrong defined a poset on such matrices and conjectured that the…

Combinatorics · Mathematics 2017-03-23 Jason O'Neill

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…

Combinatorics · Mathematics 2007-05-23 Bridget Eileen Tenner

We generate and count isomorphism classes of gluing-parallel posets with interfaces (iposets) on up to eight points, and on up to ten points with interfaces removed. In order to do so, we introduce a new class of iposets with full…

Combinatorics · Mathematics 2022-03-08 Olavi Äikäs , Uli Fahrenberg , Christian Johansen , Krzysztof Ziemiański

A subfamily $\mathcal{G}\subseteq \mathcal{F}\subseteq 2^{[n]}$ of sets is a non-induced (weak) copy of a poset $P$ in $\mathcal{F}$ if there exists a bijection $i:P\rightarrow \mathcal{G}$ such that $p\le_P q$ implies $i(p)\subseteq i(q)$.…

Combinatorics · Mathematics 2022-07-27 Balázs Keszegh , Nathan Lemons , Ryan R. Martin , Dömötör Pálvölgyi , Balázs Patkós

We investigate resolutions of letterplace ideals of posets. We develop topological results to compute their multigraded Betti numbers, and to give structural results on these Betti numbers. If the poset is a union of no more than $c$…

Commutative Algebra · Mathematics 2020-06-17 Alessio D'Alì , Gunnar Fløystad , Amin Nematbakhsh

For a discrete poset $\mathcal X$ McCord proved that the natural map $|{\mathcal X}|\to {\mathcal X}$ from the order complex to the poset equipped with the Up topology is a weak homotopy equivalence. Much later, Zivaljevi\'{c} defined the…

Combinatorics · Mathematics 2024-05-30 Ulysses Alvarez , Ross Geoghegan

A new class of partial order-types, class $\gbqo^+$ is defined and investigated here. A poset $P$ is in the class $W^+ $ iff the free poset algebra $F(P)$ is generated by a better quasi-order $G$ that is included in the free lattice $L(P)$.…

General Topology · Mathematics 2012-10-23 Uri Abraham , Robert Bonnet , Wieslaw Kubis

A countable poset is ultrahomogeneous if every isomorphism between its finite subposets can be extended to an automorphism. The groups $\operatorname{Aut}(A)$ of such posets $A$ have a natural topology in which $\operatorname{Aut}(A)$ are…

Group Theory · Mathematics 2019-05-16 Szymon Głąb , Przemysław Gordinowicz , Filip Strobin

In this paper, we consider ordered set partitions obtained by imposing conditions on the size of the lists, and such that the first $r$ elements are in distinct blocks, respectively. We introduce a generalization of the Lah numbers. For…

Combinatorics · Mathematics 2020-06-05 Beáta Bényi , Miguel Méndez , José L. Ramirez

Let $\mathbf D$ be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On $\BZ\mathbf D$ we define a product and a coproduct, together with an internal product, that is,…

Representation Theory · Mathematics 2011-02-19 Claudia Malvenuto , Christophe Reutenauer