Related papers: Oriented posets, Rank Matrices and q-deformed Mark…
We define a family of combinatorial objects, which we call Baxter posets. We prove that Baxter posets are counted by the Baxter numbers by showing that they are the adjacency posets of diagonal rectangulations. Given a diagonal…
Motivation coming from the study of affine Weyl groups, a structure of ranked poset is defined on the set of circular permutations in $S_n$ (that is, $n$-cycles). It is isomorphic to the poset of so-called admitted vectors, and to an…
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…
We consider the $q$-deformation of rational numbers introduced recently by Morier-Genoud and Ovsienko. We propose three enumerative interpretations of these $q$-rationals: in terms of a new version of Ostrowski's numeration system for…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
We consider a natural $q$-deformation of the classical Markov numbers. This $q$-deformation is closely related to $q$-deformed rational numbers recently introduced by two of us. Both notions, those of $q$-rationals and $q$-Markov numbers,…
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…
We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distributive lattices of lower ideals of fence posets are unimodal. We do this by introducing a related class of circular fence posets and proving a…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
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…
This paper is divided into two parts. In the first part, we develop a general method for expressing ranks of matrix expressions that involve Moore-Penrose inverses, group inverses, Drazin inverses, as well as weighted Moore-Penrose inverses…
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizing the marked chain polytopes and marked order polytopes by putting them as extremal cases in an Ehrhart equivalent family. Some…
Let alpha = (a,b,...) be a composition. Consider the associated poset F(alpha), called a fence, whose covering relations are x_1 < x_2 < ... < x_{a+1} > x_{a+2} > ... > x_{a+b+1} < x_{a+b+2} < ... . We study the associated distributive…
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…
The (right) $q$-deformed rational numbers was introduced by Morier-Genoud and Ovsienko, and its left variant, whose numerators and denominators are essentially the normalized Jones polynomials of rational links, by Bapat, Becker and Licata.…
We provide a Minkowski sum decomposition of marked chain-order polytopes into building blocks associated to elementary markings and thus give an explicit minimal set of generators of an associated semi-group algebra. We proceed by…
We use model theoretic techniques to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of…
We classify nets of conics in Desarguesian projective planes over finite fields of odd order, namely, two-dimensional linear systems of conics containing a repeated line. Our proof is geometric in the sense that we solve the equivalent…
In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for…