Wild Pfister forms over Henselian fields, K-theory, and conic division algebras

The epicenter of this paper concerns Pfister quadratic forms over a field $F$ with a Henselian discrete valuation. All characteristics are considered but we focus on the most complicated case where the residue field has characteristic 2 but $F$ does not. We also prove results about round quadratic forms, composition algebras, generalizations of composition algebras we call conic algebras, and central simple associative symbol algebras. Finally we give relationships between these objects and Kato's filtration on the Milnor $K$-groups of $F$

Iterated Elliptic and Hypergeometric Integrals for Feynman Diagrams

We calculate 3-loop master integrals for heavy quark correlators and the 3-loop QCD corrections to the $\rho$-parameter. They obey non-factorizing differential equations of second order with more than three singularities, which cannot be factorized in Mellin-$N$ space either. The solution of the homogeneous equations is possible in terms of convergent close integer power series as $_2F_1$ Gau\ss{} hypergeometric functions at rational argument. In some cases, integrals of this type can be mapped to complete elliptic integrals at rational argument. This class of functions appears to be the next one arising in the calculation of more complicated Feynman integrals following the harmonic polylogarithms, generalized polylogarithms, cyclotomic harmonic polylogarithms, square-root valued iterated integrals, and combinations thereof, which appear in simpler cases. The inhomogeneous solution of the corresponding differential equations can be given in terms of iterative integrals, where the new innermost letter itself is not an iterative integral. A new class of iterative integrals is introduced containing letters in which (multiple) definite integrals appear as factors. For the elliptic case, we also derive the solution in terms of integrals over modular functions and also modular forms, using $q$-product and series representations implied by Jacobi's $\vartheta_i$ functions and Dedekind's $\eta$-function. The corresponding representations can be traced back to polynomials out of Lambert--Eisenstein series, having representations also as elliptic polylogarithms, a $q$-factorial $1/\eta^k(\tau)$, logarithms and polylogarithms of $q$ and their $q$-integrals. Due to the specific form of the physical variable $x(q)$ for different processes, different representations do usually appear. Numerical results are also presented.Comment: 68 pages LATEX, 10 Figure

Quadratic polynomials represented by norm forms

The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the rationals containing the roots of P. The proof uses analytic methods.Comment: 55 page

Implementation of prime decomposition of polynomial ideals over small finite fields

AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is proposed and implemented on the basis of previous work of the second author. To achieve better performance, several improvements are added to the existing algorithm, with strategies for computational flow proposed, based on experimental results. The practicality of the algorithm is examined by testing the implementation experimentally, which also reveals information about the quality of the implementation

A robust collision source method for rank adaptive dynamical low-rank approximation in radiation therapy

Deterministic models for radiation transport describe the density of radiation particles moving through a background material. In radiation therapy applications, the phase space of this density is composed of energy, spatial position and direction of flight. The resulting six-dimensional phase space prohibits fine numerical discretizations, which are essential for the construction of accurate and reliable treatment plans. In this work, we tackle the high dimensional phase space through a dynamical low-rank approximation of the particle density. Dynamical low-rank approximation (DLRA) evolves the solution on a low-rank manifold in time. Interpreting the energy variable as a pseudo-time lets us employ the DLRA framework to represent the solution of the radiation transport equation on a low-rank manifold for every energy. Stiff scattering terms are treated through an efficient implicit energy discretization and a rank adaptive integrator is chosen to dynamically adapt the rank in energy. To facilitate the use of boundary conditions and reduce the overall rank, the radiation transport equation is split into collided and uncollided particles through a collision source method. Uncollided particles are described by a directed quadrature set guaranteeing low computational costs, whereas collided particles are represented by a low-rank solution. It can be shown that the presented method is L2-stable under a time step restriction which does not depend on stiff scattering terms. Moreover, the implicit treatment of scattering does not require numerical inversions of matrices. Numerical results for radiation therapy configurations as well as the line source benchmark underline the efficiency of the proposed method

Fusion rules in conformal field theory

Several aspects of fusion rings and fusion rule algebras, and of their manifestations in twodimensional (conformal) field theory, are described: diagonalization and the connection with modular invariance; the presentation in terms of quotients of polynomial rings; fusion graphs; various strategies that allow for a partial classification; and the role of the fusion rules in the conformal bootstrap programme.Comment: 68 pages, LaTeX. changed contents of footnote no.

Implementation of prime decomposition of polynomial ideals over small finite fields

AbstractAn algorithm for the prime decomposition of polynomial ideals over small finite fields is proposed and implemented on the basis of previous work of the second author. To achieve better performance, several improvements are added to the existing algorithm, with strategies for computational flow proposed, based on experimental results. The practicality of the algorithm is examined by testing the implementation experimentally, which also reveals information about the quality of the implementation