搜索结果: 1-6 共查到“知识库 代数几何学 THE LINE”相关记录6条 . 查询时间(0.2 秒)
THE IDEAL OF RELATIONS FOR THE RING OF INVARIANTS OF n POINTS ON THE LINE
RELATIONS FOR THE RING INVARIANTS OF n POINTS THE LINE
font style='font-size:12px;'>
2015/10/14
The ring of projective invariants of n ordered points on the projective line is one of the most basic and earliest studied examples in Geometric Invariant Theory. It is a remarkable fact and the point...
THE EQUATIONS FOR THE MODULI SPACE OF n POINTS ON THE LINE
MODULI SPACE n POINTS ON THE LINE
font style='font-size:12px;'>
2015/10/14
A central question in invariant theory is that of determining the relations among invariants. Geometric invariant theory quotients come with a natural ample line bundle, and hence often a natural proj...
THE IDEAL OF RELATIONS FOR THE RING OF INVARIANTS OF n POINTS ON THE LINE
INVARIANTS
font style='font-size:12px;'>
2015/7/14
The ring of projective invariants of n ordered points on the projective line is one of the most
basic and earliest studied examples in Geometric Invariant Theory. It is a remarkable fact and the poin...
Explicit presentations of nonspecial line bundles and secant spaces
algebraic curve nonspecial line bundle nonspecial divisor minimal presentation q-very ample order of very ampleness
font style='font-size:12px;'>
2012/5/9
A line bundle L on a smooth curve X is nonspecial if and only if L admits a presentation L=K_X -D +E for some effective divisors D and E>0 on X with gcd (D, E)=0 and h^0 (X, O_X (D))=1. In this work, ...
Monodromy of triple point line arrangements
line arrangement Milnor fiber monodromy
font style='font-size:12px;'>
2011/9/2
Abstract: We show that the monodromy operator action on the first cohomology group of the Milnor fiber is combinatorially determined for line arrangements with at most triple points and containing at ...
One dimensional Convolutional Goppa Codes over the projective line
One dimensional Convolutional Goppa Codes the projective line Information Theory
font style='font-size:12px;'>
2011/9/1
Abstract: We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions of H. Gluesing-Luerssen and B. Langfeld. Moreover we give a class...