Related papers: On the logarithmic factor in error term estimates …
A general method is presented for deriving the limiting behavior of estimators that are defined as the values of parameters optimizing an empirical criterion function. The asymptotic behavior of such estimators is typically deduced from…
Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
We establish a new asymptotic formula for the number of polynomials of degree $n$ with $k$ prime factors over a finite field $\mathbb{F}_q$. The error term tends to $0$ uniformly in $n$ and in $q$, and $k$ can grow beyond $\log n$.…
We generalize the asymptotic estimates by Bubboloni, Luca and Spiga (2012) on the number of $k$-compositions of $n$ satisfying some coprimality conditions. We substantially refine the error term concerning the number of $k$-compositions of…
For an affine two factor model, we study the asymptotic properties of the maximum likelihood and least squares estimators of some appearing parameters in the so-called subcritical (ergodic) case based on continuous time observations. We…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
We prove asymptotic formulae for small weighted solutions of quadratic congruences of the form $\lambda_1x_1^2+\cdots +\lambda_nx_n^2\equiv \lambda_{n+1}\bmod{p^m}$, where $p$ is a fixed odd prime, $\lambda_1,...,\lambda_{n+1}$ are integer…
For any $\varepsilon >0$, we obtain an asymptotic formula for the number of solutions $n \le x$ to $$ \lVert \alpha n + \beta \rVert < x^{-\frac{1}{4}+\varepsilon} $$ where $n$ is $[y,z]$-smooth for infinitely many real number $x$. In…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
This note improves the best known exponent 1/12 in the prime field sum-product inequality (for small sets) to 1/11, modulo a logarithmic factor.
Sarnak obtained the asymptotic formula of the sum of the class numbers of indefinite binary quadratic forms from the prime geodesic theorem for the modular group. In the present paper, we show several asymptotic formulas of partial sums of…
We calculate asymptotic expansions for the moments of number of comparisons used by the randomized quick sort algorithm using the singularity analysis of certain generating functions.
Although we expect to find many smooth numbers (i.e., numbers with no large prime factors) among the values taken by a polynomial with integer coefficients, it is unclear what the asymptotic number of such smooth values should be; this is…
This paper completes and partially improves some of the results of [arXiv:0809.5002] about the asymptotic behavior of solutions of linear and nonlinear elliptic equations with singular coefficients via an Almgren type monotonicity formula
Asymptotic expansions are derived for solutions of the parabolic cylinder and Weber differential equations. In addition the inhomogeneous versions of the equations are considered, for the case of polynomial forcing terms. The expansions…
The paper considers asymptotics of summation functions of additive and multiplicative arithmetic functions. We also study asymptotics of summation functions of natural and prime arguments. Several assertions on this subject are proved and…
In this article we present logarithmic methods for solving first order and second order ordinary differential equations. The essence of the method is that we apply the basic properties derivatives and logarithms to reduce the number of…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…