Related papers: A Frobenius-Schreier-Sims Algorithm to tensor deco…
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
We study properties of the category of modules of an algebra object A in a tensor category C. We show that the module category inherits various structures from C, provided that A is a Frobenius algebra with certain additional properties. As…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
The representation theory of finite groups began with Frobenius's factorization of Dedekind's group determinant. In this paper, we consider the case of the semigroup determinant. The semigroup determinant is nonzero if and only if the…
This paper proposes a new, visual method to study numerical semigroups and the Frobenius problem. The method is based on building a so-called reduction graph, whose nodes usually correspond to monogenic semigroups, and whose edges can have…
This is an introduction to double algebras which is the structure modelled by the properties of the convolution product in Hopf algebras, weak Hopf algebras and in Hopf algebroids. We show that Hopf algebroids with a Frobenius integral can…
We solve an open problem proposed in the book ``Computing the continuous discretely" written by Matthias Beck and Sinai Robins. That is, we proposed a polynomial time algorithm for calculating Fourier-Dedekind sums. The algorithm is simple…
Tensor decompositions are promising tools for big data analytics as they bring multiple modes and aspects of data to a unified framework, which allows us to discover complex internal structures and correlations of data. Unfortunately most…
We consider semigroups of operators on a W$^*$-algebra and prove, under appropriate assumptions, the existence of a Jacobs-DeLeeuw-Glicksberg type decomposition. This decomposition splits the algebra into a "stable" and "reversible" part…
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…
Given a morphism of (small) groupoids with injective object map, we provide sufficient and necessary conditions under which the induction and co-induction functors between the categories of linear representations are naturally isomorphic. A…
Two-point Feynman parameter integrals, with at most one mass and containing local operator insertions in $4+\ep$-dimensional Minkowski space, can be transformed to multi-integrals or multi-sums over hyperexponential and/or hypergeometric…
We study module like objects over categorical quotients of algebras by the action of coalgebras with several objects. These take the form of ``entwined comodules'' and ``entwined contramodules'' over a triple $(\mathscr C,A,\psi)$, where…
A systematic method for constructing trigonometric R-matrices corresponding to the (multiplicity-free) tensor product of any two affinizable representations of a quantum algebra or superalgebra has been developed by the Brisbane group and…
We exploit the truncated singular value decomposition and the recently proposed circulant decomposition for an efficient first-order approximation of the multiplication of large dense matrices. A decomposition of each matrix into a sum of a…
The Lusztig-Shoji algorithm is generalized to a complex reflection group $W$ and give us a version of the Springer correspondence of $W$. We show that the combinatorics of generalized Springer correspondences of dihedral groups of order…
Schur modules give the irreducible polynomial representations of the general linear group $\mathrm{GL}_t$. Viewing the symmetric group $\mathfrak{S}_t$ as a subgroup of $\mathrm{GL}_t$, we may restrict Schur modules to $\mathfrak{S}_t$ and…
A new generalized cyclic symmetric structure in the factor matrices of polyadic decompositions of matrix multiplication tensors for non-square matrix multiplication is proposed to reduce the number of variables in the optimization problem…
Let A be a finite dimensional, unital, and associative algebra which is endowed with a non-degenerate and invariant inner product. We give an explicit description of an action of cyclic Sullivan chord diagrams on the normalized Hochschild…
We consider the problem of decomposing a real-valued symmetric tensor as the sum of outer products of real-valued vectors. Algebraic methods exist for computing complex-valued decompositions of symmetric tensors, but here we focus on…