Related papers: Unshuffling Permutations
Permutation symmetries of multipartite quantum states are defined only when the constituent subsystems are of equal dimensions. In this work we extend this notion of permutation symmetry to heterogeneous systems, that is, systems composed…
An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…
Commutative shuffle products are known to be intimately related to universal formulas for products, exponentials and logarithms in group theory as well as in the theory of free Lie algebras, such as, for instance, the…
Various semantics for studying the square of opposition and the hexagon of opposition have been proposed recently. We interpret sentences by imprecise (set-valued) probability assessments on a finite sequence of conditional events. We…
Computations with integro-differential operators are often carried out in an associative algebra with unit, and they are essentially non-commutative computations. By adjoining a cocommutative co-product, one can have those operators perform…
What is the higher-dimensional analog of a permutation? If we think of a permutation as given by a permutation matrix, then the following definition suggests itself: A d-dimensional permutation of order n is an [n]^(d+1) array of zeros and…
For natural and artificial systems with some symmetry structure, computational understanding and manipulation can be achieved without learning by exploiting the algebraic structure. Here we describe this algebraic coordinatization method…
A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
We carry on the investigation initiated in [15] : we describe new shuffle products coming from some special functions and group them, along with other products encountered in the literature, in a class of products, which we name…
Consider a permutation $\sigma\in S_n$ as a deck of cards numbered from 1 to $n$ and laid out in a row, where $\sigma_j$ denotes the number of the card that is in the $j$-th position from the left.\rm\ We study some probabilistic and…
We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…
We determine a set of permutation patterns $q$ so that the number of permutations with $r$ occurrences of $q$ is asymptotically $n^r$ times the number of permutations avoiding $q$, partially settling a conjecture of Conway and Guttman. We…
Inspired by connections to two dimensional quantum theory, we define several models of computation based on permuting distinguishable particles (which we call balls), and characterize their computational complexity. In the quantum setting,…
Using a notation of corner between edges when graph has a fixed rotation, i.e. cyclical order of edges around vertices, we define combinatorial objects - combinatorial maps as pairs of permutations, one for vertices and one for faces.…
We call an integer a \emph{near-square} if its absolute value is a square or a prime times a square. We investigate such near-squares in the binary recurrence sequences defined for integers $a \geq 3$ by $u_{0}(a)=0$, $u_{1}(a)=1$ and…
A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…
A large family of relations among multiple zeta values may be described using the combinatorics of shuffle and quasi-shuffle algebras. While the structure of shuffle algebras have been well understood for some time now, quasi-shuffle…
Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…