Macquarie University, Sydney Macquarie University ResearchOnline

Showing items 1 - 15 of 34.

Add to Quick Collection   All 34 Results

Sort:
 Add All Items to Quick Collection
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1159135
Description: 14 page(s)
Reviewed: Reviewed
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41602
Description: We obtain an estimate for incomplete multiple Kloosterman sums modulo a prime which improves the previous result of W. Luo.
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41592
Description: We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has rather “flat” Fourier s ... More
Reviewed: Reviewed
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/46214
Description: 7 page(s)
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1142098
Description: Let χ be a primitive multiplicative character modulo an integer m ≥ 1. Using some classical bounds of character sums, we estimate the average value of the character sums with subsequence sums Tm (S,χ) ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41832
Description: We use lattice reduction to obtain a polynomial-time algorithm for recovering an integer (up to a multiple) given multiples of its residues modulo sufficiently many primes, when the multipliers are un ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41607
Description: We show that the communication complexity of the parity of the sum of binary digits of x+y is at least 0.085667...n+O(1) where x and y are n-bit integers. We also obtain a nontrivial (but weaker) lowe ... More
Reviewed: Reviewed
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/118763
Description: We show that, for most of the elliptic curves E over a prime finite field Fp of p elements, the discriminant D(E) of the quadratic number field containing the endomorphism ring of E over F p is suffic ... More
Reviewed: Reviewed
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/24987
Description: For a prime p, we consider some natural classes of matrices over a finite field Fp of p elements, such as matrices of given rank or with characteristic polynomial having irreducible divisors of prescr ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: conference paper
Identifier: http://hdl.handle.net/1959.14/1244672
Description: 35 page(s)
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/48143
Description: For a prime p, we obtain an upper bound on the discrepancy of fractions r/p, where r runs through all of roots modulo p of all monic univariate polynomials of degree d whose vector of coefficients bel ... More
Full Text: Full Text
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/41852
Description: We estimate character sums over points on elliptic curves over a finite field Fq of q elements. Pseudorandom sequences can be constructed by taking linear combinations with small coefficients (for exa ... More
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/25122
Description: We define Wieferich numbers to be those odd integers w ≥ 3 that satisfy the congruence 2 φ(w)≡ 1(mod w²). It is clear that the distribution of Wieferich numbers is closely related to the distribution ... More
Reviewed: Reviewed
Date: 2007
Subject Keyword: 010100 Pure Mathematics
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/1159038
Description: 15 page(s)
Reviewed: Reviewed
Date: 2007
Language: eng
Resource Type: journal article
Identifier: http://hdl.handle.net/1959.14/25302
Description: We estimate exponential sums of the form [equation omitted for formatting reasons] where f is a polynomial with integer cofficients, and ind n is the discrete logarithm of n modulo an odd prime p and ... More
Reviewed: Reviewed