Related papers: On repetitive right application of B-terms
In the spectral theory of non-self-adjoint operators there is a well-known operation of product of operator colligations. Many similar operations appear in the theory of infinite-dimensional groups as multiplications of double cosets. We…
In this note we observe that automated theorem provers (ATPs) that recursively enumerate theorems in a particular way will fail to identify some valid theorems for a reason that is analogous to how G\"odel proved the existence of what are…
We introduce the notion of bilinear moment functional and study their general properties. The analogue of Favard's theorem for moment functionals is proven. The notion of semi-classical bilinear functionals is introduced as a generalization…
Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…
For a class of compactly supported windows we characterize the frame property for a Gabor system $\mts,$ for translation parameters $a$ belonging to a certain range depending on the support size. We show that the obstructions to the frame…
Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…
Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
We prove that $\omega$-regular languages accepted by B\"uchi or Muller automata satisfy an effective automata-theoretic version of the Baire property. Then we use this result to obtain a new effective property of rational functions over…
Circuits based on sum-product structure have become a ubiquitous representation to compactly encode knowledge, from Boolean functions to probability distributions. By imposing constraints on the structure of such circuits, certain inference…
$B$ functions are a class of relatively complicated exponentially decaying basis functions. Since the molecular multicenter integrals of the much simpler Slater-type functions are notoriously difficult, it is not at all obvious why $B$…
We describe a method for proving non-looping non-termination, that is, of term rewriting systems that do not admit looping reductions. As certificates of non-termination, we employ regular (tree) automata.
Does combining a finite collection of objects infinitely many times guarantee the construction of a particular object? Here we use recursive function theory to examine the popular scenario of an infinite collection of typing monkeys…
In this article, we continue the investigation of hep-th 1611.02179 regarding iterative properties of dual conformal integrals in higher dimensions. In d=4, iterative properties of four and five point dual conformal integrals manifest…
Rigorous modelling of natural and industrial systems still conveys various challenges related to abstractions, methods to proceed with and easy-to-use tools to build, compose and reason on models. Operads are mathematical structures that…
The mechanisms of comprehension during language processing remains an open question. Classically, building the meaning of a linguistic utterance is said to be incremental, step-by-step, based on a compositional process. However, many…
An aggregative composition is a binary operation obeying the principle that the whole is determined by the sum of its parts. The development of graph algebras, on which the theory of formal graph languages is built, relies on aggregative…
We introduce a set of eight universal Rules of Inference by which computer programs with known properties (axioms) are transformed into new programs with known properties (theorems). Axioms are presented to formalize a segment of Number…
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…
In recent years, the BCFW construction provided a very powerful tool for computing scattering amplitudes as well as it shed light on the perturbation theory structure. In this talk, we discuss the long-standing issue of the boundary term…