This paper is devoted to the study of intuitionistic fuzzy topological spaces. In this paper an intuitionistic fuzzy regular weakly generalized closed set and intuitionistic fuzzy regular weakly generalized open set are introduced. Some of its properties are studied. Also we have provided some applications of intuitionistic fuzzy weakly generalized closed set namely intuitionistic fuzzy rwT1/2 ...

Let Lω(G) be a Beurling algebra on a locally compact abelian group G. We look for general conditions on the weight which allows the vanishing of continuous derivations of Lω(G). This leads us to introducing vector-valued Beurling algebras and considering the translation of operators on them. This is then used to connect the augmentation ideal to the behavior of derivation space. We apply these ...

for a bounded linear operator on hilbert space we define a sequence of the so-called weakly extremal vectors‎. ‎we study the properties of weakly extremal vectors and show that the orthogonality equation is valid for weakly extremal vectors‎. ‎also we show that any quasinilpotent operator $t$ has an hypernoncyclic vector‎, ‎and so $t$ has a nontrivial hyperinvariant subspace‎.

the aim of this paper is to introduce the concepts of fuzzy upper and fuzzy lower almost continuous, weakly continuous and almost weakly continuous multifunctions. several characterizations and properties of these multifunctions along with their mutual relationships are established in $l$-fuzzy topological spaces

A connguration is weakly ag-transitive if its group of automor-phisms acts intransitively on ags but the group of all automorphisms and anti-automorphisms acts transitively on ags. It is shown that weakly ag-transitive conngurations are in one-to-one correspondence with bipartite 1 2-arc-transitive graphs of girth not less than 6. Several innnite families of weakly ag-transitive conngurations a...

We prove that deciding whether the Runner can win this turn (mate-in-1) in the Netrunner card game generalized to allow decks to contain an arbitrary number of copies of a card is weakly NP-hard. We also prove that deciding whether the Corp can win within two turns (mate-in-2) in this generalized Netrunner is weakly NP-hard.