Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Macaulay-like marked bases (1211.7264v3)

Published 30 Nov 2012 in math.AC and math.AG

Abstract: We define marked sets and bases over a quasi-stable ideal $\mathfrak j$ in a polynomial ring on a Noetherian $K$-algebra, with $K$ a field of any characteristic. The involved polynomials may be non-homogeneous, but their degree is bounded from above by the maximum among the degrees of the terms in the Pommaret basis of $\mathfrak j$ and a given integer $m$. Due to the combinatorial properties of quasi-stable ideals, these bases behave well with respect to homogenization, similarly to Macaulay bases. We prove that the family of marked bases over a given quasi-stable ideal has an affine scheme structure, is flat and, for large enough $m$, is an open subset of a Hilbert scheme. Our main results lead to algorithms that explicitly construct such a family. We compare our method with similar ones and give some complexity results.

Summary

We haven't generated a summary for this paper yet.