English
Related papers

Related papers: Atoms for signed permutations

200 papers

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

Combinatorics · Mathematics 2013-04-05 Adrian Ocneanu

Let $G$ be a connected reductive algebraic group over an algebraically closed field ${\bf k}$ of characteristic not equal to 2, let $\B$ be the variety of all Borel subgroups of $G$, and let $K$ be a symmetric subgroup of $G$. Fixing a…

Representation Theory · Mathematics 2011-04-15 Sam Evens , Jiang-Hua Lu

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

Geometric Topology · Mathematics 2016-01-14 Arnaud Mortier

We study parabolic double cosets in a Coxeter system by decomposing them into atom(ic coset)s, a generalization of simple reflections introduced in a joint work with Elias, Libedinsky, Patimo. We define and classify braid relations between…

Combinatorics · Mathematics 2025-05-12 Hankyung Ko

Let $ G $ be a connected reductive algebraic group over $ \mathbb{R} $, and $ H $ its symmetric subgroup. For parabolic subgroups $ P_{G} \subset G $ and $ P_{H} \subset H $, the product of flag varieties $ \mathfrak{X} = H/P_H \times G/P_G…

Representation Theory · Mathematics 2025-06-17 Kyo Nishiyama , Taito Tauchi

We consider both standard and twisted action of a (real) Coxeter group G on the complement M_G to the complexified reflection hyperplanes by combining the reflections with complex conjugation. We introduce a natural geometric class of…

Representation Theory · Mathematics 2008-01-29 Giovanni Felder , Alexander P. Veselov

It is shown that there is an order isomorphism $\phi'$ from the poset $V$ of $B\times B$-orbits on the wonderful compactification of a semi-simple adjoint group $G$ with Weyl group $W$ to an interval in reverse Chevalley-Bruhat order on a…

Representation Theory · Mathematics 2007-05-23 Yu Chen , Matthew Dyer

We present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of closures. We show that there exists a bijection between the set of these classes and the set of involutions of the symmetric group. We…

Combinatorics · Mathematics 2009-10-27 Yonah Cherniavsky

Let $k$ be a field with a nontrivial discrete valuation which is complete and has perfect residue field. Let $G$ be the group of $k$-rational points of a reductive, linear algebraic group $\textbf{G}$ equipped with an involution $\theta$…

Group Theory · Mathematics 2010-06-16 Ricardo Portilla

We extend the weak Bruhat order of a finite Coxeter group to the set of its coclasses, modulo parabolic standard subgroups. We use this order to describe associative algebra structures on the vector spaces spanned by the faces of…

Combinatorics · Mathematics 2007-05-23 Patricia Palacios , Maria Ronco

In order to study certain algebraic objects, and notably algebraic groups, Serre introduced the notion on invariants, in particular cohomological invariants. The construction of non-trivial cohomological invariants of algebraic groups is an…

Rings and Algebras · Mathematics 2023-04-04 Nicolas Garrel

We obtain the equivariant K-homology of the classifying space \underline{E}W for W a right-angled or, more generally, an even Coxeter group. The key result is a formula for the relative Bredon homology of \underline{E}W in terms of Coxeter…

K-Theory and Homology · Mathematics 2009-08-07 Ruben Sanchez-Garcia

We classify all quotients $W/W_J$ up to isomorphism in Bruhat order, with $(W,S)$ a Coxeter system and $W_J$ a parabolic subgroup of $W$. In particular, the non-trivial isomorphisms fall into a small number of cases which are highly…

Representation Theory · Mathematics 2023-03-14 Joseph Newton

We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…

Representation Theory · Mathematics 2007-05-23 Anthony Henderson

We show that the principal order ideal below an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are…

Combinatorics · Mathematics 2012-07-24 Axel Hultman , Kathrin Vorwerk

We introduce diagrams and essential sets for signed permutations, extending the analogous notions for ordinary permutations. In particular, we show that the essential set provides a minimal list of rank conditions defining the Schubert…

Combinatorics · Mathematics 2016-12-28 David Anderson

Let $G$ be a split connected reductive group over the ring of integers of a finite unramified extension $K$ of $\mathbf{Q}_p$. Under a standard assumption on the Coxeter number of $G$, we compute the cohomology algebra of $G(\mathcal{O}_K)$…

Number Theory · Mathematics 2025-07-21 Andrea Dotto , Bao V. Le Hung

Let $X$ be a finite set such that $|X|=n$, and let $k< n/2$. A group is $k$-homogeneous if it has only one orbit on the sets of size $k$. The aim of this paper is to prove some general results on permutation groups and then apply them to…

Group Theory · Mathematics 2015-12-18 João Araújo , Peter J. Cameron

The elements in the hyperoctahedral group $\mathfrak{B}_n$ can be treated as signed permutations with the natural order $\cdots<-2<-1<0<1<2<\cdots$, or as colored permutations with the $r$-order $-1<_r-2<_r\cdots<_r0<_r1<_r2<_r\cdots$. For…

Combinatorics · Mathematics 2023-05-30 X. Gao , F. Z. K. Li , L. Wan , J. Y. X. Yang

We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…

Discrete Mathematics · Computer Science 2011-08-19 Matthew J. Samuel