Related papers: Weak order and descents for monotone triangles

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

In this paper we introduce the notion of weak operator and the theory of Yetter-Drinfeld modules over a weak braided Hopf algebra with invertible antipode in a strict monoidal category. We prove that the class of such objects constitutes a…

A weak order on the set of maximal chains of the non-crossing partition lattice is introduced and studied. A $0$-Hecke algebra action is used to compute the radius of the graph on these chains in which two chains are adjacent if they differ…

A non-unital generalization of weak bialgebra is proposed with a multiplier-valued comultiplication. Certain canonical subalgebras of the multiplier algebra (named the `base algebras') are shown to carry coseparable co-Frobenius coalgebra…

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

We show that an arithmetic function which satisfies some weak multiplicativity properties and in addition has a non-decreasing or $\log$-uniformly continuous normal order is close to a function of the form $n\mapsto n^c$. As an application…

Using an action of the Richardson-Springer monoid on involutions, we study the weak order on the variety of complete quadrics. Maximal chains in the poset are explicitly determined. Applying results of Brion, our calculations describe…

Let $A$ be a Banach algebra. For $f\in A^{\ast}$, we inspect the weak sequential properties of the well-known map $T_f:A\to A^{\ast}$, $T_f(a) = fa$, where $fa\in A^{\ast}$ is defined by $fa(x) = f(ax)$ for all $x\in A$. We provide…

The weak convergence of orthogonal polynomials is given under conditions on the asymptotic behaviour of the coefficients in the three-term recurrence relation. The results generalize known results and are applied to several systems of…

Motivated by the properties of the descent polynomials, which enumerate permutations of $S_n$ with a fixed descent set, we define descent polynomials for labeled rooted trees. We give recursive and explicit formulas for these polynomials…

We study the optimization problem over the weakly Pareto set of a convex multiobjective optimization problem given by polynomial functions. Using Lagrange multiplier expressions and the weight vector, we give three types of representations…

In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…

This paper investigates the existence of Denjoy minimal sets and, more generally, strictly ergodic sets in the dynamics of iterated homeomorphisms. It is shown that for the full two-shift, the collection of such invariant sets with the weak…

A permutation of the multiset $\{1^m,2^m,\dots,n^m\}$ is a {\em canon permutation} if the subsequence formed by the $j$th copy of each element of $[n]:=\{1,2,\dots,n\}$ is identical for all $j\in[m]$. Canon permutations were introduced by…

We study the partial orders induced on Wachs and signed Wachs permutations by the Bruhat and weak orders of the symmetric and hyperoctahedral groups. We show that these orders are graded, determine their rank function, characterize their…

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

Monotone triangles are certain triangular arrays of integers, which correspond to $n \times n$ alternating sign matrices when prescribing $(1,2,...,n)$ as bottom row of the monotone triangle. In this article we define halved monotone…

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

We study the "top-to-random-and-reverse shuffle", defined as the top-to-random shuffle in the symmetric group algebra composed with the permutation $w_0$ (which sends each $i$ to $n+1-i$). More generally, we analyze the composition of any…

This paper presents a reverse mathematical analysis of several forms of the sorites paradox. We first illustrate how traditional formulations are reliant on H\"older's Representation Theorem for ordered Archimedean groups. While this is…