Related papers: An Explicit Construction of Type A Demazure Atoms
We describe a categorification of the Double Affine Hecke Algebra (${\mathcal{H}\kern -.4em\mathcal{H}}$) associated with an affine Lie algebra $\widehat{\mathfrak{g}}$, including a categorification of the polynomial representation and…
This paper discusses the problem of symmetric tensor decomposition on a given variety $X$: decomposing a symmetric tensor into the sum of tensor powers of vectors contained in $X$. In this paper, we first study geometric and algebraic…
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 study connections between the topology of generic character varieties of fundamental groups of punctured Riemann surfaces, Macdonald polynomials, quiver representations, Hilbert schemes on surfaces, modular forms and multiplicities in…
Let k be a field of positive characteristic. We construct, for each dominant coweight \lambda of the standard maximal torus in the special linear group, a closed subvariety D(\lambda) of the multigraded Hilbert scheme of an affine space…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
We characterize the combinatorial types of stacked d-polytopes that are inscribable. Equivalently, we identify the triangulations of a simplex by stellar subdivisions that can be realized as Delaunay triangulations.
In this work we provide a decomposition theorem for the class of quaternary and non-binary signed-graphic matroids. This generalizes previous results for binary signed-graphic matroids and graphic matroids, and it provides the theoretical…
Nonsymmetric interpolation Laurent polynomials in $n$ variables are introduced, with the interpolation points depending on $q$ and on a $n$-tuple of parameters $\tau=(\tau_1,\ldots,\tau_n)$. When $\tau_i=st^{n-i}$ Okounkov's $3$-parameter…
With a main tool is signed graphs, we give a full description of the characteristic quasi-polynomials of ideals of classical root systems ($ABCD$) with respect to the integer and root lattices. As a result, we obtain a full description of…
We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…
We introduce the $q$-analogue of the type $A$ Dunkl operators, which are a set of degree--lowering operators on the space of polynomials in $n$ variables. This allows the construction of raising/lowering operators with a simple action on…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…
We present several new and compact formulas for the modified and integral form of the Macdonald polynomials, building on the compact "multiline queue" formula for Macdonald polynomials due to Corteel, Mandelshtam, and Williams. We also…
In this paper, we study a polynomial decomposition model that arises in problems of system identification, signal processing and machine learning. We show that this decomposition is a special case of the X-rank decomposition --- a powerful…
In his famous paper [2], Demazure introduced certain indecomposable modules and used them to give a short proof of Bott's theorem. In this paper we consider a generalization of these modules and give their cohomology.
We present a method to derive new explicit expressions for bidiagonal decompositions of Vandermonde and related matrices such as the (q-, h-) Bernstein-Vandermonde ones, among others. These results generalize the existing expressions for…
A compound determinant identity for minors of rectangular matrices is established. As an application, we derive Vandermonde type determinant formulae for classical group characters.
The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…
Kamiya, Takemura, and Terao introduced a characteristic quasi-polynomial which enumerates the numbers of elements in the complement of hyperplane arrangements modulo positive integers. In this paper, we compute the characteristic…