Related papers: Relations with a fixed interval exchange transform…
Irreducible representations (irreps) of a finite group $G$ are equivalent if there exists a similarity transformation between them. In this paper, we describe an explicit algorithm for constructing this transformation between a pair of…
A class of algebras is constructed using free fermions and the invariant antisymmetric tensors associated with irreducible holonomy groups. (This version contains minor typographical corrections and some additional references. )
Fix a word $w$ in a free group $F$ on $r$ generators. A $w$-random permutation in the symmetric group $S_N$ is obtained by sampling $r$ independent uniformly random permutations $\sigma_{1},\ldots,\sigma_{r}\in S_{N}$ and evaluating…
Bj\"orner-Ekedahl prove that general intervals $[e,w]$ in Bruhat order are "top-heavy", with at least as many elements in the $i$-th corank as the $i$-th rank. Well-known results of Carrell and of Lakshmibai-Sandhya give the equality case:…
We introduce the notion of semigroup with a tight ideal series and investigate their closures in semitopological semigroups, particularly inverse semigroups with continuous inversion. As a corollary we show that the symmetric inverse…
We describe groups elementarily equivalent to a free metabelian group with n generators. We also explore an exponentiation that naturally occurs in metabelian groups.
This is an expository paper aimed to outline the current situation with problems related with the occurrence of eigenvalue $1$ of elements in linear groups and group representations.
We study the existence of transitive exchange maps with flips defined on the unit circle. We provide a complete answer to the question of whether there exists a transitive exchange map of the unit circle defined on n subintervals and having…
The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…
We consider exchange of three intervals with permutation $(3,2,1)$. The aim of this paper is to count the cardinality of the set $3\iet(N)$ of all words of length $N$ which appear as factors in infinite words coding such transformations. We…
This article is a partial answer to the question of which groups can be represented as isometry groups of formal languages for generalized Levenshtein distances. Namely, it is proved that for any language the modulus of the difference…
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…
We present a link between easy quantum groups, discrete groups and combinatorics. By this, we infer new connections between quantum isometry groups, reflection groups, varieties of groups and the combinatorics of partitions. More precisely,…
We characterise higher order Riesz transforms on the Heisenberg group and also show that they satisfy dimension-free bounds under some assumptions on the multipliers. Using transfer- ence theorems, we deduce boundedness theorems for Riesz…
Interval-closed sets of a poset are a natural superset of order ideals. We initiate the study of interval-closed sets of finite posets from enumerative and dynamical perspectives. In particular, we use the generalized toggle group to define…
A transformation of the form x to iy; x,y in R, or an equivalent similarity transformation with a metric operator $\eta$ are shown to transform non-Hermitian PT-symmetric Hamiltonians into Hermitian partner Hamiltonians in Hilbert space.…
We formulate one dimensional many-body integrable systems in terms of a new set of phase space variables involving exchange operators. The hamiltonian in these variables assumes a decoupled form. This greatly simplifies the derivation of…
In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…
Given a permutation group $G$ on a finite set $\Omega$, let $G^{(k)}$ denote the $k$-closure of $G$, that is, the largest permutation group on $\Omega$ having the same orbits in the induced action on $\Omega^k$ as $G$. Recall that a group…
For substitution satisfying Pisot, irreducible, unimodular condition, a tiling substitution plays a key role in construction of a stepped surface and Rauzy fractal. In this paper we will extend the method to hyperbolic automorphisms on the…