Related papers: A combinatorial formula for graded multiplicities …
In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…
There are several interesting filtrations on the Cartan subalgebra of a complex simple Lie algebra coming from very different contexts: one is the principal filtration coming from the Langlands dual, one is coming from the Clifford algebra…
We present higher order polynomial algebras which are the dynamical symmetry algebras of a wide class of multi-mode boson systems in non-linear optics. We construct their unitary representations and the corresponding single-variable…
We define a special matrix multiplication among a special subset of $2N\x 2N$ matrices, and study the resulting (non-associative) algebras and their subalgebras. We derive the conditions under which these algebras become alternative…
We define evaluation forms associated to objects in a module subcategory of Ext-symmetry generated by finitely many simple modules over a path algebra with relations and prove a multiplication formula for the product of two evaluation…
We investigate a specific class of CV modules for $\mathfrak{sl}_3$ and establish an exact sequence for these modules. Utilizing dimension arguments, we demonstrate that this module is isomorphic to the fusion product of irreducible…
A method is presented for forming polynomial interpolants on squares and cubes, which are more efficient in the so-called Euclidean degree than other commonly used methods with the same number of collocation points. These methods have…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
This paper presents a low-latency hardware accelerator for modular polynomial multiplication for lattice-based post-quantum cryptography and homomorphic encryption applications. The proposed novel modular polynomial multiplier exploits the…
Let $ R=k[x_1...x_r]$ and $M$ a multigraded $R-$module. In this work we interpret $M$ as a multipersistent homology module and give a multigraded resolution of it. The construction involves cellular resolutions of monomial ideals and…
Generalized Hall-Littlewood polynomials (Macdonald spherical functions) and generalized Kostka-Foulkes polynomials ($q$-weight multiplicities) arise in many places in combinatorics, representation theory, geometry, and mathematical physics.…
We answer some questions related to multiplicity formulas by Rosenthal and Zelevinsky and by Lakshmibai and Weyman for points on Schubert varieties in Grassmannians. In particular, we give combinatorial interpretations in terms of…
In this paper, we introduce a combinatorial path model of representation of the quantum affine algebra of type $D_n$, inspired by Mukhin and Young's combinatorial path models of representations of the quantum affine algebras of types $A_n$…
In this paper we construct bases of standard (i.e. integrable highest weight) modules $L(\Lambda)$ for affine Lie algebra of type $B_2\sp{(1)}$ consisting of semi-infinite monomials. The main technical ingredient is a construction of…
We study the category of graded representations with finite--dimensional graded pieces for the current algebra associated to a simple Lie algebra. This category has many similarities with the category $\cal O$ of modules for $\lie g$ and in…
Let G be a reductive algebraic group over a field k. When k=C, R.K.Brylinski constructed a filtration of weight spaces of a G module, using the action of a principal nilpotent element of the Lie algebra, and proved that this filtration…
We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…
[Inserted by J. Maurice Rojas] We give a formula for the number of complex roots of a generic system of two polynomial equations in two unknowns. The formula is completely combinatorial, ultimately depending just on the convex hull of the…
This is the first of a series of papers studying combinatorial (with no ``subtractions'') bases and characters of standard modules for affine Lie algebras, as well as various subspaces and ``coset spaces'' of these modules. In part I we…
In this paper, we continue our study of the Hilbert polynomials of coinvariants begun in our previous work math.QA/0205324 (paper I). We describe the sl_n-fusion products for symmetric tensor representations following the method of Feigin…