Related papers: Some Remarks on Shanks-type Conjectures
We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…
We do research on the real method of Hardy spaces associated with the Dunkl setting on the real line for the range of 0<p<=1.
We study the probability distribution of the number of zeros of multivariable polynomials with bounded degree over a finite field. We find the probability generating function for each set of bounded degree polynomials. In particular, in the…
This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…
The purpose of this note is to revive in $L^p$ spaces the original A. Markov ideas to study monotonicity of zeros of orthogonal polynomials. This allows us to prove and improve in a simple and unified way our previous result [Electron.…
We characterize invariant subspaces of Brownian shifts on vector-valued Hardy spaces. We also solve the unitary equivalence problem for the invariant subspaces of these shifts.
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
Consider a random polynomial $Q_n$ of degree $n+1$ whose zeroes are i.i.d. random variables $\xi_0,\xi_1,\ldots,\xi_n$ in the complex plane. We study the pairing between the zeroes of $Q_n$ and its critical points, i.e. the zeroes of its…
We present fully polynomial-time (deterministic or randomised) approximation schemes for Holant problems, defined by a non-negative constraint function satisfying a generalised second order recurrence modulo a couple of exceptional cases.…
We study the density of complex zeros of a system of real random SO($m+1$) polynomials in several variables. We show that the density of complex zeros of this random polynomial system with real coefficients rapidly approaches the density of…
Recently, S.~Kanti Patra and Md.~Moid Shaik proved the existence of monochromatic solutions to systems of polynomial equations near zero for particular dense subsemigroups $S$ of $((0,\infty),+)$. We extend their results to a much larger…
For a certain class of partitions, a simple qualitative relation is observed between the shape of the Young diagram and the pattern of zeroes of the Wronskian of the corresponding Hermite polynomials. In the case of two-term Wronskian…
Let $E$ be a closed subset of the unit circle of measure zero. Recently, Beise and M\"uller showed the existence of a function in the Hardy space $H^2$ for which the partial sums of its Taylor series approximate any continuous function on…
The zero sets of harmonic polynomials play a crucial role in the study of the free boundary regularity problem for harmonic measure. In order to understand the fine structure of these free boundaries a detailed study of the singular points…
In this paper, we give a complete real-variable theory of local variable Hardy spaces. First, we present various real-variable characterizations in terms of several local maximal functions. Next, the new atomic and the finite atomic…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
It is known that the structure of invariant subspaces of the Hardy space $H^2(\mathbb D^n)$ on the polydisc $\mathbb{D}^n$ is very complicated; hence, we need good examples help us to understand the structure of invariant subspaces of…
We prove matching direct and inverse theorems for uniform polynomial approximation with $A^*$ weights (a subclass of doubling weights suitable for approximation in the $L_\infty$ norm) having finitely many zeros and not too "rapidly…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
The article is devoted to the problem of Hilbert-Schmidt type analytic extensions in Hardy spaces over the infinite-dimensional unitary matrix group endowed with an invariant probability measure. An orthogonal basis of Hilbert-Schmidt…