Related papers: Transpositional sequences and multigraphs

Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…

Let $R$ be a commutative ring with identity and $n\geq1$ be an integer. Let $R^{n}=R\times\cdots\times R~(n~times)$. The \textit{total dot product} graph, denoted by $TD(R,n)$ is a simple graph with elements of $R^{n}-\{(0,0,\ldots,0)\}$ as…

We compute the number of ways a given permutation can be written as a product of exactly $k$ transpositions. We express this number as a linear combination of explicit geometric sequences, with coefficients which can be computed in many…

Let $T$ be a maximal torus of a semisimple complex algebraic group, $\mathrm{BS}(s)$ be the Bott-Samelson variety for a sequence of simple reflections $s$ and $\mathrm{BS}(s)^T$ be the set of $T$-fixed points of $\mathrm{BS}(s)$. We prove…

In this paper, we study harmonic analysis on finite homogeneous spaces whose associated permutation representation decomposes with multiplicity. After a careful look at Frobenius reciprocity and transitivity of induction, and the…

A Transposition graph $T_n$ is defined as a Cayley graph over the symmetric group $Sym_n$ generated by all transpositions. This paper shows how the spectrum of $T_n$ can be obtained using the spectral properties of the Jucys-Murphy…

Given integers $k\geq 2$ and $a_1,\ldots,a_k\geq 1$, let $\boldsymbol{a}:=(a_1,\ldots,a_k)$ and $n:=a_1+\cdots+a_k$. An $\boldsymbol{a}$-multiset permutation is a string of length $n$ that contains exactly $a_i$ symbols $i$ for each…

For a composition $I$ whose first part exceeds 1, we can define the multiple $t$-value $t(I)$ as the sum of all the terms in the series for the multiple zeta value $\zeta(I)$ whose denominators are odd. In this paper we show that if $I$ is…

Let $T$ be a digraph with vertices $u_1, \dots, u_t$ ($t\ge 2$) and let $H_1, \dots, H_t$ be digraphs such that $H_i$ has vertices $u_{i,j_i},\ 1\le j_i\le n_i.$ Then the composition $Q=T[H_1, \dots, H_t]$ is a digraph with vertex set…

Let $\{A_{i,n}\}$ be a triangular array of elements in a Banach algebra, whose norms do not grow too fast, and whose row averages converge to $A$. Let $\sigma \in S(n)$ be a permutation drawn uniformly at random. If the array only contains…

A complex matrix is called \emph{coninvolutory} if $T\overline{T}=I$. In this paper, we study decompositions of affine transformations in $\mathrm{Aff}(n,\mathbb{C})=\mathrm{GL}(n,\mathbb{C})\ltimes \mathbb{C}^n$ into products of…

We prove that deciding whether a given input word contains as subsequence every possible permutation of integers $\{1,2,\ldots,n\}$ is coNP-complete. The coNP-completeness holds even when given the guarantee that the input word contains as…

We prove that given a measure preserving system $(X,\mathcal{B},\mu,T_1,\dots,T_d)$ with commuting, ergodic transformations $T_i$ such that $T_iT_j^{-1}$ are ergodic for all $i \neq j$, the multicorrelation sequence $a(n)=\int_X f_0 \cdot…

Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…

Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…

For any group $G$ with subgroup $H$ and a set of representatives $T$ from the set of cosets $G/H$, we develop a rewriting system from $G$ that bequeaths a product into the set decomposition $T\times H$ of $G$, converting it into a group. In…

The task of learning to map an input set onto a permuted sequence of its elements is challenging for neural networks. Set-to-sequence problems occur in natural language processing, computer vision and structure prediction, where…

Let $R$ be an associative ring with unity $1$ and consider that $2,k$ and $2k\in \mathbb{N}$ are invertible in $R$. For $m\geq 1$ denote by $UT_n(m,R)$ and $UT_{\infty}(m,R)$, the subgroups of $UT_n(R)$ and $UT_{\infty}(R)$ respectively,…