نتایج جستجو برای: automorphic dual
تعداد نتایج: 157675 فیلتر نتایج به سال:
A loop is (right) automorphic if all its (right) inner mappings are automorphisms. Using the classification of primitive groups of small degrees, we show that there is no non-associative simple commutative automorphic loop of order less than 2, and no non-associative simple automorphic loop of order less than 2500. We obtain numerous examples of non-associative simple right automorphic loops. W...
We extend the results of [CHT] by removing the ‘minimal ramification’ condition on the lifts. That is we establish the automorphy of suitable conjugate self-dual, regular (de Rham with distinct Hodge-Tate numbers), l-adic lifts of certain automorphic mod l Galois representations of any dimension. The main innovation is a new approach to the automorphy of non-minimal lifts which is closer in spi...
In this paper we deal with monogenic and k-hypermonogenic automorphic forms on arithmetic subgroups of the Ahlfors-Vahlen group. Monogenic automorphic forms are exactly the 0-hypermonogenic automorphic forms. In the first part we establish an explicit relation between k-hypermonogenic automorphic forms and Maaß wave forms. In particular, we show how one can construct from any arbitrary non-vani...
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes, for instance, groups and commutative Moufang loops. We study uniquely 2-divisible automorphic loops, particularly automorphic loops of odd order, from the point of view of the associated Bruck loops (motivated by Glauberman’s work on uniquely 2-divisible Moufang loops) and the associated L...
Given a graph G, an automorphic edge(vertex)-coloring of G is a proper edge(vertex)-coloring such that each automorphism of the graph preserves the coloring. The automorphic chromatic index (number) is the least integer k for which G admits an automorphic edge(vertex)coloring with k colors. We show that it is NP-complete to determine the automorphic chromatic index and the automorphic chromatic...
The geometric Langlands correspondence has been interpreted as the mirror symmetry of the Hitchin fibrations for two dual reductive groups. This mirror symmetry, in turn, reduces to T–duality on the generic Hitchin fibers, which are smooth tori. In this paper we study what happens when the Hitchin fibers on the B-model side develop orbifold singularities. These singularities correspond to local...
In recent years, the theory of almost automorphic functions has been developed extensively see, e.g., Bugajewski and N’guérékata 1 , Cuevas and Lizama 2 , and N’guérékata 3 and the references therein . However, literature concerning pseudo-almost automorphic functions is very new cf. 4 . It is well known that the study of composition of two functions with special properties is important and bas...
These notes accompany a series of three lectures on automorphic loops to be delivered by the author at Workshops Loops ’15 (Ohrid, Macedonia, 2015). Automorphic loops are loops in which all inner mappings are automorphisms. The first paper on automorphic loops appeared in 1956 and there has been a surge of interest in the topic since 2010. The purpose of these notes is to introduce the methods ...
We utilize a combination of integral transforms, including the Laplace transform, with some classical results in analytic number theory concerning Riemann ξ-function, to obtain new equation. This equation is generalized self-dual principal automorphic L-functions. also provide proof known functional-type identities from theory, and recast criteria associated RH. An application our Dirichlet pro...
The geometric Langlands correspondence has been interpreted as the mirror symmetry of the Hitchin fibrations for two dual reductive groups. This mirror symmetry, in turn, reduces to T–duality on the generic Hitchin fibers, which are smooth tori. In this paper we study what happens when the Hitchin fibers on the B-model side develop orbifold singularities. These singularities correspond to local...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید