English
Related papers

Related papers: S-curves in Polynomial External Fields

200 papers

We extend the classical Enriques-Petri Theorem to $s$-subcanonical projectively normal curves, proving that such a curve is $(s+2)$-gonal if and only if it is contained in a surface of minimal degree. Moreover, we show that any Fermat…

Algebraic Geometry · Mathematics 2014-06-13 Pietro De Poi , Francesco Zucconi

We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…

Classical Analysis and ODEs · Mathematics 2014-10-15 A. Ferragut , C. Galindo , F. Monserrat

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Mathematical Physics · Physics 2011-09-16 Paul Baird

A detailed study is made of super elliptic curves, namely super Riemann surfaces of genus one considered as algebraic varieties, particularly their relation with their Picard groups. This is the simplest setting in which to study the…

High Energy Physics - Theory · Physics 2009-10-22 Jeffrey M. Rabin

Sergey Pinchuk discovered a class of pairs of real polynomials in two variables that have a nowhere vanishing Jacobian determinant and define maps of the real plane to itself that are not one-to-one. This paper describes the asymptotic…

Algebraic Geometry · Mathematics 2009-09-25 L. Andrew Campbell

We consider a plane polynomial vector field $P(x,y)dx+Q(x,y)dy$ of degree $m>1$. To each algebraic invariant curve of such a field we associate a compact Riemann surface with the meromorphic differential $\omega=dx/P=dy/Q$. The asymptotic…

Dynamical Systems · Mathematics 2009-10-31 Alexei Tsygvintsev

We construct divergence-free Sobolev vector fields in C([0,1];W^{1,r}(T^d;R^d)) with r < d and d >=2 which simultaneously admit any finite number of distinct positive solutions to the continuity equation. We then show that the vector fields…

Analysis of PDEs · Mathematics 2021-08-09 J. Pitcho , M. Sorella

This thesis is devoted to the study of well-posedness properties of some geometric variational problems: existence, regularity and uniqueness of solutions. We study two specific problems arising in the context of geometric calculus of…

Differential Geometry · Mathematics 2022-12-23 Gianmarco Caldini

Polyfold theory, as developed by Hofer, Wysocki, and Zehnder, is a relatively new approach to resolving transversality issues that arise in the study of $J$-holomorphic curves in symplectic geometry. This approach has recently led to a…

Symplectic Geometry · Mathematics 2020-01-01 Wolfgang Schmaltz

The existence of a finite global attractor for polynomial curve system has been known since the work of Belk et al. [4]. However, except in the hyperbolic case, the rate at which the pullback of a curve under a polynomial converges to the…

Dynamical Systems · Mathematics 2026-05-29 Shuyi Wang , Gaofei Zhang

We show that (as conjectured by Lin and Wang) when a Vassiliev invariant of type $m$ is evaluated on a knot projection having $n$ crossings, the result is bounded by a constant times $n^m$. Thus the well known analogy between Vassiliev…

q-alg · Mathematics 2008-02-03 Dror Bar-Natan

We define a Rasmussen $s$-invariant over the coefficient ring of the integers, and show how it is related to the $s$-invariants defined over a field. A lower bound for the slice genus of a knot arising from it is obtained, and we give…

Geometric Topology · Mathematics 2022-02-02 Dirk Schuetz

We study an infinite class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. This generalizes a sequence of sparse polynomials which arises in a natural way as graph theoretic…

Classical Analysis and ODEs · Mathematics 2020-08-05 Karl Dilcher , Maciej Ulas

A polynomial $p\in\mathbb{R}[z_1,\dots,z_n]$ is real stable if it has no roots in the upper-half complex plane. Gurvits's permanent inequality gives a lower bound on the coefficient of the $z_1z_2\dots z_n$ monomial of a real stable…

Data Structures and Algorithms · Computer Science 2017-02-10 Nima Anari , Shayan Oveis Gharan

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

Data Structures and Algorithms · Computer Science 2015-03-19 Hans L. Bodlaender , Bart M. P. Jansen , Stefan Kratsch

The notion of a surface-order specific entropy h_c(P) of a two-dimensional discrete random field P along a curve c is introduced as the limit of rescaled entropies along lattice approximations of the blowups of c. Existence is shown by…

Probability · Mathematics 2007-10-30 Julia Brettschneider

We study the classic graph drawing problem of drawing a planar graph using straight-line edges with a prescribed convex polygon as the outer face. Unlike previous algorithms for this problem, which may produce drawings with exponential…

Computational Geometry · Computer Science 2012-03-01 Erin W. Chambers , David Eppstein , Michael T. Goodrich , Maarten Löffler

Using the natural notion of {\em Hasse--Schmidt derivations on an exterior algebra}, we relate two classical and seemingly unrelated subjects. The first is the celebrated Cayley--Hamilton theorem of linear algebra, "{\em each endomorphism…

Rings and Algebras · Mathematics 2019-01-10 Letterio Gatto , Inna Scherbak

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results.…

Classical Analysis and ODEs · Mathematics 2018-06-19 Oksana Bihun , Damiano Fulghesu

Alexandrov's Theorem states that every metric with the global topology and local geometry required of a convex polyhedron is in fact the intrinsic metric of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a…

Computational Geometry · Computer Science 2010-01-04 Daniel Kane , Gregory N. Price , Erik D. Demaine