2000 character limit reached
Lech's Inequality for the Buchsbaum-Rim Multiplicity and Mixed Multiplicity
Published 2 Dec 2019 in math.AC | (1912.01073v4)
Abstract: We generalize an improved Lech bound, due to Huneke, Smirnov, and Validashti, for the Buchsbaum-Rim multiplicity and mixed multiplicity. We reduce the problem to the graded case and then to the polynomial ring case. There we use complete reductions, studied by Rees, to prove sharper bounds for the mixed multiplicity in low dimensions before proving the general case.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.