A new approach to translating between natural language expressions and hypergraph-based semantic knowledge representations is proposed. Language comprehension is formulated in terms of homomorphisms mapping syntactic parse trees into semantic hypergraphs, and language generation as constraint satisfaction based on constraints derived via applying the inverse relations of these homomorphisms. Th...

We consider sequences of graphs (Gn) and define various notions of convergence related to these sequences: “left convergence” defined in terms of the densities of homomorphisms from small graphs into Gn; “right convergence” defined in terms of the densities of homomorphisms from Gn into small graphs; and convergence in a suitably defined metric. In Part I of this series, we show that left conve...

Wang et al. introduced Lp radial Blaschke-Minkowski homomorphisms based on Schuster?s homomorphisms. In 2018, Feng and He gave the concept of (p,q)-mixed geominimal surface area according to Lutwak, Yang Zhang?s volume. this article, associated with areas homomorphisms, we establish some inequalities including two Brunn-Minkowski type inequalities, a cyclic inequality monotonic inequalities.

This is a continuation of the paper by the same author published in this journal, v. 19 (2007), no. 6. This paper is a continuation of the paper [4] and makes a whole with it. We retain the notation, the definitions, and the assumptions of [4], and we continue the numeration of sections, theorems and lemmas. The proofs of Theorems 2–4 in §6 of [4] were in fact missing; it was said only that one...

In this paper, we introduce a new algebraic structure, called a UP-algebra (UP means the University of Phayao) and a concept of UP-ideals, UP-subalgebras, congruences and UP-homomorphisms in UP-algebras, and investigated some related properties of them. We also describe connections between UP-ideals, UP-subalgebras, congruences and UP-homomorphisms, and show that the notion of UP-algebras is a ...

A seminal result by Lovász states that two digraphs A and B (possibly with loops) are isomorphic if and only if for every digraph X the number of homomorphisms X → A equals the number of homomorphisms X → B. Lovász used this result to deduce certain cancellation properties for the direct product of digraphs. We develop an analogous result for the class of digraphs without loops, and with weak h...

A signed graph (G,Σ) is an undirected graph G together with an assignment of signs (positive or negative) to all its edges, where Σ denotes the set of negative edges. Two signatures are said to be equivalent if one can be obtained from the other by a sequence of resignings (i.e. switching the sign of all edges incident to a given vertex). Extending the notion of usual graph homomorphisms, homom...

Let G and A be abelian torsion groups. In[bq., R. S. Pierce develops a complete set of invarlants for Hom(G,A). To compute these invariants he introduces, and uses extensively, the group of small homomorphisms of G into A. Also, using some of Pierce’s methods, Fuchs characterizes this group in [I]. Our purpose in this paper is to characterize Hom(G,A) in what seems to be a more natural manner t...

Different modeling procedures applied to a physical system may result in behaviors which are distinct but nevertheless share many structural properties. Such behaviors are isomorphic in a sense which we formalize and characterize in this paper. More generally, we introduce a natural notion of homomorphisms between behaviors of multidimensional systems, generalizing recent work of Fuhrmann. A ge...

Due to the nature of product in the category of locales, the entourage uniformities in the point-free context only mimic the classical Weil approach while the cover (Tukey type) ones can be viewed as an immediate extension. Nevertheless the resulting categories are concretely isomorphic. We present a transparent construction of this isomorphism, and apply it to the natural uniformities of local...