Related papers: A Frobenius-Schreier-Sims Algorithm to tensor deco…

List decoding of Hermitian codes is reformulated to allow an efficient and simple algorithm for the interpolation step. The algorithm is developed using the theory of Groebner bases of modules. The computational complexity of the algorithm…

We combine the known methods for univariate polynomial root-finding and for computations in the Frobenius matrix algebra with our novel techniques to advance numerical solution of a univariate polynomial equation, and in particular…

If $A$ is a finite-dimensional algebra graded by a group $G$, and $\sigma \in G$, we define a variant of paratrophic matrix associated with $A$ and $\sigma$, and we use it to characterize the $\sigma$-graded Frobenius property for $A$. We…

We introduce a canonical structure of a commutative associative filtered algebra with the unit on polynomial smooth valuations, and study its properties. The induced structure on the subalgebra of translation invariant smooth valuations has…

We show a new algorithm and its implementation for multiplying bit-polynomials of large degrees. The algorithm is based on evaluating polynomials at a specific set comprising a natural set for evaluation with additive FFT and a high order…

We show that given a rigid C*-tensor category, there is an equivalence of categories between normalized irreducible Q-systems, also known as connected unitary Frobenius algebra objects, and compact connected W*-algebra objects. Although…

In this paper, we introduce the notion of cyclic Frobenius algebras (CF-algebras). Canonical structures of CF-algebras exist on associative and Poisson algebras. It turns out that the modern theory of integrable systems yields non-trivial…

The slope filtration theorem gives a partial analogue of the eigenspace decomposition of a linear transformation, for a Frobenius-semilinear endomorphism of a finite free module over the Robba ring (the ring of germs of rigid analytic…

We introduce an algorithm to decide isomorphism between tensors. The algorithm uses the Lie algebra of derivations of a tensor to compress the space in which the search takes place to a so-called densor space. To make the method practicable…

We give new algorithms based on the sum-of-squares method for tensor decomposition. Our results improve the best known running times from quasi-polynomial to polynomial for several problems, including decomposing random overcomplete…

We obtain a characteristic-free decomposition of tensor space, regarded as a module for the Brauer centralizer algebra.

We give an explicit formula for the decomposition of the tensor product of any two indecomposable non-projective modules for the symmetric group algebra $F \mathfrak{S}_p$ modulo projective modules. In particular, we show that the tensor…

Lichnerowicz's algebra of differential geometric operators acting on symmetric tensors can be obtained from generalized geodesic motion of an observer carrying a complex tangent vector. This relation is based upon quantizing the classical…

This paper is a detailed description of an algorithm based on a generalized Buchberger algorithm for constructing Groebner-type bases associated with polynomials of shift operators. The algorithm is used for calculating Feynman integrals…

The spin analogues of several classical concepts and results for Hecke algebras are established. A Frobenius type formula is obtained for irreducible characters of the Hecke-Clifford algebra. A precise characterization of the trace…

The paper proposes a new and systematic approach to the so-called black box group methods in computational group theory. As the starting point of our programme, we construct Frobenius maps on black box groups of untwisted Lie type in odd…

We consider the problem of automatically decomposing operations over tensors or arrays so that they can be executed in parallel on multiple devices. We address two, closely-linked questions. First, what programming abstraction should…

Recently, it was shown that a rich class of second-order (maximally) superintegrable systems has an underpinning Hesse-Frobenius structure, i.e.\ a Frobenius structure that is compatible with a Hessian structure such that the Hessian…

This expository article presents a unified ring theoretic approach, based on the theory of Frobenius algebras, to a variety of results on Hopf algebras. These include a theorem of S. Zhu on the degrees of irreducible representations, the…

Let consider $n$ natural numbers $a\_1 ,\ldots , a\_{n} $. Let $S$ be the numerical semigroup generated by $a\_1 ,\ldots , a\_{n} $. Set $A=K[t^{a\_1}, \ldots , t^{a\_n}]=K[{x\_1}, \ldots , {x\_n}]/I$. The aim of this paper is:…