939 resultados para Siegel modular forms
Resumo:
There are a variety of characterizations of Saito-Kurokawa lifts from elliptic modular forms to Siegel modular forms of degree 2. In addition to giving a survey of known characterizations, we apply a recent result of Weissauer to provide a number of new and simpler characterizations of Saito-Kurokawa lifts.
Resumo:
We affirmatively answer a question due to S. Bocherer concerning the feasibility of removing one differential operator from the standard collection of m + 1 of them used to embed the space of Jacobi forms of weight 2 and index m into several pieces of elliptic modular forms. (C) 2014 Elsevier Inc. All rights reserved.
Resumo:
The thesis deals with the modularity conjecture for three-dimensional Calabi-Yau varieties. This is a generalization of the work of A. Wiles and others on modularity of elliptic curves. Modularity connects the number of points on varieties with coefficients of certain modular forms. In chapter 1 we collect the basics on arithmetic on Calabi-Yau manifolds, including general modularity results and strategies for modularity proofs. In chapters 2, 3, 4 and 5 we investigate examples of modular Calabi-Yau threefolds, including all examples occurring in the literature and many new ones. Double octics, i.e. Double coverings of projective 3-space branched along an octic surface, are studied in detail. In chapter 6 we deal with examples connected with the same modular forms. According to the Tate conjecture there should be correspondences between them. Many correspondences are constructed explicitly. We finish by formulating conjectures on the occurring newforms, especially their levels. In the appendices we compile tables of coefficients of weight 2 and weight 4 newforms and many examples of double octics.
Resumo:
Thesis (Ph.D.)--University of Washington, 2016-06
Resumo:
This thesis studies Frobenius traces in Galois representations from two different directions. In the first problem we explore how often they vanish in Artin-type representations. We give an upper bound for the density of the set of vanishing Frobenius traces in terms of the multiplicities of the irreducible components of the adjoint representation. Towards that, we construct an infinite family of representations of finite groups with an irreducible adjoint action.
In the second problem we partially extend for Hilbert modular forms a result of Coleman and Edixhoven that the Hecke eigenvalues ap of classical elliptical modular newforms f of weight 2 are never extremal, i.e., ap is strictly less than 2[square root]p. The generalization currently applies only to prime ideals p of degree one, though we expect it to hold for p of any odd degree. However, an even degree prime can be extremal for f. We prove our result in each of the following instances: when one can move to a Shimura curve defined by a quaternion algebra, when f is a CM form, when the crystalline Frobenius is semi-simple, and when the strong Tate conjecture holds for a product of two Hilbert modular surfaces (or quaternionic Shimura surfaces) over a finite field.
Resumo:
A computerized handheld procedure is presented in this paper. It is intended as a database complementary tool, to enhance prospective risk analysis in the field of occupational health. The Pendragon forms software (version 3.2) has been used to implement acquisition procedures on Personal Digital Assistants (PDAs) and to transfer data to a computer in an MS-Access format. The data acquisition strategy proposed relies on the risk assessment method practiced at the Institute of Occupational Health Sciences (IST). It involves the use of a systematic hazard list and semi-quantitative risk assessment scales. A set of 7 modular forms has been developed to cover the basic need of field audits. Despite the minor drawbacks observed, the results obtained so far show that handhelds are adequate to support field risk assessment and follow-up activities. Further improvements must still be made in order to increase the tool effectiveness and field adequacy.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A conceptual proof is given of the fact that the coefficients of the characteristic series of the U-operator acting on families of overconvegent modular forms lie in the Iwasawa algebra.
Resumo:
2000 Mathematics Subject Classification: 11G15, 11G18, 14H52, 14J25, 32L07.
Resumo:
In the first part of this thesis we generalize a theorem of Kiming and Olsson concerning the existence of Ramanujan-type congruences for a class of eta quotients. Specifically, we consider a class of generating functions analogous to the generating function of the partition function and establish a bound on the primes ℓ for which their coefficients c(n) obey congruences of the form c(ℓn + a) ≡ 0 (mod ℓ). We use this last result to answer a question of H.C. Chan. In the second part of this thesis [S2] we explore a natural analog of D. Calegari’s result that there are no hyperbolic once-punctured torus bundles over S^1 with trace field having a real place. We prove a contrasting theorem showing the existence of several infinite families of pairs (−χ, p) such that there exist hyperbolic surface bundles over S^1 with trace field of having a real place and with fiber having p punctures and Euler characteristic χ. This supports our conjecture that with finitely many known exceptions there exist such examples for each pair ( −χ, p).
Resumo:
Across the world there are many bodies currently involved in researching into the design of autonomous guided vehicles (AGVs). One of the greatest problems at present however, is that much of the research work is being conducted in isolated groups, with the resulting AGVs sensor/control/command systems being almost completely nontransferable to other AGV designs. This paper describes a new modular method for robot design which when applied to AGVs overcomes the above problems. The method is explained here with respect to all forms of robotics but the examples have been specifically chosen to reflect typical AGV systems.
Resumo:
To obtain crystals of the Escherichia coli catabolite gene activator protein (CAP) complexed with its DNA-binding site, we have searched for crystallization conditions with 26 different DNA segments ≥28 base-pairs in length that explore a variety of nucleotide sequences, lengths, and extended 5′ or 3′ termini. In addition to utilizing uninterrupted asymmetric lac site sequences, we devised a novel approach of synthesizing half-sites that allowed us to efficiently generate symmetric DNA segments with a wide variety of extended termini and lengths in the large size range (≥28 bp) required by this protein. We report three crystal forms that are suitable for X-ray analysis, one of which (crystal form III) gives measurable diffraction amplitudes to 3 Å resolution. Additives such as calcium, n-octyl-β-d-glucopyranoside and spermine produce modest improvements in the quality of diffraction from crystal form III. Adequate stabilization of crystal form III is unexpectedly complex, requiring a greater than tenfold reduction in the salt concentration followed by addition of 2-methyl-2,4-pentanediol and then an increase in the concentration of polyethylene glycol.
Resumo:
We present a new free library for Constraint Logic Programming over Finite Domains, included with the Ciao Prolog system. The library is entirely written in Prolog, leveraging on Ciao's module system and code transformation capabilities in order to achieve a highly modular design without compromising performance. We describe the interface, implementation, and design rationale of each modular component. The library meets several design goals: a high level of modularity, allowing the individual components to be replaced by different versions; highefficiency, being competitive with other TT> implementations; a glass-box approach, so the user can specify new constraints at different levels; and a Prolog implementation, in order to ease the integration with Ciao's code analysis components. The core is built upon two small libraries which implement integer ranges and closures. On top of that, a finite domain variable datatype is defined, taking care of constraint reexecution depending on range changes. These three libraries form what we call the TT> kernel of the library. This TT> kernel is used in turn to implement several higher-level finite domain constraints, specified using indexicals. Together with a labeling module this layer forms what we name the TT> solver. A final level integrates the CLP (J7©) paradigm with our TT> solver. This is achieved using attributed variables and a compiler from the CLP (J7©) language to the set of constraints provided by the solver. It should be noted that the user of the library is encouraged to work in any of those levels as seen convenient: from writing a new range module to enriching the set of TT> constraints by writing new indexicals.