Related papers: Canonical Representatives of Morphic Permutations
We propose the method for obtaining invariants of arbitrary representations of Lie groups that reduces this problem to known problems of linear algebra. The basis of this method is the idea of a special extension of the representation…
We discuss canonical transformations in Quantum Field Theory in the framework of the functional-integral approach. In contrast with ordinary Quantum Mechanics, canonical transformations in Quantum Field Theory are mathematically more subtle…
We study the notion of essential dimension for a linear representation of a finite group. In characteristic zero we relate it to the canonical dimension of certain products of Weil transfers of generalized Severi-Brauer varieties. We then…
Let $A$ be a ring with $1\neq 0$, not necessarily finite, endowed with an involution~$*$, that is, an anti-automorphism of order $\leq 2$. Let $H_n(A)$ be the additive group of all $n\times n$ hermitian matrices over $A$ relative to $*$.…
Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…
We construct a class of rank-one infinite measure-preserving transformations such that for each transformation $T$ in the class, the cartesian product $T\times T$ of the transformation with itself is ergodic, but the product $T\times…
Let $G$ be a finite classical group of Lie type of rank $\ell$, defined over a field of characteristic $p>2$. In this work, we classify the irreducible representations of $G$ whose dimensions are bounded by a constant proportional to…
We discuss implications of the following statement about the representation theory of symmetric groups: every integer appears infinitely often as an irreducible character evaluation, and every nonnegative integer appears infinitely often as…
In this paper, we will give a natural definition for morphisms between multiplicative unitaries. We will then discuss some equivalences of this definition and some interesting properties of them. Moreover, we will define normal…
We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…
Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…
We completely characterize perfect, permutative, irreducible representations of an ultragraph Leavitt path algebra. For this we extend to ultragraph Leavitt path algebras Chen's construction of irreducible representations of Leavitt path…
For positive $q\neq1$, the $q$-exchangeability of an infinite random word is introduced as quasi-invariance under permutations of letters, with a special cocycle which accounts for inversions in the word. This framework allows us to extend…
A graph $G = (V, E)$ is word-representable, if there exists a word w over the alphabet V such that for letters ${x, y} \in V$ , $x$ and $y$ alternate in $w$ if and only if $xy \in E$. In this paper, we prove that any non-empty…
In this work, we characterize the class of word-representable graphs with respect to the modular decomposition. Consequently, we determine the representation number of a word-representable graph in terms of the permutation-representation…
We show that an arbitrary probability distribution can be represented in exponential form. In physical contexts, this implies that the equilibrium distribution of any classical or quantum dynamical system is expressible in grand canonical…
A superpermutation is a sequence that contains every permutation of $n$ distinct symbols as a contiguous substring. For instance, a valid example for three symbols is a sequence that contains all six permutations. This paper introduces a…
We study how much injective morphisms can increase the repetitiveness of a given word. This question has a few possible variations depending on the meaning of ``repetitiveness''. We concentrate on fractional exponents of finite words and…
A permutation is said to be a square if it can be obtained by shuffling two order-isomorphic patterns. The definition is intended to be the natural counterpart to the ordinary shuffle of words and languages. In this paper, we tackle the…