English
Related papers

Related papers: Involution words: counting problems and connection…

200 papers

Taking transposes of Standard Young Tableaux defines a natural involution on the set $I(n)$ of involutions of length $n$ via the the Robinson-Schensted correspondence. In some cases, this involution can be defined without resorting to the…

Combinatorics · Mathematics 2019-04-05 Miklos Bona , Rebecca Smith

The aim of this paper is to define some new number-theoretic functions including necklaces polynomials and the numbers of special words such as Lyndon words. By using Dirichlet convolution formula with well-known number-theoretic functions,…

Number Theory · Mathematics 2021-04-19 Irem Kucukoglu , Yilmaz Simsek

Springer numbers are an analog of Euler numbers for the group of signed permutations. Arnol'd showed that they count some objects called snakes, that generalize alternating permutations. Hoffman established a link between Springer numbers,…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

Representation Theory · Mathematics 2021-07-15 Harm Derksen , Visu Makam

Reflection length and codimension of fixed point spaces induce partial orders on a complex reflection group. While these partial orders are of independent combinatorial interest, our investigation is motivated by a connection between the…

Combinatorics · Mathematics 2012-02-02 Briana Foster-Greenwood

For certain groups, parabolic subgroups appear as stabilizers of flags of sets or vector spaces. Quotients by these parabolic subgroups represent orbits of flags, and their cardinalities asymptotically reveal entropies (as rates of…

Information Theory · Computer Science 2025-12-03 Ryan Leal , Jingtong Sun , Juan Pablo Vigneaux

We define a new class of countable groups, which are defined by its action on the set of monotonic numberings (diagrams) of an arbitrary finite or countable partial ordered set (poset). These groups are generated by the set of involutions?…

Combinatorics · Mathematics 2021-11-17 Anatoly Vershik

These introductory notes are about functional renormalization group equations and some of their applications. It is emphasised that the applicability of this method extends well beyond critical systems, it actually provides us a general…

High Energy Physics - Theory · Physics 2011-07-19 Janos Polonyi

In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…

Combinatorics · Mathematics 2014-11-17 Émilie Charlier , Teturo Kamae , Svetlana Puzynina , Luca Q. Zamboni

Convolution admits a natural formulation as a functional operation on matrices. Motivated by the functional and entrywise calculi, this leads to a framework in which convolution defines a matrix transform that preserves positivity. Within…

Functional Analysis · Mathematics 2026-01-01 Javad Mashreghi , Mostafa Nasri , Prateek Kumar Vishwakarma

We study the restriction of the absolute order on a Coxeter group $W$ to an interval $[1,w]_T$, where $w\in W$ is an involution. We characterize and classify those involutions $w$ for which $[1,w]_T$ is a lattice, using the notion of…

Group Theory · Mathematics 2026-01-14 Thomas Gobet

We introduce shifted analogues of key polynomials related to symplectic and orthogonal orbit closures in the complete flag variety. Our definitions are given by applying isobaric divided difference operators to the analogues of Schubert…

Combinatorics · Mathematics 2024-09-09 Eric Marberg , Travis Scrimshaw

We study continuous wavelet transforms associated to matrix dilation groups giving rise to an irreducible square-integrable quasi-regular representation on ${\rm L}^2(\mathbb{R}^d)$. We first prove that these representations are integrable…

Functional Analysis · Mathematics 2013-08-22 Hartmut Führ

In this short note we focus on self-inverse Sheffer sequences and involutions in the Riordan group. We translate the results of Brown and Kuczma on self-inverse sequences of Sheffer polynomials to describe all involutions in the Riordan…

Combinatorics · Mathematics 2009-07-15 Ana Luzon , Manuel A. Moron

Suppose that G is a finite, unitary reflection group acting on a complex vector space V and X is the fixed point subspace of an element of G. Define N to be the setwise stabilizer of X in G, Z to be the pointwise stabilizer, and C=N/Z. Then…

Representation Theory · Mathematics 2016-11-22 Nils Amend , Angela Berardinelli , J. Matthew Douglass , Gerhard Roehrle

We formulate a theory of invariants for the spin symmetric group in some suitable modules which involve the polynomial and exterior algebras. We solve the corresponding graded multiplicity problem in terms of specializations of the Schur…

Representation Theory · Mathematics 2011-02-18 Jinkui Wan , Weiqiang Wang

We investigate the homology representation of the symmetric group on rank-selected subposets of subword order. We show that the homology module for words of bounded length, over an alphabet of size $n,$ decomposes into a sum of tensor…

Representation Theory · Mathematics 2025-09-09 Sheila Sundaram

Edelman and Greene generalized the Robinson--Schensted--Knuth correspondence to reduced words in order to give a bijective proof of the Schur positivity of Stanley symmetric functions. Stanley symmetric functions may be regarded as the…

Combinatorics · Mathematics 2019-03-15 Sami Assaf

Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…

Combinatorics · Mathematics 2017-09-26 Samantha Dahlberg

Word order evolution has been hypothesized to be constrained by a word order permutation ring: transitions involving orders that are closer in the permutation ring are more likely. The hypothesis can be seen as a particular case of…

Computation and Language · Computer Science 2020-09-24 Ramon Ferrer-i-Cancho