Related papers: Transpositional sequences and multigraphs

We introduce a formalism of infinite, linearly ordered products in general groups. Using this, we define infinite compositions in certain groups of formal power series such as transseries. We show that such groups can sometimes be…

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$…

We consider two orthogonal points of view on finite permutations, seen as pairs of linear orders (corresponding to the usual one line representation of permutations as words) or seen as bijections (corresponding to the algebraic point of…

This thesis is dedicated to developing a dilation theory for semigroups of completely positive maps. The first part treats two-parameter semigroups, and contains also contributions to dilation theory of product system representations. The…

Tensor train (TT) decomposition is a powerful representation for high-order tensors, which has been successfully applied to various machine learning tasks in recent years. However, since the tensor product is not commutative, permutation of…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first charac- terize some functions having linear translators, based on which several families of…

Let $n \in \mathbb{Z}_{>0}$. We prove that there exist a finite set $V$ and finitely many algebraic curves $T_1, \ldots, T_k$ with the following property: if $(x_1, \ldots, x_n, y)$ is an $(n+1)$-tuple of pairwise distinct singular moduli…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

We study conditions under which subdirect products of various types of algebraic structures are finitely generated or finitely presented. In the case of two factors, we prove general results for arbitrary congruence permutable varieties,…

Let $\beta$ be any permutation on $n$ symbols and let $c(k, \beta)$ be the number of permutations that $k$-commute with $\beta$. The cycle type of a permutation $\beta$ is a vector $(c_1, \dots, c_n)$ such that $\beta$ has exactly $c_i$…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a)=ab$, $\sigma(b)=ac$, $\sigma(c)=a$. The prefix of $\mathbb{T}$ of length $n$ is denoted by $\mathbb{T}[1,n]$. The main result is threefold, we give: (1)…

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

The partial sums of a sequence ${\mathbf x} = x_1, x_2, \ldots, x_k$ of distinct non-identity elements of a group $(G,\cdot)$ are $s_0 = id_G$ and $s_j = \prod_{i=1}^j x_i$ for $0 < j \leq k$. If the partial sums are all different then…

A permutation $\sigma$ describing the relative orders of the first $n$ iterates of a point $x$ under a self-map $f$ of the interval $I=[0,1]$ is called an \emph{order pattern}. For fixed $f$ and $n$, measuring the points $x\in I$ (according…

Let $(G, 1_G)$ be a finite group and let $S=g_1\bdot \ldots\bdot g_{\ell}$ be a nonempty sequence over $G$. We say $S$ is a tiny product-one sequence if its terms can be ordered such that their product equals $1_G$ and…

Let $f$ be a permutation from $\mathbb{N}_0$ onto $\mathbb{N}_0$. Let $x\in\mathbb{N}_0$ and consider a (finite or infinite) sequence $s= (x,f(x),f^2(x),\cdots)$. We call $s$ a permutation sequence. Let $D$ be the set of elements of $s$. If…

Given an integer $q\ge2$ and $\theta_1,\cdots,\theta_{q-1}\in\{0,1\}$, let $(\theta_n)_{n\ge0}$ be the generalized Thue-Morse sequence, defined to be the unique fixed point of the morphism $$0\mapsto0\theta_1\cdots\theta_{q-1}$$…

Given a formal power series f(z) we define, for any positive integer r, its rth Witt transform, W_f^{(r)}, by rW_f^{(r)}(z)=sum_{d|r}mu(d)f(z^d)^{r/d}, where mu is the Moebius function. The Witt transform generalizes the necklace…

Tensor transpose is a higher order generalization of matrix transpose. In this paper, we use permutations and symmetry group to define? the tensor transpose. Then we discuss the classification and composition of tensor transposes.…