English
Related papers

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

200 papers

Let $H$ be a complex separable Hilbert space and $B(H)$ the algebra of all bounded linear operators on $H$. In this paper, we give considerable generalizations of the inequalities for norms of commutators of normal operators. Let $S, T \in…

Functional Analysis · Mathematics 2019-03-26 N. B. Okelo , P. O. Mogotu

We introduce a call-by-name lambda-calculus $\lambda Jn$ with generalized applications which is equipped with distant reduction. This allows to unblock $\beta$-redexes without resorting to the standard permutative conversions of generalized…

Logic in Computer Science · Computer Science 2024-08-07 José Espírito Santo , Delia Kesner , Loïc Peyrot

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…

Computer Science and Game Theory · Computer Science 2017-01-11 Ulrich Berger

We prove the Stability Property for the call-by-value $\lambda$-calculus (CbV in the following). This result states necessary conditions under which the contexts of the CbV $\lambda$-calculus commute with intersections of approximants. This…

Logic in Computer Science · Computer Science 2024-09-19 Davide Barbarossa

We introduce a method to evaluate untyped lambda terms by combining the theory of traversals, a term-tree traversing technique inspired from Game Semantics, with judicious use of the eta-conversion rule of the lambda calculus. The traversal…

Programming Languages · Computer Science 2018-03-01 William Blum

We introduce a simple extension of the $\lambda$-calculus with pairs---called the distributive $\lambda$-calculus---obtained by adding a computational interpretation of the valid distributivity isomorphism $A \Rightarrow (B\wedge C)\ \…

Logic in Computer Science · Computer Science 2020-10-23 Beniamino Accattoli , Alejandro Díaz-Caro

This article presents a natural extension of the tensor algebra. In addition to "left multiplications" by vectors, we can consider "derivations" by covectors as basic operators on this extended algebra. These two types of operators satisfy…

Representation Theory · Mathematics 2011-05-23 Minoru Itoh

The renormalization method based on the Taylor expansion for asymptotic analysis of differential equations is generalized to difference equations. The proposed renormalization method is based on the Newton-Maclaurin expansion. Several basic…

Classical Analysis and ODEs · Mathematics 2017-07-27 Cheng-shi Liu

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances…

Logic in Computer Science · Computer Science 2013-08-05 Stefan Hetzl , Daniel Weller

While monotone operator theory is often studied on Hilbert spaces, many interesting problems in machine learning and optimization arise naturally in finite-dimensional vector spaces endowed with non-Euclidean norms, such as…

Optimization and Control · Mathematics 2025-08-26 Alexander Davydov , Saber Jafarpour , Anton V. Proskurnikov , Francesco Bullo

Following Milner's seminal paper, the representation of functions as processes has received considerable attention. For pure $\lambda$-calculus, the process representations yield (at best) non-extensional $\lambda $-theories (i.e., $\beta$…

Logic in Computer Science · Computer Science 2025-09-17 Ken Sakayori , Davide Sangiorgi

We construct a generalization of the multiplicative product of distributions presented by L. H\"ormander in [L. H\"ormander, {\it The analysis of linear partial differential operators I} (Springer-Verlag, 1983)]. The new product is defined…

Functional Analysis · Mathematics 2009-07-14 Nuno Costa Dias , Joao Nuno Prata

This paper presents a regularized Newton method (RNM) with generalized regularization terms for unconstrained convex optimization problems. The generalized regularization includes quadratic, cubic, and elastic net regularizations as special…

Optimization and Control · Mathematics 2024-07-11 Yuya Yamakawa , Nobuo Yamashita

It has been recently proposed to use the operator product expansion to evaluate the expectation values of renormalized operators without the need of a direct computation of the relevant renormalization constants. We test the viability of…

High Energy Physics - Lattice · Physics 2009-10-31 Sergio Caracciolo , Andrea Montanari , Andrea Pelissetto

We extend the BMS(4) group by adding logarithmic supertranslations. This is done by relaxing the boundary conditions on the metric and its conjugate momentum at spatial infinity in order to allow logarithmic terms of carefully designed form…

High Energy Physics - Theory · Physics 2023-03-22 Oscar Fuentealba , Marc Henneaux , Cédric Troessaert

We present the type system $\mathtt{d}$, an extended type system with lambda-typed lambda-expressions. It is related to type systems originating from the Automath project. $\mathtt{d}$ extends existing lambda-typed systems by an existential…

Logic in Computer Science · Computer Science 2024-12-17 Matthias Weber

We propose new iterative methods for computing nontrivial extremal generalized singular values and vectors. The first method is a generalized Davidson-type algorithm and the second method employs a multidirectional subspace expansion…

Numerical Analysis · Mathematics 2017-05-18 Ian N. Zwaan , Michiel E. Hochstenbach

The scaling and mass expansion (shortly 'sm-expansion') is a new axiom for causal perturbation theory, which is a stronger version of a frequently used renormalization condition in terms of Steinmann's scaling degree. If one quantizes the…

Mathematical Physics · Physics 2015-06-18 Michael Duetsch

Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of $M$-estimators with…

Statistics Theory · Mathematics 2018-09-17 Arun Kumar Kuchibhotla

Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is $\lambda$-calculus a reasonable machine? Is there a way to measure the computational…

Logic in Computer Science · Computer Science 2014-05-15 Beniamino Accattoli , Ugo Dal Lago