English
Related papers

Related papers: The $16$th Hilbert problem on algebraic limit cycl…

200 papers

For a fixed planar graph $H$, let $\operatorname{\mathbf{N}}_{\mathcal{P}}(n,H)$ denote the maximum number of copies of $H$ in an $n$-vertex planar graph. In the case when $H$ is a cycle, the asymptotic value of…

Combinatorics · Mathematics 2021-06-08 Christopher Cox , Ryan R. Martin

We give an asymptotic lower bound on the number of field extensions generated by algebraic points on superelliptic curves over $\mathbb{Q}$ with fixed degree $n$ and discriminant bounded by $X$. For $C$ a fixed such curve given by an affine…

Number Theory · Mathematics 2025-09-17 Lea Beneish , Christopher Keyes

In this note we give a family of planar polynomial differential systems with a prescribed hyperbolic limit cycle. This family constitutes a corrected and wider version of an example given in the work of M.A. Abdelkader entitled ``Relaxation…

Dynamical Systems · Mathematics 2017-05-18 Jaume Giné , Maite Grau

The vector Riemann-Hilbert problem is analyzed when the entries of its matrix coefficient are meromorphic and almost periodic functions. Three cases for the meromorphic functions, when they have (i) a finite number of poles and zeros…

Mathematical Physics · Physics 2016-02-17 Yuri A. Antipov

This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…

funct-an · Mathematics 2007-05-23 Joachim Kupsch , Oleg G. Smolyanov

In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…

Computational Complexity · Computer Science 2015-02-16 Albert Atserias

We study limit cycles in piecewise complex systems with switching manifold $\mathbb{S}^1$. Using M\"obius transformations we establish an equivalence between circular and straight-line discontinuities that preserves periods, stability, and…

Dynamical Systems · Mathematics 2026-04-30 Gabriel Rondón , Paulo R. da Silva , Jaume Llibre

The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…

Cryptography and Security · Computer Science 2022-09-22 Alessio Caminata , Elisa Gorla

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

The Hilbert scheme of n points in the projective plane parameterizes degree n zero-dimensional subschemes of the projective plane. We examine the dual cones of effective divisors and moving curves on the Hilbert scheme. By studying…

Algebraic Geometry · Mathematics 2012-03-05 Jack Huizenga

We give an effective method for controlling the maximum number of limit cycles of some planar polynomial systems. It is based on a suitable choice of a Dulac function and the application of the well-known Bendixson-Dulac Criterion for…

Dynamical Systems · Mathematics 2008-03-17 Armengol Gasull , Hector Giacomini

We prove that for a sufficiently ample line bundle $L$ on a surface $S$, the number of $\delta$-nodal curves in a general $\delta$-dimensional linear system is given by a universal polynomial of degree $\delta$ in the four numbers…

Algebraic Geometry · Mathematics 2014-03-25 M. Kool , V. Shende , R. P. Thomas

We define four different kinds of multiplicity of an invariant algebraic curve for a given polynomial vector field and investigate their relationships. After taking a closer look at the singularities and at the line of infinity, we improve…

Dynamical Systems · Mathematics 2007-05-23 Jaume Llibre , Jorge Vitorio Pereira

We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…

alg-geom · Mathematics 2008-02-03 Martin Sombra

In this article we address the problem of computing the dimension of the space of plane curves of degree $d$ with $n$ general points of multiplicity $m$. A conjecture of Harbourne and Hirschowitz implies that when $d \geq 3m$, the dimension…

Algebraic Geometry · Mathematics 2007-05-23 C. Ciliberto , R. Miranda

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…

Data Structures and Algorithms · Computer Science 2018-06-22 Markus Chimani , Tilo Wiedera

Hilbert famously showed that polynomials in n variables are not too complicated, in various senses. For example, the Hilbert Syzygy Theorem shows that the process of resolving a module by free modules terminates in finitely many (in fact,…

Commutative Algebra · Mathematics 2019-05-14 Daniel Erman , Steven V Sam , Andrew Snowden

Hilbert's 14th problem studies the finite generation property of the intersection of an integral algebra of finite type with a subfield of the field of fractions of the algebra. It has a negative answer due to the counterexample of Nagata.…

Algebraic Geometry · Mathematics 2018-09-05 Huayi Chen , Hideaki Ikoma

In this article we prove that the complement of a very generic curve of degree at least equal to 14 in the complex projective plane is hyperbolic in the sense of Kobayashi. Thus, using a new method, we improve the former known bound…

Algebraic Geometry · Mathematics 2008-10-14 Erwan Rousseau

The central levels problem asserts that the subgraph of the $(2m+1)$-dimensional hypercube induced by all bitstrings with at least $m+1-\ell$ many 1s and at most $m+\ell$ many 1s, i.e., the vertices in the middle $2\ell$ levels, has a…

Combinatorics · Mathematics 2021-12-24 Petr Gregor , Ondřej Mička , Torsten Mütze