Related papers: Composition Conditions for Classes of Analytic Fun…
In this paper we determine a number of meaningful compositions of higher order of a set of functions, which is considered in Malesevic (1998), in implicit and explicit form. Results which are obtained are applied to the vector analysis in…
Matrix conditions extend linear Mal'tsev conditions from Universal Algebra to exactness properties in Category Theory. Some can be stated in the finitely complete context while, in general, they can only be stated for regular categories. We…
For argumentation mining, there are several sub-tasks such as argumentation component type classification, relation classification. Existing research tends to solve such sub-tasks separately, but ignore the close relation between them. In…
Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string…
A key requirement on any well-behaved process language is its compositionality: behavioural equivalence of processes should be respected by the constructors of the language. Turi and Plotkin's abstract GSOS provides an elegant bialgebraic…
We extend the signal flow calculus---a compositional account of the classical signal flow graph model of computation---to encompass affine behaviour, and furnish it with a novel operational semantics. The increased expressive power allows…
In this article we explore under which conditions on the interior function the composition of functions is measurable. We also study the sharpness of the result by providing a counterexample for weaker hypotheses.
In previous work, summarized in this paper, we proposed an operation of parallel composition for rewriting-logic theories, allowing compositional specification of systems and reusability of components. The present paper focuses on…
Recognizing visual entities in a natural language sentence and arranging them in a 2D spatial layout require a compositional understanding of language and space. This task of layout prediction is valuable in text-to-image synthesis as it…
We prove canonical and non-canonical tree-of-tangles theorems for abstract separation systems that are merely structurally submodular. Our results imply all known tree-of-tangles theorems for graphs, matroids and abstract separation systems…
We show that for the edge ideals of a certain class of forests, the arithmetical rank equals the projective dimension.
We define the operation of composing two hereditary classes of permutations using the standard composition of permutations as functions and we explore properties and structure of permutation classes considering this operation. We mostly…
We prove that the Hopf algebra of parking functions and the Hopf algebra of ordered forests are isomorphic, using a rigidity theorem for a particular type of bialgebras.
In this article, a class of analytic functions is investigated and their some properties are established. Several recurrence relations and various classes of bilinear and bilateral generating functions for these analytic functions are also…
It is shown that a large class of properties coincide for weighted composition operators on a large class of weighted VMOA spaces, including the ones with logarithmic weights and the ones with standard weights $(1-|z|)^{-c}, \ 0\leq c<…
In this paper we present a geometric proof of the following fact. Let $D$ be a Jordan domain in $\mathbb{C}$, and let $f$ be analytic on $cl(D)$. Then there is an injective analytic map $\phi:D\to\mathbb{C}$, and a polynomial $p$, such that…
We prove Euler-Lagrange and natural boundary necessary optimality conditions for fractional problems of the calculus of variations which are given by a composition of functionals. Our approach uses the recent notions of Riemann-Liouville…
A longstanding question in cognitive science concerns the learning mechanisms underlying compositionality in human cognition. Humans can infer the structured relationships (e.g., grammatical rules) implicit in their sensory observations…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…