Related papers: When all Permutations are Combinatorial Similariti…

A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Let $\mathcal A$ and $\mathcal B$ be two (complex) algebras. A linear map $\phi:{\mathcal A}\to{\mathcal B}$ is called $n$-homomorphism if $\phi(a_{1}... a_{n})=\phi(a_{1})...\phi(a_{n})$ for each $a_{1},...,a_{n}\in{\mathcal A}.$ In this…

An automorphism of a graph $G=(V,E)$ is a bijective map $\phi$ from $V$ to itself such that $\phi(v_i)\phi(v_j)\in E$ $\Leftrightarrow$ $v_i v_j\in E$ for any two vertices $v_i$ and $v_j$. Denote by $\mathfrak{G}$ the group consisting of…

Using ideas from shape theory we embed the coarse category of metric spaces into the category of direct sequences of simplicial complexes with bonding maps being simplicial. Two direct sequences of simplicial complexes are equivalent if one…

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…

If an automorphism f of a structure M is such that fix(f^k) = fix(f) for all positive k, then M|fix(f) is a substructure of M. The possible isomorphism types of such M|fix(f) are characterized when M is countable and arithmetically…

A permutation $\pi$ contains a permutation $\sigma$ as a pattern if it contains a subsequence of length $|\sigma|$ whose elements are in the same relative order as in the permutation $\sigma$. This notion plays a major role in enumerative…

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

Consider the algebra Q<<x_1,x_2,...>> of formal power series in countably many noncommuting variables over the rationals. The subalgebra Pi(x_1,x_2,...) of symmetric functions in noncommuting variables consists of all elements invariant…

Isomorphisms p between pattern classes A and B are considered. It is shown that, if p is not a symmetry of the entire set of permutations, then, to within symmetry, A is a subset of one a small set of pattern classes whose structure,…

We characterize all compact and Hausdorff spaces $X$ which satisfy that for every multiplicative bijection $\phi$ on $C(X, I)$, there exist a homeomorphism $\mu : X \to X$ and a continuous map $p: X \to (0, +\infty)$ such that $$\phi (f)…

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…

A sequence of random variables is called exchangeable if the joint distribution of the sequence is unchanged by any permutation of the indices. De Finetti's theorem characterizes all $\{0,1\}$-valued exchangeable sequences as a "mixture" of…

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…

We investigate pairs of permutations $F,G$ of $\mathbb{F}_{p^n}$ such that $F(x+a)-G(x)$ is a permutation for every $a\in\mathbb{F}_{p^n}$. We show that necessarily $G(x) = \wp(F(x))$ for some complete mapping $-\wp$ of $\mathbb{F}_{p^n}$,…

A linear map $\Phi :\mathbb{M}_n \to \mathbb{M}_k$ is called completely copositive if the resulting matrix $[\Phi (A_{j,i})]_{i,j=1}^m$ is positive semidefinite for any integer $m$ and positive semidefinite matrix $[A_{i,j}]_{i,j=1}^m$. In…