In this paper we analyze the structure of some sets of moments of elements in a finite von Neumann algebra M . If the fundamental group of M is R+\{0}, then the moment sets are convex, and if M is isomorphic to M ⊗M , then the sets are closed under pointwise multiplication. We introduce a class of discrete groups that we call hyperlinear. These are the (infinite conjugacy classes) discrete subg...

the sofeh mountain in the south of isfahan (iran) has a development of shafts (vertical cave). simorgh cave with a depth of 42 m and a length of 52 m has developed along significant fault structures. structural analysis indicates relationships of orientation between the faults and fractures and shafts and chambers geometries. considering the main ne-sw trend of tectonic structures in the area, ...

In this paper we analyze the structure of some sets of non-commutative moments of elements in a finite von Neumann algebra M . If the fundamental group of M is R+\{0}, then the moment sets are convex, and if M is isomorphic to M ⊗M , then the sets are closed under pointwise multiplication. We introduce a class of discrete groups that we call hyperlinear. These are the discrete subgroups (with i...

In this paper we find big Euclidean domains in complex manifolds. We consider open neighbourhoods of sets the form $K\cup M$ a manifold $X$, where $K$ is compact $\mathscr O(U)$-convex set an Stein neighbourhood $U$ $K$, $M$ embedded submanifold and $K\cap O(M)$-convex. prove Docquier-Grauert type theorem concerning biholomorphic equivalence such sets, give sufficient conditions for existence M...

Let L be a countable first-order language and M = (M, . . .) be an L-structure. “Definable set” means a subset of M which is L-definable in M with parameters. A set X ⊆ M is said to be immune if it is infinite and does not contain any infinite definable subset. X is said to be partially immune if for some definable A, A∩X is immune. X is said to be totally non-immune if for every definable A, A...

The maximum independent sets in the Doob graphs D(m,n) are analogs of the distance-2 MDS codes in Hamming graphs and of the latin hypercubes. We prove the characterization of these sets stating that every such set is semilinear or reducible. As related objects, we study vertex sets with maximum cut (edge boundary) in D(m,n) and prove some facts on their structure. We show that the considered tw...