Crop rotation limits Canada thistle, but not Couch grass or annual weeds

Direct weed control of annual as well as perennial weeds was necessary to reduce the amount of weeds in organic crop rotation experiments at three locations in Denmark. For Canada thistle, however, the rotation was the most important controlling factor: the rotation with grass-clover had less thistle biomass than the one without

On conformal Jordan cells of finite and infinite rank

This work concerns in part the construction of conformal Jordan cells of infinite rank and their reductions to conformal Jordan cells of finite rank. It is also discussed how a procedure similar to Lie algebra contractions may reduce a conformal Jordan cell of finite rank to one of lower rank. A conformal Jordan cell of rank one corresponds to a primary field. This offers a picture in which any finite conformal Jordan cell of a given conformal weight may be obtained from a universal covering cell of the same weight but infinite rank.Comment: 9 pages, LaTeX, v2: typo corrected, comments added, version to be publishe

Higher su(N) tensor products

We extend our recent results on ordinary su(N) tensor product multiplicities to higher su(N) tensor products. Particular emphasis is put on four-point couplings where the tensor product of four highest weight modules is considered. The number of times the singlet occurs in the decomposition is the associated multiplicity. In this framework, ordinary tensor products correspond to three-point couplings. As in that case, the four-point multiplicity may be expressed explicitly as a multiple sum measuring the discretised volume of a convex polytope. This description extends to higher-point couplings as well. We also address the problem of determining when a higher-point coupling exists, i.e., when the associated multiplicity is non-vanishing. The solution is a set of inequalities in the Dynkin labels.Comment: 17 pages, LaTe

Når man skal vælge vårbygsort

Index for konkurrence mod ukrudt er vigtigt for valget af vårbygsorter

A Tight Lower Bound to the Outage Probability of Discrete-Input Block-Fading Channels

In this correspondence, we propose a tight lower bound to the outage probability of discrete-input Nakagami-m block-fading channels. The approach permits an efficient method for numerical evaluation of the bound, providing an additional tool for system design. The optimal rate-diversity trade-off for the Nakagami-m block-fading channel is also derived and a tight upper bound is obtained for the optimal coding gain constant.Comment: 22 pages, 4 figures. This work has been accepted for IEEE Transactions on Information Theory and has been presented in part at the 2007 IEEE International Symposium on Information Theory, Nice, France, June 200

Properties of the mechanosensitive channel MscS pore revealed by tryptophan scanning mutagenesis

Funding This work was supported by a Wellcome Trust Programme grant [092552/A/10/Z awarded to I.R.B., S.M., J. H. Naismith (University of St Andrews, St Andrews, U.K.), and S. J. Conway (University of Oxford, Oxford, U.K.)] (T.R. and M.D.E.), by a BBSRC grant (A.R.) [BB/H017917/1 awarded to I.R.B., J. H. Naismith, and O. Schiemann (University of St Andrews)], by a Leverhulme Emeritus Fellowship (EM-2012-060\2), and by a CEMI grant to I.R.B. from the California Institute of Technology. The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007-2013 FP7/2007-2011) under Grant PITN-GA-2011-289384 (FP7-PEOPLE-2011-ITN NICHE) (H.G.) (awarded to S.M.).Peer reviewedPublisher PD