AbstractGiven a list of n cells L=[(p1,q1),…,(pn,qn)] where pi,qi∈Z⩾0, we let ΔL=det‖(pj!)−1(qj!)−1xipjyiqj‖. The space of diagonally alternating polynomials is spanned by {ΔL} where L varies among all lists with n cells. For a>0, the operators Ea=∑i=1nyi∂xia act on diagonally alternating polynomials. Haiman has shown that the space An of diagonally alternating harmonic polynomials is spanned by {EλΔn} where λ=(λ1,…,λℓ) varies among all partitions, Eλ=Eλ1⋯Eλℓ and Δn=det‖((n−j)!)−1xin−j‖. For t=(tm,…,t1)∈Z>0m with tm>⋯>t1>0, we consider here the operator Ft=det‖Etm−j+1+(j−i)‖. Our first result is to show that FtΔL is a linear combination of ΔL′ where L′ is obtained by moving ℓ(t)=m distinct cells of L in some determined fashion. This allows ...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
AbstractThe lattice cell in thei+1 st row andj+1 st column of the positive quadrant of the plane is ...
AbstractThe presentation of alternating permutatioas via labelled binary trees is used to define pol...
Abstract. Given a list of n cells L = [(p1, q1),..., (pn, qn)] where pi, qi ∈ Z≥0, we let ∆L = det ∥...
AbstractThe space DHn of Sn diagonal harmonics is the collection of polynomials P(x, y) = P(x1,…,xn,...
AbstractLet Q[X, Y] denote the ring of polynomials with rational coefficients in the variables X = {...
AbstractLet Q[X, Y] denote the ring of polynomials with rational coefficients in the variables X = {...
AbstractThe space DHn of Sn diagonal harmonics is the collection of polynomials P(x, y) = P(x1,…,xn,...
AbstractLet μ = (μ1 ⩾ μ2 ⩾ ⋯ ⩾ μk + 1) = (k, 1n − k) be a partition of n. In [GH] Garsia and Haiman ...
We present a framework for the construction of linearizations for scalar and matrix polynomials base...
AbstractLet μ = (μ1 ⩾ μ2 ⩾ ⋯ ⩾ μk + 1) = (k, 1n − k) be a partition of n. In [GH] Garsia and Haiman ...
We present a framework for the construction of linearizations for scalar and matrix polynomials base...
AbstractThe Hilbert ideal is an ideal generated by invariant polynomials (of strictly positive degre...
AbstractA foundation polynomial is used to induce polynomial bases for Fn−1[x], the vector space of ...
Let Γ be a graph on n vertices, adjacency matrix A, and distinct eigenvalues λ> λ1> λ2> · ...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
AbstractThe lattice cell in thei+1 st row andj+1 st column of the positive quadrant of the plane is ...
AbstractThe presentation of alternating permutatioas via labelled binary trees is used to define pol...
Abstract. Given a list of n cells L = [(p1, q1),..., (pn, qn)] where pi, qi ∈ Z≥0, we let ∆L = det ∥...
AbstractThe space DHn of Sn diagonal harmonics is the collection of polynomials P(x, y) = P(x1,…,xn,...
AbstractLet Q[X, Y] denote the ring of polynomials with rational coefficients in the variables X = {...
AbstractLet Q[X, Y] denote the ring of polynomials with rational coefficients in the variables X = {...
AbstractThe space DHn of Sn diagonal harmonics is the collection of polynomials P(x, y) = P(x1,…,xn,...
AbstractLet μ = (μ1 ⩾ μ2 ⩾ ⋯ ⩾ μk + 1) = (k, 1n − k) be a partition of n. In [GH] Garsia and Haiman ...
We present a framework for the construction of linearizations for scalar and matrix polynomials base...
AbstractLet μ = (μ1 ⩾ μ2 ⩾ ⋯ ⩾ μk + 1) = (k, 1n − k) be a partition of n. In [GH] Garsia and Haiman ...
We present a framework for the construction of linearizations for scalar and matrix polynomials base...
AbstractThe Hilbert ideal is an ideal generated by invariant polynomials (of strictly positive degre...
AbstractA foundation polynomial is used to induce polynomial bases for Fn−1[x], the vector space of ...
Let Γ be a graph on n vertices, adjacency matrix A, and distinct eigenvalues λ> λ1> λ2> · ...
A basis for an ideal is such that every element in the ideal can be expressed as a linear combinatio...
AbstractThe lattice cell in thei+1 st row andj+1 st column of the positive quadrant of the plane is ...
AbstractThe presentation of alternating permutatioas via labelled binary trees is used to define pol...