Related papers: Monomial integrals on the classical groups

In this paper we pursue the study of spectral categories initiated in [26]. More precisely, we construct the Universal matrix invariant of spectral categories, i.e. a functor U with values in an additive category Add, which inverts the…

We reconsider an old problem, namely the dimension of the $G$-invariant subspace in $V^{\otimes p} \otimes V^{*\otimes q}$, where $G$ is one of the classical groups ${\rm GL}(V)$, ${\rm SL}(V)$, ${\rm O}(V)$, ${\rm SO}(V)$, or ${\rm…

We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…

A new method is proposed for integrating the equations of motion of an elastic filament. In the standard finite-difference and finite-element formulations the continuum equations of motion are discretized in space and time, but it is then…

We adapt the notion of an algebraic theory to work in the setting of quasicategories developed recently by Joyal and Lurie. We develop the general theory at some length. We study one extended example in detail: the theory of commutative…

We show how the categorial approach to inverse monoids can be described as a certain endofunctor (which we call the partialization functor) of some category. In this paper we show that this functor can be used to obtain several recently…

A monomial algebra is the quotient of a polynomial algebra by an ideal generated by monomials. We prove that finite-dimensional monomial algebras are characterized by their automorphism group among finite-dimensional, local algebras with…

Using the entropic inequalities for Shannon and Tsallis entropies new inequalities for some classical polynomials are obtained. To this end, an invertible mapping for the irreducible unitary representation of groups $SU(2)$ and $SU(1,1)$…

Integration of polynomials over the classical groups of unitary, orthogonal and symplectic matrices can be reduced to basic building blocks known as Weingarten functions. We present an elementary derivation of these functions.

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

A new method for the construction of classical integrable systems, that we call loop coproduct formulation, is presented. We show that the linear r-matrix formulation, the Sklyanin algebras and the reflection algebras can be obtained as…

This is an introduction to the group algebras of the symmetric groups, written for a quarter-long graduate course. After recalling the definition of group algebras (and monoid algebras) in general, as well as basic properties of…

We compute the periods associated with a special class of hyperplane arrangements. In particular, we exhibit a combinatorial condition on the intersection lattice of a hyperplane arrangement that ensures that its associated periods are…

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…

We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics.…

The numerical method of Kahan applied to quadratic differential equations is known to often generate integrable maps in low dimensions and can in more general situations exhibit preserved measures and integrals. Computerized methods based…

In this study, a novel feature coding method that exploits invariance for transformations represented by a finite group of orthogonal matrices is proposed. We prove that the group-invariant feature vector contains sufficient discriminative…

To study orthogonal arrays and signed orthogonal arrays, Ray-Chaudhuri and Singhi (1988 and 1994) considered some module spaces. Here, using a linear algebraic approach we define an inclusion matrix and find its rank. In the special case of…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…