Related papers: Ladder operators and rational extensions
Using quilted Floer cohomology and relative quilt invariants, we define a composition functor for categories of Lagrangian correspondences in monotone and exact symplectic Floer theory. We show that this functor agrees with geometric…
Let T be Goedel's system of primitive recursive functionals of finite type in the lambda formulation. We define by constructive means using recursion on nested multisets a multivalued function I from the set of terms of T into the set of…
We define a Lax operator as a monic pseudodifferential operator $L(\partial)$ of order $N\geq 1$, such that the Lax equations $\dfrac{\partial L(\partial)}{\partial t_k}=[(L^{\frac kN}(\partial))_+,L(\partial)]$ are consistent and non-zero…
The structure of symplectic integrators up to fourth-order can be completely and analytical understood when the factorization (split) coefficents are related linearly but with a uniform nonlinear proportional factor. The analytic form of…
In this paper we extensively investigate the class of conditionally positive definite operators, namely operators generating conditionally positive definite sequences. This class itself contains subnormal operators, $2$- and $3$-isometries…
We present a novel construction of recursion operators for scalar second-order integrable multidimensional PDEs with isospectral Lax pairs written in terms of first-order scalar differential operators. Our approach is quite straightforward…
This is a (slightly edited) version of the PhD dissertation of the author, submitted to Brown University in July 2005. We construct a homotopy calculus of functors in the sense of Goodwillie for the categories of rational homotopy theory.…
We show that any scalar differential operator with a family of polyno- mials as its common eigenfunctions leads canonically to a matrix differen- tial operator with the same property. The construction of the correspond- ing family of matrix…
Simulations and bisimulations are ubiquitous in the study of concurrent systems and modal logics of various types. Besides classical relational transition systems, relevant system types include, for instance, probabilistic, weighted,…
Yang-Baxter R operators symmetric with respect to the orthogonal and symplectic algebras are considered in an uniform way. Explicit forms for the spinorial and metaplectic R operators are obtained. L operators, obeying the RLL relation with…
A new approach to normal operators in real Hilbert spaces is discussed, and a spectral representation is obtained, derived directly from the complex case. The results are then applied to quaternionic normal operators, regarded as a special…
We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…
We initiate the study of derived functors in the setting of extriangulated categories. By using coends, we adapt Yoneda's theory of higher extensions to this framework. We show that, when there are enough projectives or enough injectives,…
Considering patterns as sets of their instances, a difference operator over patterns computes a finite set of two given patterns, which represents the difference between the dividend pattern and the divisor pattern. A complement of a…
Multi-adjoint logic programming is a general framework with interesting features, which involves other positive logic programming frameworks such as monotonic and residuated logic programming, generalized annotated logic programs, fuzzy…
The eigenvalues of the complete commuting set of self-adjoint operators determine the classification of states. We construct a classification for the image of the Jordan-Schwinger mapping of the su(2) algebra. We use the ladder operator…
A new class of operators, larger than $C$-symmetric operators and different than normal one, named $C$--normal operators is introduced. Basic properties are given. Characterizations of this operators in finite dimensional spaces using a…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
We construct a localization for operads with respect to one-ary operations based on the Dwyer-Kan hammock localization. For an operad O and a sub-monoid of one-ary operations W we associate an operad LO and a canonical map O to LO which…