Search

Cooperation among kin is common in animal societies. Kin groups may form by individuals directly discriminating relatives based on kin recognition cues, or form passively through natal philopatry and limited dispersal. We describe the genetic landscape for a primitively eusocial wasp, Polistes dominula, and ask whether individuals choose cooperative partners that are nearby and/or that are genetic relatives. Firstly, we genotyped an entire sub-population of 1361 wasps and found genetic structuring on an extremely fine scale: the probability of finding genetic relatives decreases exponentially within just a few meters of an individual’s nest. At the same time, however, we found a lack of genetic structuring between natural nest aggregations within the population. Secondly, in a separate dataset where ~2000 wasps were genotyped, we show that wasps forced experimentally to make a new nest choice tended to choose new nests near to their original nests, and that these nests tended to contain some full sisters. However, a significant fraction of wasps chose nests that did not contain sisters, despite sisters being present in nearby nests. Although we cannot rule out a role for direct kin recognition or natal nest-mate recognition, our data suggest that kin groups may form via a philopatric rule-of-thumb, whereby wasps simply select groups and nesting sites that are nearby. The result is that most subordinate helpers obtain indirect fitness benefits by breeding cooperatively.

We correct a mistake in a lemma in the paper cited in the title and show that it did not affect any of the other results of the paper. To this end, we prove results on linearly disjoint field extensions that do not seem to be commonly known. We give an example to show that a separability assumption in one of these results cannot be dropped (doing so had led to the mistake). Further, we discuss recent generalizations of the original classification of defect extensions.

This article is intended to indicate and discuss some errors in N. Lavi’s paper “A Ganzstellensatz for semi-algebraic sets and a boundedness criterion for rational functions”.

A relation, established by Andras Schubert (Scientometrics 78(3): 559–565, 2009) on the relation between a paper’s h-index and its total number of received citations, is explained. The relation is a concavely increasing power law and is explained based on the Lotkaian model for the h-index, proved by Egghe and Rousseau.

This article calculates probabilities for the occurrence of different types of papers such as genius papers, basic papers, ordinary papers or insignificant papers. The basis of these calculations are the formulae for the cumulative n-th citation distribution, being the cumulative distribution of times at which articles receive their n-th (n=1,2,3,...) citation. These formulae (proved in previous papers) are extended to allow for different aging rates of the papers. These new results are then used to define different importance classes of papers according to the different values of n, in function of time t. Examples are given in case of a classification into four parts: genius papers, basic papers, ordinary papers and (almost) insignificant papers. The fact that, in these examples, the size of each class is inversely related to the importance of the journals in this class is proved in a general mathematical context in which we have an arbitrary number of classes and where the threshold values of n in each class are defined according to the natural law of Weber-Fechner.

International audience; In this note, we point out two major errors in the paper "Minimizing total tardiness on parallel machines with preemptions" by Kravchenko and Werner (2012). More precisely, they claimed to have proved that both problems P|pmtn|∑T j and P|r j ,p j =p,pmtn|∑T j are NP -Hard. We give a counter-example to their proofs, letting the complexity of these two problems open.

We present a few comments on the paper "Attacking the market split problem with lattice point enumeration" by A. Wasserman, published in Journal of Combinatorial Optimization, vol. 6, pp. 5–16, 2002.

The spectral gap conjecture of M. van den Berg [2, formula (65)] asserts that λ2 − λ1 ≥ 3π for all convex euclidean domains of diameter 1, where λ1 and λ2 denote the first two eigenvalues of the Dirichlet Laplacian. Notice that equality holds for the 1-dimensional unit interval, which can be regarded also as a degenerate n-dimensional rectangular box. The gap estimate is conjectured to hold more generally for Schrodinger operators with convex potentials, under Dirichlet boundary conditions; see the work of S.-T. Yau and collaborators [9, 11]. This Schrodinger gap conjecture was proved some time ago in 1 dimension by R. Lavine [8], and more recently in all dimensions by B. Andrews and J. Clutterbuck [1]. The proof in this journal by H. Donnelly [3] of the original gap conjecture in 2 dimensions (for the Dirichlet Laplacian with zero potential) is not correct. The Editors of Mathematische Zeitschrift have asked us to describe the flaws in the proof, in order to clarify the state of the literature. Donnelly’s approach to the problem is a natural one: first perform a shape optimization to rule out a non-degenerate minimizing domain, and then analyze the spectral gap for a sequence of domains degenerating to an interval, with the help of results by D. Jerison [5]. (For some history on this approach, and on the gap conjecture more generally, see the report on the AIM meeting “Low Eigenvalues of Laplace and Schrodinger Operators” [10], especially page 12 of the open problems list.) The error lies in the proof of the shape optimization step, as we now explain. Donnelly wishes to prove that no minimizing domain can exist for

In this note, we improve some results of Granville and Soundararajan on the distribution of values of the truncated random Euler product L ( 1 , X ; y ) : = ∏ p ⩽ y ( 1 − X ( p ) / p ) −1 , where the X ( p ) are independent random variables, taking the values ±1 with equal probability p / 2 ( p + 1 ) and 0 with probability 1 / ( p + 1 ) .

We generalize and give a simple proof of a Theorem of Blasco. For a topological space X , C(X) denotes the algebra of real valued continuous functions on X under the operation (αf + gh)(x) := αf(x) + h(x)g(x) for each f, g, h ∈ C(X) and α ∈ R. An algebra A on X means a subalgebra of C(X) which contains the constant functions. By a ∗-algebra A on X we mean an algebra on X and all bounded functions in A separate points from the closed sets. Let A be an algebra on X and π : A −→ R be a (algebra) homomorphism and α be a cardinal number. π is said to be α-evaluating if for each subset B of A with cardinality at most α there exits xB ∈ X such that π(f) = f(xB) for each f ∈ B. If α = |N|(=the cardinal number of the set of the natural numbers N), the α-evaluating homomorphism is called countable evaluating. Let α be a cardinal number. Recall that a topological space X is called αLindelof if for each open cover U has a subcover V such that the cardinality of V is at most α. A lindelof space means a |N|-Lindelof space. The following theorem is given in [1] as one of the main results. Theorem 1. Let X be a completely regular Hausdorff space. Then X is Lindelof if and only if each countable evaluating homomorphism π on a ∗-algebra A on X is point evaluating. Received June 9, 2004; accepted June 30, 2004. Communicated by Bor-Luh Lin. 2000 Mathematics Subject Classification: Primary 54C35, 46E25.

Numerical data for the distribution of citations are examined for: (i) papers published in 1981 in journals which are catalogued by the Institute for Scientific Information (783,339 papers) and (ii) 20 years of publications in Physical Review D, vols. 11-50 (24,296 papers). A Zipf plot of the number of citations to a given paper versus its citation rank appears to be consistent with a power-law dependence for leading rank papers, with exponent close to -1/2. This, in turn, suggests that the number of papers with x citations, N(x), has a large-x power law decay N(x)~x^{-alpha}, with alpha approximately equal to 3., 4 pages, 4 figures, 1 table, revtex 2 column format. A small error in the description of one of the data sets corrected, no change in results

In this note we make a few simple observations regarding examples of D. Popa (cf. [3]) concerning weakly compact operators on C [0,1] and other related classes. Mathematics Subject Classification (2000): 46B28, 46B50, 46E15, 46G12. Key words: Weakly compact operators; compact operators; nuclear operators; absolutely summing operators. Quaestiones Mathematicae 26(2003), 53-56.

In this note we show how to test whether or not certain algebraic equations derived in the paper 'Fault Detection and Isolation for State Affine Systems', by H. Hammouri, M. Kinnaert, E.H. El Yaagoubi, are solvable and to describe a solution method. Test and solution rely upon elementary linear algebraic techniques.

In this paper we show that for a set X of real numbers the function space C p ( X ) has both a property introduced by Sakai in [Proc. Amer. Math. Soc. 104 (1988) 917–919] and a property introduced by Reznichenko (see [Topology Appl. 104 (2000) 181–190]) if and only if all finite powers of X have a property that was introduced by Gerlits and Nagy in [Topology Appl. 14 (1982) 151–161]. It follows that the minimal cardinality of a set of real numbers for which the function space does not have the properties of Sakai and Reznichenko is equal to the additivity of the ideal of first category sets of real numbers.

In this paper we show that non-context-free phenomena can be captured using only limited logical means. In particular, we show how to encode a Tree Adjoining Grammar [16] into a weakly equivalent monadic context-free tree grammar (MCFTG). By viewing MCFTG-rules as terms in a free Lawvere theory, we can translate a given MCFTG into a regular tree grammar. The latter is characterizable by both a tree automaton and a corresponding formula in monadic second-order (MSO) logic. The trees of the resulting regular tree language are then unpacked into the intended “linguistic” trees through a model-theoretic interpretation in the form of an MSO transduction based upon tree-walking automata. This two-step approach gives a logical as well as an operational description of the tree sets involved.

A graph is perfect if the size of the maximum clique equals the chromatic number in every induced subgraph. Chvatal defined a subclass of perfect graphs known as perfectly-orderable graphs, which have the property that a special ordering on the vertices leads to a trivial algorithm to find an optimum coloring. He also identified a subclass of the perfectly-orderable graphs, which he called brittle graphs, characterized by the property that every nonempty induced subgraph contains a vertex x such that x is either not an endpoint of a P 4 or is not in the middle of a P 4 . The brittle graphs were studied in a recent paper of Hoang and Khouzam [J. Graph Theory 12 (1988) 391-404] where the authors gave alternate characterizations one of which leads to an O( n 3 m ) time recognition algorithm for brittle graphs, where n is the number of vertices and m is the number of edges. In contrast, no polynomial-time recognition algorithms are known for either perfect graphs or perfectly-orderable graphs. We point out that an O( n 2 m ) time recognition algorithm for brittle graphs can be derived from Chvatal's definition, and we present a more complicated O( m 2 ) time recognition algorithm.

We count binary strings where the possible numbers of successive 0's and 1's are restricted.

Keywords: convergence theorem for Banach space valued qamartsq ; amarts convergence ; Radon-Nikodym property Reference GPRO-ARTICLE-1984-001 Record created on 2010-05-25, modified on 2017-08-24

Various proof methods have been proposed to solve the implication problem, i.e. proving that properties of the form: ∀( P → Q ) – where P and Q denote conjunctions of atoms – are logical consequences of logic programs. Nonetheless, it is commonplace to say that it is still quite a difficult problem. Besides, the advent of the constraint logic programming scheme constitutes not only a major step towards the achievement of efficient declarative logic programming systems but also a new field to explore. By recasting and simplifying the implication problem in the constraint logic programming (CLP) framework, we define a generic proof method for the implication problem, which we prove sound from the algebraic point of view. We present four examples using CLP( N ), CLP( RT ), CLP( Σ ∗ ) and RISC-CLP( R ). The logical point of view of the constraint logic programming scheme enables the automation of the proof method. At last, we prove the unsolvability of the implication problem, we point out the origins of the incompleteness of the proposed proof method and we identify two classes of programs for which we give a decision procedure for the implication problem.

In the paper of the title [1], a number of problems are posed. Ne­ gative solutions of two of them (Problems 2 and 3) are derived in a straightforward way from a paper of L. Gillman and the present author [2]. Motivation will not be supplied since it is given amply in [1], but enough definitions are given to keep the presentation reasonably self­ contained. 1. A Hausdorff space X is said to satisfy (Qm), where m is an in finite cardinal, if, whenever U and V are disjoint open subsets of X such that each is a union of the closures of less than m open subsets of X, then U and V have disjoint closures. In particular, a normal (Hausdorff) space X satisfies (Q*,) if and only if disjoint open F.-SUbsets of X have disjoint closures. (For, an open set that is the union of less than ~, closed sets is a fortiori an F.. Conversely if U is the union of countably many closed subsets Fo> then since X is normal, for each n there is an open set Un containing Fn whose closure is contained in U. Thus U is the union of the closures of the open sets Un.) In Prob­ lem 3 of [1], it is asked if every compact (HaUSdorff) space satisfying (Qm) for some m>~o is necessarily totally disconnected, and it is re­ marked that this is the case if the first axiom of countability is also as­ sumed. If X is a completely regular space, let C(X) denote the ring of all continuous real-valued functions on X, and let Z(f)= {x EX: f(x)=O}, let P(f)={xEX:f(x»O}, and let N(f)=P(-f). As usual, let (IX denote the Stone-Cech compactification of X. If every finitely generated ideal of C(X) is a principal ideal, then X is called an F-space. The fol­ lowing are equivalent. ( i) X is an F-space. ( ii) If f E C(X), then P(f) and NU) are completely separated [2, Theorem 2.3]. (iii) If f E C(X), then every bounded g E C(X-ZU» has an ex­ tension g E C(X) [2, Theorem 2.6]. A good supply of compact F-spaces is provided by the fact that if X is locally compact and ,,-compact, then {lX-X is an F-space [2, Theo­ rem 2.7].

In this paper we study bipartite quantum correlations using techniques from tracial noncommutative polynomial optimization. We construct a hierarchy of semidefinite programming lower bounds on the minimal entanglement dimension of a bipartite correlation. This hierarchy converges to a new parameter: the minimal average entanglement dimension, which measures the amount of entanglement needed to reproduce a quantum correlation when access to shared randomness is free. For synchronous correlations, we show a correspondence between the minimal entanglement dimension and the completely positive semidefinite rank of an associated matrix. We then study optimization over the set of synchronous correlations by investigating quantum graph parameters. We unify existing bounds on the quantum chromatic number and the quantum stability number by placing them in the framework of tracial optimization. In particular, we show that the projective packing number, the projective rank, and the tracial rank arise naturally when considering tracial analogues of the Lasserre hierarchy for the stability and chromatic number of a graph. We also introduce semidefinite programming hierarchies converging to the commuting quantum chromatic number and commuting quantum stability number., Comment: 26 pages

The purpose of this note is to present a lemma which will settle a question of completeness left open in Section 6 of the above mentioned paper [5]. We give two applications of the lemma, (i) by proving that, in addition to Herbach's results, also the standard $F$-test for $\sigma^2_{ab} = 0$ is a uniformly most powerful similar test, (ii) by pointing out that the standard form introduced in [5] together with our lemma provide convenient tools to prove that in a balanced model II design (with the usual normality assumptions) the standard estimates of variance components are minimum variance unbiased. This result is well known ([2], [3]) and it has in fact been pointed out by Graybill and Wortham [3] that a completeness argument may be used to demonstrate the minimum variance property of the usual estimators for the variance components. The present lemma shows that the estimators do indeed have the necessary completeness property. We will follow Herbach's notation throughout.

It is shown that the words ‘far weaker’ used four times by Singh and Ullafa [4] in describing their mixing condition in relation to ones of Robinson [1] for establishing the central limit theorem for nonparametric estimators, should in each case be replaced by theword ‘stronger,’ Singh and Ullah's [4] condition being equivalent to complete independence across time.

The World Health Organization is yet to realise the global aim of achieving future-free and eliminating the transmission of respiratory diseases such as H1N1, SARS and Ebola since the recent reemergence of Ebola in the Democratic Republic of Congo. In this paper, a Caputo fractional-order derivative is applied to a system of non-integer order differential equation to model the transmission dynamics of respiratory diseases. The nonnegative solutions of the system are obtained by using the Generalized Mean Value Theorem. The next generation matrix approach is used to obtain the basic reproduction number \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathcal {R}_{0} $$\end{document}R0. We discuss the stability of the disease-free equilibrium when \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {R}_{0} < 1$$\end{document}R0 1 $$\end{document}R0>1. A sensitivity analysis shows that \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {R}_{0} $$\end{document}R0 is most sensitive to the probability of the disease transmission rate. The results from the numerical simulations of optimal control strategies disclose that the utmost way of controlling or probably eradicating the transmission of respiratory diseases should be quarantining the exposed individuals, monitoring and treating infected people for a substantial period.

The unit-cell reduction described by Selling and used by Delone (Delaunay) is explained in a simple form., The unit-cell reduction described by Selling and used by Delone (whose early publications were under the spelling Delaunay) is explained in a simple form. The transformations needed to implement the reduction are listed. The simplicity of this reduction contrasts with the complexity of Niggli reduction.

In this note, we point out several gaps in Gurudwan and Sharma (Appl. Math. Comput. 217(15):6748-6754, 2011) and Yang (Appl. Math. Comput. 218(21):10367-10369, 2012) and give the main results under weaker conditions. MSC: 47H10; 47H09; 46B20

The acyclic number ?$a(G)$? of a graph ?$G$? is the maximum order of an induced forest in ?$G$?. The purpose of this short paper is to propose a conjecture that ?$a(G)\geq \left( 1-\frac{3}{2g}\right)n$? holds for every planar graph ?$G$? of girth ?$g$? and order ?$n$?, which captures three known conjectures on the topic. In support of this conjecture, we prove a weaker result that ?$a(G)\geq \left( 1-\frac{3}{g} \right)n$? holds. In addition, we give a construction showing that the constant ?$\frac{3}{2}$? from the conjecture cannot be decreased. Aciklično število ?$a(G)$? grafa ?$G$? je maksimalni red induciranega gozda v ?$G$?. Namen tega kratkega članka je predstavitev domneve, da ?$a(G)\geq \left( 1-\frac{3}{2g}\right)n$? velja za vsak ravninski graf ?$G$? ožine ?$g$? in reda ?$n$?, ki obsega tri znane hipoteze s tega področja. V podporo tej domnevi dokažemo šibkejši rezultat, da velja ?$a(G)\geq \left( 1-\frac{3}{g} \right)n$?. Poleg tega podamo konstrukcijo, ki pokaže, da konstante ?$\frac{3}{2}$? iz te hipoteze ni mogoče zmanjšati.

The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$G = (V, E)$$\end{document}G=(V,E) and non-negative distances d for every edge, the TSP asks for a shortest tour through all vertices with respect to the distances d. The method of choice for solving the TSP to optimality is a branch and cut approach. Usually the integrality constraints are relaxed first and all separation processes to identify violated inequalities are done on fractional solutions. In our approach we try to exploit the impressive performance of current ILP-solvers and work only with integer solutions without ever interfering with fractional solutions. We stick to a very simple ILP-model and relax the subtour elimination constraints only. The resulting problem is solved to integer optimality, violated constraints (which are trivial to find) are added and the process is repeated until a feasible solution is found. In order to speed up the algorithm we pursue several attempts to find as many relevant subtours as possible. These attempts are based on the clustering of vertices with additional insights gained from empirical observations and random graph theory. Computational results are performed on test instances taken from the TSPLIB95 and on random Euclidean graphs.

Knowledge regarding the 3D structure of a protein provides useful information about the protein’s functional properties. Particularly, structural similarity between proteins can be used as a good predictor of functional similarity. One method that uses the 3D geometrical structure of proteins in order to compare them is the similarity value (SV). In this paper, we introduce a new definition of the SV measure for comparing two proteins. To this end, we consider the mass of the protein’s atoms and concentrate on the number of protein’s atoms to be compared. This defines a new measure, called the weighted similarity value (WSV), adding physical properties to geometrical properties. We also show that our results are in good agreement with the results obtained by TM-SCORE and DALILITE. WSV can be of use in protein classification and in drug discovery.

The central idea observes a recursive mapping of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}n-body intramolecular interactions to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$(n+1)$$\end{document}(n+1)-body terms that is consistent with the molecular topology. Iterative application of the line graph transformation is identified as a natural and elegant tool to accomplish the recursion. The procedure readily generalizes to arbitrary \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}n-body potentials. In particular, the method yields a complete characterization of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$4$$\end{document}4-body interactions. The hierarchical structure of atomic index lists for each interaction order \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}n is compactly expressed as a directed acyclic graph. A pseudo-code description of the generating algorithm is given. With suitable data structures (e.g., edge lists or adjacency matrices), automatic enumeration and indexing of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n$$\end{document}n-body interactions can be implemented straightforwardly to handle large bio-molecular systems. Explicit examples are discussed, including a chemically relevant effective potential model of taurocholate bile salt.

This paper derives scaling laws of the sum rate throughput for MIMO Gaussian broadcast channels using time-sharing to the strongest user, dirty paper coding (DPC), and beamforming when the number of users (receivers) n is large. Assuming a fixed total average transmit power, we show that for a system with M transmit antennas and users equipped with N antennas, the sum rate scales like M log log nTV for DPC and beamforming when M is fixed and for any N (either growing to infinity or not). On the other hand, when both M and TV are fixed, the sum rate of time-sharing to the strongest user scales like min(M,N) log log n. It is also shown that if M grows as logn, the sum rate of DPC and beamforming will grow linearly in M, but with different constant multiplicative factors. In this region, the sum rate capacity of time-sharing scales like N log log n.

This paper discusses the development of graphical user interfaces (GUIs) to illustrate sampling from a trinomial distribution by the natural extension of Galton's Quincunx to three dimensions.

The triangle removal lemma states that a simple graph with o(n^3) triangles can be made triangle-free by removing o(n^2) edges. It is natural to ask if this widely used result can be extended to multi-graphs (or equivalently, weighted graphs). In this short paper we rule out the possibility of such an extension by showing that there are multi-graphs with only n^{2+o(1)} triangles that are still far from being triangle-free. On the other hand, we show that for some g(n)=\omega(1), if a multi-graph (or weighted graph) has only g(n)n^2 triangles then it must be close to being triangle-free. The proof relies on variants of the Ruzsa-Szemer\'edi theorem.

In this paper we give a GAP program for computing the Szeged and the PI indices of any graph. Also we compute the Szeged and PI indices of VC(5)C(7) [ p,q] and HC(5)C(7) [ p,q] nanotubes by this program.

In this letter, we derive the scaling laws of the sum rate for fading multiple-input multiple-output Gaussian broadcast channels using time sharing to the strongest user, dirty-paper coding (DPC), and beamforming, when the number of users (receivers) n is large. Throughout the letter, we assume a fix average transmit power and consider a block-fading Rayleigh channel. First, we show that for a system with M transmit antennas and users equipped with N antennas, the sum rate scales like M log logn N for DPC, and beamforming when M is fixed and for any N (either growing to infinity or not). On the other hand, when both M and N are fixed, the sum rate of time sharing to the strongest user scales like min(M,N)log log n. Therefore, the asymptotic gain of DPC over time sharing for the sum rate is (M/min(M,N)) when M and N are fixed. It is also shown that if M grows as logn, the sum rate of DPC and beamforming will grow linearly in M, but with different constant multiplicative factors. In this region, the sum-rate capacity of time-sharing scales like N log log n.