Related papers: Refined enumeration of noncrossing chains and hook…

We enumerate smooth and rationally smooth Schubert varieties in the classical finite types A, B, C, and D, extending Haiman's enumeration for type A. To do this enumeration, we introduce a notion of staircase diagrams on a graph. These…

We consider noncrossing partitions of [n] under the action of (i) the reflection group (of order 2), (ii) the rotation group (cyclic of order n) and (iii) the rotation/reflection group (dihedral of order 2n). First, we exhibit a bijection…

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

We discover another one-parameter generalization of Postnikov's hook length formula for binary trees. The particularity of our formula is that the hook length $h_v$ appears as an exponent. As an application, we derive another simple hook…

Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, which involves r parameters. The right-hand side can be…

Markov chains are a natural and well understood tool for describing one-dimensional patterns in time or space. We show how to infer $k$-th order Markov chains, for arbitrary $k$, from finite data by applying Bayesian methods to both…

Answering Questions 19.23 and 19.24 from the Kourovka notebook we construct polycyclic groups with arbitrary torsion lengths and give examples of finitely presented groups whose quotients by their torsion subgroups are not finitely…

Given a non-necessarily commutative unital ring $R$ and a unital partial representation $\Theta $ of a group $G$ into the Picard semigroup $\mathbf{PicS} (R)$ of the isomorphism classes of partially invertible $R$-bimodules, we construct an…

A basis of the center of the 0-Hecke algebra of an arbitrary finite Coxeter group was described by He in 2015. This basis is indexed by certain equivalence classes of the Coxeter group whose explicit description is rather complicated. Even…

We enlarge a Coxeter group into a category, with one object for each finite parabolic subgroup, encoding the combinatorics of double cosets. This category, the singular Coxeter monoid, is connected to the geometry of partial flag varieties.…

The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…

We present a novel algorithm to solve a non-linear system of equations, whose solution can be interpreted as a tight lower bound on the vector of expected hitting times of a Markov chain whose transition probabilities are only partially…

We extend F.Pastjin's construction of uniform decomposable chains of finite rank to those of rank 'finite over a limit' and investigate infinite products and unions of such chains. We derive an extension of Pastjin's characterisation to…

In well-known work, Kazhdan and Lusztig (1979) defined a new set of Hecke algebra basis elements (actually two such sets) associated to elements in any Coxeter group. Often these basis elements are computed by a standard recursive algorithm…

In this short note we discuss recent results on hook length formulas of trees unifying some earlier results, and explain hook length formulas naturally associated to families of increasingly labelled trees.

Given a complete graph with positive weights on its edges, we define the weight of a subset of edges as the product of weights of the edges in the subset and consider sums (partition functions) of weights over subsets of various kinds:…

We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…

It is well known that the set of $m$-Dyck paths with a fixed height and a fixed amount of valleys is counted by the Fu{\ss}-Narayana numbers. In this article, we consider the set of $m$-Dyck paths that start with at least $t$ north steps.…

We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us on the one hand to obtain enumerations connecting products of hook lengths and vectors of integers. This…

In this paper we present an algorithm for enumerating without repetitions all the non-crossing generically minimally rigid bar-and-joint frameworks under edge constraints (also called constrained non-crossing Laman frameworks) on a given…