Related papers: V. Markov's problem for monotone polynomials
Under suitable assumptions of regularity and non-degeneracy on the covariance of the driving additive noise, any Markov solution to the stochastic Navier-Stokes equations has an associated generator of the diffusion and is the unique…
An adaptive analogue of the Yu. E. Nesterov method for variational inequalities with a strongly monotone operator is proposed. Some estimates are obtained for the parameters determining the quality of the solution of the variational…
We show that one can approximate the least fixed point solution for a multivariate system of monotone probabilistic polynomial equations in time polynomial in both the encoding size of the system of equations and in log(1/\epsilon), where…
The problem of estimating the multiplicity of the zero of a polynomial when restricted to the trajectory of a non-singular polynomial vector field, at one or several points, has been considered by authors in several different fields. The…
We show an algorithm for computing the permanent of a random matrix with vanishing mean in quasi-polynomial time. Among special cases are the Gaussian, and biased-Bernoulli random matrices with mean 1/lnln(n)^{1/8}. In addition, we can…
A number of sharp inequalities are proved for the space ${\mathcal P}\left(^2D\left(\frac{\pi}{4}\right)\right)$ of 2-homogeneous polynomials on ${\mathbb R}^2$ endowed with the supremum norm on the sector…
This paper deals with an extremal problem for harmonic functions in the unit ball of $\mathbf{R}^n$. We are concerned with the pointwise sharp estimates for the gradient of real--valued bounded harmonic functions. Our main result may be…
In the paper we study a measure version of the evolutionary nonlinear Boltzmann-type equation in which we admit a random number of collisions of particles. We consider first a stationary model and use two methods to find its fixed points:…
We consider sampling and enumeration problems for Markov equivalence classes. We create and analyze a Markov chain for uniform random sampling on the DAGs inside a Markov equivalence class. Though the worst case is exponentially slow…
We focus on the linear convergence of generalized proximal point algorithms for solving monotone inclusion problems. Under the assumption that the associated monotone operator is metrically subregular or that the inverse of the monotone…
For a polynomial $P_n$ of degree $n$, Bernstein's inequality states that $\|P_n'\| \le n \|P_n\|$ for all $L^p$ norms on the unit circle, $0<p\le\infty,$ with equality for $P_n(z)= c z^n.$ We study this inequality for random polynomials,…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
Compound Poisson distributions and signed compound Poisson measures are used for approximation of the Markov binomial distribution. The upper and lower bound estimates are obtained for the total variation, local and Wasserstein norms. In a…
The problem of replacing an integral norm with respect to a given probability measure by the corresponding integral norm with respect to a discrete measure is discussed in the paper. The above problem is studied for elements of finite…
In this paper estimates for the uniform norm of solutions of parabolic SPDEs are derived. The result is obtained through iteration techniques, motivated by the work of Moser in deterministic settings. As an application of the main result,…
A polynomial-time exact algorithm for counting the number of directed acyclic graphs in a Markov equivalence class was recently given by Wien\"obst, Bannach, and Li\'skiewicz (AAAI 2021). In this paper, we consider the more general problem…
We obtain Calder{\'o}n-Zygmund estimates for some degenerate equations of Kolmogorov type with inhomogeneous coefficients. We then derive the well-posedness of the martingale problem associated to related degenerate operators, and therefore…
We establish a new extremal property of the classical Chebyshev polynomials in the context of best rank-one approximation of tensors. We also give some necessary conditions for a tensor to be a minimizer of the ratio of spectral and…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…