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

Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension…

The notion of a Z-algebra has a non-linear analogue, whose purpose it is to control operations on commutative rings rather than linear operations on abelian groups. These plethories can also be considered non-linear generalizations of…

We discuss a decomposition formula of simple products of fermion correlation functions with cyclic constrains and its applications to spin sums of super string amplitudes. Based on some facts which are noted or derived in this paper, we…

We describe the construction of Frobenius manifold out of a cyclic (commutative) $BV_\infty$ algebra $(A,\Delta)$ under the assumption of a Hodge-to-de Rham degeneration property and the existence of a compatible homotopy retract of $A$…

Let $p$ be a prime number, and let $Dist(SL_2)$ be the algebra of distributions, supported at $1$, on the algebraic group $SL_2$ over $\mathbb{F}_p$. The Frobenius map $Fr:SL_2\to SL_2$ induces a map $Fr:Dist(SL_2)\to Dist(SL_2)$ which is…

This paper presents a new methodology to count the number of numerical semigroups of given genus or Frobenius number. We apply generating function tools to the bounded polyhedron that classifies the semigroups with given genus (or Frobenius…

For a ribbon fusion category $\mathcal{A}$ and a special symmetric commutative Frobenius algebra $F$ in $\mathcal{A}$, we use factorization homology and the ansular correlators obtained via the modular microcosm principle to construct a…

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann…

For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…

In data processing and machine learning, an important challenge is to recover and exploit models that can represent accurately the data. We consider the problem of recovering Gaussian mixture models from datasets. We investigate symmetric…

A partition of a finite abelian group gives rise to a dual partition on the character group via the Fourier transform. Properties of the dual partitions are investigated and a convenient test is given for the case that the bidual partition…

We define the affine Frobenius Brauer categories associated to each symmetric involutive Frobenius superalgebra $A$. We then define an action of these categories on the categories of finite-dimensional supermodules for orthosymplectic Lie…

An algorithm is presented for generating successive approximations to trigonometric functions of sums of non-commuting matrices. The resulting expressions involve nested commutators of the respective matrices. The procedure is shown to…

In this paper we study the Frobenius characters of the invariant subspaces of the tensor powers of a representation V. The main result is a formula for these characters for a polynomial functor of V involving the characters for V. The main…

This is a survey of Frobenius splitting techniques in commutative algebra, based on the first author's lectures at the introductory workshop for the special year in commutative algebra at MSRI in fall 2012.

The notion of compact quantum subgroup is revisited and an alternative definition is given. Induced representations are considered and a Frobenius reciprocity theorem is obtained. A relationship between ergodic actions of compact quantum…

The quantum Frobenius map and it splitting are shown to descend to corresponding maps for generalized $q$-Schur algebras at a root of unity. We also define analogs of $q$-Schur algebras for any affine algebra, and prove the corresponding…

In this paper, we define a semi-tensor product for third-order tensors. Based on this definition, we present a new type of tensor decomposition strategy and give the specific algorithm. This decomposition strategy actually generalizes the…

We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…

To each symmetric graded Frobenius superalgebra we associate a W-algebra. We then define a linear isomorphism between the trace of the Frobenius Heisenberg category and a central reduction of this W-algebra. We conjecture that this is an…