Purpose Consumer adoption of online shopping continues to increase each year. At the same time, retailers face intense competition and few are profitable. This suggests that businesses researchers still have much learn regarding key antecedents success. Based on extensive past research has focused importance various antecedents, this work seeks provide an integrative, comprehensive nomological ...

in this note, we introduce the concept of a fuzzy filter of a blalgebra,with respect to a t-norm briefly, t-fuzzy filters, and give some relatedresults. in particular, we prove representation theorem in bl-algebras. thenwe generalize the notion of a fuzzy congruence (in a bl-algebra) was definedby lianzhen et al. to a new fuzzy congruence, specially with respect to a tnorm.we prove that there i...

in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max...

We define a G-fuzzy congruence, which is a generalized fuzzy congruence, discuss some of its basic properties, and characterize the G-fuzzy congruence generated by a fuzzy relation on a semigroup. We also give certain lattice theoretic properties of Gfuzzy congruences on semigroups.

A canonical form for congruence of matrices was introduced by Turnbull and Aitken in 1932. More than 70 years later, in 2006, another canonical form for congruence has been introduced by Horn and Sergeichuk. The main purpose of this paper is to compare both canonical forms and provide a brief survey on the history of the canonical form for congruence.

In this paper congruences on orthomodular lattices are studied with particular regard to analogies in Boolean algebras. For this reason the lattice of p-ideals (corresponding to the congruence lattice) and the interplay between congruence classes is investigated. From the results adduced there, congruence regularity, uniformity and permutability for orthomodular lattices can be derived easily.

We describe an easy way to determine whether the realization of a set of idempotent identities guarantees congruence modularity or the satisfaction of a nontrivial congruence identity. Our results yield slight strengthenings of Day’s Theorem and Gumm’s Theorem, which each characterize congruence modularity.

We previously obtained a congruence modulo four for the number of real solutions to many Schubert problems on a square Grassmannian given by osculating flags. Here, we consider Schubert problems given by more general isotropic flags, and prove this congruence modulo four for the largest class of Schubert problems that could be expected to exhibit this congruence.

We summarize the combinatorial properties of congruence generation in congruence distributive varieties which are relevant to Baker’s finite basis theorem, explain the extent to which these properties survive in congruence meet-semidistributive varieties, indicate our approach to extending Baker’s theorem to the latter varieties, and pose several problems which our approach does not answer.