1![The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay) Second ERC Research period on Diophantine Geometry Cet The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay) Second ERC Research period on Diophantine Geometry Cet](https://www.pdfsearch.io/img/cf8a530a548689ab813297fa876b812c.jpg) | Add to Reading ListSource URL: www.math.u-psud.fr- Date: 2014-07-21 06:07:05
|
---|
2![From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen](https://www.pdfsearch.io/img/2395dd9195a353d3d33b9512a402dc8e.jpg) | Add to Reading ListSource URL: www.cs.uwm.eduLanguage: English - Date: 2002-03-01 16:04:01
|
---|
3![The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay, visiting BICMR) Capital Normal University The set of non-n-th powers in a number field is diophantine Joint work with Jan Van Geel (Gent) Jean-Louis Colliot-Th´el`ene (CNRS et Universit´e Paris-Sud, Orsay, visiting BICMR) Capital Normal University](https://www.pdfsearch.io/img/eb88c6a03cac0dafb825e8d988a4c045.jpg) | Add to Reading ListSource URL: www.math.u-psud.frLanguage: English - Date: 2015-11-25 21:14:39
|
---|
4![ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa ALGEBRAIC STRUCTURE AND DEGREE REDUCTION Let S ⊂ Fn . We define deg(S) to be the minimal degree of a non-zero polynomial that vanishes on S. We have seen that for a finite set S, deg(S) ≤ n|S|1/n . In fact, we can sa](https://www.pdfsearch.io/img/c72e1e5b552002a7fdaac004c8b6ec40.jpg) | Add to Reading ListSource URL: math.mit.eduLanguage: English - Date: 2012-10-10 15:15:19
|
---|
5![Recent results on Diophantine quintuples Alan Filipin Građevinski fakultet, Sveučilište u Zagrebu A set of m positive integers with the property that the product of any two of them increased by 1 is a perfect square i Recent results on Diophantine quintuples Alan Filipin Građevinski fakultet, Sveučilište u Zagrebu A set of m positive integers with the property that the product of any two of them increased by 1 is a perfect square i](https://www.pdfsearch.io/img/5c8b29a18566476aa1a4ef359d609197.jpg) | Add to Reading ListSource URL: www.mathos.unios.hr- Date: 2016-02-08 01:23:25
|
---|
6![THEOREM OF THE DAY The DPRM Theorem Every recursively enumerable set is Diophantine. A set is recursively enumerable if there exists some (possibly non-terminating) algorithm which lists precisely the members of the set. THEOREM OF THE DAY The DPRM Theorem Every recursively enumerable set is Diophantine. A set is recursively enumerable if there exists some (possibly non-terminating) algorithm which lists precisely the members of the set.](https://www.pdfsearch.io/img/77a7b7d2c6201677d7d0b481d995fc8f.jpg) | Add to Reading ListSource URL: www.theoremoftheday.orgLanguage: English - Date: 2014-02-07 05:06:57
|
---|
7![A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension∗ Esther Ezra† Abstract Let (X, S) be a set system on an n-point set X. The discrepancy of S is defined as the minimum of the A Size-Sensitive Discrepancy Bound for Set Systems of Bounded Primal Shatter Dimension∗ Esther Ezra† Abstract Let (X, S) be a set system on an n-point set X. The discrepancy of S is defined as the minimum of the](https://www.pdfsearch.io/img/13f2ea2e7414917d62f87eff477ca774.jpg) | Add to Reading ListSource URL: www.cims.nyu.eduLanguage: English - Date: 2014-07-17 15:05:51
|
---|
8![Estimating a product of sines using Diophantine approximation Jordan Bell Department of Mathematics, University of Toronto April 3, 2014 Estimating a product of sines using Diophantine approximation Jordan Bell Department of Mathematics, University of Toronto April 3, 2014](https://www.pdfsearch.io/img/0d2cd34ddc0bfc36d639878f3d564596.jpg) | Add to Reading ListSource URL: individual.utoronto.caLanguage: English - Date: 2014-04-03 12:18:40
|
---|
9![Undecidability in Number Theory Bjorn Poonen D Undecidability in Number Theory Bjorn Poonen D](https://www.pdfsearch.io/img/adcc7b8c6e584a17be2c8ca594ea0bc1.jpg) | Add to Reading ListSource URL: www.ams.orgLanguage: English - Date: 2008-02-04 14:23:41
|
---|
10![Recursion Theory Frank Stephan October 8, 2012 Recursion theory deals with the fundamental concepts on what subsets of natural numbers (or other famous countable domains) could be defined effectively and how Recursion Theory Frank Stephan October 8, 2012 Recursion theory deals with the fundamental concepts on what subsets of natural numbers (or other famous countable domains) could be defined effectively and how](https://www.pdfsearch.io/img/e1b6f78349b74dc3b910183e3367ed69.jpg) | Add to Reading ListSource URL: www.comp.nus.edu.sgLanguage: English - Date: 2012-10-08 00:46:12
|
---|