let $a$ be a non-trivial abelian group and $a^{*}=asetminus {0}$. a graph $g$ is said to be $a$-magic graph if there exists a labeling$l:e(g)rightarrow a^{*}$ such that the induced vertex labeling$l^{+}:v(g)rightarrow a$, define by $$l^+(v)=sum_{uvin e(g)} l(uv)$$ is a constant map.the set of all constant integerssuch that $sum_{uin n(v)} l(uv)=c$, for each $vin n(v)$,where $n(v)$ denotes the s...

By the technique of forcing, some new independence results are proved for the alternative set theory (AST) and similar weak theories: The scheme of choice is independent both of AST and of second order arithmetic, axiom of constructibility is independent of AST plus schemes of choice.

In this paper we consider MIMO broadcast channels with separable variance profile modelling antenna correlation at both transmit and receive sides. For large number of antennas we derive the theoretical sum-rate capacity when the transmitter performs zero-forcing or regularized zero-forcing precoding. In particular, we apply the results to volumelimited devices where the correlation originates ...

traditional work on pro-drop languages identified a set of parametric values ‎associated with the availability of null subjects, including the presence of null ‎expletive subjects. in the same vein, but more within the framework of minimalist ‎program, i will discuss while referential subjects may optionally be overt or covert ‎in the persian, expletives are obligatorily null. in this regard, a...

in this paper, a new definition of fuzzy bounded sets and totallyfuzzy bounded sets is introduced and properties of such sets are studied. thena relation between totally fuzzy bounded sets and n-compactness is discussed.finally, a geometric characterization for fuzzy totally bounded sets in i- topologicalvector spaces is derived.

The metric dimension dim(G) of a graph G is the minimum number of vertices such that every vertex of G is uniquely determined by its vector of distances to the chosen vertices. The zero forcing number Z(G) of a graph G is the minimum cardinality of a set S of black vertices (whereas vertices in V (G)\S are colored white) such that V (G) is converted entirely to black after finitely many applica...