相关论文: Sorting probability of Catalan posets

Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…

By using a result from the numerical algebraic geometry package Bertini we show that (up to high numerical accuracy) a specific set of degree 6 and degree 9 polynomials cut out the secant variety $\sigma_{4}(\mathbb{P}^{2}\times \mathbb{P}…

We give a new proof of the $k$-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called $k$-in-$n$ dissections. Furthermore, we give a formula for the average number of cycles in a…

In 2022, Defant and Kravitz introduced extended promotion (denoted $\partial$), a map that acts on the set of labelings of a poset. Extended promotion is a generalization of Sch\"{u}tzenberger's promotion operator, a well-studied map that…

We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…

Given a sequence of integers b = (b_0,b_1,b_2,...) one gives a Dyck path P of length 2n the weight wt(P) = b_{h_1} b_{h_2} ... b_{h_n}, where h_i is the height of the ith ascent of P. The corresponding weighted Catalan number is C_n^b =…

Sorting is a fundamental problem in computer science. In the classical setting, it is well-known that $(1\pm o(1)) n\log_2 n$ comparisons are both necessary and sufficient to sort a list of $n$ elements. In this paper, we study the Noisy…

We show that height $h$ posets that have planar cover graphs have dimension $\mathcal{O}(h^6)$. Previously, the best upper bound was $2^{\mathcal{O}(h^3)}$. Planarity plays a key role in our arguments, since there are posets such that (1)…

We prove some iteration theorems for a certain class of $\kappa^+$-cc forcing posets.

In this note, we provide a bijection between a new collection of words on nonnegative integers of length n and Dyck paths of length 2n-2, thus proving that this collection belongs to the Catalan family. The surprising key step in this…

We report the results of a computer investigation of sets of mutually orthogonal latin squares (MOLS) of small order. For $n\le9$ we 1. Determine the number of orthogonal mates for each species of latin square of order $n$. 2. Calculate the…

We calculate moments of the so-called Kesten distribution by means of the expansion of the denominator of the density of this distribution and then integrate all summands with respect to the semicircle distribution. By comparing this…

Let $K = \mathbb{Q}(\zeta_3)$, where $\zeta_3$ is a primitive root of unity. In this paper we study the distribution of integers $\alpha \in \mathcal{O}_K$ for which the norm equation $N_{K(\sqrt[3]{\alpha})/K}(\mathbf{x}) = \zeta_3$ is…

In this short note we prove that the finite non-abelian simple groups PSL(2,q), where q = 5,7, are determined by their posets of classes of isomorphic subgroups. In particular, this disproves the conjecture in the end of [5].

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…

The poset of copies of a relational structure ${\mathbb X}$ is the partial order ${\mathbb P} ({\mathbb X} ) := \langle \{ Y \subset X: {\mathbb Y} \cong {\mathbb X}\}, \subset \rangle$ and each similarity of such posets (e.g. isomorphism,…

For a polarized toric variety (X,L) of dimension n less than 5, we give a lower bound of the Delta-genus by using the vanishing number of adjoint bundle of a multiple of L. We show that for a polarized toric variety of dimension n with…

We consider random polynomials whose coefficients are independent and identically distributed on the integers. We prove that if the coefficient distribution has bounded support and its probability to take any particular value is at most…

We show that the Schubert polynomial S_w specializes to the Catalan number C_n when $w=1(n+1)...2$. Several proofs of this result as well as a q-analog are given. An application to the singularities of Schubert varieties is given.

A $k \times n$ partial Latin rectangle is \textit{$C$-sparse} if the number of nonempty entries in each row and column is at most $C$ and each symbol is used at most $C$ times. We prove that the probability a uniformly random $k \times n$…