Related papers: A note on Hilbert 16th Problem

Limit cycles of planar polynomial vector fields have been an active area of research for decades; the interest in periodic-orbit related dynamics comes from Hilbert's 16th problem and the fact that oscillatory states are often found in…

The existence of a uniform upper bound for the maximum number of limit cycles of planar piecewise linear differential systems with two zones separated by a straight line has been subject of interest of hundreds of papers. After more than 30…

Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser graph, we investigate the following function, denoted by $f(n,k)$: the maximal number of Hamiltonian cycles on an $n$ element set, such that no…

A graph G is (a:b)-colorable if there exists an assignment of b-element subsets of {1,...,a} to vertices of G such that sets assigned to adjacent vertices are disjoint. We show that every planar graph without cycles of length 4 or 5 is…

Let $m_n(G)$ denote the number of maximal subgroups of $G$ of index $n$. An upper bound is given for the degree of maximal subgroup growth of all polycyclic metabelian groups $G$ (i.e., for $\limsup \frac{\log m_n(G)}{\log n}$, the degree…

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…

Let $\pi$ be a finitely presented group. If h is a non trivial homology class in Hn($\pi$; Z), a theorem of Gromov (see [Gro83], 6) asserts the existence of regular geometric cycles which represent h, whose relative systolic volume is as…

An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices, and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. In 1972, Erd\H{o}s conjectured that every Hamiltonian graph with…

We study the maximum number of limit cycles that can bifurcate from a degenerate center of a cubic homogeneous polynomial differential system. Using the averaging method of second order and perturbing inside the class of all cubic…

A cycle $C$ of a graph $G$ is \emph{isolating} if every component of $G-V(C)$ is a single vertex. We show that isolating cycles in polyhedral graphs can be extended to larger ones: every isolating cycle $C$ of length $6 \leq |E(C)| < \left…

For a non-vanishing gradient-like vector field on a compact manifold $X^{n+1}$ with boundary, a discrete set of trajectories may be tangent to the boundary with reduced multiplicity $n$, which is the maximum possible. (Among them are…

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of…

For any integer $n \geq 5$, we construct an $n$-dimensional $C^1$ vector field exhibiting a robustly transitive singular attractor which is not sectional-hyperbolic. Nevertheless, the attractor is singular-hyperbolic. This provides the…

For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…

We show that every $4$-chromatic graph on $n$ vertices, with no two vertex-disjoint odd cycles, has an odd cycle of length at most $\tfrac12\,(1+\sqrt{8n-7})$. Let $G$ be a non-bipartite quadrangulation of the projective plane on $n$…

Let ${\cal H}$ be a hyperbolic component of quadratic rational maps possessing two distinct attracting cycles. We show that ${\cal H}$ has compact closure in moduli space if and only if neither attractor is a fixed point.

Consider a polynomial vector field $\xi$ in $\mathbb{C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of…

Following the previous work of Nikulin and Agol, Belolipetsky, Storm, and Whyte it is known that there exist only finitely many (totally real) number fields that can serve as fields of definition of arithmetic hyperbolic reflection groups.…

We prove that every conformal vector field on the complex hyperbolic space $\mathbb{C}H^n$ is Killing for all $n\ge 2$. Although this rigidity is classically known, our proof is entirely different in nature: it is local, analytic, and fully…