Related papers: The Hilbert 16-th problem and an estimate for cycl…

For $0\leq \ell <k$, a Hamiltonian $\ell$-cycle in a $k$-uniform hypergraph $H$ is a cyclic ordering of the vertices of $H$ in which the edges are segments of length $k$ and every two consecutive edges overlap in exactly $\ell$ vertices. We…

This paper studies the number of limit cycles, known as the Smale-Pugh problem, for the generalized Abel equation \begin{align*} \frac{dx}{d\theta}=A(\theta)x^p+B(\theta)x^q, \end{align*} where $A$ and $B$ are are piecewise trigonometrical…

For a class of polynomial non-autonomous differential equations of degree n, we use phase plane analysis to show that each equation in this class has n periodic solutions. The result implies that certain rigid two-dimensional systems have…

Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…

Our main goal in this paper is to study the number of small-amplitude isolated periodic orbits, so-called limit cycles, surrounding only one equilibrium point a class of polynomial Kolmogorov systems. We denote by $\mathcal M_{K}(n)$ the…

In this paper, we consider the system $-\Delta u =\lambda (v+1)^p,\;\;-\Delta v = \gamma (u+1)^\theta$ on a smooth bounded domain $\Omega$ in $\mathbb{R}^N$ with the Dirichlet boundary condition $u=v=0$ on $\partial \Omega.$ Here $…

In this paper, we apply the averaging method via Brouwer degree in a class of planar systems given by a linear center perturbed by a sum of continuous homogeneous vector fields, to study lower bounds for their number of limit cycles. Our…

We consider a family of self-adjoint Ornstein--Uhlenbeck operators $L_{\alpha} $ in an infinite dimensional Hilbert space H having the same gaussian invariant measure $\mu$ for all $\alpha \in [0,1]$. We study the Dirichlet problem for the…

A subset $C$ of edges in a $k$-uniform hypergraph $H$ is a \emph{loose Hamilton cycle} if $C$ covers all the vertices of $H$ and there exists a cyclic ordering of these vertices such that the edges in $C$ are segments of that order and such…

Parameter-elliptic boundary-value problems are investigated on the extended Sobolev scale. This scale consists of all Hilbert spaces that are interpolation spaces with respect to the Hilbert Sobolev scale. The latter are the H\"ormander…

Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes…

We prove that for all $k\geq 4$ and $1\leq\ell<k/2$, every $k$-uniform hypergraph $\mathcal{H}$ on $n$ vertices with $\delta_{k-2}(\mathcal{H})\geq\left(\frac{4(k-\ell)-1}{4(k-\ell)^2}+o(1)\right)\binom{n}{2}$ contains a Hamiltonian…

Thanks to the interest of many people, a mistake has been found in our way of counting limit cycles. We are working on a new version.

We show that for $ \eta>0 $ and sufficiently large $ n $, every 5-graph on $ n $ vertices with $\delta_{2}(H)\ge (91/216+\eta)\binom{n}{3}$ contains a Hamilton 2-cycle. This minimum 2-degree condition is asymptotically best possible.…

We investigate local computation algorithms (LCA) for two-coloring of $k$-uniform hypergraphs. We focus on hypergraph instances that satisfy strengthened assumption of the Lov\'{a}sz Local Lemma of the form $2^{1-\alpha k} (\Delta+1)…

We study the local H\"older regularity of strong solutions $u$ of second-order uniformly elliptic equations having a gradient term with superquadratic growth $\gamma > 2$, and right-hand side in a Lebesgue space $L^q$. When $q >…

A heterodimensional cycle is an invariant set of a dynamical system consisting of two hyperbolic periodic orbits with different dimensions of their unstable manifolds and a pair of orbits that connect them. For systems which are at least…

Let $A\colon H\rightarrow H$ be a normal operator on an infinite-dimensional separable Hilbert space $H$ and let $S\subseteq H$ be a finite subset such that $\{A^nx\}_{n\geq 0,\,x\in S}$ can be rescaled to form a frame for $H$. That is,…

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…

We consider problems about packing and counting Hamilton $\ell$-cycles in hypergraphs of large minimum degree. Given a hypergraph $\mathcal H$, for a $d$-subset $A\subseteq V(\mathcal H)$, we denote by $d_{\mathcal H}(A)$ the number of…