Related papers: Weak order and descents for monotone triangles

In this paper, we introduce a weak group inverse (called the WG inverse in the present paper) for square matrices of an arbitrary index, and give some of its characterizations and properties. Furthermore, we introduce two orders: one is a…

We construct a `weak' version EM^w(K) of Lack & Street's 2-category of monads in a 2-category K, by replacing their compatibility constraint of 1-cells with the units of monads by an additional condition on the 2-cells. A relation between…

We investigate weak$^*$ derived sets, that is the sets of weak$^*$ limits of bounded nets, of convex subsets of duals of non-reflexive Banach spaces and their possible iterations. We prove that a dual space of any non-reflexive Banach space…

This thesis finds its place in the interplay between algebraic and geometric combinatorics. We focus on studying two different families of lattices in relation to the weak order: the permutree lattices and the $s$-weak order. The first part…

In the present article, we show the existence of a coupled fixed point for an order preserving mapping in a preordered left K-complete quasi-pseudometric space using a preorder induced by an appropriate function. We also define the concept…

We introduce and study weak o-minimality in the context of complete types in an arbitrary first-order theory. A type $p\in S(A)$ is weakly o-minimal if for some relatively $A$-definable linear order, $<$, on $p(\mathfrak{C})$ every…

Motivated by q-shuffle products determined by Singer from q-analogues of multiple zeta values, we build in this article a generalisation of the shuffle and stuffle products in terms of weak shuffle and stuffle products. Then, we…

We initiate the combinatorial study of the poset $\mathrm{wIndex}_{\mathcal{T}}$ of weak $\mathcal{T}$-indexing systems, consisting of composable collections of arities for $\mathcal{T}$-equivariant algebraic structures, where $\mathcal{T}$…

Perverse schobers are conjectural categorical analogs of perverse sheaves. We show that such structures appear naturally in Homological Minimal Model Program which studies the effect of birational transformations such as flops, on the…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

In this paper, we present monotone sequences of lower and upper bounds on the Perron value of a nonngeative matrix, and we study their strict monotonicity. Using those sequences, we provide two combinatorial applications. One is to improve…

Compressed sensing extends from the recovery of sparse vectors from undersampled measurements via efficient algorithms to the recovery of matrices of low rank from incomplete information. Here we consider a further extension to the…

We consider tilting mutations of a weakly symmetric algebra at a subset of simple modules, as recently introduced by T. Aihara. These mutations are defined as the endomorphism rings of certain tilting complexes of length 1. Starting from a…

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to…

We provide a geometrical characterization of extremal negative dependence as a convex polytope in the simplex of multidimensional Bernoulli distributions, and we prove that it is an antichain that satisfies some minimality conditions with…

In this paper we define three different notions of tensor products for Leibniz bimodules. The ``natural" tensor product of Leibniz bimodules is not always a Leibniz bimodule. In order to fix this, we introduce the notion of a weak Leibniz…

A subset of a Carnot group is said to be precisely monotone if the restriction of its characteristic function to each integral curve of every left-invariant horizontal vector field is monotone. Equivalently, a precisely monotone set is a…

We introduce two new partial orders on the standard Young tableaux of a given partition shape, in analogy with the strong and weak Bruhat orders on permutations. Both posets are ranked by the major index statistic offset by a fixed shift.…

In this article, we introduce a category of weak Lie 3-algebras with suitable weak morphisms. The definition is based on the construction of a partial resolution over $\mathbb{Z}$ of the Koszul dual cooperad of the $\textrm{Lie}$ operad,…

Sorting networks are oblivious sorting algorithms with many practical applications and rich theoretical properties. Propositional encodings of sorting networks are a key tool for proving concrete bounds on the minimum number of comparators…