Program for calculating SU(4) Clebsch-Gordan coefficients

The SU(4) Clebsch-Gordan coefficients of the decomposition {Na}⊗{Nb}→{N} are calculated for arbitrary irreducible representations {Na}, {Nb} and {N}. They are efficiently computed for the group chain SU(4) ⊃ SU(3)×U(1) ⊃ SU(2)×U(1) ⊃ U(1) using the eigenfunction method along with recurrence relations.

Program summary

Program title: CGSU4Catalogue identifier: AEBL_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEBL_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 2847No. of bytes in distributed program, including test data, etc.: 23 794Distribution format: tar.gzProgramming language: Fortran 95Computer: Personal computerOperating system: Linux, WindowsRAM: 2 MBClassification: 4.2Subprograms used: ACRM_v1_0; Title: SU(3) [1]Nature of problem: The SU(4) Clebsch-Gordan coefficients according to the group chain SU(4) ⊃ SU(3) × U(1) ⊃ SU(2) × U(1) ⊃ U(1) are calculated for arbitrary couplings.Solution method: The eigenfunctions method in combination with recurrence relations is used to generate tables of the SU(4) ⊃ SU(3) × U(1) isoscalar factors for the decomposition {Na}⊗{Nb}→γ{N} with the multiplicity label γ. The SU(4) Clebsch-Gordan coefficients are then composed by these isoscalar factors and SU(3) Clebsch-Gordan coefficients according to the Racah factorization lemma.Restrictions: The dimensions of the involved representations are limited by the size of the arrays defined in the program.Additional comments: If many Clebsch-Gordan coefficients are needed for the same decomposition {Na}⊗{Nb}→γ{N}, the running time is significantly reduced if the table of isoscalar factors is calculated only once. The SU(3) code [1] and the code for eigen, a matrix diagonalization program (IBM scientific subroutine package) are included in the CGSU4 code package.Running time: The running time sensitively depends on the specific Clebsch-Gordan decomposition and the dimensions of the involved representations, varying from parts of a second to a minute.References:[1] Y. Akiyama, J.P. Draayer, Comput. Phys. Comm. 5 (1973) 405.     

Slavnov-Taylor1.0: A Mathematica package for computation in BRST formalism

Slavnov-Taylor is a Mathematica package which allows us to perform automatic symbolic computation in BRST formalism. This article serves as a self-contained guide to prospective users, and indicates the conventions and approximations used.

Program summary

Title of program:Slavnov-TaylorCatalogue identifier:ADSSProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADSSProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandProgramming Language: Mathematica 4.0Platform: Any platform supporting Mathematica 4.0Computers tested on: Pentium PCOperating systems under which the program has been tested: LinuxMemory required to execute: Minimal: 1.254.784 bytes, Standard: 1.281.248 bytesNo. of bytes in distributed program, including test data, etc.: 8368 bytesDistribution format: tar gzip fileKeywords: Slavnov-Taylor, BRST, MathematicaNature of physical problem: Symbolic computation in the Slavnov-Taylor formalism for gauge theories in 4-dimensional space-time based on a semi-simple compact Lie group for a general BRS transformations.Restrictions on the complexity of the problem: Only matter in the adjoint is allowed.Typical running time: less than one second     

GeM software package for computation of symmetries and conservation laws of differential equations

We present a recently developed Maple-based “GeM” software package for automated symmetry and conservation law analysis of systems of partial and ordinary differential equations (DE). The package contains a collection of powerful easy-to-use routines for mathematicians and applied researchers. A standard program that employs “GeM” routines for symmetry, adjoint symmetry or conservation law analysis of any given DE system occupies several lines of Maple code, and produces output in the canonical form. Classification of symmetries and conservation laws with respect to constitutive functions and parameters present in the given DE system is implemented. The “GeM” package is being successfully used in ongoing research. Run examples include classical and new results.

Program summary

Title of program: GeMCatalogue identifier: ADYK_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYK_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions: noneComputers: PC-compatible running Maple on MS Windows or Linux; SUN systems running Maple for Unix on OS SolarisOperating systems under which the program has been tested: Windows 2000, Windows XP, Linux, SolarisProgramming language used: Maple 9.5Memory required to execute with typical data: below 100 MegabytesNo. of lines in distributed program, including test data, etc.: 4939No. of bytes in distributed program, including test data, etc.: 166 906Distribution format: tar.gzNature of physical problem: Any physical model containing linear or nonlinear partial or ordinary differential equations.Method of solution: Symbolic computation of Lie, higher and approximate symmetries by Lie's algorithm. Symbolic computation of conservation laws and adjoint symmetries by using multipliers and Euler operator properties. High performance is achieved by using an efficient representation of the system under consideration and resulting symmetry/conservation law determining equations: all dependent variables and derivatives are represented as symbols rather than functions or expressions.Restrictions on the complexity of the problem: The GeM module routines are normally able to handle ODE/PDE systems of high orders (up to order seven and possibly higher), depending on the nature of the problem. Classification of symmetries/conservation laws with respect to one or more arbitrary constitutive functions of one or two arguments is normally accomplished successfully.Typical running time: 1-20 seconds for problems that do not involve classification; 5-1000 seconds for problems that involve classification, depending on complexity.     

TaylUR 3, a multivariate arbitrary-order automatic differentiation package for Fortran 95

This new version of TaylUR is based on a completely new core, which now is able to compute the numerical values of all of a complex-valued function's partial derivatives up to an arbitrary order, including mixed partial derivatives.

New version program summary

Program title: TaylURCatalogue identifier: ADXR_v3_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXR_v3_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GPLv2No. of lines in distributed program, including test data, etc.: 6750No. of bytes in distributed program, including test data, etc.: 19 162Distribution format: tar.gzProgramming language: Fortran 95Computer: Any computer with a conforming Fortran 95 compilerOperating system: Any system with a conforming Fortran 95 compilerClassification: 4.12, 4.14Catalogue identifier of previous version: ADXR_v2_0Journal reference of previous version: Comput. Phys. Comm. 176 (2007) 710Does the new version supersede the previous version?: YesNature of problem: Problems that require potentially high orders of partial derivatives with respect to several variables or derivatives of complex-valued functions, such as e.g. momentum or mass expansions of Feynman diagrams in perturbative QFT, and which previous versions of this TaylUR [1,2] cannot handle due to their lack of support for mixed partial derivatives.Solution method: Arithmetic operators and Fortran intrinsics are overloaded to act correctly on objects of a defined type taylor, which encodes a function along with its first few partial derivatives with respect to the user-defined independent variables. Derivatives of products and composite functions are computed using multivariate forms [3] of Leibniz's rule where ν=(ν₁,…,νd), , , Dνf=^∂|ν|f/(ν₁^∂x₁?νd^∂xd), and μ<ν iff either |μ|<|ν| or |μ|=|ν|,μ₁=ν₁,…,μk=νk,μk+1<νk+1 for some k∈{0,…,d−1}, and of Fàa di Bruno's formula where the sum is over , . An indexed storage system is used to store the higher-order derivative tensors in a one-dimensional array. The relevant indices (k₁,…,ks;λ₁,…,λs) and the weights occurring in the sums in Leibniz's and Fàa di Bruno's formula are precomputed at startup and stored in static arrays for later use.Reasons for new version: The earlier version lacked support for mixed partial derivatives, but a number of projects of interest required them.Summary of revisions: The internal representation of a taylor object has changed to a one-dimensional array which contains the partial derivatives in ascending order, and in lexicographic order of the corresponding multiindex within the same order. The necessary mappings between multiindices and indices into the taylor objects' internal array are computed at startup. To support the change to a genuinely multivariate taylor type, the DERIVATIVE function is now implemented via an interface that accepts both the older format derivative(f,mu,n) and also a new format derivative(f,mu(:))=Dμf that allows access to mixed partial derivatives. Another related extension to the functionality of the module is the HESSIAN function that returns the Hessian matrix of second derivatives of its argument. Since the calculation of all mixed partial derivatives can be very costly, and in many cases only some subset is actually needed, a masking facility has been added. Calling the subroutine DEACTIVATE_DERIVATIVE with a multiindex as an argument will deactivate the calculation of the partial derivative belonging to that multiindex, and of all partial derivatives it can feed into. Similarly, calling the subroutine ACTIVATE_DERIVATIVE will activate the calculation of the partial derivative belonging to its argument, and of all partial derivatives that can feed into it. Moreover, it is possible to turn off the computation of mixed derivatives altogether by setting Diagonal_taylors to .TRUE.. It should be noted that any change of Diagonal_taylors or Taylor_order invalidates all existing taylor objects. To aid the better integration of TaylUR into the HPSrc library [4], routines SET_DERIVATIVE and SET_ALL_DERIVATIVES are provided as a means of manually constructing a taylor object with given derivatives.Restrictions: Memory and CPU time constraints may restrict the number of variables and Taylor expansion order that can be achieved. Loss of numerical accuracy due to cancellation may become an issue at very high orders.Unusual features: These are the same as in previous versions, but are enumerated again here for clarity. The complex conjugation operation assumes all independent variables to be real. The functions REAL and AIMAG do not convert to real type, but return a result of type taylor (with the real/imaginary part of each derivative taken) instead. The user-defined functions VALUE, REALVALUE and IMAGVALUE, which return the value of a taylor object as a complex number, and the real and imaginary part of this value, respectively, as a real number are also provided. Fortran 95 intrinsics that are defined only for arguments of real type (ACOS, AINT, ANINT, ASIN, ATAN, ATAN2, CEILING, DIM, FLOOR, INT, LOG10, MAX, MAXLOC, MAXVAL, MIN, MINLOC, MINVAL, MOD, MODULO, NINT, SIGN) will silently take the real part of taylor-valued arguments unless the module variable Real_args_warn is set to .TRUE., in which case they will return a quiet NaN value (if supported by the compiler) when called with a taylor argument whose imaginary part exceeds the module variable Real_args_tol. In those cases where the derivative of a function becomes undefined at certain points (as for ABS, AINT, ANINT, MAX, MIN, MOD, and MODULO), while the value is well defined, the derivative fields will be filled with quiet NaN values (if supported by the compiler).Additional comments: This version of TaylUR is released under the second version of the GNU General Public License (GPLv2). Therefore anyone is free to use or modify the code for their own calculations. As part of the licensing, it is requested that any publications including results from the use of TaylUR or any modification derived from it cite Refs. [1,2] as well as this paper. Finally, users are also requested to communicate to the author details of such publications, as well as of any bugs found or of required or useful modifications made or desired by them.Running time: The running time of TaylUR operations grows rapidly with both the number of variables and the Taylor expansion order. Judicious use of the masking facility to drop unneeded higher derivatives can lead to significant accelerations, as can activation of the Diagonal_taylors variable whenever mixed partial derivatives are not needed.Acknowledgments: The author thanks Alistair Hart for helpful comments and suggestions. This work is supported by the Deutsche Forschungsgemeinschaft in the SFB/TR 09.References:

[1]

G.M. von Hippel, TaylUR, an arbitrary-order diagonal automatic differentiation package for Fortran 95, Comput. Phys. Comm. 174 (2006) 569.

[2]

G.M. von Hippel, New version announcement for TaylUR, an arbitrary-order diagonal automatic differentiation package for Fortran 95, Comput. Phys. Comm. 176 (2007) 710.

[3]

G.M. Constantine, T.H. Savits, A multivariate Faa di Bruno formula with applications, Trans. Amer. Math. Soc. 348 (2) (1996) 503.

[4]

A. Hart, G.M. von Hippel, R.R. Horgan, E.H. Müller, Automated generation of lattice QCD Feynman rules, Comput. Phys. Comm. 180 (2009) 2698, doi:10.1016/j.cpc.2009.04.021, arXiv:0904.0375.

     

HypExp, a Mathematica package for expanding hypergeometric functions around integer-valued parameters

We present the Mathematica package HypExp which allows to expand hypergeometric functions around integer parameters to arbitrary order. At this, we apply two methods, the first one being based on an integral representation, the second one on the nested sums approach. The expansion works for both symbolic argument z and unit argument. We also implemented new classes of integrals that appear in the first method and that are, in part, yet unknown to Mathematica.

Program summary

Title of program:HypExpCatalogue identifier:ADXF_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXF_v1_0Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicence:noneComputers:Computers running Mathematica under Linux or WindowsOperating system:Linux, WindowsProgram language:MathematicaNo. of bytes in distributed program, including test data, etc.:739 410No. of lines in distributed program, including test data, etc.:89 747Distribution format:tar.gzOther package needed:the package HPL, included in the distributionExternal file required:noneNature of the physical problem:Expansion of hypergeometric functions around integer-valued parameters. These are needed in the context of dimensional regularization for loop and phase space integrals.Method of solution:Algebraic manipulation of nested sums and integral representation.Restrictions on complexity of the problem:Limited by the memory availableTypical running time:Strongly depending on the problem and the availability of libraries.     

eett6f v. 1.0: A program for top quark pair production and decay into 6 fermions at linear colliders

The first version of a computer program eett6f for calculating cross sections of e⁺e⁻→6 fermions processes relevant for a -pair production and decay at centre of mass energies typical for linear colliders is presented. eett6f v. 1.0 allows for calculating both the total and differential cross sections at tree level of the Standard Model (SM). The program can be used as the Monte Carlo generator of unweighted events as well.     

HiggsBounds: Confronting arbitrary Higgs sectors with exclusion bounds from LEP and the Tevatron

HiggsBounds is a computer code that tests theoretical predictions of models with arbitrary Higgs sectors against the exclusion bounds obtained from the Higgs searches at LEP and the Tevatron. The included experimental information comprises exclusion bounds at 95% C.L. on topological cross sections. In order to determine which search topology has the highest exclusion power, the program also includes, for each topology, information from the experiments on the expected exclusion bound, which would have been observed in case of a pure background distribution. Using the predictions of the desired model provided by the user as input, HiggsBounds determines the most sensitive channel and tests whether the considered parameter point is excluded at the 95% C.L. HiggsBounds is available as a Fortran 77 and Fortran 90 code. The code can be invoked as a command line version, a subroutine version and an online version. Examples of exclusion bounds obtained with HiggsBounds are discussed for the Standard Model, for a model with a fourth generation of quarks and leptons and for the Minimal Supersymmetric Standard Model with and without CP-violation. The experimental information on the exclusion bounds currently implemented in HiggsBounds will be updated as new results from the Higgs searches become available.

Program summary

Program title: HiggsBoundsCatalogue identifier: AEFF_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEFF_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 55 733No. of bytes in distributed program, including test data, etc.: 1 986 213Distribution format: tar.gzProgramming language: Fortran 77, Fortran 90 (two code versions are offered).Computer: HiggsBounds can be built with any compatible Fortran 77 or Fortran 90 compiler. The program has been tested on x86 CPUs running under Linux (Ubuntu 8.04) and with the following compilers: The Portland Group Inc. Fortran compilers (pgf77, pgf90), the GNU project Fortran compilers (g77, gfortran).Operating system: LinuxRAM: minimum of about 6000 kbytes (dependent on the code version)Classification: 11.1External routines: HiggsBounds requires no external routines/libraries. Some sample programs in the distribution require the programs FeynHiggs 2.6.x or CPsuperH2 to be installed (see “Subprograms used”).Subprograms used:

Cat Id	Title	Reference
ADKT_v2_0	FeynHiggsv2.6.5	CPC 180(2009)1426
ADSR_v2_0	CPsuperH2.0	CPC 180(2009)312

Full-size table

     

yambo: An ab initio tool for excited state calculations

yambo is an ab initio code for calculating quasiparticle energies and optical properties of electronic systems within the framework of many-body perturbation theory and time-dependent density functional theory. Quasiparticle energies are calculated within the GW approximation for the self-energy. Optical properties are evaluated either by solving the Bethe-Salpeter equation or by using the adiabatic local density approximation. yambo is a plane-wave code that, although particularly suited for calculations of periodic bulk systems, has been applied to a large variety of physical systems. yambo relies on efficient numerical techniques devised to treat systems with reduced dimensionality, or with a large number of degrees of freedom. The code has a user-friendly command-line based interface, flexible I/O procedures and is interfaced to several publicly available density functional ground-state codes.

Program summary

Program title:yamboCatalogue identifier: AEDH_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEDH_v1_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU General Public Licence v2.0No. of lines in distributed program, including test data, etc.: 149 265No. of bytes in distributed program, including test data, etc.: 2 848 169Distribution format: tar.gzProgramming language: Fortran 95, CComputer: any computer architecture, running any flavor of UNIXOperating system: GNU/Linux, AIX, Irix, OS/XHas the code been vectorised or parallelized?: YesRAM: 10-1000 MbytesClassification: 7.3, 4.4, 7.2External routines:

•

BLAS (http://www.netlib.org/blas/)

•

LAPACK (http://www.netlib.org/lapack/)

•

MPI (http://www-unix.mcs.anl.gov/mpi/) is optional.

•

BLACS (http://www.netlib.org/scalapack/) is optional.

•

SCALAPACK (http://www.netlib.org/scalapack/) is optional.

•

FFTW (http://www.fftw.org/) is optional.

•

netCDF (http://www.unidata.ucar.edu/software/netcdf/) is optional.

Nature of problem: Calculation of excited state properties (quasiparticles, excitons, plasmons) from first principles.Solution method: Many body perturbation theory (Dyson equation, Bethe Salpeter equation) and time-dependent density functional theory. Quasiparticle approximation. Plasmon-pole model for the dielectric screening. Plane wave basis set with norm conserving pseudopotentials.Unusual features: During execution, yambo supplies estimates of the elapsed and remaining time for completion of each runlevel. Very friendly shell-based user-interface.Additional comments:yambo was known as “SELF” prior to GPL release. It belongs to the suite of codes maintained and used by the European Theoretical Spectroscopy Facility (ETSF) [1].Running time: The typical yambo running time can range from a few minutes to some days depending on the chosen level of approximation, and on the property and physical system under study.References:[1] The European Theoretical Spectroscopy Facility, http://www.etsf.eu.     

FLY. A parallel tree N-body code for cosmological simulations

FLY is a parallel treecode which makes heavy use of the one-sided communication paradigm to handle the management of the tree structure. In its public version the code implements the equations for cosmological evolution, and can be run for different cosmological models.This reference guide describes the actual implementation of the algorithms of the public version of FLY, and suggests how to modify them to implement other types of equations (for instance, the Newtonian ones).

Program summary

Title of program:FLYCatalogue identifier: ADSCProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADSCProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputer for which the program is designed and others on which it has been tested: Cray T3E, Sgi Origin 3000, IBM SPOperating systems or monitors under which the program has been tested: Unicos 2.0.5.40, Irix 6.5.14, Aix 4.3.3Programming language used: Fortran 90, CMemory required to execute with typical data: about 100 Mwords with 2 million-particlesNumber of bits in a word: 32Number of processors used: parallel program. The user can select the number of processors ?1Has the code been vectorized or parallelized?: parallelizedNumber of bytes in distributed program, including test data, etc.: 4 615 604Distribution format: tar gzip fileKeywords: Parallel tree N-body code for cosmological simulationsNature of physical problem:FLY is a parallel collisionless N-body code for the calculation of the gravitational force.Method of solution: It is based on the hierarchical oct-tree domain decomposition introduced by Barnes and Hut (1986).Restrictions on the complexity of the program: The program uses the leapfrog integrator schema, but could be changed by the user.Typical running time: 50 seconds for each time-step, running a 2-million-particles simulation on an Sgi Origin 3800 system with 8 processors having 512 Mbytes RAM for each processor.Unusual features of the program:FLY uses the one-side communications libraries: the SHMEM library on the Cray T3E system and Sgi Origin system, and the LAPI library on IBM SP system     

SuperIso v3.0, flavor physics observables calculations: extension to NMSSM

SuperIso v3.0 is a public program for evaluation of flavor physics observables in the minimal supersymmetric extension of the Standard Model (MSSM) and the next to minimal supersymmetric extension of the Standard Model (NMSSM). SuperIso v3.0 incorporates many flavor observables such as the inclusive branching ratio of B→Xsγ, the isospin asymmetry of B→K^∗γ, the branching ratio of Bs→μ⁺μ⁻, the branching ratio of B→τντ, the branching ratio of B→Dτντ, the branching ratio of K→μνμ and the branching ratios of Ds→τντ and Ds→μνμ. The calculation of the branching ratio of B→Xsγ includes NNLO Standard Model contributions. The program also computes the muon anomalous magnetic moment (g−2). Seven sample models are included in the package, namely mSUGRA, NUHM, AMSB and GMSB for the MSSM, and CNMSSM, NGMSB and NNUHM for the NMSSM. SuperIso uses a SUSY Les Houches Accord file (SLHA1 or SLHA2) as input, which can be either generated automatically by the program via a call to external spectrum calculators (SOFTSUSY, ISAJET or NMSSMTools), or provided by the user.

New version program summary

Program title:SuperIso v3.0Catalogue identifier: AEAN_v3_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEAN_v3_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: GNU General Public LicenceNo. of lines in distributed program, including test data, etc.: 6869No. of bytes in distributed program, including test data, etc.: 42 627Distribution format: tar.gzProgramming language: C (C99 Standard compliant)Computer: 32- or 64-bit PC, MacOperating system: Linux, MacOSRAM: less than 1 MBClassification: 11.6External routines: ISASUGRA/ISAJET, SOFTSUSY and/or NMSSMToolsDoes the new version supersede the previous version?: YesNature of problem: Calculation of flavor physics observables as well as the muon anomalous magnetic moment in the Minimal Supersymmetric Standard Model with minimal flavor violation and in the Next to Minimal Supersymmetric Standard Model, in order to derive constraints on the supersymmetric parameter spaces.Solution method:SuperIso uses a SUSY Les Houches Accord (SLHA1 or SLHA2) file, which can be either generated automatically via a call to SOFTSUSY, ISAJET or NMSSMTools, or provided by the user. This file contains the masses, mixings and couplings of the supersymmetric particles. SuperIso then computes the most constraining flavor physics observables and the muon (g−2). SuperIso is able to perform the calculations in different supersymmetry breaking scenarios, such as mSUGRA, NUHM, AMSB and GMSB, as well as constrained NMSSM scenarios such as CNMSSM, NNUHM and NGMSB.Reasons for new version:SuperIso has been extended to the next to minimal supersymmetric extension of the Standard Model (NMSSM). The implemented routines are therefore extensively modified.Summary of revisions:

•

Improvement of the SLHA2 reader.

•

Replacement of “float” variables by “double”.

•

Implementation of an interface with NMSSMTools.

•

Extension of the calculation of flavor observables as well as the muon anomalous magnetic moment to NMSSM.

•

Addition of three different NMSSM scenarios: CNMSSM, NGMSB and NNUHM.

•

Three sample main programs have been added: cnmssm.c, ngmsb.c and nnuhm.c. Additional instructions to use them are given when running them without arguments.

Unusual features: The code is very flexible, and new observables can be added easily.Running time: Less than 1 sec     

micrOMEGAs: Version 1.3

We present the latest version of micrOMEGAs, a code that calculates the relic density of the lightest supersymmetric particle (LSP) in the minimal supersymmetric standard model (MSSM). All tree-level processes for the annihilation of the LSP are included as well as all possible coannihilation processes with neutralinos, charginos, sleptons, squarks and gluinos. The cross-sections extracted from CalcHEP are calculated exactly using loop-corrected masses and mixings as specified in the SUSY Les Houches Accord. Relativistic formulae for the thermal average are used and care is taken to handle poles and thresholds by adopting specific integration routines. The input parameters can be either the soft SUSY parameters in a general MSSM or the parameters of a SUGRA model specified at the GUT scale. In the latter case, a link with Suspect, SOFTSUSY, Spheno and Isajet allows one to calculate the supersymmetric spectrum, Higgs masses, as well as mixing matrices. Higher-order corrections to Higgs couplings to quark pairs including QCD as well as some SUSY corrections (Δmb) are implemented. Routines calculating μ(g−2), b→sγ and Bs→μ⁺μ⁻ are also included. In particular the b→sγ routine includes an improved NLO for the SM and the charged Higgs while the SUSY large tanβ effects beyond leading-order are included. This new version also provides cross-sections for any 2→2 process as well as partial decay widths for two-body final states in the MSSM allowing for easy simulation at colliders.

Program summary

Program title:micrOMEGAs1.3Catalogue identifier:ADQR_v1_3Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADQR_v1_3Program obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandLicensing provisions:noneComputer:PC, Alpha, Silicon graphics, SunProgramming language:C and FortranOperating system:UNIX (Linux, OSF1, IRIX64, SunOS)RAM:20 MB depending on the number of processes requiredNo of lines in distributed program, including test data, etc.:78 314No. of bytes in distributed program, including test data, etc.:703 112Distribution format:tar.gzNumber of processors used:1External routines/libraries:Library of Fortran functions, for example, -lg2c (platform dependent)Catalogue identifier of previous version:ADQRJournal reference of previous version:Comput. Phys. Comm. 149 (2002) 103Does the new version supersede the previous version?:yesNature of problem:Calculation of the relic density of the lightest supersymmetric particle in the MSSM.Solution method:In numerically solving the evolution equation for the density of dark matter, relativistic formulae for the thermal average are used. All tree-level processes for annihilation and coannihilation of SUSY particles are included. The cross-sections for all processes are calculated exactly with CalcHEP. Higher-order corrections to Higgs masses and Higgs couplings to quark pairs including QCD as well as some SUSY corrections are implemented. The input parameters can be either the soft SUSY parameters in a general MSSM or the parameters of a SUGRA model specified at the GUT scale. In the latter case, a link with Suspect, SOFTSUSY, Spheno and Isajet allows to calculate the supersymmetric spectrum, Higgs masses, as well as mixing matrices.Reasons for the new version:This new version contains a more accurate calculation of the relic density of dark matter as well as many new features both for interface with codes that calculate the supersymmetric spectrum as well as for computation of cross-sections and decays relevant for collider physics.Summary of revisions:

•

Interface with the main codes to calculate the supersymmetric spectrum: Suspect, Isajet, Spheno and SOFTSUSY in models defined at some high scale.

•

Includes loop corrected sparticle masses and mixing matrices.

•

Includes loop-corrected Higgs masses and widths. QCD corrections to the Higgs couplings to fermion pairs are included as well as, via an effective Lagrangian, the Δmb correction relevant at large tanβ.

•

Provides exact numerical solution of the Boltzmann equation by Runge-Kutta.

•

Outputs the relative contribution of each channel to 1/Ω.

•

Computes cross-sections for any 2→2 process at the parton level.

•

Calculates decay widths for all particles at tree-level including all 1→2 decay modes.

•

Calculates constraints on MSSM: Bs→μ⁺μ⁻ and NLO corrections to b→sγ.

Unusual features:Depending on the parameters of the model, the program generates additional new code for matrix elements, compiles it and loads it dynamically.Running time:0.2 sec.     

MC-TESTER: a universal tool for comparisons of Monte Carlo predictions for particle decays in high energy physics

Theoretical predictions in high energy physics are routinely provided in the form of Monte Carlo generators. Comparisons of predictions from different programs and/or different initialization set-ups are often necessary. MC-TESTER can be used for such tests of decays of intermediate states (particles or resonances) in a semi-automated way. Our test consists of two steps. Different Monte Carlo programs are run; events with decays of a chosen particle are searched, decay trees are analyzed and appropriate information is stored. Then, at the analysis step, a list of all found decay modes is defined and branching ratios are calculated for both runs. Histograms of all scalar Lorentz-invariant masses constructed from the decay products are plotted and compared for each decay mode found in both runs. For each plot a measure of the difference of the distributions is calculated and its maximal value over all histograms for each decay channel is printed in a summary table. As an example of MC-TESTER application, we include a test with the τ lepton decay Monte Carlo generators, TAUOLA and PYTHIA. The HEPEVT (or LUJETS) common block is used as exclusive source of information on the generated events.

Program summary

Title of the program:MC-TESTER, version 1.1Catalogue identifier: ADSMProgram summary URL:http://cpc.cs.qub.ac.uk/summaries/ADSMProgram obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputer: PC, two Intel Xeon 2.0 GHz processors, 512MB RAMOperating system: Linux Red Hat 6.1, 7.2, and also 8.0Programming language used:C++, FORTRAN77: gcc 2.96 or 2.95.2 (also 3.2) compiler suite with g++ and g77Size of the package: 7.3 MB directory including example programs (2 MB compressed distribution archive), without ROOT libraries (additional 43 MB).No. of bytes in distributed program, including test data, etc.: 2 024 425Distribution format: tar gzip fileAdditional disk space required: Depends on the analyzed particle: 40 MB in the case of τ lepton decays (30 decay channels, 594 histograms, 82-pages booklet).Keywords: particle physics, decay simulation, Monte Carlo methods, invariant mass distributions, programs comparisonNature of the physical problem: The decays of individual particles are well defined modules of a typical Monte Carlo program chain in high energy physics. A fast, semi-automatic way of comparing results from different programs is often desirable, for the development of new programs, to check correctness of the installations or for discussion of uncertainties.Method of solution: A typical HEP Monte Carlo program stores the generated events in the event records such as HEPEVT or PYJETS. MC-TESTER scans, event by event, the contents of the record and searches for the decays of the particle under study. The list of the found decay modes is successively incremented and histograms of all invariant masses which can be calculated from the momenta of the particle decay products are defined and filled. The outputs from the two runs of distinct programs can be later compared. A booklet of comparisons is created: for every decay channel, all histograms present in the two outputs are plotted and parameter quantifying shape difference is calculated. Its maximum over every decay channel is printed in the summary table.Restrictions on the complexity of the problem: For a list of limitations see Section 6.Typical running time: Varies substantially with the analyzed decay particle. On a PC/Linux with 2.0 GHz processors MC-TESTER increases the run time of the τ-lepton Monte Carlo program TAUOLA by 4.0 seconds for every 100000 analyzed events (generation itself takes 26 seconds). The analysis step takes 13 seconds; processing takes additionally 10 seconds. Generation step runs may be executed simultaneously on multi-processor machines.Accessibility: web page: http://cern.ch/Piotr.Golonka/MC/MC-TESTER e-mails: Piotr.Golonka@CERN.CH, T.Pierzchala@friend.phys.us.edu.pl, Zbigniew.Was@CERN.CH.     

Maple procedures for the coupling of angular momenta. An up-date of the Racah module

An up-date of the Racah module is presented, adopted to Maple 11 and 12, which supports both, algebraic manipulations of expressions from Racah's algebra as well as numerical computations of many functions and symbols from the theory of angular momentum. The functions that are known to the program include the Wigner rotation matrices and n-j symbols, Clebsch-Gordan and Gaunt coefficients, spherical harmonics of various kinds as well as several others.

Program summary

Program title:RacahCatalogue identifier: ADFV_v10_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADFV_v10_0.htmlProgram obtainable from: CPC Program Library, Queen's University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 30 436No. of bytes in distributed program, including test data, etc.: 544 866Distribution format: tar.gzProgramming language: Maple 11 and 12Computer: All computers with a license for the computer algebra package Maple [1]Operating system: Suse Linux 10.2+ and Ubuntu 8.10Classification: 4.1, 5Catalogue identifier of previous version: ADFV_v9_0Journal reference of previous version: Comput. Phys. Comm. 174 (2006) 616Does the new version supersede the previous version?: YesNature of problem: The theories of angular momentum and spherical tensor operators, sometimes known also as Racah's algebra, provide a powerful calculus for studying spin networks and (quantum) many-particle systems. For an efficient use of these theories, however, one requires not only a reliable handling of a large number of algebraic transformations and rules but, more often than not, also a fast access to their standard quantities, such as the Wigner n-j symbols, Clebsch-Gordan coefficients, spherical harmonics of various kinds, the rotation matrices, and many others.Solution method: A set of Maple procedures has been developed and maintained during the last decade which supports both, algebraic manipulations as well as fast computations of the standard expressions and symbols from the theory of angular momentum [2,3]. These procedures are based on a sizeable set of group-theoretical (and often rather sophisticated) relations which has been discussed and proven in the literature; see the monograph by Varshalovich et al. [4] for a comprehensive compilation. In particular the algebraic manipulation of complex (Racah) expressions may result in considerable simplifications, thus reducing the ‘numerical costs’, and often help obtain further insight into the behaviour of physical systems.Reasons for new version: A revision of the Racah module became necessary for mainly three reasons: (i) Since the last extension of the Racah procedures [5], which was developed within the framework of Maple 8, several updates of Maple were distributed by the vendors (currently Maple 13) and required a number of adaptations to the source code; (ii) the increasing size and program structure of the Racah module made it advisible to separate the (procedures for the treatment of the) atomic shell model from the manipulation and computation of Racah expressions. Therefore, the computation of angular coefficients for different coupling schemes, (grand) coefficients of fractional parentage as well as the matrix elements (of various irreducible tensors from the shell model) is to be maintained from now on independently within the Jucys module; (iii) a number of bugs and inconsistencies have been reported to us and corrected in the present version.Summary of revisions: In more detail, the following changes have been made:

1.

Since recent versions of Maple now support the automatic type checking of all incoming arguments and the definition of user-defined types; we have adapted most of the code to take advantage of these features, and especially those commands that are accessible by the user.

2.

In the computation of the Wigner n-j symbols and Clebsch-Gordan coefficients, we now return a ‘0’ in all cases in which the triangular rules are not fulfilled, for example, if δ(a,b,c)=0 for or . This change in the program saves the user making these tests on the quantum numbers explicitly everytime (in the summation over more complex expressions) that such a symbol or coefficient is invoked. The program still terminates with an error message if the (half-integer and integer) angular momentum quantum numbers appear in an inproper combination.

3.

While a recursive generation of the Wigner 3-j and 6-j symbols [6] may reduce the costs of some computations (and has thus been utilized in the past), it also makes the program rather sophisticated, especially if an algebraic evaluation or computations with a high number of Digits need to be supported by the same generic commands. The following procedures are therefore no longer supported by the Racah module:Racah_compute_w3j_jrange(), Racah_compute_w3j_mrange(),Racah_compute_w3j_recursive(), Racah_compute_w6j_range(), andRacah_compute_w6j_recursive().On most PCs, a sequential computation of all requested symbols is carried out within the same time basically.

4.

Because the module Jucys has grown to a size of about 35,000 lines of code and data, it appears helpful and necessary to maintain it independently. The procedures from the Jucys modules were designed to facilitate the computation of matrix elements of the unit tensors, the coefficients of fractional parentage (of various types) as well as transformation matrices between different coupling schemes [7] and are, thus, independent of the Racah module (although they typically require that the Racah code is available). The Jucys module is no longer distributed together with the present code.

5.

Apart from the Wigner n-j symbols (see above), some minor bugs have been reported and corrected in Racah_expand() and Racah_set().

6.

To facilitate the test of the installation and as a first tutorial on the module, we now provide the Maple worksheet Racah-tests-2009-maple12.mw in the Racah2009 root directory. This worksheet contains the examples and test cases from the previous versions. For the test of the installation, it is recommended that a ‘copy’ of this worksheet is saved and compared to the results from the re-run. It can be used also as a helpful source to define new examples in interactive work with the Racah module.

The Racah module is distributed in a tar file ADFV_v10_0.tar.gz from which the RACAH2009 root directory is (re-)generated by the command tar -zxvf ADFV_v10_0.tar.gz. This directory contains the source code libraries (tested for Maple 11 and 12), a Read.me for the installation of the program, the worksheet Racah-tests-2009-maple12.mw as well as the document Racah-commands-2009.pdf. This .pdf document serves as a Short Reference Manual and provides the definition of all the data structures of the Racah program together with an alphabetic list of all user relevant (and exported) commands. Although emphasis was placed on preserving the compatibility of the program with earlier releases of Maple, this cannot always be guaranteed due to changes in the Maple syntax. The Racah2009 root also contains an example of a .mapleinit file that can be modified and incorporated into the user's home directory to make the Racah module accessible like any other module of Maple. As mentioned above, the worksheet Racah-tests-2009-maple12.mw, help test the installation and may serve as a first tutorial.Restrictions: The (Racah) program is based on the concept of Racah expressions [cf. Fig. 1 in Ref. [4]] which, in principle, may contain any number of Wigner n-j symbols (n?9), Clebsch-Gordan coefficients, spherical harmonics and/or rotation matrices. In practise, of course, the required time and the success of an evaluation procedure depends on the complexity of the expressions and on the storage available, sometimes also on Maple's internal garbage treatment. In some cases, it is advisable to attempt first a simplification of the magnetic quantum numbers for a given expression before the summation over further 6-j and 9-j symbols should be taken into account. For all other quantities (that are compiled in Ref. [8], Tables 1 and 2, and explained in more detail in the Short Reference Manual, Racah-commands-2009.pdf), we currently just facilitate fast numerical computations by exploiting, as far as possible, Maple's hardware floating-point model. The program also supports simplifications on the Wigner rotation matrices. In integrals over the rotation matrices, products of up to three Wigner D-functions or reduced matrices (with the same angular arguments) are recognized; for the integration over a solid angle, however, the domain of integration must be specified explicitly for the Euler angles α and γ in order to force Maple to generate a constant of integration. In the course of the evaluation of Racah expressions, it is, in practice, often difficult to check internally whether all substructures of an expression are defined properly. Therefore, the user must ensure that all angular momenta (if given explicitly) must finally evaluate to integer and half-integer values and that they satisfy proper coupling conditions.Unusual features: The Racah program is designed for interactive use and for providing a quick and algebraic evaluation of (complex) expressions from Racah's algebra. In the evaluation, it exploits a large set of sum rules which are known from Racah's algebra and which may include (multiple) summations over dummy indices; see Varshalovich et al. [5] for a more detailed account of the theory. One strength of the program is that it recognizes automatically the symmetries of the symbols and functions, and that it applies also (some of) the graphical rules due to Yutsis and coworkers [9]. As before, the result of the evaluation process will be provided as Racah expressions, if a further simplification could be achieved, and may hence be used for further derivations and calculations within the given framework. In dealing with recoupling coefficients, these coefficients can be entered simply as a string of angular momenta (variables), separated by commas, and very similar to how they appear in mathematical texts. This is a crucial advantage of the program, compared with previous developments, for which the angular momenta and coupling coefficients had often to be given in a very detailed format. A Short Reference Manual to all procedures of the Racah program is provided by this distribution; it also contains the worksheet Racah-tests-2009-maple12.mw that contains the examples from all previous versions and may help test the installation. This worksheet can serve as a first tutorial to the Racah procedures. In the past, the Racah program has been utilized extensively in a number of applications including angular and polarization studies of heavy ions [10], angular distributions and correlation functions following photon-induced excitation processes [11], entanglement studies [12], in application of point-group symmetries and several others.Running time: The worksheet supplied with the distribution takes about 1 minute to run.References:

[1] Maple is a registered trademark of Waterloo Maple Inc.

[2] S. Fritzsche, Comp. Phys. Commun. 103 (1997) 51.

[3] S. Fritzsche, S. Varga, D. Geschke, B. Fricke, Comp. Phys. Commun. 111 (1998) 167;

T. Ingho, S. Fritzsche, B. Fricke, Comp. Phys. Commun. 139 (2001) 297;

S. Fritzsche, T. Ingho, T. Bastug, M. Tomaselli, Comp. Phys. Commun. 139 (2001) 314.

[4] D.A. Varshalovich, A.N. Moskalev, V.K. Khersonskii, Quantum Theory of Angular Momentum, World Scientific, Singapore a.o., 1988.

[5] J. Pagaran, S. Fritzsche, G. Gaigalas, Comp. Phys. Commun. 174 (2006) 616.

[6] K. Schulten, R.G. Gordon, Comp. Phys. Commun. 11 (1976) 269.

[7] G. Gaigalas, S. Fritzsche, B. Fricke, Comp. Phys. Commun. 135 (2001) 219;

G. Gaigalas, S. Fritzsche, Comp. Phys. Commun. 149 (2002) 39;

G. Gaigalas, O. Scharf, S. Fritzsche, Comp. Phys. Commun. 166 (2005) 141.

[8] S. Fritzsche, T. Ingho, M. Tomaselli, Comp. Phys. Commun. 153 (2003) 424.

[9] A.P. Yutsis, I.B. Levinson, V.V. Vanagas, The Theory of Angular Momentum, Israel Program for Scientific Translation, Jerusalem, 1962.

[10] S. Fritzsche, P. Indelicato, T. Stöhlker, J. Phys. B 38 (2005) S707.

[11] M. Kitajima, M. Okamoto, M. Hoshino, et al., J. Phys. B 35 (2002) 3327;

N.M. Kabachnik, S. Fritzsche, A.N. Grum-Grzhimailo, et al., Phys. Reports 451 (2007) 155;

S. Fritzsche, A.N. Grum-Grzhimailo, E.V. Gryzlova, N.M. Kabachnik, J. Phys. B 41 (2008) 165601;

T. Radtke, et al., Phys. Rev. A 77 (2008) 022507.

[12] T. Radtke, S. Fritzsche, Comp. Phys. Commun. 175 (2006) 145.

     

The tauola-photos-F environment for the TAUOLA and PHOTOS packages, release II

We present the system for maintaining the versions of two packages: the TAUOLA of τ-lepton decay and PHOTOS for radiative corrections in decays. The following features can be chosen in an automatic or semi-automatic way: (1) format of the common block HEPEVT; (2) version of the physics input (for TAUOLA): as published, as initialized by the CLEO collaboration, as initialized by the ALEPH collaboration (it is suggested to use this version only with the help of the collaboration advice), new optional parametrization of matrix elements in 4π decay channels; (3) type of application: stand-alone, universal interface based on the information stored in the HEPEVT common block including longitudinal spin effects in the elementary Z/γ^∗→τ⁺τ⁻ process, extended version of the standard universal interface including full spin effects in the H/A→τ⁺τ⁻ decay, interface for KKMC Monte Carlo, (4) random number generators; (5) compiler options. The last section of the paper contains documentation of the programs updates introduced over the last two years.

Program summary

Title of program:tauola-photos-F, release IICatalogue identifier:ADXO_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXO_v1_0Programs obtainable from: CPC Program Library, Queen's University of Belfast, N. IrelandComputer: PC running GNU/Linux operating systemProgramming languages and tools used:CPP: standard C-language preprocessor, GNU Make builder tool, also FORTRAN compilerNo. of lines in distributed program, including test data, etc.: 194 118No. of bytes in distributed program, including test data, etc.:2 481 234Distribution format: tar.gzCatalogue identifier:ADXO_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXO_v2_0No. of lines in distributed program, including test data, etc.:308 235No. of bytes in distributed program, including test data, etc.:2 988 363Distribution format:tar.gzDoes the new version supersede the previous version:YesNature of the physical problem: The code of Monte Carlo generators often has to be tuned to the needs of large HEP Collaborations and experiments. Usually, these modifications do not introduce important changes in the algorithm, but rather modify the initialization and form of the hadronic current in τ decays. The format of the event record (HEPEVT common block) used to exchange information between building blocks of Monte Carlo systems often needs modification. Thus, there is a need to maintain various, slightly modified versions of the same code. The package presented here allows the production of ready-to-compile versions of TAUOLA [S. Jadach, Z. Wa?s, R. Decker, J.H. Kühn, Comput. Phys. Comm. 76 (1993) 361; A.E. Bondar, et al., Comput. Phys. Comm. 146 (2002) 139] and PHOTOS [E. Barberio, Z. Wa?s, Comput. Phys. Comm. 79 (1994) 291] Monte Carlo generators with appropriate demonstration programs. The new algorithm, universal interface of TAUOLA to work with the HEPEVT common block, is also documented here. Finally, minor technical improvements of TAUOLA and PHOTOS are also listed.Method of solution: The standard UNIX tool: the C-language preprocessor is used to produce a ready-to-distribute version of TAUOLA and PHOTOS code. The final FORTRAN code is produced from the library of ‘pre-code’ that is included in the package.Reasons for new version: The functionality of the version of TAUOLA and PHOTOS changed over the last two years. The changes, and their reasons, are documented in Section 9, and our new papers cited in this section.Additional comments: The updated version includes new features described in Section 9 of the paper. PHOTOS and TAUOLA were first submitted to the library as separate programs. Summary details of these previous programs are obtainable from the CPC Program Library.Typical running time: Depends on the speed of the computer used and the demonstration program chosen. Typically a few seconds.