Related papers: The interval posets of permutations seen from the …
We give an operadic interpretation of the known result of L.Shapiro and A.B.Stephens that characterizes percolating permutation matrices. A relation of ideals and suboperads of the non-symmetric operad of permutations to percolative…
This paper studies partitions in the space of antimonotonic boolean functions on sets of n elements. The antimonotonic functions are the antichains of the partially ordered set of subsets. We analyse and characterise a natural partial…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$, let $N(m,n)$ denote the set of all compositions $\alpha=(\alpha_1,\cdots,\alpha_m)$,…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for…
We introduce so-called consistent posets which are bounded posets with an antitone involution ' where the lower cones of x,x' and of y,y' coincide provided x,y are different form 0,1 and, moreover, if x,y are different form 0 then their…
In this paper, we investigate the M{\"o}bius function $\mu\_{\mathcal{S}}$ associated to a (locally finite) poset arising from a semigroup $\mathcal{S}$ of $\mathbb{Z}^m$. We introduce and develop a new approach to study…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…
A poset is {\it $(\3+\1)$-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because of their connection with interval orders and their…
We introduce partially ordered sets (posets) with an additional structure given by a collection of vector subspaces of an algebra $A$. We call them algebraically equipped posets. Some particular cases of these, are generalized equipped…
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.
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…
An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…
We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…
Let $P$ be a locally finite poset with the interval space $\Int(P)$, and $R$ a ring with identity. We shall introduce the M\"{o}bius conjugation $\mu^\ast$ sending each function $f:P\to R$ to an incidence function $\mu^\ast(f):\Int(P)\to R$…
We introduce Orthogonal M\"obius Inversion $\mathsf{OI}$, a concept analogous to M\"obius inversion on finite posets, which is applicable to order-preservings functions from a finite poset to the Grassmannian $\mathsf{Gr}(V)$ of an inner…
A brief presentation of basic definitions and notation used in permutation patterns research.