We present the first unquenched latticeQCD calculation of the form factors for the decay
We study the sparsity of the solutions to systems of linear Diophantine equations with and without nonnegativity constraints. The sparsity of a solution vector is the number of its nonzero entries, which is referred to as the
 Award ID(s):
 1818969
 Publication Date:
 NSFPAR ID:
 10225929
 Journal Name:
 Mathematical Programming
 Volume:
 192
 Issue:
 12
 Page Range or eLocationID:
 p. 519546
 ISSN:
 00255610
 Publisher:
 Springer Science + Business Media
 Sponsoring Org:
 National Science Foundation
More Like this

Abstract at nonzero recoil. Our analysis includes 15 MILC ensembles with$$B\rightarrow D^*\ell \nu $$ $B\to {D}^{\ast}\ell \nu $ flavors of asqtad sea quarks, with a strange quark mass close to its physical mass. The lattice spacings range from$$N_f=2+1$$ ${N}_{f}=2+1$ fm down to 0.045 fm, while the ratio between the light and the strangequark masses ranges from 0.05 to 0.4. The valence$$a\approx 0.15$$ $a\approx 0.15$b andc quarks are treated using the Wilsonclover action with the Fermilab interpretation, whereas the light sector employs asqtad staggered fermions. We extrapolate our results to the physical point in the continuum limit using rooted staggered heavylight meson chiral perturbation theory. Then we apply a modelindependent parametrization to extend the form factors to the full kinematic range. With this parametrization we perform a joint latticeQCD/experiment fit using several experimental datasets to determine the CKM matrix element . We obtain$$V_{cb}$$ ${V}_{\mathrm{cb}}$ . The first error is theoretical, the second comes from experiment and the last one includes electromagnetic and electroweak uncertainties, with an overall$$\left V_{cb}\right = (38.40 \pm 0.68_{\text {th}} \pm 0.34_{\text {exp}} \pm 0.18_{\text {EM}})\times 10^{3}$$ $\left({V}_{\mathrm{cb}}\right)=(38.40\pm 0.{68}_{\text{th}}\pm 0.{34}_{\text{exp}}\pm 0.{18}_{\text{EM}})\times {10}^{3}$ , which illustrates the tensions between the experimental data sets, and between theory and experiment. This result is inmore »$$\chi ^2\text {/dof} = 126/84$$ ${\chi}^{2}\text{/dof}=126/84$ 
Abstract This paper studies several solution paths of sparse quadratic minimization problems as a function of the weighing parameter of the biobjective of estimation loss versus solution sparsity. Three such paths are considered: the “
path” where the discontinuous$$\ell _0$$ ${\ell}_{0}$ function provides the exact sparsity count; the “$$\ell _0$$ ${\ell}_{0}$ path” where the$$\ell _1$$ ${\ell}_{1}$ function provides a convex surrogate of sparsity count; and the “capped$$\ell _1$$ ${\ell}_{1}$ path” where the nonconvex nondifferentiable capped$$\ell _1$$ ${\ell}_{1}$ function aims to enhance the$$\ell _1$$ ${\ell}_{1}$ approximation. Serving different purposes, each of these three formulations is different from each other, both analytically and computationally. Our results deepen the understanding of (old and new) properties of the associated paths, highlight the pros, cons, and tradeoffs of these sparse optimization models, and provide numerical evidence to support the practical superiority of the capped$$\ell _1$$ ${\ell}_{1}$ path. Our study of the capped$$\ell _1$$ ${\ell}_{1}$ path is interesting in its own right as the path pertains to computable directionally stationary (= strongly locally minimizing in this context, as opposed to globally optimal) solutions of a parametric nonconvex nondifferentiable optimization problem. Motivated by classical parametric quadratic programming theory and reinforced by modern statistical learning studies, both casting an exponential perspective in fully describing such solution paths, we also aim to address the questionmore »$$\ell _1$$ ${\ell}_{1}$ 
Abstract Let us fix a prime
p and a homogeneous system ofm linear equations for$$a_{j,1}x_1+\dots +a_{j,k}x_k=0$$ ${a}_{j,1}{x}_{1}+\cdots +{a}_{j,k}{x}_{k}=0$ with coefficients$$j=1,\dots ,m$$ $j=1,\cdots ,m$ . Suppose that$$a_{j,i}\in \mathbb {F}_p$$ ${a}_{j,i}\in {F}_{p}$ , that$$k\ge 3m$$ $k\ge 3m$ for$$a_{j,1}+\dots +a_{j,k}=0$$ ${a}_{j,1}+\cdots +{a}_{j,k}=0$ and that every$$j=1,\dots ,m$$ $j=1,\cdots ,m$ minor of the$$m\times m$$ $m\times m$ matrix$$m\times k$$ $m\times k$ is nonsingular. Then we prove that for any (large)$$(a_{j,i})_{j,i}$$ ${\left({a}_{j,i}\right)}_{j,i}$n , any subset of size$$A\subseteq \mathbb {F}_p^n$$ $A\subseteq {F}_{p}^{n}$ contains a solution$$A> C\cdot \Gamma ^n$$ $\leftA\right>C\xb7{\Gamma}^{n}$ to the given system of equations such that the vectors$$(x_1,\dots ,x_k)\in A^k$$ $({x}_{1},\cdots ,{x}_{k})\in {A}^{k}$ are all distinct. Here,$$x_1,\dots ,x_k\in A$$ ${x}_{1},\cdots ,{x}_{k}\in A$C and are constants only depending on$$\Gamma $$ $\Gamma $p ,m andk such that . The crucial point here is the condition for the vectors$$\Gamma $\Gamma <p$
in the solution$$x_1,\dots ,x_k$$ ${x}_{1},\cdots ,{x}_{k}$ to be distinct. If we relax this condition and only demand that$$(x_1,\dots ,x_k)\in A^k$$ $({x}_{1},\cdots ,{x}_{k})\in {A}^{k}$ are not all equal, then the statement would follow easily from Tao’s slice rank polynomial method. However, handling the distinctness condition is much harder, and requires a new approach. While all previous combinatorial applications of the slice rank polynomial method have relied on the slice rank of diagonal tensors, we use a slice rank argument for a nondiagonal tensor in combination with combinatorial and probabilistic arguments.$$x_1,\dots ,x_k$$ ${x}_{1},\cdots ,{x}_{k}$ 
Abstract We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in
and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathsf {Quasi}\text {}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$ $\mathrm{Quasi}\mathrm{NP}=\mathrm{NTIME}\left[{n}^{{\left(\mathrm{log}n\right)}^{O\left(1\right)}}\right]$ , by showing that$\mathcal { C}$ $C$ admits nontrivial satisfiability and/or$\mathcal { C}$ $C$# SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a nontrivial# SAT algorithm for a circuit class . Say that a symmetric Boolean function${\mathcal C}$ $C$f (x _{1},…,x _{n}) issparse if it outputs 1 onO (1) values of . We show that for every sparse${\sum }_{i} x_{i}$ ${\sum}_{i}{x}_{i}$f , and for all “typical” , faster$\mathcal { C}$ $C$# SAT algorithms for circuits imply lower bounds against the circuit class$\mathcal { C}$ $C$ , which may be$f \circ \mathcal { C}$ $f\circ C$stronger than itself. In particular:$\mathcal { C}$ $C$# SAT algorithms forn ^{k}size circuits running in 2^{n}/$\mathcal { C}$ $C$n ^{k}time (for allk ) implyN E X P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$# SAT algorithms for size$2^{n^{{\varepsilon }}}$ ${2}^{{n}^{\epsilon}}$ circuits running in$\mathcal { C}$ $C$ time (for some$2^{nn^{{\varepsilon }}}$ ${2}^{n{n}^{\epsilon}}$ε > 0) implyQ u a s i N P does not have circuits of polynomial size.$(f \circ \mathcal { C})$ $(f\circ C)$Applying
# SAT algorithms from the literature, one immediate corollary of our results is thatQ u a s i N P does not haveE M A J ∘A C C ^{0}∘T H R circuits of polynomialmore » 
Abstract Given a suitable solution
V (t ,x ) to the Korteweg–de Vries equation on the real line, we prove global wellposedness for initial data . Our conditions on$$u(0,x) \in V(0,x) + H^{1}(\mathbb {R})$$ $u(0,x)\in V(0,x)+{H}^{1}\left(R\right)$V do include regularity but do not impose any assumptions on spatial asymptotics. We show that periodic profiles satisfy our hypotheses. In particular, we can treat localized perturbations of the muchstudied periodic traveling wave solutions (cnoidal waves) of KdV. In the companion paper Laurens (Nonlinearity. 35(1):343–387, 2022.$$V(0,x)\in H^5(\mathbb {R}/\mathbb {Z})$$ $V(0,x)\in {H}^{5}(R/Z)$https://doi.org/10.1088/13616544/ac37f5 ) we show that smooth steplike initial data also satisfy our hypotheses. We employ the method of commuting flows introduced in Killip and Vişan (Ann. Math. (2) 190(1):249–305, 2019.https://doi.org/10.4007/annals.2019.190.1.4 ) where . In that setting, it is known that$$V\equiv 0$$ $V\equiv 0$ is sharp in the class of$$H^{1}(\mathbb {R})$$ ${H}^{1}\left(R\right)$ spaces.$$H^s(\mathbb {R})$$ ${H}^{s}\left(R\right)$