English
Related papers

Related papers: The Weak Bruhat Order and Separable Permutations

200 papers

We study the property of being strongly weakly compactly generated (and some relatives) in projective tensor products of Banach spaces. Our main result is as follows. Let $1<p,q<\infty$ be such that $1/p+1/q\geq 1$. Let $X$ (resp., $Y$) be…

Functional Analysis · Mathematics 2022-06-20 José Rodríguez

A product formula for the parity generating function of the number of 1's in invertible matrices over Z_2 is given. The computation is based on algebraic tools such as the Bruhat decomposition. The same technique is used to obtain a parity…

Combinatorics · Mathematics 2007-05-23 Yona Cherniavsky , Eli Bagno

In this work, we investigate the presence of the weak Lefschetz property (WLP) and Hilbert functions for various types of random standard graded Artinian algebras. If an algebra has the WLP then its Hilbert function is unimodal. Using…

Commutative Algebra · Mathematics 2024-02-28 Uwe Nagel , Sonja Petrović

Weak Bruhat interval modules of the $0$-Hecke algebra in type $A$ provide a uniform approach to studying modules associated with noteworthy families of quasisymmetric functions. Recently this kind of modules were generalized from type $A$…

Representation Theory · Mathematics 2024-10-11 Han Yang , Houyi Yu

We find a generating function for interval-closed sets of the product of two chains poset by constructing a bijection to certain bicolored Motzkin paths. We also find a functional equation for the generating function of interval-closed sets…

We derive explicit expressions for the generating functions of refined Vafa-Witten invariants $\Omega(\gamma,y)$ of $\mathbb{P}^2$ of arbitrary rank $N$ and for their non-holomorphic modular completions. In the course of derivation we also…

High Energy Physics - Theory · Physics 2025-07-14 Sergei Alexandrov

We say that permutations $\pi_1,\dots, \pi_r \in \mathcal{S}_n$ invariably generate $\mathcal{S}_n$ if, no matter how one chooses conjugates $\pi'_1,\dots,\pi'_r$ of these permutations, $\pi'_1,\dots,\pi'_r$ generate $\mathcal{S}_n$. We…

Group Theory · Mathematics 2017-10-18 Sean Eberhard , Kevin Ford , Ben Green

The rank of a semigroup is the cardinality of a smallest generating set. In this paper we compute the rank of the endomorphism monoid of a non-trivial uniform partition of a finite set, that is, the semigroup of those transformations of a…

Group Theory · Mathematics 2008-07-09 Joao Araujo , Csaba Schneider

In this paper, we extend Manin and Schechtman's higher Bruhat orders for the symmetric group to higher Bruhat orders for non-longest words $w$ in $S_n$. We prove that the higher Bruhat orders of non-longest words are ranked posets with…

Combinatorics · Mathematics 2021-06-01 Daniel Hothem

The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…

Combinatorics · Mathematics 2007-05-23 Sergei Ovchinnikov

In this note we investigate correlation inequalities for `up-sets' of permutations, in the spirit of the Harris--Kleitman inequality. We focus on two well-studied partial orders on $S_n$, giving rise to differing notions of up-sets. Our…

Combinatorics · Mathematics 2020-04-22 J. Robert Johnson , Imre Leader , Eoin Long

Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…

Representation Theory · Mathematics 2015-08-14 Seth Shelley-Abrahamson , Suhas Vijaykumar

We extend and generalize many of the enumerative results concerning West's stack-sorting map $s$. First, we prove a useful theorem that allows one to efficiently compute $|s^{-1}(\pi)|$ for any permutation $\pi$, answering a question of…

Combinatorics · Mathematics 2019-02-12 Colin Defant

In this paper, we find weak generating sets for a classical W-algebra $\mathcal{W}^k(\mathfrak{g},f)$ when $\mathfrak{g}=\mathfrak{sl}_N$ or $\mathfrak{sl}_{N_1|N_2}$. Furthermore, observing the relation between quantum and classical…

Mathematical Physics · Physics 2025-11-11 Min Hee Park , Uhi Rinn Suh

The multiplicative structure of the trivial symplectic groupoid over $\mathbb R^d$ associated to the zero Poisson structure can be expressed in terms of a generating function. We address the problem of deforming such a generating function…

Symplectic Geometry · Mathematics 2015-06-26 Alberto S. Cattaneo , Benoit Dherin , Giovanni Felder

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

Combinatorics · Mathematics 2019-05-24 Zachary Hamaker , Victor Reiner

The aim of this paper is to study generating functions for the coefficients of the classical superoscillatory function associated with weak measurements. We also establish some new relations between the superoscillatory coefficients and…

Classical Analysis and ODEs · Mathematics 2023-04-03 Fabrizio Colombo , Rolf Soeren Krausshar , Irene Sabadini , Yilmaz Simsek

The classical permutohedron Perm is the convex hull of the points (w(1),...,w(n)) in R^n where w ranges over all permutations in the symmetric group. This polytope has many beautiful properties -- for example it provides a way to visualize…

Combinatorics · Mathematics 2015-01-06 Lauren K. Williams

We investigate the rank-generating function $F_{\lambda}$ of the poset of partitions contained inside a given shifted Ferrers shape $\lambda$. When $\lambda $ has four parts, we show that $F_{\lambda}$ is unimodal when $\lambda =\langle…

Combinatorics · Mathematics 2015-11-10 Richard P. Stanley , Fabrizio Zanello

We study the notion of weak amalgamation in the context of diagonal conjugacy classes. Generalizing results of Kechris and Rosendal, we prove that for every countable structure $M$, Polish group $G$ of permutations of $M$, and $n \geq 1$,…

Logic · Mathematics 2022-03-11 Maciej Malicki