Related papers: Iterative properties of birational rowmotion
Perfect sorting by reversals, a problem originating in computational genomics, is the process of sorting a signed permutation to either the identity or to the reversed identity permutation, by a sequence of reversals that do not break any…
In 2017, Davis, Nelson, Petersen, and Tenner [Discrete Math. 341 (2018),3249--3270] initiated the combinatorics of pinnacles in permutations. We provide a simple and efficient recursion to compute $p_n(S)$, the number of permutations of…
Let $\mathcal{R}$ be a unital ring with involution. The notions of 1MP-inverse and MP1-inverse are extended from $M_{m,n}(\mathbb{C)}$, the set of all $m\times n $ matrices over $\mathbb{C}$, to the set $\mathcal{R}% ^{\dagger}$ of all…
Realizing the possibility suggested by Hardouin [6], we show that her own Picard-Vessiot Theory for iterative $q$-difference rings is covered by the (consequently, more general) framework, settled by Amano and Masuoka [2], of artinian…
In this paper, we introduce and study the iterates of the following family of functions $\varphi_k$ defined on natural numbers which exhibits nice properties. $$\varphi_k(x)=\left\lbrace \begin{array}{ll} x+k, & \mbox{ if $x$ is prime;}\\…
We consider some two-dimensional birational transformations. One of them is a birational deformation of the H\'enon map. For some of these birational mappings, the post critical set (i.e. the iterates of the critical set) is infinite and we…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
We present a family of birational transformations in $ CP_2$ depending on two, or three, parameters which does not, generically, preserve meromorphic two-forms. With the introduction of the orbit of the critical set (vanishing condition of…
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…
Given a finite poset, Greene introduced a rational function obtained by summing certain rational functions over the linear extensions of the poset. This function has interesting interpretations, and for certain families of posets, it…
A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations that have some ascending and some descending blocks. We then…
Order dimension theory measures the complexity of partially ordered sets by quantifying how far they are from being linearly ordered. In this paper we study classical bounding results for order dimension within the framework of reverse…
In this note we consider a Ramsey type result for partially ordered sets. In particular, we give an alternative short proof of a theorem for a posets with multiple linear extensions recently obtained by Solecki and Zhao.
The combinatorially and the geometrically defined partial orders on the set of permutations coincide. We extend this result to $(0,1)$-matrices with fixed row and column sums. Namely, the Bruhat order induced by the geometry of a Cherkis…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…
In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
The Lalanne-Kreweras involution is an involution on the set of Dyck paths which combinatorially exhibits the symmetry of the number of valleys and major index statistics. We define piecewise-linear and birational extensions of the…