Related papers: Limit-Cycle Replication via Chebyshev Pullbacks an…

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

In this thesis we present several results in coding theory, concerning error-correcting codes and the Shannon capacity. 1. We give a general symmetry reduction of matrices occuring in semidefinite programs in coding theory. 2. We apply the…

Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…

In the present study we consider planar piecewise linear vector fields with two zones separated by the straight line $x=0$. Our goal is to study the existence of simultaneous crossing and sliding limit cycles for such a class of vector…

We consider a system of the form x'=P_n(x,y)+xR_m(x,y), y'=Q_n(x,y)+yR_m(x,y), where P_n(x,y), Q_n(x,y) and R_m(x,y) are homogeneous polynomials of degrees n, n and m, respectively, with n<=m. We prove that this system has at most one limit…

We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilbert's Irreducibility Theorem for degree $n$ polynomials $f$…

We prove a quantitative version of Hilbert's irreducibility theorem for function fields: If $f(T_1,\ldots, T_n,X)$ is an irreducible polynomial over the field of rational functions over a finite field $\mathbb{F}_q$ of characteristic $p$,…

One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…

Consider a holomorphic foliation with singularities of a 2-dimensional complex manifold. In this article we prove a new sufficient condition for this foliation to have countably many homologically independent complex limit cycles. In…

We propose a new proof technique that aims to be applied to the same problems as the Lov\'asz Local Lemma or the entropy-compression method. We present this approach in the context of non-repetitive colorings and we use it to improve…

For various triple systems $F$, we give tight lower bounds on the number of copies of $F$ in a triple system with a prescribed number of vertices and edges. These are the first such results for hypergraphs, and extend earlier theorems of…

We prove an upper bound for the number of rational points of bounded height on irreducible affine hypersurfaces. More precisely, given an irreducible polynomial $f \in \mathbb{Z}[X_1, \dots, X_n]$, we prove an upper bound on the number of…

This is a thesis that was defended in 2009 at Lomonosov Moscow State University. In Chapter 1: 1. It is proved that that the class of lower (Skolem) elementary functions is the set of all polynomial-bounded functions that can be obtained by…

We construct a lift of the degree filtration on the integer valued polynomials to (even MU-based) synthetic spectra. Namely, we construct a bialgebra in modules over the evenly filtered sphere spectrum which base-changes to the degree…

The cycle set of a graph $G$ is the set consisting of all sizes of cycles in $G$. Answering a conjecture of Erd\H{o}s and Faudree, Verstra\"{e}te showed that there are at most $2^{n - n^{1/10}}$ different cycle sets of graphs with $n$…

The paper is devoted to some extremal problems for convex polygons on the Euclidean plane, related to the concept of self Chebyshev radius for the polygon boundary. We consider a general problem of minimization of the perimeter among all…

In this paper, we study the number of limit cycles which bifurcate from the periodic orbits of cubic polynomial vector fields of Lotka-Volterra type having a rational first integral of degree 2, under polynomial perturbations of degree $n$.…

In recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. Aiming to balance the tradeoff between data recovery for…

We obtain upper bounds for the number of monic irreducible polynomials over $\mathbb Z$ of a fixed degree $n$ and a growing height $H$ for which the field generated by one of its roots has a given discriminant. We approach it via counting…

For a Hilbert function space $\mathcal H$ the Smirnov class $\mathcal N^+(\mathcal H)$ is defined to be the set of functions expressible as a ratio of bounded multipliers of $\mathcal H$, whose denominator is cyclic for the action of…