New results on inclusive quarkonium decays

I review some recent progress, leading to a substantial reduction in the number of non-perturbative parameters, in the calculation of inclusive quarkonium decay widths in the framework of non-relativistic effective field theories.Comment: 4 pages, 3 figures, to be published in the proceedings of the XXXVIIth Rencontres de Moriond (QCD and High Energy Hadronic Interactions), 16-23 March 2002, Les Arcs, Franc

Decays rates for S- and P-wave bottomonium

We use the Bodwin-Braaten-Lepage factorization scheme to separate the long- and short-distance factors that contribute to the decay rates of $\Upsilon$, $\eta_b$ (S-wave) and $\chi_b$,$h_b$ (P-wave). The long distance matrix elements are calculated on the lattice in the quenched approximation using a non-relativistic formulation of the $b$ quark dynamics.Comment: 3 pages Latex using espcrc2.sty and epsf.sty + 2 postscript figure

Gluon Fragmentation into 3PJ^3P_J Quarkonium

The functions of the gluon fragmentation into $^3P_J$ quarkonium are calculated to order $\alpha_s^2$. With the recent progress in analysing quarkonium systems in QCD we show explicitly how the socalled divergence in the limit of the zero-binding energy, which is related to $P$-wave quarkonia, is treated correctly in the case of fragmentation functions. The obtained fragmentation functions satisfy explicitly at the order of $\alpha_s^2$ the Altarelli-Parisi equation and when $z\rightarrow 0$ they behave as $z^{-1}$ as expected. Some comments on the previous results are made.Comment: Type-errors in the text and equations are eliminated. Several sentences are added in Sect.4. The file is compressed and uuencoded (E-Mail contact [email protected]

NRQCD: Fundamentals and Applications to Quarkonium Decay and Production

I discuss NRQCD and, in particular, the NRQCD factorization formalism for quarkonium production and decay. I also summarize the current status of the comparison between the predictions of NRQCD factorization and experimental measurements.Comment: 8 pages, 5 eps figures, uses ws-ijmpa.cls, plenary talk presented at the International Conference on QCD and Hadronic Physics, Beijing, China, June, 16--20, 200

Decay rates of various bottomonium systems

Using the Bodwin--Braaten--Lepage factorization theorem in heavy quarkonium decay and production processes, we calculated matrix elements associated with S- and P-wave bottomonium decays via lattice QCD simulation methods. In this work, we report preliminary results on the operator matching between the lattice expression and the continuum expression at one loop level. Phenomenological implications are discussed using these preliminary $\overline{MS}$ matrix elements.Comment: 4 pages, postscript file (gzip compressed, uudecoded), contribution to Lat'9

Heavy quarkonia

Two complementary approaches to the theory of heavy quarkonia are discussed. The nonrelativistic potential models give amazingly accurate predictions, but lack a theoretical justification. The expansion in powers of $v/c$ is theoretically very acceptable, but is not as good in giving numerical predictions. The importance of combining these two approaches is stressed.Comment: Presented at QCD'96 Montpellier 4-12 June 1996 7 pages, no figures, Latex fil

Reachability Preservers: New Extremal Bounds and Approximation Algorithms

We abstract and study \emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G = (V, E)$ and a set of \emph{demand pairs} $P \subseteq V \times V$, a reachability preserver is a sparse subgraph $H$ that preserves reachability between all demand pairs. Our first contribution is a series of extremal bounds on the size of reachability preservers. Our main result states that, for an $n$-node graph and demand pairs of the form $P \subseteq S \times V$ for a small node subset $S$, there is always a reachability preserver on $O(n+\sqrt{n |P| |S|})$ edges. We additionally give a lower bound construction demonstrating that this upper bound characterizes the settings in which $O(n)$ size reachability preservers are generally possible, in a large range of parameters. The second contribution of this paper is a new connection between extremal graph sparsification results and classical Steiner Network Design problems. Surprisingly, prior to this work, the osmosis of techniques between these two fields had been superficial. This allows us to improve the state of the art approximation algorithms for the most basic Steiner-type problem in directed graphs from the $O(n^{0.6+\varepsilon})$ of Chlamatac, Dinitz, Kortsarz, and Laekhanukit (SODA'17) to $O(n^{4/7+\varepsilon})$.Comment: SODA '1

A Unified View of Graph Regularity via Matrix Decompositions

We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs, and (a version of) $L^p$ upper regular graphs. More precisely, we define \emph{cut pseudorandom graphs}, we prove our regularity lemmas for these graphs, and then we show that cut pseudorandomness captures all of the above graph classes as special cases. The core of our approach is an abstracted matrix decomposition, roughly following Frieze and Kannan [Combinatorica '99] and \Lovasz{} and Szegedy [Geom.\ Func.\ Anal.\ '07], which can be computed by a simple algorithm by Charikar [AAC0 '00]. This gives rise to the class of cut pseudorandom graphs, and using work of Oveis Gharan and Trevisan [TOC '15], it also implies new PTASes for MAX-CUT, MAX-BISECTION, MIN-BISECTION for a significantly expanded class of input graphs. (It is NP Hard to get PTASes for these graphs in general.