skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: COMPATIBLE SYSTEMS OF GALOIS REPRESENTATIONS ASSOCIATED TO THE EXCEPTIONAL GROUP
We construct, over any CM field, compatible systems of $$l$$ -adic Galois representations that appear in the cohomology of algebraic varieties and have (for all $$l$$ ) algebraic monodromy groups equal to the exceptional group of type $$E_{6}$$ .  more » « less
Award ID(s):
1700759 1701703
PAR ID:
10095330
Author(s) / Creator(s):
; ; ; ; ;
Date Published:
Journal Name:
Forum of Mathematics, Sigma
Volume:
7
ISSN:
2050-5094
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract. Let 𝘎 be a real semisimple algebraic Lie group and 𝘏 a real reductive algebraic subgroup. We describe the pairs (𝘎,𝘏) for which the representation of 𝘎 in L²(𝘎/𝘏) is tempered. The proof gives the complete list of pairs (𝘎,𝘏) for which L²(𝘎/𝘏) is not tempered. When 𝘎 and 𝘏 are complex Lie groups, the temperedness condition is characterized by the fact that 𝘵𝘩𝘦 𝘴𝘵𝘢𝘣𝘪𝘭𝘪𝘻𝘦𝘳 𝘪𝘯 𝘏 𝘰𝘧 𝘢 𝘨𝘦𝘯𝘦𝘳𝘪𝘤 𝘱𝘰𝘪𝘯𝘵 𝘰𝘯 𝘎/𝘏 𝘪𝘴 𝘷𝘪𝘳𝘵𝘶𝘢𝘭𝘭𝘺 𝘢𝘣𝘦𝘭𝘪𝘢𝘯. 𝘔𝘢𝘵𝘩𝘦𝘮𝘢𝘵𝘪𝘤𝘴 𝘚𝘶𝘣𝘫𝘦𝘤𝘵 𝘊𝘭𝘢𝘴𝘴𝘪𝘧𝘪𝘤𝘢𝘵𝘪𝘰𝘯: Primary 22𝐄46; secondary 43𝐀85, 22𝐅30. 𝘒𝘦𝘺 𝘞𝘰𝘳𝘥𝘴: Lie groups, homogeneous spaces, tempered representations, unitary representations, matrix coefficients, symmetric spaces. 
    more » « less
  2. We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure M. We prove that if is a complete L-theory, then T is mutually algebraic if and only if there is some model M of T for which every atomic formula has uniformly bounded arrays. Moreover, an incomplete theory T is mutually algebraic if and only if every atomic formula has uniformly bounded arrays in every model M of T. 
    more » « less
  3. The rational homotopy type of a mapping space is a way to describe the structure of the space using the algebra of its homotopy groups and the differential graded algebra of its cochains. An L∞-model is a graded Lie algebra with a family of higher-order brackets satisfying the generalized Jacobi identity and antisymmetry. It can be used to study the rational homotopy type of a space. The nilpotency index of an L∞-model is useful in understanding a space's algebraic structure. In this paper, we compute the rational homotopy type of the component of some mapping spaces between projective spaces and determine the nilpotency index of corresponding L∞-models. 
    more » « less
  4. We obtain Weyl type asymptotics for the quantised derivative \dj \mkern 1muf of a function f f from the homgeneous Sobolev space W ˙ d 1 ( R d ) \dot {W}^1_d(\mathbb {R}^d) on R d . \mathbb {R}^d. The asymptotic coefficient ‖ ∇ f ‖ L d ( R d ) \|\nabla f\|_{L_d(\mathbb R^d)} is equivalent to the norm of \dj \mkern 1muf in the principal ideal L d , ∞ , \mathcal {L}_{d,\infty }, thus, providing a non-asymptotic, uniform bound on the spectrum of \dj \mkern 1muf. Our methods are based on the C ∗ C^{\ast } -algebraic notion of the principal symbol mapping on R d \mathbb {R}^d , as developed recently by the last two authors and collaborators. 
    more » « less
  5. Every program should be accompanied by a specification that describes important aspects of the code's behavior, but writing good specifications is often harder than writing the code itself. This paper addresses the problem of synthesizing specifications automatically, guided by user-supplied inputs of two kinds: i) a query posed about a set of function definitions, and ii) a domain-specific language L in which the extracted property is to be expressed (we call properties in the language L-properties). Each of the property is a best L-property for the query: there is no other L-property that is strictly more precise. Furthermore, the set of synthesized L-properties is exhaustive: no more L-properties can be added to it to make the conjunction more precise. We implemented our method in a tool, Spyro. The ability to modify both the query and L provides a Spyro user with ways to customize the kind of specification to be synthesized. We use this ability to show that Spyro can be used in a variety of applications, such as mining program specifications, performing abstract-domain operations, and synthesizing algebraic properties of program modules. 
    more » « less