The Set Packing problem is, given a collection of sets $${\mathcal S}$$ over ground set U}$$ , to find maximum that are pairwise disjoint. is among the most fundamental NP-hard optimization problems have been studied extensively in various computational regimes. focus this work on parameterized complexity, Parameterized (PSP): Given $$r \in {\mathbb N}$$ there $$ {\mathcal S}' \subseteq S}: |{\...

In this note we study some topological properties of bounded sets and Bourbaki-bounded sets. Also we introduce two types of Bourbaki-bounded homomorphisms on topological groups  including, n$-$Bourbaki-bounded homomorphisms and$hspace{1mm}$ B$-$Bourbaki-bounded homomorphisms. We compare them to each other and with the class of continuous homomorphisms. So, two topologies are presented on them a...

A subset of a locally convex space E is called (relatively) sequentially complete if every Cauchy sequence $$\left\{ x_{n}\right\} _{n=1}^{\infty }$$ in contained converges to point $$x\in A$$ (a E$$ ). Asanov and Velichko proved that X countably compact, functionally bounded set $$C_{p}\left( X\right) $$ relatively Baturov showed Lindelöf $$\Sigma -space, each compact (so bounded) C_{p}\left( ...