English
Related papers

Related papers: Involution words: counting problems and connection…

200 papers

An involution in a Coxeter group has an associated set of involution words, a variation on reduced words. These words are saturated chains in a partial order first considered by Richardson and Springer in their study of symmetric varieties.…

Combinatorics · Mathematics 2019-06-27 Eric Marberg , Brendan Pawlowski

Involution words are variations of reduced words for twisted involutions in Coxeter groups. They arise naturally in the study of the Bruhat order, of certain Iwahori-Hecke algebra modules, and of orbit closures in flag varieties.…

Combinatorics · Mathematics 2017-03-28 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

The orbits of the orthogonal and symplectic groups on the flag variety are in bijection, respectively, with the involutions and fixed-point-free involutions in the symmetric group $S_n$. Wyser and Yong have described polynomial…

Combinatorics · Mathematics 2018-08-29 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

The variety of complete quadrics is the wonderful compactification of $GL_n/O_n$ and admits a cell decomposition into Borel orbits indexed by combinatorial objects called $\mu$-involutions. We study Coxeter-theoretic properties of…

Combinatorics · Mathematics 2026-04-07 Jack Chen-An Chou , Zachary Hamaker

Involution Schubert polynomials represent cohomology classes of $K$-orbit closures in the complete flag variety, where $K$ is the orthogonal or symplectic group. We show they also represent $T$-equivariant cohomology classes of subvarieties…

Combinatorics · Mathematics 2022-11-09 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

As shown by A. Melnikov, the orbits of a Borel subgroup acting by conjugation on upper-triangular matrices with square zero are indexed by involutions in the symmetric group. The inclusion relation among the orbit closures defines a partial…

Combinatorics · Mathematics 2024-05-15 Evgeny Smirnov

It is a classical result that any permutation in the symmetric group can be generated by a sequence of adjacent transpositions. The sequences of minimal length are called reduced words, and in this paper we study the graphs of these reduced…

Combinatorics · Mathematics 2020-10-30 Samantha Dahlberg , Younghwan Kim

The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…

Combinatorics · Mathematics 2014-09-16 Mahir Bilen Can , Michael Joyce , Benjamin Wyser

Given an involutive automorphism $\theta$ of a Coxeter system $(W,S)$, let $\mathfrak{I}(\theta) \subseteq W$ denote the set of twisted involutions. We provide a minimal set of moves that can be added to the braid moves, in order to connect…

Combinatorics · Mathematics 2017-04-28 Mikael Hansson , Axel Hultman

The orbits of the symplectic group acting on the type A flag variety are indexed by the fixed-point-free involutions in a finite symmetric group. The cohomology classes of the closures of these orbits have polynomial representatives…

Combinatorics · Mathematics 2019-09-30 Zachary Hamaker , Eric Marberg , Brendan Pawlowski

Let $W$ be a finite Coxeter group and $X$ a subset of $W$. The length polynomial $L_{W,X}(t)$ is defined by $L_{W,X}(t) = \sum_{x \in X} t^{\ell(x)}$, where $\ell$ is the length function on $W$. In this article we derive expressions for the…

Combinatorics · Mathematics 2014-03-31 Sarah B. Hart , Peter J. Rowley

There is a natural analogue of weak Bruhat order on the involutions in any Coxeter group. The saturated chains of intervals in this order correspond to reduced words for a certain set of group elements called atoms. Brion gives a general…

Combinatorics · Mathematics 2025-06-12 Zachary Hamaker , Eric Marberg

We survey the recent study of involution Schubert polynomials and a modest generalization that we call degenerate involution Schubert polynomials. We cite several conditions when (degenerate) involution Schubert polynomials have simple…

Combinatorics · Mathematics 2020-02-04 Michael Joyce

Let $w$ be a word in a free group. A few years ago, Magee and the first named author discovered that the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain Fourier coefficients…

Group Theory · Mathematics 2026-05-08 Doron Puder , Yotam Shomroni , Danielle Ernst-West , Matan Seidel

In groups with involution a nonassociative product of elements is defined, which leads to the definition of a certain type of quasigroups. These quasigroups are represented by square tables of complex numbers, with inverses, which differ…

Group Theory · Mathematics 2015-09-30 Jerzy Kocinski

There is a well-known classification of conjugacy classes of involutions in finite Coxeter groups, in terms of subsets of nodes of their Coxeter graphs. In many cases, the product of an involution with the longest element is again an…

Group Theory · Mathematics 2022-02-10 Marcus Zibrowius

We define and study odd analogues of classical geometric and combinatorial objects associated to permutations, namely odd Schubert varieties, odd diagrams, and odd inversion sets. We show that there is a bijection between odd inversion sets…

Combinatorics · Mathematics 2020-06-24 Francesco Brenti , Angela Carnevale

We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…

Combinatorics · Mathematics 2007-05-23 Jinho Baik , Eric M. Rains

The $\textit{Edelman-Greene statistic}$ of S. Billey-B. Pawlowski measures the "shortness" of the Schur expansion of a Stanley symmetric function. We show that the maximum value of this statistic on permutations of Coxeter length $n$ is the…

Combinatorics · Mathematics 2019-09-02 Gidon Orelowitz

We study the graph on reduced words with edges given by the Coxeter relations for the symmetric group. We define a metric on reduced words for a given permutation, analogous to Coxeter length for permutations, for which the graph becomes…

Combinatorics · Mathematics 2020-03-05 Sami Assaf
‹ Prev 1 2 3 10 Next ›