相关论文: Short note on an open problem
We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…
We study the monotonic behaviour of the zeros of the multiple Jacobi-Angelesco orthogonal polynomials, in the diagonal case, with respect to the parameters $\alpha,\beta$ and $\gamma$. We prove that the zeros are monotonic functions of…
The recurrence matrix relations, differentiation formulas, and analytical and fractional integral properties of incomplete gamma matrix functions $\gamma(Q, x)$ and $\Gamma(Q, x)$ are all covered in this article. The generalized incomplete…
We study the twisted q-zeta functions and twisted q-Bernoulli polynomials
We derive a functional central limit theorem (fclt) for normalised sums of a function of the partial sums of independent and identically distributed random variables. In particular, we show, using a technique presented in Huang and Zhang…
In this paper, we study modularity of several functions which naturally arose in a recent paper of Lau and Zhou on open Gromov-Witten potentials of elliptic orbifolds. They derived a number of examples of indefinite theta functions, and we…
An analysis of the zeta and gamma function is presented, using elementary functions like [] and {}, a general formula for the angle of zeta(1/2 + i*n) is found and the same for the gamma function.
We survey and unify results on elimination of dominated strategies by monotonic dynamics and prove some new results that may be seen as dual to those of Hofbauer and Weibull (J. Econ. Theory, 1996, 558-573) on convex monotonic dynamics.
In this paper we solve Kolmogorov problem about existence of a function with given norms of derivatives for classes of multiple monotone functions and absolute monotone functions in the case of arbitrary number of norms. We also show the…
The function $G(x)=(1-\ln x /\ln(1+x))x\ln x$ has been considered by Alzer, Qi and Guo. We prove that $G'$ is completely monotonic by finding an integral representation of the holomorphic extension of $G$ to the cut plane. A main difficulty…
We prove that the graph of a discontinuous $n$-monomial function $f:\mathbb{R}\to\mathbb{R}$ is either connected or totally disconnected. Furthermore, the discontinuous monomial functions with connected graph are characterized as those…
A function $\rho:[0,\infty)\to(0,1]$ is a completely monotonic function if and only if $\rho(\Vert\mathbf{x}\Vert^2)$ is positive definite on $\mathbb{R}^d$ for all $d$ and thus it represents the correlation function of a weakly stationary…
In the paper, the authors establish some asymptotic formulas and double inequalities for the factorial $n!$ and the gamma function $\Gamma$ in terms of the tri-gamma function $\psi'$.
In this paper, we establish the following two identities involving the Gamma function and Bernoulli polynomials, namely $$ \sum_{k\leq x}\frac{1}{k^s} \sum_{j=1}^{k^s}\log\Gamma\left(\frac{j}{k^s}\right) \sum_{\substack{d|k \\…
This is the first of a couple of papers in which, by exploiting the capabilities of the Hamiltonian approach to general relativity, we get a number of technical achievements that are instrumental both for a disclosure of \emph{new} results…
Recently, Ni and Pan proved a $q$-congruence on certain sums involving central $q$-binomial coefficients, which was conjectured by Guo. In this paper, we give a generalization of this $q$-congruence and confirm another $q$-congruence, also…
We show that a large collection of special functions, in particular Nielsen's beta function, are generalized Stieltjes functions of order 2, and therefore logarithmically completely monotonic. This includes the Laplace transform of…
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that Rockafellar's constraint qualification holds. In this paper, we prove the maximal…
We show that the perfect matching problem in general graphs is in Quasi-NC. That is, we give a deterministic parallel algorithm which runs in $O(\log^3 n)$ time on $n^{O(\log^2 n)}$ processors. The result is obtained by a derandomization of…
In this short note we extend a result of Jahangiri and Farahmand \cite{JM} concerning functions of bounded turning to a more general class of functions.