Class Notes for Math 905: Commutative Algebra, Instructor Sylvia Wiegand

Topics include: Rings, ideals, algebraic sets and affine varieties, modules, localizations, tensor products, intersection multiplicities, primary decomposition, the Nullstellensatz

ON THE RADICAL OF A FREE MALCEV ALGEBRA

We prove that the prime radical rad M of the free Malcev algebra M of rank more than two over a field of characteristic not equal 2 coincides with the set of all universally Engelian elements of M. Moreover, let T(M) be the ideal of M consisting of all stable identities of the split simple 7-dimensional Malcev algebra M over F. It is proved that rad M = J(M) boolean AND T(M), where J(M) is the Jacobian ideal of M. Similar results were proved by I. Shestakov and E. Zelmanov for free alternative and free Jordan algebras.

Infinite dimensional Lie algebra associated with conformal transformations of the two-point velocity correlation tensor from isotropic turbulence

We deal with homogeneous isotropic turbulence and use the two-point velocity correlation tensor field (parametrized by the time variable t) of the velocity fluctuations to equip an affine space K3 of the correlation vectors by a family of metrics. It was shown in Grebenev and Oberlack (J Nonlinear Math Phys 18:109–120, 2011) that a special form of this tensor field generates the so-called semi-reducible pseudo-Riemannian metrics ds2(t) in K3. This construction presents the template for embedding the couple (K3, ds2(t)) into the Euclidean space R3 with the standard metric. This allows to introduce into the consideration the function of length between the fluid particles, and the accompanying important problem to address is to find out which transformations leave the statistic of length to be invariant that presents a basic interest of the paper. Also we classify the geometry of the particles configuration at least locally for a positive Gaussian curvature of this configuration and comment the case of a negative Gaussian curvature.

A model and an algebra for semi-structured and full-text queries

The need for a convergence between semi-structured data management and Information Retrieval techniques is manifest to the scientific community. In order to fulfil this growing request, W3C has recently proposed XQuery Full Text, an IR-oriented extension of XQuery. However, the issue of query optimization requires the study of important properties like query equivalence and containment; to this aim, a formal representation of document and queries is needed. The goal of this thesis is to establish such formal background. We define a data model for XML documents and propose an algebra able to represent most of XQuery Full-Text expressions. We show how an XQuery Full-Text expression can be translated into an algebraic expression and how an algebraic expression can be optimized.

Use of computer algebra in the calculation of Feynman diagrams

The increasing precision of current and future experiments in high-energy physics requires a likewise increase in the accuracy of the calculation of theoretical predictions, in order to find evidence for possible deviations of the generally accepted Standard Model of elementary particles and interactions. Calculating the experimentally measurable cross sections of scattering and decay processes to a higher accuracy directly translates into including higher order radiative corrections in the calculation. The large number of particles and interactions in the full Standard Model results in an exponentially growing number of Feynman diagrams contributing to any given process in higher orders. Additionally, the appearance of multiple independent mass scales makes even the calculation of single diagrams non-trivial. For over two decades now, the only way to cope with these issues has been to rely on the assistance of computers. The aim of the xloops project is to provide the necessary tools to automate the calculation procedures as far as possible, including the generation of the contributing diagrams and the evaluation of the resulting Feynman integrals. The latter is based on the techniques developed in Mainz for solving one- and two-loop diagrams in a general and systematic way using parallel/orthogonal space methods. These techniques involve a considerable amount of symbolic computations. During the development of xloops it was found that conventional computer algebra systems were not a suitable implementation environment. For this reason, a new system called GiNaC has been created, which allows the development of large-scale symbolic applications in an object-oriented fashion within the C++ programming language. This system, which is now also in use for other projects besides xloops, is the main focus of this thesis. The implementation of GiNaC as a C++ library sets it apart from other algebraic systems. Our results prove that a highly efficient symbolic manipulator can be designed in an object-oriented way, and that having a very fine granularity of objects is also feasible. The xloops-related parts of this work consist of a new implementation, based on GiNaC, of functions for calculating one-loop Feynman integrals that already existed in the original xloops program, as well as the addition of supplementary modules belonging to the interface between the library of integral functions and the diagram generator.

Le matrici e la loro algebra

In questa tesi ci si propone lo studio dell'anello delle matrici quadrate di ordine n, su un campo, per arrivare a dimostrare che ha solo ideali banali pur non essendo un campo. Allo scopo si introducono le operazioni elementari e il procedimento di traduzione di tali operazioni con opportune moltiplicazioni per matrici dette elementari. Si considera inoltre il gruppo generale lineare arrivando a dimostrare che un particolare sottoinsieme delle matrici elementari è un generatore di tale gruppo.

Algebra esterna e grassmanniane

Nella tesi viene fornita una costruzione dell'algebra esterna di un K-spazio vettoriale, alcune conseguenze principali come la derivazione in maniera traspente del determinante di e alcune sue proprietà e l'introduzione del concetto di Grassmanniana.

Il polinomio strutturale di un'algebra monounaria

Questa tesi descrive alcune proprietà delle algebre monounarie finite e si propone di trovare un metodo per classificarle. Poiché infatti il numero di algebre di ordine n aumenta notevolmente con la crescita di quest’ultimo, si cerca un modo per suddividerle in classi d’isomorfismo. In particolare, dal momento che anche il numero di queste classi cresce esponenzialmente all’aumentare di n, utilizziamo una classificazione meno fine dell’isomorfismo basata sul polinomio strutturale. Grazie a questo strumento infatti è possibile risalire a famiglie di grafi orientati associati ad algebre monounarie, a due a due non isomorfi, ricavando perciò alcune specifiche caratteristiche di quest’ultime. Infine, calcolando l’ordine di gruppi particolari, detti automorfi, si può ottenere l’effettivo numero di algebre aventi un dato polinomio strutturale.

Computer algebra for x-ray spectral reconstruction between 6 and 25 MV

A previously presented algorithm for the reconstruction of bremsstrahlung spectra from transmission data has been implemented into MATHEMATICA. Spectra vectorial algebra has been used to solve the matrix system A * F = T. The new implementation has been tested by reconstructing photon spectra from transmission data acquired in narrow beam conditions, for nominal energies of 6, 15, and 25 MV. The results were in excellent agreement with the original calculations. Our implementation has the advantage to be based on a well-tested mathematical kernel. Furthermore it offers a comfortable user interface.

A feasible theory of truth over combinatory algebra

We define an applicative theory of truth TPT which proves totality exactly for the polynomial time computable functions. TPT has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. Truth induction can be allowed without any constraints. For these reasons the system TPT has the high expressive power one expects from truth theories. It allows embeddings of feasible systems of explicit mathematics and bounded arithmetic. The proof that the theory TPT is feasible is not easy. It is not possible to apply a standard realisation approach. For this reason we develop a new realisation approach whose realisation functions work on directed acyclic graphs. In this way, we can express and manipulate realisation information more efficiently.