Related papers: On the Hilbert number for piecewise linear vector …
In 2013, Koldobsky posed the problem to find a constant $d_n$, depending only on the dimension $n$, such that for any origin-symmetric convex body $K\subset\mathbb{R}^n$ there exists an $(n-1)$-dimensional linear subspace…
In this paper, we present a method of higher-order analysis on bifurcation of small limit cycles around an elementary center of integrable systems under perturbations. This method is equivalent to higher-order Melinikov function approach…
The purpose of the present paper is to study the limit cycles of one-parameter perturbed plane Hamiltonian vector field $X_\varepsilon$ $$ X_\varepsilon : \left\{ \begin{array}{llr} \dot{x}=\;\; H_y+\varepsilon f(x,y)\\…
Let k be a subfield of a p-adic field of odd residue characteristic, and let L be the function field of a variety of dimension n >= 1 over k. Then Hilbert's Tenth Problem for L is undecidable. In particular, Hilbert's Tenth Problem for…
In the study of the number of limit cycles of near-Hamiltonian systems, the first order Melnikov function plays an important role. This paper aims to establish a development of a known method to estimate the upper bound of the number of…
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 analyze the dynamics of a 4-parameter family of planar ordinary differential equations, given by a polynomial of degree 5 that is equivariant under a symmetry of order 6. We obtain the number of limit cycles as a function of the…
Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…
We treat the boundary problem for complex varieties with isolated singularities, of complex dimension greater than or equal to 3, non necessarily compact, which are contained in strongly convex, open subsets of a complex Hilbert space H. We…
Let RD(n) denote the minimum d for which there exists a formula for the roots of the general degree n polynomial using only algebraic functions of d or fewer variables. In 1927, Hilbert sketched how the 27 lines on a cubic surface could be…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
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…
Given an n-dimensional natural Hamiltonian L on a Riemannian or pseudo-Riemannian manifold, we call "extension" of L the n+1 dimensional Hamiltonian $H=\frac 12 p_u^2+\alpha(u)L+\beta(u)$ with new canonically conjugated coordinates…
The already proved Lum-Chua's conjecture says that a continuous planar piecewise linear differential system with two zones separated by a straight line has at most one limit cycle. In this paper, we provide a new proof by using a novel…
It is known that non-hyperbolic limit cycles are structurally unstable in the set of planar smooth and analytical vector fields. In the polynomial case, it is known only that limit cycles of even degree are structurally unstable. In this…
The classical Dirac theorem asserts that every graph $G$ on $n$ vertices with minimum degree $\delta(G) \ge \lceil n/2 \rceil$ is Hamiltonian. The lower bound of $\lceil n/2 \rceil$ on the minimum degree of a graph is tight. In this paper,…
In this paper, we study the problem of limit cycle bifurcation in two piecewise polynomial systems of Li\'enard type with multiple parameters. Based on the developed Melnikov function theory, we obtain the maximum number of limit cycles of…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
It is studied the Hilbert boundary value problem for the nondegenerate Beltrami equations in domains $D$ of the complex plane $\mathbb C$ with the so--called quasihyperbolic boundary condition. It is proved the existence of solutions of…
In the present paper, we study the number of zeros of the first order Melnikov function for piecewise smooth polynomial differential system, to estimate the number of limit cycles bifurcated from the period annulus of quadratic isochronous…