Theta functions on covers of symplectic groups
Authors
Abstract:
We study the automorphic theta representation $Theta_{2n}^{(r)}$ on the $r$-fold cover of the symplectic group $Sp_{2n}$. This representation is obtained from the residues of Eisenstein series on this group. If $r$ is odd, $nle r
similar resources
p-ADIC L-FUNCTIONS FOR ORDINARY FAMILIES ON SYMPLECTIC GROUPS
We construct the p-adic standard L-functions for ordinary families of Hecke eigensystems of the symplectic group Sp(2n)/Q using the doubling method. We explain a clear and simple strategy of choosing the local sections for the Siegel Eisenstein series on the doubling group Sp(4n)/Q, which guarantees the nonvanishing of local zeta integrals and allows us to p-adically interpolate the restriction...
full textFourier Coefficients for Theta Representations on Covers of General Linear Groups
We show that the theta representations on certain covers of general linear groups support certain types of unique functionals. The proof involves two types of Fourier coefficients. The first are semi-Whittaker coefficients, which generalize coefficients introduced by Bump and Ginzburg for the double cover. The covers for which these coefficients vanish identically (resp. do not vanish for some ...
full textstudy of hash functions based on chaotic maps
توابع درهم نقش بسیار مهم در سیستم های رمزنگاری و پروتکل های امنیتی دارند. در سیستم های رمزنگاری برای دستیابی به احراز درستی و اصالت داده دو روش مورد استفاده قرار می گیرند که عبارتند از توابع رمزنگاری کلیددار و توابع درهم ساز. توابع درهم ساز، توابعی هستند که هر متن با طول دلخواه را به دنباله ای با طول ثابت تبدیل می کنند. از جمله پرکاربردترین و معروف ترین توابع درهم می توان توابع درهم ساز md4, md...
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution then yields the NP-hardness of the decision problem on the existence of locally injective homomorphisms to Theta graphs with three distinct odd path lengths.
full textNon-Abelian Sequenceable Groups Involving ?-Covers
A non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized Fibonacci sequence , , , . A remarkable application of this definition may be find on the study of random covers in the cryptography. The 2-step generalized sequences for the dihedral groups studi...
full textOn Covers of Abelian Groups by Cosets
Let G be any abelian group and {asGs}ks=1 be a finite system of cosets of subgroups G1, . . . , Gk. We show that if {asGs} k s=1 covers all the elements of G at least m times with the coset atGt irredundant then [G : Gt] 6 2 and furthermore k > m + f([G : Gt]), where f( ∏ r i=1 p αi i ) = ∑ r i=1 αi(pi − 1) if p1, . . . , pr are distinct primes and α1, . . . , αr are nonnegative integers. This ...
full textMy Resources
Journal title
volume 43 issue Issue 4 (Special Issue)
pages 89- 116
publication date 2017-08-30
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023