Related papers: Algorithmic constructions of relative train track …
We prove that the full automorphism group and the outer automorphism group of the free group of countably infinite rank are coarsely bounded. That is, these groups admit no continuous actions on a metric space with unbounded orbits, and…
In this article, we characterize the (covariant) isotropy groups of free, finitely generated racks and quandles. As a consequence, we show that the usual inner automorphisms of such racks and quandles are precisely those automorphisms that…
The girth of a matrix is the least number of linearly dependent columns, in contrast to the rank which is the largest number of linearly independent columns. This paper considers the construction of {\it high-girth} matrices, whose…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
A fully irreducible outer automorphism phi of the free group F_n of rank n has an expansion factor which often differs from the expansion factor of the inverse of phi. Nevertheless, we prove that the ratio between the logarithms of the…
The tensor train (TT) rank has received increasing attention in tensor completion due to its ability to capture the global correlation of high-order tensors ($\textrm{order} >3$). For third order visual data, direct TT rank minimization has…
For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…
In this note, we provide some categorical perspectives on the relativization construction arising from quantum measurement theory in the presence of symmetries and occupying a central place in the operational approach to quantum reference…
The Product Replacement Algorithm is a practical algorithm for generating random elements of a finite group. The algorithm can be described as a random walk on a graph whose vertices are the generating k-tuples of the group (for a fixed…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
We construct ensembles of random integrable matrices with any prescribed number of nontrivial integrals and formulate integrable matrix theory (IMT) -- a counterpart of random matrix theory (RMT) for quantum integrable models. A type-M…
For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…
A rank 3 graph is an orbital graph of a rank 3 permutation group of even order. Despite the classification of rank 3 graphs being complete, see, e.g., Chapter 11 of the recent monograph 'Strongly regular graphs' by Brouwer and Van…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
We will review the main results concerning the automorphism groups of saturated structures which were obtained during the two last decades. The main themes are: the small index property in the countable and uncountable cases; the…
We present new numerical results on the space of local, unitary, parity-preserving conformal field theories (CFTs) in three dimensions from the stress tensor bootstrap. In bounds maximizing certain OPE coefficients, we find a plethora of…
The central purpose of this article is to establish new inverse and implicit function theorems for differentiable maps with isolated critical points. One of the key ingredients is a discovery of the fact that differentiable maps with…
The unitary representation theory of locally compact contraction groups and their semi-direct products with $\mathbb{Z}$ is studied. We put forward the problem of completely characterising such groups which are type I or CCR and this…
An independent transversal (IT) in a graph with a given vertex partition is an independent set consisting of one vertex in each partition class. Several sufficient conditions are known for the existence of an IT in a given graph with a…