On the appearance of a Hopf bifurcation in a non-ideal mechanical problem

In this paper we studied a non-ideal system with two degrees of freedom consisting of a dumped nonlinear oscillator coupled to a rotatory part. We investigated the stability of the equilibrium point of the system and we obtain, in the critical case, sufficient conditions in order to obtain an appropriate Normal Form. From this, we get conditions for the appearance of Hopf Bifurcation when the difference between the driving torque and the resisting torque is small. It was necessary to use the Bezout Theorem, a classical result of Algebraic Geometry, in the obtaining of the foregoing results. (C) 2003 Elsevier Ltd. All rights reserved.

Sobre o teorema de fibração de Milnor

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Teorema de Riemann-Roch, morfismos de Frobenius e a hipótese de Riemann

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Hypersurfaces with many singularities

1. Teil: Bekannte Konstruktionen. Die vorliegende Arbeit gibt zunächst einen ausführlichen Überblick über die bisherigen Entwicklungen auf dem klassischen Gebiet der Hyperflächen mit vielen Singularitäten. Die maximale Anzahl mu^n(d) von Singularitäten auf einer Hyperfläche vom Grad d im P^n(C) ist nur in sehr wenigen Fällen bekannt, im P^3(C) beispielsweise nur für d<=6. Abgesehen von solchen Ausnahmen existieren nur obere und untere Schranken. 2. Teil: Neue Konstruktionen. Für kleine Grade d ist es oft möglich, bessere Resultate zu erhalten als jene, die durch allgemeine Schranken gegeben sind. In dieser Arbeit beschreiben wir einige algorithmische Ansätze hierfür, von denen einer Computer Algebra in Charakteristik 0 benutzt. Unsere anderen algorithmischen Methoden basieren auf einer Suche über endlichen Körpern. Das Liften der so experimentell gefundenen Hyperflächen durch Ausnutzung ihrer Geometrie oder Arithmetik liefert beispielsweise eine Fläche vom Grad 7 mit $99$ reellen gewöhnlichen Doppelpunkten und eine Fläche vom Grad 9 mit 226 gewöhnlichen Doppelpunkten. Diese Konstruktionen liefern die ersten unteren Schranken für mu^3(d) für ungeraden Grad d>5, die die allgemeine Schranke übertreffen. Unser Algorithmus hat außerdem das Potential, auf viele weitere Probleme der algebraischen Geometrie angewendet zu werden. Neben diesen algorithmischen Methoden beschreiben wir eine Konstruktion von Hyperflächen vom Grad d im P^n mit vielen A_j-Singularitäten, j>=2. Diese Beispiele, deren Existenz wir mit Hilfe der Theorie der Dessins d'Enfants beweisen, übertreffen die bekannten unteren Schranken in den meisten Fällen und ergeben insbesondere neue asymptotische untere Schranken für j>=2, n>=3. 3. Teil: Visualisierung. Wir beschließen unsere Arbeit mit einer Anwendung unserer neuen Visualisierungs-Software surfex, die die Stärken mehrerer existierender Programme bündelt, auf die Konstruktion affiner Gleichungen aller 45 topologischen Typen reeller kubischer Flächen.

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.

Deriving Deligne-Mumford stacks with perfect obstruction theories

Intersection theory on moduli spaces has lead to immense progress in certain areas of enumerative geometry. For some important areas, most notably counting stable maps and counting stable sheaves, it is important to work with a virtual fundamental class instead of the usual fundamental class of the moduli space. The crucial prerequisite for the existence of such a class is a two-term complex controlling deformations of the moduli space. Kontsevich conjectured in 1994 that there should exist derived version of spaces with this specific property. Another hint at the existence of these spaces comes from derived algebraic geometry. It is expected that for every pair of a space and a complex controlling deformations of the space their exists, under some additional hypothesis, a derived version of the space having the chosen complex as cotangent complex. In this thesis one version of these additional hypothesis is identified. We then show that every space admitting a two-term complex controlling deformations satisfies these hypothesis, and we finally construct the derived spaces.

Rational Hausdorff Divisors: A New approach to the Approximate Parametrization of Curves.

When applying computational mathematics in practical applications, even though one may be dealing with a problem that can be solved algorithmically, and even though one has good algorithms to approach the solution, it can happen, and often it is the case, that the problem has to be reformulated and analyzed from a different computational point of view. This is the case of the development of approximate algorithms. This paper frames in the research area of approximate algebraic geometry and commutative algebra and, more precisely, on the problem of the approximate parametrization.

Beiträge zur Lehre der universellen Summirung von Strecken, d. i. ihrer Aneinanderfügung mittels Parallelverschiebung.

Mode of access: Internet.

Results on singularities of pairs

Thesis (Ph.D.)--University of Washington, 2016-06

Aurifeuillian factorization

The Cunningham project seeks to factor numbers of the form bn±1 with b = 2, 3, . . . small. One of the most useful techniques is Aurifeuillian Factorization whereby such a number is partially factored by replacing bn by a polynomial in such a way that polynomial factorization is possible. For example, by substituting y = 2k into the polynomial factorization (2y2)2+1 = (2y2−2y+1)(2y2+2y+1) we can partially factor 24k+2+1. In 1962 Schinzel gave a list of such identities that have proved useful in the Cunningham project; we believe that Schinzel identified all numbers that can be factored by such identities and we prove this if one accepts our definition of what “such an identity” is. We then develop our theme to similarly factor f(bn) for any given polynomial f, using deep results of Faltings from algebraic geometry and Fried from the classification of finite simple groups.

On the Difference of 4-Gonal Linear Systems on some Curves

Let C = (C, g^1/4 ) be a tetragonal curve. We consider the scrollar invariants e1 , e2 , e3 of g^1/4 . We prove that if W^1/4 (C) is a non-singular variety, then every g^1/4 ∈ W^1/4 (C) has the same scrollar invariants.

The Effects of the Use of Technology In Mathematics Instruction on Student Achievement

The purpose of this study was to examine the effects of the use of technology on students’ mathematics achievement, particularly the Florida Comprehensive Assessment Test (FCAT) mathematics results. Eleven schools within the Miami-Dade County Public School System participated in a pilot program on the use of Geometers Sketchpad (GSP). Three of these schools were randomly selected for this study. Each school sent a teacher to a summer in-service training program on how to use GSP to teach geometry. In each school, the GSP class and a traditional geometry class taught by the same teacher were the study participants. Students’ mathematics FCAT results were examined to determine if the GSP produced any effects. Students’ scores were compared based on assignment to the control or experimental group as well as gender and SES. SES measurements were based on whether students qualified for free lunch. The findings of the study revealed a significant difference in the FCAT mathematics scores of students who were taught geometry using GSP compared to those who used the traditional method. No significant differences existed between the FCAT mathematics scores of the students based on SES. Similarly, no significant differences existed between the FCAT scores based on gender. In conclusion, the use of technology (particularly GSP) is likely to boost students’ FCAT mathematics test scores. The findings also show that the use of GSP may be able to close known gender and SES related achievement gaps. The results of this study promote policy changes in the way geometry is taught to 10th grade students in Florida’s public schools.

Aspects of Motives: Finite-dimensionality, Chow-Kunneth Decompositions and Intersections of Cycles

This thesis analyzes the Chow motives of 3 types of smooth projective varieties: the desingularized elliptic self fiber product, the Fano surface of lines on a cubic threefold and an ample hypersurface of an Abelian variety. For the desingularized elliptic self fiber product, we use an isotypic decomposition of the motive to deduce the Murre conjectures. We also prove a result about the intersection product. For the Fano surface of lines, we prove the finite-dimensionality of the Chow motive. Finally, we prove that an ample hypersurface on an Abelian variety possesses a Chow-Kunneth decomposition for which a motivic version of the Lefschetz hyperplane theorem holds.