Related papers: Weak order and descents for monotone triangles
Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern…
In this article, we propose to initiate the general study of involution systems. An {\em involution system}, that is, a group $W$ generated by a set of involutions $S$, is naturally endowed with a {\em weak order} arising from orienting the…
We construct a simple combinatorially-defined representation of $\mathfrak{sl}_2$ which respects the order structure of the weak order on the symmetric group. This is used to resolve a conjecture of Stanley that the weak order has the…
A weak multiplier Hopf algebra is a pair (A,\Delta) of a non-degenerate idempotent algebra A and a coproduct $\Delta$ on A. The coproduct is a coassociative homomorphism from A to the multiplier algebra M(A\otimes A) with some natural extra…
Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining…
This paper presents two alternative approaches for counting the number of two-row weakly increasing matrices, which are $2\times n$ matrices whose entries are integers from $1$ to $k$ and are weakly increasing along all rows and columns,…
In this paper, we first investigate an abstract subdifferential for which (using Ekeland's variational principle) we can prove an analog of the Br{\o}ndsted-Rockafellar property. We introduce the "$r_L$-density" of a subset of the product…
We develop a theory of minors for alternating dimaps --- orientably embedded digraphs where, at each vertex, the incident edges (taken in the order given by the embedding) are directed alternately into, and out of, the vertex. We show that…
We show that the number of monotone triangles with prescribed bottom row (k_1,...,k_n) is given by a simple product formula which remarkably involves (shift) operators. Monotone triangles with bottom row (1,2,...,n) are in bijection with $n…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
We propose a new class of hypertopologies, called here weak$^{\ast }$ hypertopologies, on the dual space $\mathcal{X}^{\ast }$ of a real or complex topological vector space $\mathcal{X}$. The most well-studied and well-known hypertopology…
We introduce a notion of {\em cyclic Schur-positivity} for sets of permutations, which naturally extends the classical notion of Schur-positivity, and it involves the existence of a bijection from permutations to standard Young tableaux…
In 1979, Norton showed that the representation theory of the 0-Hecke algebra admits a rich combinatorial description. Her constructions rely heavily on some triangularity property of the product, but do not use explicitly that the 0-Hecke…
The coefficients of the chain polynomial of a finite poset enumerate chains in the poset by their number of elements. It has been a challenging open problem to determine which posets have real-rooted chain polynomials. Two new classes of…
An action on order ideals of posets considered by Fon-Der-Flaass is analyzed in the case of posets arising from minuscule representations of complex simple Lie algebras. For these minuscule posets, it is shown that the Fon-Der-Flaass action…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
We present bijections between four classes of combinatorial objects. Two of them, the class of unlabeled (2+2)-free posets and a certain class of involutions (or chord diagrams), already appeared in the literature, but were apparently not…
We obtain sharp bounds for the monotonic rearrangement operator from "dyadic-type" classes to "continuous". In particular, for the $\mathrm{BMO}$ space and Muckenhoupt classes. The idea is to connect the problem with a simple geometric…
We definitively establish that the theory of symmetric Macdonald polynomials aligns with quantum and affine Schubert calculus using a discovery that distinguished weak chains can be identified by chains in the strong (Bruhat) order poset on…
Fixed point iterations are a fundamental tool in numerical analysis and scientific computing for the approximation of solutions to nonlinear problems. Their convergence is often established via the Banach fixed point theorem, provided that…