2010
DOI: 10.48550/arxiv.1012.0835
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Projective completions of affine varieties via degree-like functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2011
2011
2013
2013

Publication Types

Select...
2

Relationship

2
0

Authors

Journals

citations
Cited by 2 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…While dealing with such ν, we always work with δ := −ν (which we call a semidegree) instead of ν, since for polynomials f ∈ C[x, y], δ(f ) has a more 'natural' meaning than ν(f ), in the same sense that degree is a 'more natural' function on polynomials than negative degree. More generally, semidegrees are special types of degree-like functions [Mon10] which correspond to compactifications of affine varieties.…”
Section: Effective Answermentioning
confidence: 99%
See 1 more Smart Citation
“…While dealing with such ν, we always work with δ := −ν (which we call a semidegree) instead of ν, since for polynomials f ∈ C[x, y], δ(f ) has a more 'natural' meaning than ν(f ), in the same sense that degree is a 'more natural' function on polynomials than negative degree. More generally, semidegrees are special types of degree-like functions [Mon10] which correspond to compactifications of affine varieties.…”
Section: Effective Answermentioning
confidence: 99%
“…We prove Proposition 4.2 in Section 5 based on some lemmas, whose proofs we defer to Section 6. Our proofs are self-contained modulo some properties of key polynomials which we list in Section 3 and are motivated by the general theory of projective completions via 'degree-like functions' [Mon10].…”
Section: Further Applications and Comments On The Structure Of The Proofmentioning
confidence: 99%
“…A clearer exposition (with more complete reference) is in order and this submission will be updated in a few days. This article is a sequel to [9]. In it we develop affine Bezout type theorems.…”
Section: Introductionmentioning
confidence: 99%
“…
In this sequel to [9] we develop Bezout type theorems for semidegrees (including an explicit formula for iterated semidegrees) and an inequality for subdegrees. In addition we prove (in case of surfaces) a Bernstein type theorem for the number of solutions of two polynomials in terms of the mixed volume of planar convex polygons associated to them (via the theory of Kaveh-Khovanskii [5] and Lazarsfeld-Mustata [6]) * The idea of looking at the construction of theorem 2.5 is due to Professor A. Khovanskii.
…”
mentioning
confidence: 99%