相关论文: A General Type for Storage Operators
Let $n\in\mathbb{N}$ and let $A$ be a closed linear operator (everywhere bounded or unbounded). In this paper, we study (among others) equations of the type $A^*A=A^n$ where $n\geq2$ and see when they yield $A=A^*$ (or a weaker class of…
The main aim of this paper is to generalize the classical concept of positive operator, and to develop a general extension theory, which overcomes not only the lack of a Hilbert space structure, but also the lack of a normable topology. The…
Forgetting is an important concept in knowledge representation and automated reasoning with widespread applications across a number of disciplines. A standard forgetting operator, characterized in [Lin and Reiter'94] in terms of…
There has been proposed a new method of the constructing of the basic functions for spaces of tensor representations of the Lie groups with the help of the generalized Casimir operator. In the definition of the operator there were used the…
A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence,…
Datatype-generic programming increases program abstraction and reuse by making functions operate uniformly across different types. Many approaches to generic programming have been proposed over the years, most of them for Haskell, but…
We generalize Frenkel's integral formula for traces of operators to operators. The resulting formula holds for bounded self-adjoint positive operators and $p$-Schatten class of compact positive operators.
Notions of guardedness serve to delineate the admissibility of cycles, e.g. in recursion, corecursion, iteration, or tracing. We introduce an abstract notion of guardedness structure on a symmetric monoidal category, along with a…
This paper presents the Functional Machine Calculus (FMC) as a simple model of higher-order computation with "reader/writer" effects: higher-order mutable store, input/output, and probabilistic and non-deterministic computation. The FMC…
The Functional Machine Calculus (FMC) was recently introduced as a generalization of the lambda-calculus to include higher-order global state, probabilistic and non-deterministic choice, and input and output, while retaining confluence. The…
Our aim is to present several properties of a Landweber operator and of a Landweber-type operator. These operators are widely used in methods for solving the split feasibility problem and the split common fixed point problem. The presented…
Modeling generics in object-oriented programming languages such as Java and C# is a challenge. Recently we proposed a new order-theoretic approach to modeling generics. Given the strong relation between order theory and category theory, in…
Automata learning is a popular technique used to automatically construct an automaton model from queries. Much research went into devising ad hoc adaptations of algorithms for different types of automata. The CALF project seeks to unify…
An algorithm to decide the emptiness of a regular type expression with set operators given a set of parameterised type definitions is presented. The algorithm can also be used to decide the equivalence of two regular type expressions and…
We consider the $(\ell_p,\ell_r)$-Grothendieck problem, which seeks to maximize the bilinear form $y^T A x$ for an input matrix $A$ over vectors $x,y$ with $\|x\|_p=\|y\|_r=1$. The problem is equivalent to computing the $p \to r^*$ operator…
In the article we propose a general scheme for solutions of some approximation problems under a rather general setting. We illustrate the application of the proposed scheme by a series of examples, in particular we show that many results in…
We generalize an operation described by Sloane on the binary representation of an integer to other bases, thus finding several new sequences.
This paper provides an alternate characterization of type-two polynomial-time computability, with the goal of making second-order complexity theory more approachable. We rely on the usual oracle machines to model programs with subroutine…
In this paper we introduce a very general setting dealing with the superposition of operators of any positive order and provide a systematic study of them. We also provide examples and counterexamples, as well as characterizing properties…
A unified approach to the concept of a Hausdorff operator is proposed in such a way that a number of classical and new operators feet into the given definition. Conditions are given for the boundedness of the operators under consideration…