Recently, Kitaev [Ki2] introduced partially ordered generalized patterns (POGPs) in the symmetric group, which further generalize the generalized permutation patterns introduced by Babson and Steingrímsson [BS]. A POGP p is a GP some of whose letters are incomparable. In this paper, we study the generating functions (g.f.) for the number of k-ary words avoiding some POGPs. We give analogues, extend and generalize several known results, as well as get some new results. In particular, we give the g.f. for the entire distribution of the maximum number of non-overlapping occurrences of a pattern p with no hyphens (that allowed to have repetition of letters), provided we know the g.f. for the number of k-ary words that avoid p.
A partially ordered (generalized) pattern (POP) is a generalized pattern some of whose letters are incomparable, an extension of generalized permutation patterns introduced by Babson and Steingrimsson. POPs were introduced in the symmetric group by Kitaev [Partially ordered generalized patterns, Discrete Math. 298 (2005), 212-229; Introduction to partially ordered patterns, Discrete Appl. Math., to appear], and studied in the set of $k$-ary words by Kitaev and Mansour [Partially ordered generalized patterns and $k$-ary words, Annals of Combinatorics 7 (2003) 191-200]. Moreover, Kitaev et al. […
Abstract. We generalize the $b$-ary binomial coefficients with negative entries, which is based on the generating function obtained in early work. Besides an explicit expression involving the restricted partition, several properties such as symmetry, congruence and Pascal-like recurrence are studies. Finally, we also provide two different generalizations, partially satisfying Pascal-like recurrences.
In this article, we give a counter-example to Lemma 12 of the article "On Operations and Linear Extensions of Well Partially Ordered Sets" by Maciej Malicki and Aleksander Rutkowski.
We prove that for every partially ordered set $P$, there exists $c(P)$ such that every family $\mathcal{F}$ of subsets of $[n]$ ordered by inclusion and which contains no induced copy of $P$ satisfies $\sum_{F\in \mathcal{F}}1/{n\choose |F|}\leq c(P)$. This confirms a conjecture of Lu and Milans.
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Turán-type problems in partially-ordered sets, particularly those in the Boolean lattice. We find a strong difference between Ramsey numbers on the Boolean lattice and ordered Ramsey numbers when the partial ordering on the graphs have large antichains.
We introduce the package Posets for Macaulay2. This package provides a data structure and the necessary methods for working with partially ordered sets, also called posets. In particular, the package implements methods to enumerate many commonly studied classes of posets, perform operations on posets, and calculate various invariants associated to posets.
The closed cone of flag vectors of Eulerian partially ordered sets is studied. It is completely determined up through rank seven. Half-Eulerian posets are defined. Certain limit posets of Billera and Hetyei are half-Eulerian; they give rise to extreme rays of the cone for Eulerian posets. A new family of linear inequalities valid for flag vectors of Eulerian posets is given.
The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of the same rank. A corresponding notion of edgewise Cohen--Macaulay connectivity for partially ordered sets is investigated. Examples and open questions are discussed.
Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative results for POPs in permutations defined by bipartite graphs, substantially extending the list of known results in this direction. In particular, we completely characterize the Wilf-equivalence for patterns defined by the N-shape posets.
A graded partially ordered set is Eulerian if every interval has the same number of elements of even rank and of odd rank. Face lattices of convex polytopes are Eulerian. For Eulerian partially ordered sets, the flag vector can be encoded efficiently in the cd-index. The cd-index of a polytope has all positive entries. An important open problem is to give the broadest natural class of Eulerian posets having nonnegative cd-index. This paper completely determines which entries of the cd-index are nonnegative for all Eulerian posets. It also shows that there are no other lower or upper bounds on …
Let $P$ be an arbitrary finite partially ordered set. It will be proved that the number of edges of the order polytope ${\mathcal O}(P)$ is equal to that of the chain polytope ${\mathcal C}(P)$. Furthermore, it will be shown that the degree sequence of the finite simple graph which is the $1$-skeleton of ${\mathcal O}(P)$ is equal to that of ${\mathcal C}(P)$ if and only if ${\mathcal O}(P)$ and ${\mathcal C}(P)$ are unimodularly equivalent.
R. Redheffer described an $n\times n$ matrix of 0's and 1's the size of whose determinant is connected to the Riemann Hypothesis. We describe the permutations that contribute to its determinant and evaluate its permanent in terms of integer factorizations. We generalize the Redheffer matrix to finite posets that have a 0 element and find the analogous results in the more general situation.
We review selected known results on partially ordered patterns (POPs) that include co-unimodal, multi- and shuffle patterns, peaks and valleys ((modified) maxima and minima) in permutations, the Horse permutations and others. We provide several (new) results on a class of POPs built on an arbitrary flat poset, obtaining, as corollaries, the bivariate generating function for the distribution of peaks (valleys) in permutations, links to Catalan, Narayna, and Pell numbers, as well as generalizations of few results in the literature including the descent distribution. Moreover, we discuss q-analog…
A partially ordered set is r-thick if every nonempty open interval contains at least r elements. This paper studies the flag vectors of graded, r-thick posets and shows the smallest convex cone containing them is isomorphic to the cone of flag vectors of all graded posets. It also defines a k-analogue of the Mobius function and k-Eulerian posets, which are 2k-thick. Several characterizations of k-Eulerian posets are given. The generalized Dehn-Sommerville equations are proved for flag vectors of k-Eulerian posets. A new inequality is proved to be valid and sharp for rank 8 Eulerian posets.
Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes.
Sergey Kitaev has shown that the exponential generating function for permutations avoiding the generalized pattern $σ$-$k$, where $σ$ is a pattern without dashes and $k$ is one greater than the biggest element in $σ$, is determined by the exponential generating function for permutations avoiding $σ$. We show that this also holds for permutations avoiding all the generalized patterns $σ_1$-$k_1$, $...$, $σ_n$-$k_n$, where $σ_1$, $...$, $σ_n$ are patterns without dashes and $k_i$ is one greater than the biggest element in $σ_i$. Similarly the exponential generating function for permutations avoi…
We consider a combinatorial question about searching for an unknown ideal $μ$ within a known poset $λ$. Elements of $λ$ may be queried for membership in $μ$, but at most $k$ positive query results are permitted. The goal is to find a search strategy which guarantees a solution in a minimal total number $m_k(λ)$ of queries. We provide tight bounds for $m_k(λ)$, and construct optimal search strategies for the case where $k=2$ and $λ$ is the product poset of totally ordered finite sets, one of which has cardinality not more than six.
The absolute order is a natural partial order on a Coxeter group W. It can be viewed as an analogue of the weak order on W in which the role of the generating set of simple reflections in W is played by the set of all reflections in W. By use of a notion of constructibility for partially ordered sets, it is proved that the absolute order on the symmetric group is homotopy Cohen-Macaulay. This answers in part a question raised by V. Reiner and the first author. The Euler characteristic of the order complex of the proper part of the absolute order on the symmetric group is also computed.
A permutation $π$ contains a pattern $σ$ if and only if there is a subsequence in $π$ with its letters are in the same relative order as those in $σ$. Partially ordered patterns (POPs) provide a convenient way to denote patterns in which the relative order of some of the letters does not matter. This paper elucidates connections between the avoidance sets of a few POPs with other combinatorial objects, directly answering five open questions posed by Gao and Kitaev \cite{gao-kitaev-2019}. This was done by thoroughly analysing the avoidance sets and developing recursive algorithms to derive thes…
Partially ordered patterns (POPs) generalize the notion of classical patterns studied widely in the literature in the context of permutations, words, compositions and partitions. In an occurrence of a POP, the relative order of some of the elements is not important. Thus, any POP of length $k$ is defined by a partially ordered set on $k$ elements, and classical patterns correspond to $k$-element chains. The notion of a POP provides a convenient language to deal with larger sets of permutation patterns. This paper contributes to a long line of research on classical permutation patterns of lengt…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union of $r$-long cycles, one agent from each set per cycle, such that there are no destabilizing $r$-long cycles, i.e. cycles in which every agent strictly prefers its successor to its successor in the matching. Assuming that the preferences are uniformly random and independent, we show that the expected number of stable matchings grows with $n$ (cardinality of e…
We extend the definitions of upper and lower valuations on partially ordered sets, and consider the metrics they induce, in particular the metrics available (or not) based on the logarithms of such valuations. Motivating applications in computational linguistics and computational biology are indicated.
The order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ associated to a partially ordered set $P$ are studied. In this paper, we introduce the convex polytope $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ which is the convex hull of $\mathcal{O}(P) \cup (-\mathcal{C}(Q))$, where both $P$ and $Q$ are partially ordered sets with $|P|=|Q|=d$. It will be shown that $Γ(\mathcal{O}(P), -\mathcal{C}(Q))$ is a normal and Gorenstein Fano polytope by using the theory of reverse lexicographic squarefree initial ideals of toric ideals.
Reflexive polytopes which have the integer decomposition property are of interest. Recently, some large classes of reflexive polytopes with integer decomposition property coming from the order polytopes and the chain polytopes of finite partially ordered sets are known. In the present paper, we will generalize this result. In fact, by virtue of the algebraic technique on Gröbner bases, new classes of reflexive polytopes with the integer decomposition property coming from the order polytopes of finite partially ordered sets and the stable set polytopes of perfect graphs will be introduced. Furt…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of Kotzig's canonical partition to a decomposition of general graphs with perfect matchings. It contains a short proof for the theorem of the canonical partition. These results give decompositions which are canonical, that is, unique to given graphs. We also show that there are correlations between these two and that these can be computed in polynomial time.
We study the structure of a uniformly randomly chosen partial order of width 2 on n elements. We show that under the appropriate scaling, the number of incomparable elements converges to the height of a one dimensional Brownian excursion at a uniformly chosen random time in the interval [0,1], which follows the Rayleigh distribution.
We continue the study on sheaves of rings on finite posets. We present examples where the ring of global sections coincide with toric faces rings, quotients of a polynomial ring by a monomial ideal and algebras with straightening laws. We prove a rank-selection theorem which generalizes the well-known rank-selection theorem of Stanley-Reisner rings. Finally, we determine an explicit presentation of certain global rings of sections.
Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let α_k(n) be the number of partially ordered sets of type (k, n). We prove that α_k(n)<min{k^{2n}/((k!)^2), (n-k+1)^{2n}/(((n-k)!)^2)}. Denote by ξ_k(n) the number of permutations from S_n such that the maximal decreasing chain of such permutation has length k. We prove that ξ_k(n)<k^{2n}/(((k-1)!)^2). We survey connections among the pairs of linear orders, the pairs Young diagrams, two-dimensional arrays of positiv…
Over any partially ordered abelian group whose positive cone is closed in an appropriate sense and has finitely many faces, modules that satisfy a weak finiteness condition admit finite primary decompositions. This conclusion rests on the introduction of basic notions in the relevant generality, such as closedness of partially ordered abelian groups, faces and their coprimary modules, and finiteness conditions as well local and global support functors for modules over partially ordered groups.
In their paper from 1981, Milner and Sauer conjectured that for any poset P, if cf(P)=lambda>cf(lambda)=kappa, then P must contain an antichain of size kappa. We prove that for lambda>cf(lambda)=kappa, if there exists a cardinal mu<lambda such that cov(lambda,mu,kappa,2)=lambda, then any poset of cofinality lambda contains lambda^kappa antichains of size kappa. The hypothesis of our theorem is very weak and is a consequence of many well-known axioms such as GCH, SSH and PFA. The consistency of the negation of this hypothesis is unknown.
We study local cohomology of rings of global sections of sheafs on the Alexandrov space of a partially ordered set. We give a criterion for a splitting of the local cohomology groups into summands determined by the cohomology of the poset and the local cohomology of the stalks. The face ring of a rational pointed fan can be considered as the ring of global sections of a flasque sheaf on the face poset of the fan. Thus we obtain a decomposition of the local cohomology of such face rings. Since the Stanley-Reisner ring of a simplicial complex is the face ring of a rational pointed fan, our main …
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some surjection having the poset as domain. We then obtain combinatorial characterisations of such notions in terms of blocks, without reference to surjection. Finally, we give a further, equivalent definition …
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 Polish topological groups. We consider the problem whether $\operatorname{Aut}(A)$ contains a dense free subgroup of two generators. We show that if $A$ is ultrahomogeneous, then $\operatorname{Aut}(A)$ contains such subgroup. Moreover, we characterize whose countable ultrahomogeneous posets $A$ such that for each natural $m$, the set of all cyclically dense …
