Related papers: Remarks on Form Factor Bounds

The form factors for the weak currents between B and light mesons are studied by relating them to the corresponding D form factors at q^2_{max} according to HQET, by evaluating them at q^2=0 by QCD sum rules, and by assuming a polar q^2…

In dealing with high-dimensional data sets, factor models are often useful for dimension reduction. The estimation of factor models has been actively studied in various fields. In the first part of this paper, we present a new approach to…

We study the form factor f_+^H (H=D,B) involved in H-\pi transitions. We use data on D^0 \to \pi^- l^+ \nu to find f_+^D at low recoil. Then we use perturbative QCD methods to calculate at larger recoil the contributions to f_+^H that break…

Boundary groupoids were introduced by the second author, which can be used to model many analysis problems on singular spaces. In order to investigate index theory on boundary groupoids, we introduce the notion of {\em a deformation from…

This paper addresses the problem of estimating causal effects when adjustment variables in the back-door or front-door criterion are partially observed. For such scenarios, we derive bounds on the causal effects by solving two non-linear…

The abstract boundary uses sets of curves with the bounded parameter property (b.p.p.) to classify the elements of the abstract boundary into regular points, singular points, points at infinity and so on. Building on the material of Part…

This paper develops nonasymptotic information inequalities for the estimation of the eigenspaces of a covariance operator. These results generalize previous lower bounds for the spiked covariance model, and they show that recent upper…

The Waring rank of the generic $d \times d$ determinant is bounded above by $d \cdot d!$. This improves previous upper bounds, which were of the form an exponential times the factorial. Our upper bound comes from an explicit power sum…

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this…

Combining sum factorization, weighted quadrature, and row-based assembly enables efficient higher-order computations for tensor product splines. We aim to transfer these concepts to immersed boundary methods, which perform simulations on a…

Using the Observable form of Maxwell's equations, we reveal that effective parameters at materials boundaries emerge naturally as anisotropic transfer functions. The complexity of the boundary dictates the order of these functions.…

We establish an uniform factorial decay estimate for the Taylor approximation of solutions to controlled differential equations. Its proof requires a factorial decay estimate for controlled paths which is interesting in its own right.

We consider limits over categories of extensions and show how certain well-known functors on the category of groups turn out as such limits. We also discuss higher (or derived) limits over categories of extensions.

We calculate near zero recoil the order $\alpha_s$ corrections to the Bjorken and Voloshin sum rules that bound the $B\to D^{(*)}\ell\bar\nu$ form factors. These bounds are derived by relating the result of inserting a complete set of…

We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.

Heavy-to-light meson form factors at large recoil can be described using the same techniques as for hard exclusive processes involving only light hadrons. Two competing mechanisms appear in the large-recoil regime, describing so-called…

Using the analytic properties of two-point functions in QCD, as well as unitarity, bounds on the B meson form factor F(q^2) can be derived. Heavy quark spin symmetry, correctly taken into account, is shown to improve these bounds…

We establish restrictions on $B \ra K ( K^* )$ form factors imposed by recent data on $B \ra J/\Psi + K ( K^* ) $ decay rates and polarization. We show that these constraints are not satisfied by few commonly used models. Finally, we relate…

Practical model building processes are often time-consuming because many different models must be trained and validated. In this paper, we introduce a novel algorithm that can be used for computing the lower and the upper bounds of model…

We give upper and lower bounds on the largest singular value of a matrix using analogues to walks in graphs. For nonnegative matrices these bounds are asymptotically tight. In particular, we improve a bound due to I. Schur.