TITLE

# Patchworking algebraic curves disproves the Ragsdale conjecture

AUTHOR(S)
Itenberg, Ilia; Viro, Oleg
PUB. DATE
September 1996
SOURCE
Mathematical Intelligencer;Fall96, Vol. 18 Issue 4, p19
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Shows how to build algebraic curves in a combinatorial fashion. Initial data; Construction of a piecewise linear curve; Real plane algebraic curves; T-curves; Ragsdale conjecture; Patchworking Harnack curves; Counterexamples to Ragsdale conjecture.
ACCESSION #
9703114177

## Related Articles

• Wilson's map operations on regular dessins and cyclotomic fields of definition. Jones, G. A.; Streit, M.; Wolfart, J. // Proceedings of the London Mathematical Society;Mar2010, Vol. 100 Issue 2, p510

Dessins d'enfants can be seen as bipartite graphs embedded in compact orientable surfaces. According to Grothendieck and others, a dessin uniquely determines a complex structure on the surface, even an algebraic structure as a projective algebraic curve defined over a number field. Combinatorial...

• A New Noninterior Predictor-Corrector Method for the P0 LCP. Ju-liang Zhang; Jian Chen // Applied Mathematics & Optimization;Jan/Feb2006, Vol. 53 Issue 1, p79

In this paper a new predictor-corrector noninterior method for LCP is presented, in which the predictor step is generated by the Levenberg-Marquadt method, which is new in the predictor-corrector type methods, and the corrector step is generated as in [3]. The method has the following merits:...

• Polynomial Approximations on Closed Subsets of Elliptic Curves. Khaustov, A.; Shirokov, N. // Journal of Mathematical Sciences;Sep2005, Vol. 129 Issue 3, p3916

Approximation of Holder functions on subsets of elliptic curves using polynomials is considered. An equivalent problem of approximation on the complex plane with the use of doubly periodic functions is introduced. A direct approximation theorem is proved. Bibliography: 5 titles.

• Refined Jacobian Estimates and Grossï¿½Pitaevsky Vortex Dynamics. Jerrard, Robert; Spirn, Daniel; Otto, F. // Archive for Rational Mechanics & Analysis;Dec2008, Vol. 190 Issue 3, p425

We study the dynamics of vortices in solutions of the Grossï¿½Pitaevsky equation $${ i u_t = \Delta u + { 1 \over {\varepsilon^2}} u \left(1 - |u|^2 \right)}$$ in a bounded, simply connected domain $${\Omega\subset {\mathbb{R}^2}}$$ with natural boundary conditions on ?O. Previous rigorous...

• Sets with a large number of nuclei on a cubic curve. Hadnagy, Éva; Kovács, István // Journal of Geometry;2002, Vol. 74 Issue 1/2, p90

For q â‰¥ 1.02 Â· 10[sup 5] it is proven that a (q + 1)-set in PG(2, q) having more than 2/3 Â· q + 4 nuclei on an irreducible, non-singular cubic curve has to be a line.

• Paired permutation testing in 2[supk] unreplicated factorials. Dalla Valle, Francesco; Pesarin, Fortunato; Salmaso, Luigi // Statistical Methods & Applications;2002, Vol. 11 Issue 3, p265

Develops exact permutation testing of effects in unreplicated two-level multifactorial designs based on the notion of realigning observations and on paired permutations. Advantages and limitations of exact permutation procedures for unreplicated factorials; Simulation study on paired...

• Parameter controlled instance generation for lot sizing problems. Kimms, Alf // Central European Journal of Operations Research;1999, Vol. 7 Issue 3, p203

Examines the parameter controlled instance generation for lot sizing problems. Provision of methods for generating systematically varied parameter level combinations automatically; Use in evaluating lot sizing methods; Impact of the parameter on the performance of solution procedures.

• Special issue in honour of Jeno Egervï¿½ry. Csendes, T.; Gal�ntai, A.; Szeidl, L. // Central European Journal of Operations Research;Mar2010, Vol. 18 Issue 1, p1

The article discusses various reports published within the issue, including one on some combinatorial results that are related to the famous Konig-Egervary theorem, one on the ABS methods for solving linear algebraic equations and their applications to optimization, and one on rank reduction...

• THE COMPLEXITY OF FLOWSHOP AND JOBSHOP SCHEDULING. Garey, M. R.; Johnson, D.S.; Sethi, Ravi // Mathematics of Operations Research;May76, Vol. 1 Issue 2, p117

NP-complete problems form an extensive equivalence class of combinatorial problems for which no nonenumerative algorithms are known. Our first results shows that determining a shortest length schedule ill an m-machine flowshop is NP-complete for m = 3 (For m = 2, there is an efficient algorithm...

Share

## Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sign out of this library