Related papers: Centralizers in the plactic monoid

A system of N points, each having mass m, and a central mass M forming a planar central configuration, is considered. The equations of motion of a test particle are given and compared using different coordinates. For large values of N, even…

We give explicit multiplicities and formulas for multiplicities of characters appearing in the decomposition of the induced character Ind^{S_{2n}}_{C_{S_{2n}}({\sigma})} 1_C, where {\sigma} is an n-cycle, C_{S_{2n}}({\sigma}) is the…

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

Let $\mathsf{mSt}_n$ be the plactic-like monoid obtained by factoring the free monoid over a finite alphabet $\mathcal{A}_n$ by the meet of the stalactic congruence and its dual. In this paper, we prove that $\mathsf{mSt}_n$ can be equipped…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

The central elements of the algebra of monodromy matrices associated with the $\mathbb{Z}_n$ R-matrix are studied. When the crossing parameter $w$ takes a special rational value $w=\frac{n}{N}$, where $N$ and $n$ are positive coprime…

In this paper, we study the stability of matrix polynomials under structured perturbations of their coefficients. More precisely, we consider a family of matrix polynomials \[…

We study a new kind of symmetric polynomials P_n(x_1,...,x_m) of degree n in m real variables, which have arisen in the theory of numerical semigroups. We establish their basic properties and find their representation through the power sums…

The primary contribution of this thesis is to introduce and examine the planar modular partition monoid for parameters $m, k \in \mathbb{Z}_{>0}$, which has simultaneously and independently generated interest from other researchers as…

Let A={a_s(mod n_s)}_{s=0}^k be a system of residue classes. With the help of cyclotomic fields we obtain a theorem which unifies several previously known results concerning system A. In particular, we show that if every integer lies in…

In this paper we describe the quotients of several plactic-like monoids by the least congruences containing the relations $a^{\sigma(a)} = a$ with $\sigma(a)\ge 2$ for every generator $a$. The starting point for this description is the…

In this paper, we extend the Unruh-DeWitt (UDW) model to include a relativistic quantized center of mass (c.m.) for the detector, which traditionally has a classical c.m. and follows a classical trajectory. We develop a relativistic model…

In this article we give a description for the centralizer of the coefficient ring $R$ in the skew PBW extension $\sigma(R)<x_1,x_2,\cdots,x_n>.$ We give an explicit description in the quasi-commutative case and state a necessary condition…

In this note we generalize the definition of partial permutations of Ivanov and Kerov and we build a universal algebra which projects onto the m-centraliser algebra defined by Creedon. We use it to present a new proof for the polynomiality…

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…

To every integer monic polynomial of degree m can be associated a `replacement rule' that generates a word W* from another word W consisting of symbols belonging to a finite `alphabet' of size 2m. This rule applied iteratively on almost any…

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

Given linear spaces $E$ and $F$ over the real numbers or a field of characteristic zero, a simple argument is given to represent a symmetric multilinear map $u(x_1, x_2, \ldots, x_n)$ from $E^n$ to $F$ in terms of its restriction to the…

Central configurations are solutions of the equations $\lambda m_j\boldsymbol{q}_j = \frac{\partial U}{\partial \boldsymbol{q}_j}$, where $U$ denotes the potential function and each $\boldsymbol{q}_j$ is a point in the $d$-dimensional…