Related papers: Scalar actions in Lean's mathlib
We enrich the Lambek calculus with the cyclic shift operation, which is expected to model the closure operator of formal languages with respect to cyclic shifts. We introduce a Gentzen-style calculus and prove cut elimination. Secondly, we…
Type classes are an elegant extension to traditional, Hindley-Milner based typing systems. They are used in modern, typed languages such as Haskell to support controlled overloading of symbols. Haskell 98 supports only single-parameter and…
We introduce and solve an infinite class of loop integrals which generalises the well-known ladder series. The integrals are described in terms of single-valued polylogarithmic functions which satisfy certain differential equations. The…
Machine learning (ML) is increasingly being used in high-stakes applications impacting society. Therefore, it is of critical importance that ML models do not propagate discrimination. Collecting accurate labeled data in societal…
Matrix Lie groups provide a language for describing motion in such fields as robotics, computer vision, and graphics. When using these tools, we are often faced with turning infinite-series expressions into more compact finite series (e.g.,…
Functional methods and a derivative expansion are employed for laying out a procedure to compute the effective action to any loop order, for scalar fields parametrising an arbitrary Riemannian manifold, while maintaining explicit…
Large pre-trained language models perform remarkably well on tasks that can be done "in one pass", such as generating realistic text or synthesizing computer programs. However, they struggle with tasks that require unbounded multi-step…
The Shape Calculus is a bio-inspired calculus for describing 3D shapes moving in a space. A shape forms a 3D process when combined with a behaviour. Behaviours are specified with a timed CCS-like process algebra using a notion of channel…
Achieving speed and accuracy for math library functions like exp, sin, and log is difficult. This is because low-level implementation languages like C do not help math library developers catch mathematical errors, build implementations…
We establish new explicit connections between classical (scalar) and matrix Gegenbauer polynomials, which result in new symmetries of the latter and further give access to several properties that have been out of reach before: generating…
We give a thoroughful explanation of the general properties of different, general scales, corresponding to different (all possible) mathematical functions f(x), we mention and analyse many examples. These observations and statements might…
In this paper, we study invariants of linear differential operators with respect to algebraic Lie pseudogroups. Then we use these invariants and the principle of n-invariants to get normal forms (or models) of the differential operators and…
We formalize Hall's Marriage Theorem in the Lean theorem prover for inclusion in mathlib, which is a community-driven effort to build a unified mathematics library for Lean. One goal of the mathlib project is to contain all of the topics of…
The proof assistant Lean has support for abstract polynomials, but this is not necessarily the same as support for computations with polynomials. Lean is also a functional programming language, so it should be possible to implement…
We classify polar isometric actions on simply connected 3-dimensional Riemannian homogeneous spaces, up to orbit equivalence. In particular, we classify extrinsically homogeneous surfaces in such spaces and study the geometry of the orbit…
3D action recognition was shown to benefit from a covariance representation of the input data (joint 3D positions). A kernel machine feed with such feature is an effective paradigm for 3D action recognition, yielding state-of-the-art…
In this paper, we are interested in the construction of a bilinear pseudodifferential calculus. We define some symbolic classes which contains those of Coifman-Meyer. These new classes allow us to consider operators closely related to the…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
We propose a variant of the CCS process algebra with new features aiming at allowing multiscale modelling of biological systems. In the usual semantics of process algebras for modelling biological systems actions are instantaneous. When…
Many scalar field theory models with complex actions are invariant under the antilinear ($PT$) symmetry operation $L^{\ast}(-\chi)=L(\chi)$. Models in this class include the $i\phi^{3}$ model, the Bose gas at finite density and Polyakov…