Related papers: A variational approach to Hilbert's 16th problem w…

In this article we consider the action of affine group and time rescaling on planar quadratic differential systems. We construct a system of representatives of the orbits of systems with four invariant lines, including the line at infinity…

We study planar piecewise quadratic differential systems of Kolmogorov type. Specifically, we consider systems with both coordinate axes invariant and with a separation line that is straight and distinct from the invariant axes. The main…

For each $n$, let RD$(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In this paper, we recover an algorithm of Sylvester for determining…

We investigate the maximal number $N_h(m)$ of normally hyperbolic limit tori in three-dimensional polynomial vector fields of degree $m$, which extends the classical notion of Hilbert numbers to higher dimensions. Using recent developments…

This paper studies the number of centers and limit cycles of the family of planar quartic polynomial vector fields that has the invariant algebraic curve $(4x^2-1)(4y^2-1)=0.$ The main interest for this type of vector fields comes from…

We show that the choosability of the square of planar graphs of max degree 4 without five cycles is at most 12. Keywords: planar graph, choosability AMS Mathematics Subject Classification: 05C15

We show that any $n$-variate polynomial computable by a syntactically multilinear circuit of size $\operatorname{poly}(n)$ can be computed by a depth-$4$ syntactically multilinear ($\Sigma\Pi\Sigma\Pi$) circuit of size at most…

In this paper a generalized Rayleigh-Li\'enard oscillator is consider and lower bounds for the number of limit cycles bifurcating from weak focus equilibria and saddle connections are provided. By assuming some open conditions on the…

We provide a simplified proof of the following special case of Wegner's conjecture: every planar graph of maximum degree at most three admits a distance-2 coloring with at most eight colors. Our main contribution is significant…

In this paper, we study limit cycle bifurcations for a kind of non-smooth polynomial differential systems by perturbing a piecewise linear Hamiltonian system with a center at the origin and a homoclinic loop around the origin. By using the…

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…

In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree $n$ in $n^2$ variables such that any homogeneous depth 4 arithmetic circuit…

We study polynomial systems whose equations have as common support a set C of n+2 points in Z^n called a circuit. We find a bound on the number of real solutions to such systems which depends on n, the dimension of the affine span of the…

We develop a variational method to obtain accurate bounds for the eigenenergies of H = -Delta + V in arbitrary dimensions N>1, where V(r) is the nonpolynomial oscillator potential V(r) = r^2 + lambda r^2/(1+gr^2), lambda in…

It has been shown that a global minimizer of a smooth determinant of a matrix function corresponds to the largest cycle of a graph. When it exists, this is a Hamiltonian cycle. Finding global minimizers even of a smooth function is a…

We study the function $H_n(C_{2k})$, the maximum number of Hamilton paths such that the union of any pair of them contains $C_{2k}$ as a subgraph. We give upper bounds on this quantity for $k\ge 3$, improving results of Harcos and…

This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…

This paper deals with the problem of location and existence of limit cycles for real planar polynomial differential systems. We provide a method to construct Poincar\'e--Bendixson regions by using transversal curves, that enables us to…

In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\delta\geq 2$ contains a cycle with at least $\min\{2\delta,n\}$…

For a certain class of genuinely nonlinear two-by-two planar hyperbolic systems we show that any classical solution on a smoothly bounded domain has nontangential boundary limits except on a set whose Hausdorff dimension is bounded by some…