Related papers: Permutations whose reverse shares the same recordi…

In this manuscript, we study a special class of correspondences on $\mathbb{P}^{1} \times \mathbb{P}^{1}$ given by a polynomial relation, say $P(z, w)$. We focus on what we call restrictive polynomial correspondence and characterise that it…

Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…

For a split reductive group scheme $G$ over a commutative ring $k$ with Weyl group $W$, there is an important functor $Rep(G,k) \to Rep(W,k)$ defined by taking the zero weight space. We prove that the restriction of this functor to the…

It is known that there is a correspondence between representations of superalgebras and ordinary (non-graded) algebras. Keeping in mind this type of correspondence between the twisted quantum affine superalgebra $U_{q}(gl(2r|1)^{(2)})$ and…

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…

For a Weyl group $W$ and a $W$-permutohedron $P$, there are associated toric varieties $X_P$ and $X_{P/W_K}$ for any parabolic subgroup $W_K$ of $W$, since the quotient $P/W_K$ can be identified with a polytope inside $P$. We construct an…

We investigate retransmission permutation arrays (RPAs) that are motivated by applications in overlapping channel transmissions. An RPA is an $n\times n$ array in which each row is a permutation of ${1, ..., n}$, and for $1\leq i\leq n$,…

In the symmetric group $S_n$, each element $\sigma$ has an associated cycle type $\alpha$, a partition of $n$ that identifies the conjugacy class of $\sigma$. The Robinson-Schensted (RS) correspondence links each $\sigma$ to another…

Letter-to-letter transducers are a standard formalism for modeling reactive systems. Often, two transducers that model similar systems differ locally from one another, by behaving similarly, up to permutations of the input and output…

The number of Young Tableaux whose shape is a k by n rectangle is famously (nk)! 0! ... (k-1)!/((n+k-1)!(n+k-2)!... n!) implying that for each specific k, that sequence satisfies a linear recurrence equation with polynomial coefficients of…

Regular path queries (RPQs) the ubiquitous mechanism for querying data graphs of partially known structure. RPQs are in essence regular expressions over the edge symbols. The answer to an RPQ on a given graph (database) is the set of pairs…

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

Let $s$ be even and $q=p^s$. We show that the ring $W(\mathbb{F}_{q})[\![X]\!]/(X^2-pX)$ is a quotient of the universal deformation ring of a representation of a finite group. This amounts to giving an example of a finite group and its…

Computing the reversal distances of signed permutations is an important topic in Bioinformatics. Recently, a new lower bound for the reversal distance was obtained via the plane permutation framework. This lower bound appears different from…

For a compact Riemannian locally symmetric space $\Gamma\backslash G/K$ of arbitrary rank we determine the location of certain Ruelle-Taylor resonances for the Weyl chamber action. We provide a Weyl-lower bound on an appropriate counting…

For any positive integers $k,r,n$ with $r \leq \min\{k,n\}$, let $\mathcal{P}_{k,r,n}$ be the family of all sets $\{(x_1,y_1), \dots, (x_r,y_r)\}$ such that $x_1, \dots, x_r$ are distinct elements of $[k] = \{1, \dots, k\}$ and $y_1, \dots,…

The present paper deals with the representation theory of the reflection equation algebra, connected with a Hecke type R-matrix. Up to some reasonable additional conditions the R-matrix is arbitrary (not necessary originated from quantum…

Lascoux polynomials are $K$-theoretic analogues of the key polynomials. They both have combinatorial formulas involving tableaux: reverse set-valued tableaux ($\mathsf{RSVT}$) rule for Lascoux polynomials and reverse semistandard Young…

If $\alpha \in S_n$ is a permutation of $\{1, 2, \ldots, n\}$, the inversion set of $\alpha$ is $\Phi(\alpha) = \{(i, j) \, | \, 1 \leq i < j \leq n, \alpha(i) > \alpha(j)\}$. We describe all $r$-tuples $\alpha_1, \alpha_2, \ldots, \alpha_r…

Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern…