A new definition of boundedness of linear order-homomorphisms (LOH)in $L$-topological vector spaces is proposed. The new definition iscompared with the previous one given by Fang [The continuity offuzzy linear order-homomorphism, J. Fuzzy Math. 5 (4) (1997)829$-$838]. In addition, the relationship between boundedness andcontinuity of LOHs is discussed. Finally, a new uniform boundednessprincipl...

The concept of generalized order statistics (GOSs) was introduced as a unified approach to a variety of models of ordered random variables. The purpose of this paper is to investigate condi- tions on the underlying distribution functions and the parameters on which GOSs are based, to establish Shaked-Shanthikumar multivari- ate dispersive ordering of GOSs from one sample and Khaledi-Kochar mu...

We give an analogue for vertex operator algebras and superalgebras of the notion of endomorphism ring of a vector space by means of a notion of “local system of vertex operators” for a (super) vector space. We first prove that any local system of vertex operators on a (super) vector space M has a natural vertex (super)algebra structure with M as a module. Then we prove that for a vertex (operat...

Let $R$ and $S$ be commutative rings with unity, $f\colon R\rightarrow S$ a ring homomorphism $J$ an ideal of $S$. Then the subring $R\bowtie ^fJ:=\lbrace (a,f(a)+j)\mid a\in R$ $j\in J\rbrace $ $R\times is called amalgamation along respect to $f$. In this paper, we determine when ^fJ$ (generalized) filter ring.

Abstract In this paper, we study the generalized order- Jacobsthal sequences modulo for and the generalized order-k Jacobsthal-Padovan sequence modulo for . Also, we define the generalized order-k Jacobsthal orbit of a k-generator group for and the generalized order-k Jacobsthal-Padovan orbit a k-generator group for . Furthermore, we obtain the lengths of the periods of the generalized order-3 ...

The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures. As opposed to the homomorphism order of undirected graphs (which has no non-trivial finite maximal antichains), the order of directed graphs has finite maximal This research was partially supported by the EU Research...

D denotes the homomorphism poset of finite directed graphs. An antichain duality is a pair 〈F ,D〉 of antichains of D such that (F→) ∪ (→D) = D is a partition. A generalized duality pair in D is an antichain duality 〈F ,D〉 with finite F and D. We give a simplified proof of the Foniok Nešetřil Tardif theorem for the special case D, which gave full description of the generalized duality pairs in D...

In this paper we survey results related to homomorphism dualities for graphs, and more generally, for finite structures. This is related to some of the classical combinatorial problems, such as colorings of graphs and hypergraphs, and also to recently intensively studied Constraint Satisfaction Problems. On the other side dualities are related to the descriptive complexity and First Order defin...