O uso de elementos da criptografia como estímulo matemático na sala de aula

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Mathematical aspects of Feynman integrals

In the present dissertation we consider Feynman integrals in the framework of dimensional regularization. As all such integrals can be expressed in terms of scalar integrals, we focus on this latter kind of integrals in their Feynman parametric representation and study their mathematical properties, partially applying graph theory, algebraic geometry and number theory. The three main topics are the graph theoretic properties of the Symanzik polynomials, the termination of the sector decomposition algorithm of Binoth and Heinrich and the arithmetic nature of the Laurent coefficients of Feynman integrals.rnrnThe integrand of an arbitrary dimensionally regularised, scalar Feynman integral can be expressed in terms of the two well-known Symanzik polynomials. We give a detailed review on the graph theoretic properties of these polynomials. Due to the matrix-tree-theorem the first of these polynomials can be constructed from the determinant of a minor of the generic Laplacian matrix of a graph. By use of a generalization of this theorem, the all-minors-matrix-tree theorem, we derive a new relation which furthermore relates the second Symanzik polynomial to the Laplacian matrix of a graph.rnrnStarting from the Feynman parametric parameterization, the sector decomposition algorithm of Binoth and Heinrich serves for the numerical evaluation of the Laurent coefficients of an arbitrary Feynman integral in the Euclidean momentum region. This widely used algorithm contains an iterated step, consisting of an appropriate decomposition of the domain of integration and the deformation of the resulting pieces. This procedure leads to a disentanglement of the overlapping singularities of the integral. By giving a counter-example we exhibit the problem, that this iterative step of the algorithm does not terminate for every possible case. We solve this problem by presenting an appropriate extension of the algorithm, which is guaranteed to terminate. This is achieved by mapping the iterative step to an abstract combinatorial problem, known as Hironaka's polyhedra game. We present a publicly available implementation of the improved algorithm. Furthermore we explain the relationship of the sector decomposition method with the resolution of singularities of a variety, given by a sequence of blow-ups, in algebraic geometry.rnrnMotivated by the connection between Feynman integrals and topics of algebraic geometry we consider the set of periods as defined by Kontsevich and Zagier. This special set of numbers contains the set of multiple zeta values and certain values of polylogarithms, which in turn are known to be present in results for Laurent coefficients of certain dimensionally regularized Feynman integrals. By use of the extended sector decomposition algorithm we prove a theorem which implies, that the Laurent coefficients of an arbitrary Feynman integral are periods if the masses and kinematical invariants take values in the Euclidean momentum region. The statement is formulated for an even more general class of integrals, allowing for an arbitrary number of polynomials in the integrand.

Full and hat inductive definitions are equivalent in NBG

A new research project has, quite recently, been launched to clarify how different, from systems in second order number theory extending ACA 0, those in second order set theory extending NBG (as well as those in n + 3-th order number theory extending the so-called Bernays−Gödel expansion of full n + 2-order number theory etc.) are. In this article, we establish the equivalence between Δ10\bf-LFP and Δ10\bf-FP, which assert the existence of a least and of a (not necessarily least) fixed point, respectively, for positive elementary operators (or between Δn+20\bf-LFP and Δn+20\bf-FP). Our proof also shows the equivalence between ID 1 and ^ID1, both of which are defined in the standard way but with the starting theory PA replaced by ZFC (or full n + 2-th order number theory with global well-ordering).

Powers in the Lucas sequence when the index is divisible by three

In this paper the m-powers with m ≥ 2 included in the Lucas sequences when the index satisfies some conditions are found

Online games for the teaching of mathematics

In this article we present a didactic experience developed by the GIE (Group of Educational Innovation) “Pensamiento Matemático” of the Polytechnics University of Madrid (UPM), in order to bring secondary students and university students closer to Mathematics. It deals with the development of a virtual board game called Mate-trivial. The mechanics of the game is to win points by going around the board which consists of four types of squares identified by colours: “Statistics and Probability”, “Calculus and Analysis”, “Algebra and Geometry” and “Arithmetic and Number Theory ”. When landing on a square, a question of its category is set out: a correct answer wins 200 points, if wrong it loses 100 points, and not answering causes no effect on the points, but all the same, two minutes out of the 20 minutes that each game lasts are lost. For the game to be over it is necessary, before those 20 minutes run out, to reach the central square and succeed in the final task: four chained questions, one of each type, which must be all answered correctly. It is possible to choose between two levels to play: Level 1, for pre-university students and Level 2 for university students. A prototype of the game is available at the website “Aula de Pensamiento Matemático” developed by the GIE: http://innovacioneducativa.upm.es/pensamientomatematico/. This activity lies within a set of didactic actions which the GIE is developing in the framework of the project “Collaborative Strategies between University and Secondary School Education for the teaching and learning of Mathematics: An Application to solve problems while playing”, a transversal project financed by the UPM.

A brief survey of symmetry in mathematics

This paper presents a brief survey of the idea of symmetry in mathematics, as exemplified by some particular developments in algebra, differential equations, topology, and number theory.

Randomness and degrees of irregularity.

The fundamental question "Are sequential data random?" arises in myriad contexts, often with severe data length constraints. Furthermore, there is frequently a critical need to delineate nonrandom sequences in terms of closeness to randomness--e.g., to evaluate the efficacy of therapy in medicine. We address both these issues from a computable framework via a quantification of regularity. ApEn (approximate entropy), defining maximal randomness for sequences of arbitrary length, indicating the applicability to sequences as short as N = 5 points. An infinite sequence formulation of randomness is introduced that retains the operational (and computable) features of the finite case. In the infinite sequence setting, we indicate how the "foundational" definition of independence in probability theory, and the definition of normality in number theory, reduce to limit theorems without rates of convergence, from which we utilize ApEn to address rates of convergence (of a deficit from maximal randomness), refining the aforementioned concepts in a computationally essential manner. Representative applications among many are indicated to assess (i) random number generation output; (ii) well-shuffled arrangements; and (iii) (the quality of) bootstrap replicates.

... Algebraic numbers. Report of the Committee on Algebraic Numbers, National Research Council,

Cover-title.

Vorlesungen über zahlen- und funktionenlehre,

Mode of access: Internet.

The cardinal numbers : with an introductory chapter on numbers generally /

Mode of access: Internet.

Three new Mersenne primes, and a conjecture /

Bibliography: leaf 6.

Theoretische Arithmetik

Mode of access: Internet.

Recherches arithmétiques,

Facsimile-reprint of original edition, Paris, Courcier, 1807.