相关论文: Some combinatorial aspects of composition of a set…
Theoretical foundations of compositional reasoning about heaps in imperative programming languages are investigated. We introduce a novel concept of compositional symbolic memory and its relevant properties. We utilize these formal…
In this paper, we study composition operators on Hilbert space of complex-valued harmonic functions. In particular, we explore isometries, the type of self-map that generate bounded composition operator, and characterize the boundedness of…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
The notion of composite system made up of distinguishable parties is investigated in the context of arbitrary convex spaces.
The work relates to a new way for analysis of one-dimensional stochastic systems, based on consideration of its higher order difference structure. From this point of view, the deterministic and random processes are analyzed. A new numerical…
For the finite ordered sets $A, D$, write $A^D$ for the ordered set of isotone maps $D \to A$ with the pointwise order. It was proved in earlier work that the order structure of $A^A$ determines~$A$ up to isomorphism. In this note we extend…
We study weighted composition operators on Hilbert spaces of analytic functions on the unit ball with kernels of the form $(1-<z,w>)^{-\gamma}$ for $\gamma>0$. We find necessary and sufficient conditions for the adjoint of a weighted…
In this contribution we first summarize how contour integration methods can be used to derive closed formulae for functional determinants of ordinary differential operators. We then generalize our considerations to partial differential…
Set functions are a feature of functional logic programming to encapsulate all results of a non-deterministic computation in a single data structure. Given a function $f$ of a functional logic program written in Curry, we describe a…
Integral transformations are used to estimate high order derivatives of various special functions. Applications are given to numerical integration, where estimates of high order derivatives of the integrand are needed to achieve bounds on…
We define an analogue of the Baernstein star function for a meromorphic function f in several complex variables. This function is subharmonic on the upper half-plane and encodes some of the main functionals attached to f.We then…
Semantic composition remains an open problem for vector space models of semantics. In this paper, we explain how the probabilistic graphical model used in the framework of Functional Distributional Semantics can be interpreted as a…
We observe that solutions of a large class of highly oscillatory second order linear ordinary differential equations can be approximated using nonoscillatory phase functions. In addition, we describe numerical experiments which illustrate…
We first give a combinatorial interpretation of coefficients of Chebyshev polynomials, which allows us to connect them with compositions of natural numbers. Then we describe a relationship between the number of compositions of a natural…
In this paper we give a method, based on the characteristic function of a set, to solve some difficult problems of set theory in undergraduate research.
In this paper we consider generalized moment functions of higher order. These functions are closely related to the well-known functions of binomial type which have been investigated on various abstract structures. In our former paper we…
We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…
Many scientific datasets are compositional in nature. Important biological examples include species abundances in ecology, cell-type compositions derived from single-cell sequencing data, and amplicon abundance data in microbiome research.…
We show how the complexity of higher-order functional programs can be analysed automatically by applying program transformations to a defunctionalized versions of them, and feeding the result to existing tools for the complexity analysis of…
We extend first-order logic to include variadic function symbols, and prove a substitution lemma. Two applications are given: one to bounded quantifier elimination and one to the definability of certain Borel sets.