Related papers: LatticePolytopes: A package for computations with …
By trapping cold polarizable atoms in periodic potentials created by crossed laser beams, it is now possible to experimentally create "clean" lattice systems. Experimentalists have successfully engineered local and nearest-neighbor…
The program package XLOOPS calculates massive one- and two-loop Feynman diagrams. It consists of five parts: i) a graphical user interface ii) routines for generating diagrams from particle input iii) procedures for calculating one-loop…
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These…
We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, P\'olya…
I present a Mathematica package designed for manipulations and evaluations of triple-K integrals and conformal correlation functions in momentum space. Additionally, the program provides tools for evaluation of a large class of 2- and…
We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we…
We establish some geometric constraints on compact Coxeter polytopes in hyperbolic spaces and show that these constraints can be a very useful tool for the classification problem of reflective anisotropic Lorentzian lattices and cocompact…
We report on an implementation of Galois groups in the new computer algebra system OSCAR. As an application we compute Galois groups of Ehrhart polynomials of lattice polytope
For certain non compact Riemannian manifolds with ends, we obtain Littlewood-Paley type estimates on (weighted) Lp spaces, using the usual square function defined by a dyadic partition.
We report on the new functionality of the open-source Mathematica package FeynCalc relevant for multiloop calculations. In particular, we focus on such tasks as topology identification by means of the Pak algorithm, search for equivalent…
This paper describes a package for calculations of expressions with Dirac matrixes. Advantages to existing similar packages are described. MatrixExp package is intended for simplification of complex expressions involving $\gamma$-matrixes,…
We present the first general purpose framework for marginal maximum a posteriori estimation of probabilistic program variables. By using a series of code transformations, the evidence of any probabilistic program, and therefore of any…
This work introduces a new software package `Sesame' for the numerical computation of classical semiconductor equations. It supports 1 and 2-dimensional systems and provides tools to easily implement extended defects such as grain…
The duality between a class of the Davey-Stewartson type coupled systems and a class of two-dimensional Toda type lattices is discussed. A new coupled system related to the recently found lattice is presented. A method for eliminating…
This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree…
We discuss tableaux for the Implicational Propositional Calculus and show how they may be used to establish its completeness.
We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…
The architecture and capabilities of the computers currently in use for large-scale lattice QCD calculations are described and compared. Based on this present experience, possible future directions are discussed.
We introduce the Hardy spaces for Fourier integral operators on Riemannian manifolds with bounded geometry. We then use these spaces to obtain improved local smoothing estimates for Fourier integral operators satisfying the cinematic…
A lattice Delaunay polytope P is called perfect if its Delaunay sphere is the only ellipsoid circumscribed about P. We present a new algorithm for finding perfect Delaunay polytopes. Our method overcomes the major shortcomings of the…