Related papers: A Frobenius-Schreier-Sims Algorithm to tensor deco…
Dimensionality reduction is an essential technique for multi-way large-scale data, i.e., tensor. Tensor ring (TR) decomposition has become popular due to its high representation ability and flexibility. However, the traditional TR…
Conjecturing formulas and other symbolic relations occurs frequently in number theory and combinatorics. If we could automate conjecturing, we could benefit not only from speeding up, but also from finding conjectures previously out of our…
We give an algorithm for working out the indecomposable direct summands in a Krull--Schmidt decomposition of a tensor product of two simple modules for G=SL_3 in characteristics 2 and 3. It is shown that there is a finite family of modules…
We present an approach to the computation of confluent systems of defining relations in associative conformal algebras based on the similar technique for modules over ordinary associative algebras.
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…
Let A \subseteq B be cancellative abelian semigroups, and let R be an integral domain. We show that the semigroup ring R[B] can be decomposed, as an R[A]-module, into a direct sum of R[A]-submodules of the quotient ring of R[A]. In the case…
We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…
An algebraic system is proposed that represent surface cobordisms in thickened surfaces. Module and comodule structures over Frobenius algebras are used for representing essential curves. The proposed structure gives a unified algebraic…
We resolve the open problem of characterizing the Frobenius number $g(A)$ for shifted square sequences $A = (a, a+1^2, \ldots, a+k^2)$, confirming a conjecture of Einstein et al. (2007). By combining a combinatorial reduction to an…
A \emph{tensor-relational} computation is a relational computation where individual tuples carry vectors, matrices, or higher-dimensional arrays. An advantage of tensor-relational computation is that the overall computation can be executed…
Complicated mathematical equations involving products of tensors with permutation symmetries, frequently encountered in fields such as general relativity and quantum chemistry (e.g., equations in high-order coupled cluster theories),…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…
We consider a subclass of the class of group-theoretical fusion categories: To every finite group $G$ and subgroup $H$ one can associate the category of $G$-graded vector spaces with a two-sided $H$-action compatible with the grading. We…
We discuss algebraic and representation theoretic structures in braided tensor categories C which obey certain finiteness conditions. Much interesting structure of such a category is encoded in a Hopf algebra H in C. In particular, the Hopf…
We describe bases for the morphism spaces of the Frobenius Heisenberg categories associated to a symmetric graded Frobenius algebra, proving several open conjectures. Our proof uses a categorical comultiplication and generalized cyclotomic…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
Frobenius algebras in the category of sets and relations ($\mathbf{Rel}$) serve as a unifying framework for various algebraic and combinatorial structures, including groupoids, effect algebras, and abstract circles. Recently, a nerve…
This paper investigates the Terwilliger algebra of some group association schemes related to codes. In addition, it also shows the generators of invariant rings appearing by E-polynomials.
This short note is the generalization of Faugere F4-algorithm for polynomial rings with coefficients in Euclidean rings. This algorithm computes successively a Groebner basis replacing the reduction of one single s-polynomial in…
The Terwilliger algebras of association schemes over an arbitrary field $\mathbb{F}$ were briefly called the Terwilliger $\mathbb{F}$-algebras of association schemes in [9]. In this paper, the Terwilliger $\mathbb{F}$-algebras of direct…