Related papers: The $16$th Hilbert problem on algebraic limit cycl…
We study how few pairwise distinct longest cycles a regular graph can have under additional constraints. For each integer $r \geq 5$, we give exponential improvements for the best asymptotic upper bounds for this invariant under the…
We analyze the dynamics of a class of $\mathbb{Z}_{2n}$-equivariant differential equations on the plane, depending on 4 real parameters. This study is the generalisation to $\mathbb{Z}_{2n}$ of previous works with $\mathbb{Z}_4$ and…
In 2018, Legrand and Paran proved a weaker form of the Inverse Galois Problem for all Hilbertian fields and all finite groups: that is, there exist possibly non-Galois extensions over given Hilbertian base field with given finite group as…
We study the ring R(n,m) of invariants for the left-right action of SL_n \times SL_n on m-tuples of n by n complex matrices. We show that R(3,m) is generated by invariants of degree less equal 309 for all m. Then, we use a combinatorial…
An Abelian integral is the integral over the level curves of a Hamiltonian $H$ of an algebraic form $\omega$. The infinitesimal Hilbert sixteenth problem calls for the study of the number of zeros of Abelian integrals in terms of the…
We consider the 1-parameter family of planar quintic systems, $\dot x= y^3-x^3$, $\dot y= -x+my^5$, introduced by A. Bacciotti in 1985. It is known that it has at most one limit cycle and that it can exist only when the parameter $m$ is in…
Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…
In this note we study the distribution of real inflection points among the ovals of a real non-singular hyperbolic curve of even degree. Using Hilbert's method we show that for any integers $d$ and $r$ such that $4\leq r \leq 2d^2-2d$,…
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable, hamiltonian, etc.) if and only if a related system…
We study the action of irreducible derivations X on some Hilbert's quasi-regular algebras QRH of germes at 0 of analytic functions on (U,0), where U is a semi-algebraic set: that is, we show that these algebras are X-finite or locally…
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…
NOTE: Unfortunately, most of the results mentioned here were already known under the name of "d-separated interval piercing". The result that T_d(m) exists was first proved by Gya\'rfa\'s and Lehel in 1970, see [5]. Later, the result was…
We study systems of quadratic forms over fields and their isotropy over 2-extensions. We apply this to obtain particular splitting fields for quaternion algebras defined over a finite field extension. As a consequence, we obtain that every…
In recent decades, piecewise linear differential systems have attracted considerable attention due to their ability to describe a wide range of phenomena. A central problem, as in the theory of general planar differential systems, is to…
It was conjectured by Steinberg in 1976 that planar graphs without cycles of length 4 or 5 are 3-colorable. This conjecture attracted a substantial amount of attention and was finally refuted by Cohen-Addad, Hebdige, Kr\'{a}l', Li and…
This paper contributes to the solution of the Poincare problem, which is to bound the degree of a (generalized algebraic) leaf of a (singular algebraic) foliation of the complex projective plane. The first theorem gives a new sort of bound,…
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…
We solve the center-focus problem in a class of piecewise quadratic polynomial differential systems with an invariant straight line. The separation curve is also a straight line which is not invariant. We provide families having at the…
We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…
An upper bound for the number of Hamiltonian cycles of symmetric diagraphs is established first in this paper, which is tighter than the famous Minc's bound and the Br$\acute{e}$gman's bound. A transformation on graphs is proposed, so that…