Related papers: Monotonicity and log-behavior of some functions re…
In a recent result, Knop, Lovett, McGuire and Yuan (STOC 2021) proved the log-rank conjecture for communication complexity, up to log n factor, for any Boolean function composed with AND function as the inner gadget. One of the main tools…
The Riemann zeta function at integer arguments can be written as an infinite sum of certain hypergeometric functions and more generally the same can be done with polylogarithms, for which several zeta functions are a special case. An…
The transformations of the sum identities for generalized harmonic and oscillatory numbers, obtained earlier in our recent report [1], enable us to derive the new identities expressed in terms of the corresponding square roots of x. At…
We study the number of queries needed to identify a monotone Boolean function $f:\{0,1\}^n \rightarrow \{0,1\}$. A query consists of a 0-1-sequence, and the answer is the value of $f$ on that sequence. It is well-known that the number of…
The method analytic continuation of operators acting integer n-times to complex s-times (hep-th/9707206) is applied to an operator that generates Bernoulli numbers B_n (Math. Mag. 70(1), 51 (1997)). B_n and Bernoulli polynomials B_n(s) are…
We study the problem of finding monotone subsequences in an array from the viewpoint of sublinear algorithms. For fixed $k \in \mathbb{N}$ and $\varepsilon > 0$, we show that the non-adaptive query complexity of finding a length-$k$…
Let $a\in (0, \infty)$, $\gamma(a)$ be the Generalized Euler-Mascheroni Constant, and let \begin{align*} &x_n=\frac1a+\frac{1}{a+1}+\cdots+\frac{1}{a+n-1}-\ln\frac{a+n}{a},\\…
This paper begins by deriving the uniform bounds for the regular Coulomb wave function $F_{\ell,\eta}$ and its derivative $F_{\ell,\eta}'$. We then examine detailed zero configurations of $F_{\ell,\eta}$ and $F_{\ell+1,\eta}$, extending…
We consider properties of determinants of some random symmetric matrices issued from multivariate statistics: Wishart/Laguerre ensemble (sample covariance matrices), Uniform Gram ensemble (sample correlation matrices) and Jacobi ensemble…
We consider the perturbed Mann's iterative process \begin{equation} x_{n+1}=(1-\theta_n)x_n+\theta_n f(x_n)+r_n, \end{equation} where $f:[0,1]\rightarrow[0,1]$ is a continuous function, $\{\theta_n\}\in [0,1]$ is a given sequence, and…
In this paper, we introduce a way to generalize the Euler's gamma function as well as some related special functions. With a given polynomial in one variable $f(t)\ge 0$, we can associate a function, so-called "gamma function associated…
The topic of gamma type functions and related functional equation $f(x+1)=g(x)f(x)$ has been seriously studied from first half of the twentieth century till now. Regarding unique solutions of the equation the asymptotic condition…
We deal with monotone inclusion problems of the form $0\in Ax+Dx+N_C(x)$ in real Hilbert spaces, where $A$ is a maximally monotone operator, $D$ a cocoercive operator and $C$ the nonempty set of zeros of another cocoercive operator. We…
We believe that Euler constant is not just the "renormalized" value of the Riemann zeta function in 1. In a sense that we shall clarify it is in fact the normal and natural value of zeta of 1. In this paper we first propose a limit…
In this paper, we give evaluations of integrals involving the arctan and the logarithm functions, and present several new summation identities for odd harmonic numbers and Milgram constants. These summation identities can be expressed as…
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar's constraint qualification holds. In this paper, we…
We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…
Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…
We give the first agnostic, efficient, proper learning algorithm for monotone Boolean functions. Given $2^{\tilde{O}(\sqrt{n}/\varepsilon)}$ uniformly random examples of an unknown function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$, our…
We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…