Related papers: Realization problems for limit cycles of planar po…
In this paper, we characterize arbitrary polynomial vector fields on $S^n$. We establish a necessary and sufficient condition for a degree one vector field on the odd-dimensional sphere $S^{2n-1}$ to be Hamiltonian. Additionally, we…
Let $\omega$ be a plane autonomous system and C its configuration of algebraic integral curves. If the singularities of C are quasi-homogeneous we we present new criteria that guarantee Darboux integrability. We use this to construct…
We prove that an $\omega$-categorical core structure primitively positively interprets all finite structures with parameters if and only if some stabilizer of its polymorphism clone has a homomorphism to the clone of projections, and that…
We present a geometric proof of the Poincar\'e-Dulac Normalization Theorem for analytic vector fields with singularities of Poincar\'e type. Our approach allows us to relate the size of the convergence domain of the linearizing…
We give essentially unique ``normal forms'' for germs of a holomorphic vector field of the complex plane in the neighborhood of an isolated singularity which is a p:q resonant-saddle. Hence each vector field of that type is conjugate, by a…
Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…
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…
On finite structures, there is a well-known connection between the expressive power of Datalog, finite variable logics, the existential pebble game, and bounded hypertree duality. We study this connection for infinite structures. This has…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We discovered that only a weakened version of the main lemma is true. We state the right version, and the remaining open problem: Is it possible to approximate holomorphic vector fields (or more generally, sections in a line bundle) on an…
We study the number of limit cycles that a planar polynomial vector field can have as a function of its number $m$ of monomials. We prove that the number of limit cycles increases at least quadratically with $m$ and we provide good lower…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
The feedback set problems are about removing the minimum number of vertices or edges from a graph to break all its cycles. Much effort has gone into understanding their complexity on planar graphs as well as on graphs of bounded degree. We…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
Motivated by the dynamical uniform boundedness conjecture of Morton and Silverman, specifically in the case of quadratic polynomials, we give a formal construction of a certain class of dynamical analogues of classical modular curves. The…
We build in a given pseudoconvex (Runge) domain $D$ of $\mathbb{C}^N$ a $\mathcal O(D)$ convex set $\Gamma$, every connected component of which is a holomorphically contractible (convex) compact set, enjoying the property that any…
In the setting of Carnot groups, we are concerned with the rectifiability problem for subsets that have finite sub-Riemannian perimeter. We introduce a new notion of rectifiability that is, possibly, weaker than the one introduced by…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
We consider a classical N. Steenrod's problem on realization of homology classes by images of the fundamental classes of manifolds. It is well-known that each integral homology class can be realized with some multiplicity as an image of the…
We obtain a compactness result for $\Gamma$-convergence of integral functionals defined on $\mathcal{A}$-free vector fields. This is used to study homogenization problems for these functionals without periodicity assumptions. More…