Related papers: Group-theoretic Approach for Symbolic Tensor Manip…
We introduce a new OpenMath content dictionary, named tensor1, containing symbols for the expression of tensor formulas. These symbols support the expression of non-Cartesian coordinates and invariant, multilinear expressions in the context…
Given an ample groupoid $G$ with compact unit space, we study the canonical representation of the topological full group $[[G]]$ in the full groupoid $C^*$-algebra $C^*(G)$. In particular, we show that the image of this representation…
Sharing of notations and theories across an inheritance hierarchy of mathematical structures, e.g., groups and rings, is important for productivity when formalizing mathematics in proof assistants. The packed classes methodology is a…
The JSJ decomposition and the Makanin-Razborov diagram were proved to be essential in studying varieties over free groups, semigroups and associative algebras. In this paper we suggest a unified conceptual approach to the applicability of…
We introduce an algebraic structure for studying state-independent contextuality arguments, a key form of quantum non-classicality exemplified by the well-known Peres-Mermin magic square, and used as a source of quantum advantage. We…
Symmetry properties of r-times covariant tensors T can be described by certain linear subspaces W of the group ring K[S_r] of a symmetric group S_r. If for a class of tensors T such a W is known, the elements of the orthogonal subspace…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
ITensor is a system for programming tensor network calculations with an interface modeled on tensor diagram notation, which allows users to focus on the connectivity of a tensor network without manually bookkeeping tensor indices. The…
We give a new description of computads for weak globular $\omega$-categories by giving an explicit inductive definition of the free words. This yields a new understanding of computads, and allows a new definition of $\omega$-category that…
We present an algorithm to compute the action of the Hecke operators on the top dimensional integral cohomology of certain torsion-free arithmetic subgroups of algebraic groups of Q-rank one. This generalizes the modular symbol algorithm to…
In this paper, we briefly discuss the dynamic and functional approach to computer symbolic tensor analysis. The ccgrg package for Wolfram Language/Mathematica is used to illustrate this approach. Some examples of applications are attached.
A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…
The symmetry-constrained response tensors on transport, optical, and electromagnetic effects are of central importance in condensed matter physics because they can guide experimental detections and verify theoretical calculations. These…
We propose a tensor network algorithm for the efficient sampling of quantum pure states belonging to a generalized microcanonical ensemble. The algorithm consists in an adaptation of the power method to a recently introduced ensemble of…
Using Dunkl operators, we introduce a continuous family of canonical invariants of finite reflection groups. We verify that the elementary canonical invariants of the symmetric group are deformations of the elementary symmetric polynomials.…
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…
We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can…
These lecture notes present a method for symbolic tensor calculus that (i) runs on fully specified smooth manifolds (described by an atlas), (ii) is not limited to a single coordinate chart or vector frame, (iii) runs even on…
In the work are defined the concepts semi-canonical and canonical binary matrix. What is described is an algorithm solving the combinatorial problem for finding the semi-canonical matrices in the set \Lambda_n^k consisting of all n\times n…
Compact matrix quantum groups are strongly determined by their intertwiner spaces, due to a result by S.L. Woronowicz. In the case of easy quantum groups, the intertwiner spaces are given by the combinatorics of partitions, see the inital…