English
Related papers

Related papers: Towards complete string effective actions beyond l…

200 papers

We carry out a proof theoretic analysis of the wellfoundedness of recursive path orders in an abstract setting. We outline a very general termination principle and extract from its wellfoundedness proof subrecursive bounds on the size of…

Logic in Computer Science · Computer Science 2019-02-25 Thomas Powell

Document information extraction tasks performed by humans create data consisting of a PDF or document image input, and extracted string outputs. This end-to-end data is naturally consumed and produced when performing the task because it is…

Computation and Language · Computer Science 2021-04-26 Rasmus Berg Palm , Florian Laws , Ole Winther

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

We study effective potentials coming from compactifications of string theory. We show that, under mild assumptions, such potentials are bounded from below in four dimensions, giving an affirmative answer to a conjecture proposed by the…

Mathematical Physics · Physics 2014-03-27 Marcelo M. Disconzi , Michael R. Douglas , Vamsi P. Pingali

We study cosmological solutions in the effective heterotic string theory with $\alpha'$-correction terms in string frame. It is pointed out that the effective theory has an ambiguity via field redefinition and we analyze generalized…

High Energy Physics - Theory · Physics 2015-06-03 Kei-ichi Maeda , Nobuyoshi Ohta , Ryo Wakebe

An attempt is made to define the concept of execution of an instruction sequence. It is found to be a special case of directly putting into effect of an instruction sequence. Directly putting into effect of an instruction sequences…

Programming Languages · Computer Science 2011-10-11 Jan A. Bergstra

The famous Policy Iteration algorithm alternates between policy improvement and policy evaluation. Implementations of this algorithm with several variants of the latter evaluation stage, e.g, $n$-step and trace-based returns, have been…

Artificial Intelligence · Computer Science 2018-08-01 Yonathan Efroni , Gal Dalal , Bruno Scherrer , Shie Mannor

We study sequential search without priors. Our interest lies in decision rules that are close to being optimal under each prior and after each history. We call these rules dynamically robust. The search literature employs optimal rules…

Theoretical Economics · Economics 2020-08-04 Karl H. Schlag , Andriy Zapechelnyuk

We present a multi-modal action logic with first-order modalities, which contain terms which can be unified with the terms inside the subsequent formulas and which can be quantified. This makes it possible to handle simultaneously time and…

Artificial Intelligence · Computer Science 2007-05-23 Camilla Schwind

We present a study of the effective action approach to incorporate higher-order effects in e^+e^- -> n fermions. In its minimal version, the effective action approach is found to exhibit problems with unitarity and high-energy behaviour. We…

High Energy Physics - Phenomenology · Physics 2009-11-10 W. Beenakker , A. P. Chapovsky , A. Kanaki , C. G. Papadopoulos , R. Pittau

A brief overview of some recently active topics in perturbative QCD, including: string-inspired recursion techniques at tree level; recursion approaches and automation of standard techniques for 1-loop calculations; the status of NNLO jet…

High Energy Physics - Phenomenology · Physics 2017-08-23 Gavin P. Salam

The rapidly expanding corpus of medical research literature presents major challenges in the understanding of previous work, the extraction of maximum information from collected data, and the identification of promising research directions.…

Computation and Language · Computer Science 2016-07-19 Victor Andrei , Ognjen Arandjelovic

The regularity of the Hardy-Littlewood maximal function, in both discrete and continuous contexts, and for both centered and noncentered variants, has been subjected to intense study for the last two decades. But efforts so far have…

Classical Analysis and ODEs · Mathematics 2025-04-29 Faruk Temur

Information extraction (IE) has been studied extensively. The existing methods always follow a fixed extraction order for complex IE tasks with multiple elements to be extracted in one instance such as event extraction. However, we conduct…

Computation and Language · Computer Science 2024-03-26 Wenhao Huang , Jiaqing Liang , Zhixu Li , Yanghua Xiao , Chuanjun Ji

In formal argumentation, a distinction can be made between extension-based semantics, where sets of arguments are either (jointly) accepted or not, and ranking-based semantics, where grades of acceptability are assigned to arguments.…

Artificial Intelligence · Computer Science 2023-08-01 Jesse Heyninck , Badran Raddaoui , Christian Straßer

We present the derivation of the effective higher-order Hamiltonian, which gives $m \alpha^6$ contribution to energy levels of an arbitrary light atom. The derivation is based on the Foldy-Wouthuysen transformation of the one-particle Dirac…

Atomic Physics · Physics 2009-11-10 Krzysztof Pachucki

We consider the QCD string as an effective string, whose action describes long-range stringy fluctuations. The leading infrared contribution to the ground state energy is given by the Alvarez-Arvis formula, usually derived using the…

High Energy Physics - Theory · Physics 2014-08-08 J. Ambjorn , Y. Makeenko , A. Sedrakyan

We review the current knowledge about the theoretical foundations of the effective string theory for confining flux tubes and the comparison of the predictions to pure gauge lattice data. A concise presentation of the effective string…

High Energy Physics - Theory · Physics 2016-08-24 Bastian B. Brandt , Marco Meineri

We present a new approach to automated reasoning about higher-order programs by extending symbolic execution to use behavioral contracts as symbolic values, enabling symbolic approximation of higher-order behavior. Our approach is based on…

Programming Languages · Computer Science 2012-04-27 Sam Tobin-Hochstadt , David Van Horn

In the paper, a method of describing the outer derivations of the group algebra of a finitely presentable group is given. The description of derivations is given in terms of characters of the groupoid of the adjoint action of the group.

Rings and Algebras · Mathematics 2017-08-18 A. A. Arutyunov , A. S. Mishchenko , A. I. Shtern