Related papers: Turan Extremum Problem for Periodic Function with …

One of my recent papers transforms an NP-Complete problem into the question of whether or not a feasible real solution exists to some Linear Program. The unique feature of this Linear Program is that though there is no explicit bound on the…

We show that the problem of finding the measure supported on a compact subset K of the complex plane such that the variance of the least squares predictor by polynomials of degree at most n at a point exterior to K is a minimum, is…

In this paper, we consider the relation between $p > 1$ and critical dimension of the extremal solution of the semilinear equation $$\{\begin{array}{lllllll} \beta \Delta^{2}u-\tau \Delta u=\frac{\lambda}{(1-u)^{p}} & in\ \ B, 0<u\leq 1 &…

We study the Tur\'an number of long cycles in random graphs and in pseudo-random graphs. Denote by $ex(G(n,p),H)$ the random variable counting the number of edges in a largest subgraph of $G(n,p)$ without a copy of $H$. We determine the…

Let $\mathcal{F}$ be a family of $r$-uniform hypergraphs. The random Tur\'an number $\mathrm{ex}(G^r_{n,p},\mathcal{F})$ is the maximum number of edges in an $\mathcal{F}$-free subgraph of $G^r_{n,p}$, where $G^r_{n,p}$ is the…

For any large prime $q$, $1 \leq x \leq q$ and any real $0 \leq k \leq 1$, we prove an upper bound for the following $2k$-th moment $$\displaystyle \sum_{\substack{\chi \bmod q}} \Big| \sum_{n\leq x} \chi(n)\lambda(n)\Big|^{2k},$$ where…

Let $\mathscr{F}$ be a family of graphs. A graph $G$ is $\mathscr{F}$-free if $G$ does not contain any $F\in \mathcal{F}$ as a subgraph. The general Tur\'an number, denoted by $ex(n, H,\mathscr{F})$, is the maximum number of copies of $H$…

This paper provides two results that are useful in the study of the existence and the stability properties of a periodic solution for a given dynamical system. The first result deals with scalar time-periodic systems and establishes the…

Some 76 years ago P. Tur\'an was the first to establish lower estimations of the ratio of the maximum norm of the derivatives of polynomials and the maximum norm of the polynomials themselves on the interval I:=[-1,1] and on the unit disk…

We prove the global-time existence of weak solutions to the supercooled Stefan problem. Our result holds in general space dimensions and with a general class of initial data. In addition, our solution is maximal in the sense of a certain…

We consider the problem of globally minimizing the sum of many rational functions over a given compact semialgebraic set. The number of terms can be large (10 to 100), the degree of each term should be small (up to 10), and the number of…

We look for pointwise bounds on a plurisubharmonic function near its singularity point, given the value of its generalized Lelong number with respect to a plurisubharmonic weight. To this end, an extremal problem is considered. In certain…

Consider the problem {ll} \Delta^2 u= \lambda e^{u} &\text{in} B u=\frac{\partial u}{\partial n}=0 &\text{on}\partial B, where $B$ is the unit ball in $\R^N$ and $\lambda$ is a parameter. Unlike the Gelfand problem the natural candidate…

In this paper we design a new primal-dual algorithm for the classic discrete optimization problem of maximizing a monotone submodular function subject to a cardinality constraint achieving the optimal approximation of $(1-1/e)$. This…

We deal with the following general version of the classical moment problem: when can a linear functional on a unital commutative real algebra $A$ be represented as an integral with respect to a Radon measure on the character space $X(A)$ of…

For integers $k, \ell \geq 3$, let $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of…

The main goal of this paper is to introduce a framework for infinitesimal deformation problems, using new methods coming from operadic calculus. We construct an adjunction between infinitesimal deformation problems over some type of…

We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent…

We show how Turan's inequality $P_n(x)^2-P_{n-1}(x)P_{n+1}(x)\geq 0$ for Legendre polynomials and related inequalities can be proven by means of a computer procedure. The use of this procedure simplifies the daily work with inequalities.…

We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general.…