中文
相关论文

相关论文: Matching functions for heavy particles

200 篇论文

We discuss a general framework for the inclusion of heavy quark mass contributions to deep-inelastic structure functions and their perturbative matching to structure functions computed in variable-mass schemes. Our approach is based on the…

高能物理 - 唯象学 · 物理学 2015-05-18 Stefano Forte , Eric Laenen , Paolo Nason , Juan Rojo

Functional methods can be applied to the quantum effective action to efficiently determine counterterms and matching conditions for effective field theories. We extend the toolbox to two-loop order and beyond and show how to evaluate the…

高能物理 - 唯象学 · 物理学 2025-08-20 Javier Fuentes-Martín , Adrián Moreno-Sánchez , Ajdin Palavrić , Anders Eller Thomsen

We define cylindric generalisations of skew Macdonald functions when one of their parameters is set to zero. We define these functions as weighted sums over cylindric skew tableaux: fixing two integers n>2 and k>0 we shift an ordinary skew…

数学物理 · 物理学 2013-06-25 Christian Korff

The construction of heavy quark effective field theory (HqEFT) is extended to arbitrary order in both expansion parameters $\alpha_s$ and $1/m_q$. Matching conditions are discussed for the general case, and it is verified that this approach…

高能物理 - 唯象学 · 物理学 2013-11-13 W. Kilian , T. Mannel

We give the cumulative distribution functions, the expected values, and the moments of weighted lattice polynomials when regarded as real functions of independent random variables. Since weighted lattice polynomial functions include…

概率论 · 数学 2008-02-19 Jean-Luc Marichal

We study the problem of enumerating answers of Conjunctive Queries ranked according to a given ranking function. Our main contribution is a novel algorithm with small preprocessing time, logarithmic delay, and non-trivial space usage during…

数据库 · 计算机科学 2025-05-21 Shaleen Deep , Paraschos Koutris

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…

概率论 · 数学 2009-03-06 Eugenijus Manstavičius

We give direct and inverse theorems for the weighted approximation of functions with endpoint singularities by combinations of Bernstein operators.

泛函分析 · 数学 2010-08-27 Wen-ming Lu , Lin Zhang

Order parameters based on spherical harmonics and Fourier coefficients already play a significant role in condensed matter research in the context of systems of spherical or point particles. Here, we extend these types of order parameter to…

软凝聚态物质 · 物理学 2010-12-22 Aaron S. Keys , Christopher R. Iacovella , Sharon C. Glotzer

Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for…

最优化与控制 · 数学 2019-11-21 Cyrille W. Combettes , Sebastian Pokutta

We discuss the production of heavy colored paricles at the Large Hadron Collider (LHC) through gluon-gluon fusion process. A factorization theorem is obtained for this process using Soft Collinear Effective Theory. Our factorization theorem…

高能物理 - 唯象学 · 物理学 2009-01-22 Ahmad idilbi , Chul Kim

Observables involving heavy quarks can be computed in perturbative QCD in two different approximation schemes: either the quark mass dependence is fully retained, or it is retained only where needed to regulate the collinear singularity.…

高能物理 - 唯象学 · 物理学 2022-09-12 Daniele Gaggero , Andrea Ghira , Simone Marzani , Giovanni Ridolfi

We study spherically symmetric spacetimes for matter distributions with isotropic pressures. We generate new exact solutions to the Einstein field equations which also contains isotropic pressures. We develop an algorithm that produces a…

广义相对论与量子宇宙学 · 物理学 2014-12-23 S. Ngubelanga , S. D. Maharaj

Composite minimization involves a collection of functions which are aggregated in a nonsmooth manner. It covers, as a particular case, smooth approximation of minimax games, minimization of max-type functions, and simple composite…

最优化与控制 · 数学 2025-03-04 Yassine Nabou , Ion Necoara

Joint alignment of a collection of functions is the process of independently transforming the functions so that they appear more similar to each other. Typically, such unsupervised alignment algorithms fail when presented with complex data…

机器学习 · 计算机科学 2012-10-19 Marwan A. Mattar , Allen R. Hanson , Erik G. Learned-Miller

Decoupling of heavy quarks at low energies can be described by means of an effective theory as shown by S. Weinberg in Ref. [1]. We study the decoupling of the charm quark by lattice simulations. We simulate a model, QCD with two degenerate…

高能物理 - 格点 · 物理学 2017-11-22 Francesco Knechtli , Tomasz Korzec , Björn Leder , Graham Moir

This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…

最优化与控制 · 数学 2023-07-13 Maria-Luiza Vladarean , Nikita Doikov , Martin Jaggi , Nicolas Flammarion

In this manuscript, the authors derive closed formula for definite integrals of combinations of powers and logarithmic functions of complicated arguments and express these integrals in terms of the Hurwitz zeta. These derivations are then…

综合数学 · 数学 2021-04-30 Robert Reynolds , Allan Stauffer

Using Wilson-Polchinski renormalization group equations, we give a simple new proof of decoupling in a $\phi^4$-type scalar field theory involving two real scalar fields (one is heavy with mass $M$ and the other light). Then, to all orders…

高能物理 - 理论 · 物理学 2009-10-28 Chanju Kim

A connected matching in a graph G consists of a set of pairwise disjoint edges whose covered vertices induce a connected subgraph of G. While finding a connected matching of maximum cardinality is a well-solved problem, it is NP-hard to…

离散数学 · 计算机科学 2024-08-12 Phillippe Samer , Phablo F. S. Moura