On rapid generation of SL2(Fq)

نویسندگان

  • Jeremy Chapman
  • Alex Iosevich
  • ALEX IOSEVICH
چکیده

We prove that if A ⊂ Fq\{0} with |A| > Cq 5 6 , then |R(A) ·R(A)| ≥ C′q3, where R(A) = {( a11 a12 a21 a22 ) ∈ SL2(Fq) : a11, a12, a21 ∈ A } . The proof relies on a result, previously established by D. Hart and the author ([3]) which implies that if |A| is much larger than q 3 4 then |{(a11, a12, a21, a22) ∈ A×A×A×A : a11a22 − a12a21 = 1}| = |A|4q−1(1 + o(1)).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Security of the Hashing Scheme Based on SL2

Tillich and Zémor proposed a hashing scheme based on the group of unimodular matrices SL2(Fq) over a finite field Fq of q = 2 elements. Charnes and Pieprzyk studied the security of this scheme. They showed that for n = 131 and for some irreducible polynomial P131(x) this scheme is weak. We show that with sufficiently high probability the polynomials Pn(x) can be chosen in such a way that this t...

متن کامل

Frames from generalized group fourier transforms and SL2(Fq)

We explore the problem of deterministically constructing frames and matrices with low coherence, which arises in areas such as compressive sensing, spherical codes, and MIMO communications. In particular, we present a generalization of the familiar harmonic frame by selecting a subset of rows of the generalized discrete Fourier transform matrix over finite groups. We apply our methods to the gr...

متن کامل

Fast Fourier Analysis for SL2 over a Finite Field and Related Numerical Experiments

AMS Subject Classi cation: 20-04, 05C25, 20C30 Rockmore was supported in part by a National Science Foundation Mathematical Sciences Postdoctoral Fellowship. We study the complexity of performing Fourier analysis for the group SL2(Fq), where Fq is the finite field of q elements. Direct computation of a complete set of Fourier transforms for a complex-valued function f on SL2(Fq) requires q6 ope...

متن کامل

Fundamental Domains for Congruence Subgroups of Sl2 in Positive Characteristic

Morgenstern ([Mor95]) claimed to have constructed fundamental domains for congruence subgroups of the lattice group Γ = PGL2(Fq[t]), and subgraphs providing the first known examples of linear families of bounded concentrators. His method was to construct the fundamental domain for a congruence subgroup as a ‘ramified covering’ of the fundamental domain for Γ on the Bruhat-Tits tree X = Xq+1 of ...

متن کامل

Lattices in Complete Rank 2 Kac–moody Groups

Let Λ be a minimal Kac–Moody group of rank 2 defined over the finite field Fq , where q = pa with p prime. Let G be the topological Kac–Moody group obtained by completing Λ. An example is G = SL2(K), where K is the field of formal Laurent series over Fq . The group G acts on its Bruhat–Tits building X, a tree, with quotient a single edge. We construct new examples of cocompact lattices in G, ma...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016