Related papers: Cyclic sieving for longest reduced words in the hy…

We study rotation of invariant vectors in tensor products of minuscule representations. We define a combinatorial notion of rotation of minuscule Littelmann paths. Using affine Grassmannians, we show that this rotation action is realized…

Let $S_1, \cdots, S_N$ simple finite-dimensional modules of a quantum affine algebra. We prove that if $S_i\otimes S_j$ is cyclic for any $i < j$ (i.e. generated by the tensor product of the highest weight vectors), then $S_1\otimes \cdots…

We introduce the task of out-of-order membership to a formal language L, where the letters of a word w are revealed one by one in an adversarial order. The length |w| is known in advance, but the content of w is streamed as pairs (i, w[i]),…

We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. We…

A decomposition theorem for the Lind zeta function of a reversal system $(X, T, R)$ of finite order is established. A reversal system can be regarded as an action of a certain group $G$ on $X$. To establish an explicit formula for the Lind…

We consider the infinite one-sided sequence over alphabet $\{a,b\}$ generated by the period-doubling substitution $\sigma(a)=ab$ and $\sigma(b)=aa$, denoted by $\mathbb{D}$. Let $r_p(\omega)$ be the $p$-th return word of factor $\omega$.…

The {\em longest common subsequence (LCS)} problem is a classic and well-studied problem in computer science. LCS is a central problem in stringology and finds broad applications in text compression, error-detecting codes and biological…

The Garsia--Haiman module is a bigraded $\mathfrak{S}_n$-module whose Frobenius image is a Macdonald polynomial. The method of orbit harmonics promotes an $\mathfrak{S}_n$-set $X$ to a graded polynomial ring. The orbit harmonics can be…

In this text, we consider random permutations which can be written as free words in several independent random permutations: firstly, we fix a non trivial word $w$ in letters $g_1,g_1^{-1},..., g_k,g_k^{-1}$, secondly, for all $n$, we…

Let $G$ be a finite group, define $I(G)=\{x\in G : x^{2}=1\}$, $C(G)=$ set of the cyclic subgroups of $G$, $i(G)=|I(G)|$ and $c(G)=|C(G)|$. In this article, we will classify finite groups with $i(G)=c(G)-r$ for $r=0,1,$ and $2$. We also…

We study a new notion of cyclic avoidance of abelian powers. A finite word $w$ avoids abelian $N$-powers cyclically if for each abelian $N$-power of period $m$ occurring in the infinite word $w^\omega$, we have $m \geq |w|$. Let…

The paper concerns a definition for $q$-Kreweras numbers for finite Weyl groups $W$, refining the $q$-Catalan numbers for $W$, and arising from work of the second author. We give explicit formulas in all types for the $q$-Kreweras numbers.…

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…

Let $G$ be a semisimple Lie group and let $\g =\n_- +\hh +\n$ be a triangular decomposition of $\g= \hbox{Lie}\,G$. Let $\b =\hh +\n$ and let $H,N,B$ be Lie subgroups of $G$ corresponding respectively to $\hh,\n$ and $\b$. We may identify…

We study the girth of Cayley graphs of finite classical groups G on random sets of generators. Our main tool is an essentially best possible bound we obtain on the probability that a given word w takes the value 1 when evaluated in G in…

In a finite real reflection group, the reflection length of each element is equal to the codimension of its fixed space, and the two coincident functions determine a partial order structure called the absolute order. In complex reflection…

We analyze $f$-frequently hypercyclic, $q$-frequently hypercyclic ($q> 1$) and frequently hypercyclic $C_{0}$-semigroups ($q=1$) defined on complex sectors, working in the setting of separable infinite-dimensional Fr\'echet spaces. Some…

Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot\ldots\cdot(n_lg)$ where $g\in G$ and $n_1, \ldots, n_l\in[1, \ord(g)]$, and the index $\ind(S)$ of $S$ is defined to be the minimum of…

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.…