Related papers: Group-theoretic Approach for Symbolic Tensor Manip…
The authors continue a series of articles studying certain unitary representations of the Richard Thompson groups $F,T,V$ called Pythagorean. They all extend to the Cuntz algebra $\mathcal{O}$ and conversely all representations of…
Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
In this work we investigate tensor completions of groups by associative rings, which were introduced by R.Lyndon and G.Baumslag in 1960s. The main result states that there exists an algorithm that decides if a given finite system of…
We introduce a statistical system on random networks of trivalent vertices for the purpose of studying the canonical tensor model, which is a rank-three tensor model in the canonical formalism. The partition function of the statistical…
A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation and represent quantum entanglement. In this sense a tensor can be viewed as valuable resource whose transformation can lead to…
We formulate a general framework for the study of operator systems arising from discrete groups. We study in detail the operator system of the free group on $n$ generators, as well as the operator systems of the free products of finitely…
We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…
Group-theoretical fusion categories are defined by data concerning finite groups and their cohomology: A finite group $G$ endowed with a three-cocycle $\omega$, and a subgroup $H\subset G$ endowed with a two-cochain whose coboundary is the…
We present an efficient method for finding the independent invariant tensors of a gauge theory. Our method uses a theorem relating invariant tensors and D-flat directions in field space. We apply our method to several examples-- SO(3) with…
The canonical tensor model (CTM) is a tensor model in Hamilton formalism and is studied as a model for gravity in both classical and quantum frameworks. Its dynamical variables are a canonical conjugate pair of real symmetric three-index…
Diagrammatic reasoning using string diagrams provides an intuitive language for reasoning about morphisms in a symmetric monoidal category. To allow working with infinite families of string diagrams, !-graphs were introduced as a method to…
We review an approach to the index theory of operator algebras associated with Lie groups of quantized canonical transformations. Main points are an ellipticity condition ensuring the Fredholm property, the definition of localized algebraic…
Tensor expression simplification is an "ancient" topic in computer algebra, a representative of which is the canonicalization of Riemann tensor polynomials. Practically fast algorithms exist for monoterm canonicalization, but not for…
Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [arXiv:0907.2994v1] we discussed how to…
We determine the abstract commensurator com(F) of Thompson's group F and describe it in terms of piecewise linear homeomorphisms of the real line and in terms of tree pair diagrams. We show com (F) is not finitely generated and determine…
Group algebras of permutations have proved highly useful in solving a number of problems in large N gauge theories. I review the use of permutations in classifying gauge invariants in one-matrix and multi-matrix models and computing their…
We present different methods for symbolic computer algebra computations in higher dimensional (\ge9) Clifford algebras using the \Clifford\ and \Bigebra\ packages for \Maple(R). This is achieved using graded tensor decompositions,…
We present a very fast implementation of the Butler-Portugal algorithm for index canonicalization with respect to permutation symmetries. It is called xPerm, and has been written as a combination of a Mathematica package and a C subroutine.…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…