Related papers: Values of random polynomials in shrinking targets

We present a set of generators of the full annihilator ideal for the Witt ring of an arbitrary field of characteristic unequal to two satisfying a non-vanishing condition on the powers of the fundamental ideal in the torsion part of the…

We consider the problem of minimizing a polynomial function over the integer lattice. Though impossible in general, we use a known sufficient condition for the existence of continuous minimizers to guarantee the existence of integer…

In this paper, using the method proposed by Dembo and Mukherjee [5], we obtain the persistence exponents of random Weyl polynomials in both cases: half nonnegative axis and the whole real axis. Our result is a confirmation to the…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

It is well known that a random cosine polynomial $ V_n(x) = \sum_ {j=0} ^{n} a_j \cos (j x) , \ x \in (0,2 \pi) $, with the coefficients being independent and identically distributed (i.i.d.) real-valued standard Gaussian random variables…

We give a new algorithmic method of detection of atypical values for 2-variables real polynomial functions with emphasis on the effectivity.

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

Let $V\subset\R^m$ be a convex body, symmetric about all coordinate hyperplanes, and let $\PP_{aV},\, a\ge 0$, be a set of all algebraic polynomials whose Newton polyhedra are subsets of $aV$. We prove a limit equality as $a\to \iy$ between…

Asymptotic approximations to the zeros of Jacobi polynomials are given, with methods to obtain the coefficients in the expansions. These approximations can be used as standalone methods for the non-iterative computation of the nodes of…

In this paper, a new ridge-type shrinkage estimator for the precision matrix has been proposed. The asymptotic optimal shrinkage coefficients and the theoretical loss were derived. Data-driven estimators for the shrinkage coefficients were…

We consider the error term of the asymptotic formula for the number of pairs of $k$-free integers up to $x$. Our error term improves results by Heath-Brown, Brandes and Dietmann/Marmon. We then extend our results to $r$-tuples of $k$-free…

A method is suggested to obtain solutions of the various quantum optical Hamiltonians in the framework of the asymptotic iteration method. We extend the notion of asymptotic iteration method to solve the 2 \times 2 matrix Hamiltonians. On a…

In this paper, we consider the boundedness of solutions for a class of impact oscillators $$ \{{array}{ll} \displaystyle \ddot{x}+x^{2n+1}+\sum_{i=0}^{2n}p_{i}(t)x^{i}=0,& \quad {\rm for}\quad x(t)> 0, x(t)\geq 0,&…

Given $X$ a random vector in ${\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\Gamma=\frac{1}{\sqrt{N}}\sum_{i=1}^N <X_i,\cdot>e_i$ be the matrix whose rows are $\frac{X_1}{\sqrt{N}},\dots, \frac{X_N}{\sqrt{N}}$.…

In this paper we study the functions that can be learned through the polynomial interpolation quantum algorithm designed by Childs et al. This algorithm was initially intended to find the coefficients of a multivariate polynomial function…

We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.

Let -Delta+V be the Schrodinger operator acting on L^2(R^d,C) with d>2 odd. Here V is a bounded real or complex function vanishing outside the closed ball of center 0 and of radius a. We show for generic potentials V that the number of…

We obtain asymptotic formulae with optimal error terms for the number of lattice points under and near a dilation of the standard parabola, the former improving upon an old result of Popov. These results can be regarded as achieving the…

We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations,…

The small-ball method was introduced as a way of obtaining a high probability, isomorphic lower bound on the quadratic empirical process, under weak assumptions on the indexing class. The key assumption was that class members satisfy a…