Related papers: Automated Resummation and Hadron Collider Event Sh…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
A mimic computing oriented automaton can directly portray the behaviors of a mimic computing system. In this paper, we investigate the following theoretical problems on this type of automata: operational semantics and computational ability.…
Meeting summarization has become a critical task considering the increase in online interactions. While new techniques are introduced regularly, their evaluation uses metrics not designed to capture meeting-specific errors, undermining…
The purpose of this report is a study of the algebraic approach possibilities to reconstruct images. This approach is reduced to solution of the large system of linear algebraic equations. We also point out some possible further…
With the ongoing Run 3 of the LHC and its upcoming High-Luminosity upgrade, there is a growing need to study observables with high precision both experimentally and theoretically. To increase precision on the theory side, improvements of…
We consider the transverse-momentum (qT) distribution of a diphoton pair produced in hadron collisions. At small values of qT , we resum the logarithmically-enhanced perturbative QCD contributions up to next-to-next-to-leading logarithmic…
We review the resummation of threshold logarithms for heavy quark, dijet, direct photon, and W boson production cross sections in hadronic collisions. Beyond leading logarithms the resummed cross section is sensitive to the color exchange…
We define a general scheme for the evolution of fragmentation functions which resums soft gluon logarithms in a manner consistent with fixed order evolution. We present an explicit example of our approach in which double logarithms are…
The concept of an adapted homology basis for a prime order conformal automorphism of a compact Riemann surface extends to arbitrary finite groups of conformal automorphisms. Here we compute some examples of adapted homology bases for some…
We provide a literature review about Automatic Text Summarization (ATS) systems. We consider a citation-based approach. We start with some popular and well-known papers that we have in hand about each topic we want to cover and we have…
Collider experiments are equipped with trigger systems that rapidly inspect the physics content emerging from collisions to decide whether the resulting products are worth saving for later analysis. One crucial aspect for analyzing the…
We develop the first systematic theoretical approach to dijet asymmetries in hadron-hadron collisions based on the perturbative QCD (pQCD) expansion and the Sudakov resummation formalism. We find that the pQCD calculation at next-to-leading…
A jet algorithm must specify how to (re-)combine different partons or towers into a single four-vector. Various recombination schemes have been used experimentally to examine the transverse energy profile of jets in hadron colliders.…
We derive and analytically solve renormalization group (RG) equations of gauge invariant non-local Wilson line operators which resum logarithms for event shape observables $\tau$ at subleading power in the $\tau\ll 1$ expansion. These…
Next-to-leading logarithmic final-state resummed predictions have traditionally been calculated, manually, separately for each observable. In this article we derive NLL resummed results for generic observables. We highlight and discuss the…
We present results relevant for the extension of threshold resummation beyond the next-to-leading logarithmic (NLL) order for QCD hard-scattering processes. As an example, we consider di-hadron production $H_1 H_2\to h_1 h_2 X$, where the…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term…
3D shape creation and modeling remains a challenging task especially for novice users. Many methods in the field of computer graphics have been proposed to automate the often repetitive and precise operations needed during the modeling of…
The gauge-boson sector of perturbative scalar electrodynamics is investigated in detail as a testing ground for resummation methods in hot gauge theories. It also serves as a simple non-trivial reference system for the non-Abelian gluon…