English
Related papers

Related papers: Normalizing the Taylor expansion of non-determinis…

200 papers

The renormalization procedure is proved to be a rigorous way to get finite answers in a renormalizable class of field theories. We claim, however, that it is redundant if one reduces the requirement of finiteness to S-matrix elements only…

High Energy Physics - Theory · Physics 2020-07-03 D. I. Kazakov

For a real number $0<\lambda<2$, we introduce a transformation $T_\lambda$ naturally associated to expansion in $\lambda$-continued fraction, for which we also give a geometrical interpretation. The symbolic coding of the orbits of…

Probability · Mathematics 2011-04-04 Elise Janvresse , Benoît Rittaud , Thierry De La Rue

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Rafał Stefański

Given a linear semi-bounded symmetric operator $S\ge -\omega$, we explicitly define, and provide their nonlinear resolvents, nonlinear maximal monotone operators $A_\Theta$ of type $\lambda>\omega$ (i.e. generators of one-parameter…

Functional Analysis · Mathematics 2015-04-20 Andrea Posilicano

The normalized incomplete beta function can be defined either as cumulative distribution function of beta density or as the Gauss hypergeometric function with one of the upper parameters equal to unity. Logarithmic concavity/convexity of…

Classical Analysis and ODEs · Mathematics 2015-09-18 Dmitrii Karp

We present a typing system with non-idempotent intersection types, typing a term syntax covering three different calculi: the pure {\lambda}-calculus, the calculus with explicit substitutions {\lambda}S, and the calculus with explicit…

Logic in Computer Science · Computer Science 2015-07-01 Alexis Bernadet , Stéphane Jean Lengrand

We describe the extension of normal iteration strategies with appropriate condensation properties to strategies for stacks of normal trees, with full normalization. Given a regular uncountable cardinal $\Omega$ and an…

Logic · Mathematics 2024-03-19 Farmer Schlutzenberg

This paper refers to Langlands' big set of notes [L] devoted to the question if the (normalized) local Hecke-Tate root number $\Delta=\Delta(E,\chi)$, where $E$ is a finite separable extension of a fixed non-archimedean local field $F$, and…

Number Theory · Mathematics 2022-06-28 Helmut Koch , Ernst-Wilhelm Zink

The non-parametric estimation of covariance lies at the heart of functional data analysis, whether for curve or surface-valued data. The case of a two-dimensional domain poses both statistical and computational challenges, which are…

Statistics Theory · Mathematics 2022-01-19 Tomas Masak , Soham Sarkar , Victor M. Panaretos

We provide a primer to numerical methods based on Taylor series expansions such as generalized finite difference methods and collocation methods. We provide a detailed benchmarking strategy for these methods as well as all data files…

We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…

Programming Languages · Computer Science 2013-05-28 Clemens Grabmayer , Jan Rochel

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in $\lambda$-calculi by decomposing their normal forms into bisimilar subterms. Moreover, it typically allows for powerful up-to techniques, such as…

Logic in Computer Science · Computer Science 2023-06-22 Dariusz Biernacki , Serguei Lenglet , Piotr Polesiuk

We study the sequences of numbers corresponding to lambda terms of given sizes, where the size is this of lambda terms with de Bruijn indices in a very natural model where all the operators have size 1. For plain lambda terms, the sequence…

Logic in Computer Science · Computer Science 2016-05-18 Maciej Bendkowski , Katarzyna Grygiel , Pierre Lescanne , Marek Zaionc

The main purpose of this paper is to introduce the random tensor with normal distribution, which promotes the matrix normal distribution to a higher order case. Some basic knowledge on tensors are introduced before we focus on the random…

Statistics Theory · Mathematics 2022-12-09 Changqing Xu , Kaijie Xu

The explicit semiclassical treatment of logarithmic perturbation theory for the nonrelativistic bound states problem is developed. Based upon $\hbar$-expansions and suitable quantization conditions a new procedure for deriving perturbation…

Quantum Physics · Physics 2008-11-26 I. V. Dobrovolska , R. S. Tutik

We introduce regularity notions for averaged nonexpansive operators. Combined with regularity notions of their fixed point sets, we obtain linear and strong convergence results for quasicyclic, cyclic, and random iterations. New convergence…

Optimization and Control · Mathematics 2014-02-25 Heinz H. Bauschke , Dominikus Noll , Hung M. Phan

A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…

Quantum Physics · Physics 2016-08-15 Ary W. Espinosa Müller , Adelio R. Matamala Vásquez

A classical result of Sz.-Nagy asserts that a Hilbert space contraction operator $T$ can be dilated to a unitary $\cU$. A more general multivariable setting for these ideas is the setup where (i) the unit disk is replaced by a domain…

Functional Analysis · Mathematics 2022-07-08 Joseph A. Ball , Haripada Sau

The one-loop structure of the trace anomaly is investigated using different regularizations and renormalization schemes: dimensional, proper time and Pauli-Villars. The universality of this anomaly is analyzed from a very general…

High Energy Physics - Theory · Physics 2009-02-25 M. Asorey , E. V. Gorbar , I. L. Shapiro

Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in…

Logic in Computer Science · Computer Science 2012-11-07 Herman Geuvers , Robbert Krebbers , James McKinna