✦ LIBER ✦

On Thue Inequalities and a Conjecture of Schmidt

✍ Scribed by J.L. Thunder

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 246 KB
Volume: 52
Category: Article
ISSN: 0022-314X
DOI: 10.1006/jnth.1995.1073

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Family of Quartic Thue Inequalities

On a Family of Quartic Thue Inequalities I

✍ Isao Wakabayashi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 224 KB

For integers a 8, we give upper bounds for the solutions of the Thue inequalities |x 4 &a 2 x 2 y 2 + y 4 | k(a), where k(a) is a function with positive values. The method is based on Pade approximations. 1997 Academic Press ak(a), where \*(a)=2+ 2 log(6 -3 a 2 +24) log(27(a 4 &4)Â128) <4 article

On a Family of Quartic Thue Inequalities

On a Family of Quartic Thue Inequalities, II

✍ Isao Wakabayashi 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 182 KB

We give a method of estimation for rational approximation to algebraic numbers of degree 4 of the form -1+(s+-t)ÂN+-1+(s&-t)ÂN with s, t # Z and large N # N. Our method is based on Pade approximation. As an application, we consider the Thue inequalities |x 4 &a 2 x 2 y 2 &by 4 | k(a, b), where a, b

On a Family of Quintic Thue Equations

✍ C Heuberger 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 425 KB

On a Conjecture of Kleene and Post

✍ S. Barry Cooper 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB 👁 2 views

On a conjecture of Thomassen and Toft

✍ Kriesell, Matthias 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB 👁 2 views

This article is motivated by a conjecture of Thomassen and Toft on the number s 2 (G) of separating vertex sets of cardinality 2 and the number v 2 (G) of vertices of degree 2 in a graph G belonging to the class G of all 2-connected graphs without nonseparating induced cycles. Let G denote the numbe

On a conjecture of wang and williams

✍ N. V. R. Mahadev; Uri N. Peled 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

## Abstract Wang and Williams defined a __threshold assignment__ for a graph __G__ as an assignment of a non‐negative weight to each vertex and edge of __G__, and a threshold __t__, such that a set __S__ of vertices is stable if and only if the total weight of the subgraph induced by __S__ does not