most citedAn Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing math.COShow all

3 papers · 1 filter

math.CO2008

A bijective proof of a factorization formula for Macdonald polynomials at roots of unity

Francois Descouens, Hideaki Morita, Yasuhide Numata

We give a combinatorial proof of the factorization formula of modified Macdonald polynomials when the parameter t is specialized at a primitive root of unity. Our proof is restrict…

math.CO2007★ 2 cited

An Algorithm to Construct A Basis for the Module of Logarithmic Vector Fields

Yasuhide Numata

We consider logarithmic vector fields parametrized by finite collections of weighted hyperplanes. For a finite collection of weighted hyperplanes in a two-dimensional vector space,…

math.CO2007

An extended Schur's lemma and its application

Yasuhide Numata

The Springer modules have a combinatorial property called ``coincidence of dimensions,'' i.e., the Springer modules are naturally decomposed into submodules with common dimensions.…