Weak approximation for linear systems of quadrics
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Im, Bo-Hae | ko |
| dc.contributor.author | Larsen, M | ko |
| dc.date.accessioned | 2016-10-04T02:59:51Z | - |
| dc.date.available | 2016-10-04T02:59:51Z | - |
| dc.date.created | 2016-09-07 | - |
| dc.date.created | 2016-09-07 | - |
| dc.date.issued | 2006-07 | - |
| dc.identifier.citation | JOURNAL OF NUMBER THEORY, v.119, no.1, pp.148 - 154 | - |
| dc.identifier.issn | 0022-314X | - |
| dc.identifier.uri | http://hdl.handle.net/10203/213020 | - |
| dc.description.abstract | We give local conditions at infinity ensuring that the intersection of n quadrics in p(N), N >> n, satisfies weak approximation. (c) 2005 Elsevier Inc. All rights reserved | - |
| dc.language | English | - |
| dc.publisher | ACADEMIC PRESS INC ELSEVIER SCIENCE | - |
| dc.subject | CHATELET SURFACES | - |
| dc.subject | QUADRATIC-FORMS | - |
| dc.subject | INTERSECTIONS | - |
| dc.title | Weak approximation for linear systems of quadrics | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000238159000009 | - |
| dc.identifier.scopusid | 2-s2.0-33646672194 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 119 | - |
| dc.citation.issue | 1 | - |
| dc.citation.beginningpage | 148 | - |
| dc.citation.endingpage | 154 | - |
| dc.citation.publicationname | JOURNAL OF NUMBER THEORY | - |
| dc.identifier.doi | 10.1016/j.jnt.2005.10.002 | - |
| dc.contributor.localauthor | Im, Bo-Hae | - |
| dc.contributor.nonIdAuthor | Larsen, M | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordPlus | CHATELET SURFACES | - |
| dc.subject.keywordPlus | QUADRATIC-FORMS | - |
| dc.subject.keywordPlus | INTERSECTIONS | - |
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.