The free lattice-ordered group Fn (of rank r¡) has been studied in two ways: via the Conrad representation on the various right orderings of the free group Gv (sharpened by Kopytov's observation that some one right ordering must by itself give a faithful representation), and via the Glass-McCleary representation as a pathologically o-2-transitive /-permutation group. Each kind of representation...

A spread is a set of lines of PG(d, q), which partition the point set. A parallelism is a partition of the set of lines by spreads. Some constructions of constant dimension codes that contain lifted MRD codes are based on parallelisms of projective spaces. A parallelism is transitive if it has an automorphism group which is transitive on the spreads. A parallelism is point-transitive if it has ...

The class of the s-transitive (resp. w-transitive) fuzzy matrices contains properly the class of the max-min transitive fuzzy matrices for which reduction models are already known. It is shown that some basic properties of these models remain valid also for s-transitive (resp. w-transitive)fuzzy matrices.

The title of this study is the syntactic behavior second verb (V2) in Balinese serial verbs and it aims at investigating types composing analyzing V2. theory applied identifying typology by Van Staden Ger Reesink (Senft, ed., 2008), complement adjunct Kroeger (2005) used This research classified as a descriptive-qualitative study. data supporting analysis was collected from written texts short ...

We consider the question of taking transitive closures on top of pure relational systems (Sybase and Ingres in this case). We developed three kinds of transitive closure programs , one using a stored procedure to simulate a built-in transitive closure operator, one using the C language embedded with SQL statements to simulate the iterated execution of the transitive closure operation, and one u...

A significant amount of spatial information in textual documents is hidden within the relationship between events. While humans have an intuitive understanding of these relationships that allow us to recover an object’s or event’s location, currently no annotated data exists to allow automatic discovery of spatial containment relations between events. We present our process for building such a ...

A method to compute the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is given. Other previous methods in literature compute just the transitive closure, some transitive approximations or some transitive openings. The proposed algorithm computes the three different similarities that approximate a proximity for the computation...