Related papers: A rigorous computer aided estimation for Gelfond e…
We present a general result of simultaneous approximation to several transcendental real, complex or p-adic numbers xi_1,...,xi_t by conjugate algebraic numbers of bounded degree over Q, provided that the given transcendental numbers…
High-dimensional data in the form of tensors are challenging for kernel classification methods. To both reduce the computational complexity and extract informative features, kernels based on low-rank tensor decompositions have been…
We prove weighted weak-type $(r,r)$ estimates for operators satisfying $(r,s)$ limited-range sparse domination of $\ell^q$-type. Our results contain improvements for operators satisfying limited-range and square function sparse domination.…
We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…
We shall given a new effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent, improving our old result in T. Yamada, Colloq. Math. 103 (2005), 303--307.
We establish sharp convolution and multiplication estimates in weighted Lebesgue, Fourier Lebesgue and modulation spaces. Especially we recover some known results.
In this article we introduce a new approach to compute infinite products defined by automatic sequences involving the Thue-Morse sequence. As examples, for any positive integers $q$ and $r$ such that $0 \leq r \leq q-1$, we find infinitely…
In this paper, we give necessary and sufficient conditions for the boundedness of rough Hausdorff operators on Herz, Morrey and Morrey-Herz spaces with absolutely homogeneous weights. Especially, the estimates for operator norms in each…
Theorems of Khintchine, Groshev, Jarn\'ik, and Besicovitch in Diophantine approximation are fundamental results on the metric properties of $\Psi$-well approximable sets. These foundational results have since been generalised to the…
We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…
We prove sharp estimates for the Bergman projection in weighted Bergman spaces in terms of the Bekolle constant. Our main tools are a dyadic model dominating the operator and an adaptation of a method of Cruz-Uribe, Martell and Perez.
We propose a class of robust estimates for multivariate linear models. Based on the approach of MM estimation (Yohai 1987), we estimate the regression coefficients and the covariance matrix of the errors simultaneously. These estimates have…
In this note, we present an improvement to a recent result due to Beresnevich, Levesley, and Ward (2021) pertaining to weighted simultaneous Diophantine approximation on manifolds.
In this paper, we introduce weighted fractional generalized cumulative past entropy of a nonnegative absolutely continuous random variable with bounded support. Various properties of the proposed weighted fractional measure are studied.…
Linear combinations of translations of a single Gaussian, e^{-x^2}, are shown to be dense in L^2(R). Two algorithms for determining the coefficients for the approximations are given, using orthogonal Hermite functions and least squares.…
We derive an asymptotic expansion with effective error bound for $u(n)$, counting the number of unimodal sequences of size $n$. We prove that $u(n)$ satisfies the higher order Tur\'{a}n inequalities for $n\geq33$ and that certain second…
The introduction of a hard singularity in fits to total cross sections and to the ratio of real to imaginary parts enables to reproduce perfectly the data for sqrt(s)< 100 GeV using only simple-pole parametrisations, both for the soft and…
In this paper, the second in a series of eight we continue our development of the basic tools of the multivector and extensor calculus which are used in our formulation of the differential geometry of smooth manifolds of arbitrary topology…
We present an efficient algorithm to compute tight upper bounds of collision probability between two objects with positional uncertainties, whose error distributions are represented with non-Gaussian forms. Our approach can handle noisy…
Fast, accurate, and stable computation of the Clebsch-Gordan (C-G) coefficients is always desirable, for example, in light scattering simulations, the translation of the multipole fields, quantum physics and chemistry. Current recursive…