Constructing Tight Gabor Frames using CAZAC Sequences

Size: px
Start display at page:

Download "Constructing Tight Gabor Frames using CAZAC Sequences"

Transcription

1 Constructing Tight Gabor Frames using CAZAC Sequences Mark Magsino Norbert Wiener Center for Harmonic Analysis and Applications Department of Mathematics University of Maryland, College Park April 15, 2018

2 CAZAC Definition Let ϕ C N. ϕ is said to be a constant amplitude zero autocorrelation (CAZAC) sequence if and j (Z/NZ), ϕ j = 1 k (Z/NZ), k 0, 1 N N 1 j=0 ϕ j+k ϕ j = 0. (CA) (ZAC)

3 Examples Quadratic Phase Sequences Let ϕ C N and suppose for each j, ϕ j is of the form ϕ j = e πip(j) where p is a quadratic polynomial. The following quadratic polynomials generate CAZAC sequences: Chu: p(j) = j(j 1) P4: p(j) = j(j N), N is odd Odd-length Wiener: p(j) = sj 2, gcd(s, N) = 1, N is odd Even-length Wiener: p(j) = sj 2 /2, gcd(s, 2N) = 1, N is even

4 Examples Let p be prime. Then, the Legendre symbol is defined as follows, ( ) j 0 if j 0 mod p, = 1 if j k p 2 mod p has a solution, 1 if j k 2 mod p does not have a solution.

5 Examples Björck Sequences Let p be prime and ϕ C p be of the form ϕ j = e iθ(j). Then ϕ will be CAZAC in the following cases: If p 1 mod 4, then, ( ) ( ) j 1 θ(j) = arccos p 1 + p If p 3 mod 4, then, { ( ) ( ) arccos 1 p 1+p, if j p = 1 θ j = 0, otherwise

6 Connection to Hadamard Matrices Theorem Let ϕ C N and let H be the circulant matrix given by H = ϕ τ 1 ϕ τ 2 ϕ τ N 1 ϕ Then, ϕ is a CAZAC sequence if and only if H is Hadamard, i.e. H H = NId N and H ij = 1 for every (i, j). In particular there is a one-to-one correspondence between CAZAC sequences and circulant Hadamard matrices.

7 Connection to Cyclic N-roots Definition x C N is a cyclic N-root if it satisfies x 0 + x x N 1 = 0 x 0 x 1 + x 1 x x N 1 x 0 = 0 x 0 x 1 x 2 x N 1 = 1

8 Connection to Cyclic N-roots Theorem (a) If ϕ C N is a CAZAC sequence then, ( ϕ1, ϕ 2,, ϕ 0 ϕ 1 is a cyclic N-root. (b) If x C N is a cyclic N-root then, is a CAZAC sequence. ϕ 0 ϕ N 1 ϕ 0 = x 0, ϕ j = ϕ j 1 x j (c) There is a one-to-one correspondence between CAZAC sequences which start with 1 and cyclic N-roots. )

9 Gabor Frames Definition (a) Let ϕ C N and Λ (Z/NZ) (Z/NZ). The Gabor system, (ϕ, Λ) is defined by (ϕ, Λ) = {e l τ k ϕ : (k, l) Λ}. (b) If (ϕ, Λ) is a frame for C N we call it a Gabor frame.

10 Time-Frequency Transforms Definition Let ϕ, ψ C N. (a) The discrete periodic ambiguity function of ϕ, A p (ϕ), is defined by A p (ϕ)[k, l] = 1 N N 1 j=0 ϕ[j + k]ϕ[j]e 2πijl/N = 1 N τ kϕ, e l ϕ. (b) The short-time Fourier transform of ϕ with window ψ, V ψ (ϕ), is defined by V ψ (ϕ)[k, l] = ϕ, e l τ k ψ.

11 Full Gabor Frames Are Always Tight Theorem Let ϕ C N \ {0}. and Λ = (Z/NZ) (Z/NZ). Then, (ϕ, Λ) is always a tight frame with frame bound N ϕ 2 2.

12 Janssen s Representation Definition Let Λ (Z/NZ) (Z/NZ) be a subgroup. The adjoint subgroup of Λ, Λ (Z/NZ) (Z/NZ), is defined by Λ = {(m, n) : e l τ k e n τ m = e n τ m e l τ k, (k, l) Λ} Theorem (Janssen 95) Let Λ be a subgroup of (Z/NZ) (Z/NZ) and ϕ C N. Then, the (ϕ, Λ) Gabor frame operator has the form S = Λ N (m,n) Λ ϕ, e n τ m ϕ e n τ m.

13 Λ -sparsity and Tight Frames Theorem (MM 17) Let ϕ C N \ {0} and let Λ (Z/NZ) (Z/NZ) be a subgroup. (ϕ, Λ) is a tight frame if and only if (m, n) Λ, A p (ϕ)[m, n] = 0. The frame bound is Λ A p (ϕ)[0, 0].

14 DPAF of Chu Sequence DPAF of length 15 Chu sequence A p (ϕ Chu )[k, l] : { e πi(k2 k)/n, k l mod N 0, otherwise Doppler Shift Magnitude Time Shift 0.0 Figure: DPAF of length 15 Chu sequence.

15 Example: Chu/P4 Seqeunce Proposition Let N = abn where gcd (a, b) = 1 and ϕ C N be the Chu or P4 sequence. Define K = a, L = b and Λ = K L. (a) Λ = N a N b. (b) (ϕ, Λ) is a tight Gabor frame bound NN.

16 DPAF of Even Length Wiener Sequence DPAF of a 16 length Wiener sequence A p (ϕ Wiener )[k, l] : { e πisk2 /N, sk l mod N 0, otherwise Doppler Shift Magnitude Time Shift 0.0 Figure: DPAF of length 16 P4 sequence.

17 DPAF of Björck Sequence DPAF of length 13 Bjorck sequence Doppler Shift Magnitude Time Shift 0.0 Figure: DPAF of length 13 Björck sequence.

18 DPAF of a Kronecker Product Sequence 27 DPAF of Bjorck(7) ( P4(4) Kronecker Product: Let u C M, v C N. (u v)[am + b] = u[a]v[b] Dopp er Shift Magnitude Time Shift 0.0 Figure: DPAF of Kroneker product of length 7 Bjorck and length 4 P4.

19 Example: Kronecker Product Sequence Proposition Let u C M be CAZAC, v C N be CA, and ϕ C MN be defined by the Kronecker product: ϕ = u v. If gcd (M, N) = 1 and Λ = M N, then (ϕ, Λ) is a tight frame with frame bound MN.

20 Gram Matrices and Discrete Periodic Ambiguity Functions Definition Let F = {v i } M i=1 be a frame for CN. The Gram matrix, G, is defined by G ij = v i, v j. In the case of Gabor frames F = {e lm τ km ϕ : m 0,, M 1}, we can write the Gram matrix in terms of the discrete periodic ambiguity function of ϕ: G mn = Ne 2πikn(ln lm)/n A p (ϕ)[k n k m, l n l m ]

21 Gram Matrix of Chu and P4 Sequences Lemma Let ϕ C N be the Chu or P4 sequence and let N = abn where gcd(a, b) = 1. Suppose G is the Gram matrix generated by the Gabor system (ϕ, K L) where K = a and L = b. Then, (a) The support of the rows (or columns) of G either completely conincide or are completely disjoint. (b) If two rows (or columns) have coinciding supports, they are scalar multiples of each other.

22 Example: P4 Gram Matrix

23 Tight Frames from Gram Matrix Theorem Let ϕ C N be the Chu or P4 sequence and let N = abn where gcd(a, b) = 1. Suppose G is the Gram matrix generated by the Gabor system (ϕ, K L) where K = a and L = b. Then, (a) rank(g) = N. (b) G has exactly one nonzero eigenvalue, NN. In particular (a) and (b) together imply that the Gabor system (ϕ, K L) is a tight frame with frame bound NN.

Constant Amplitude and Zero Autocorrelation Sequences and Single Pixel Camera Imaging

Constant Amplitude and Zero Autocorrelation Sequences and Single Pixel Camera Imaging Constant Amplitude and Zero Autocorrelation Sequences and Single Pixel Camera Imaging Mark Magsino mmagsino@math.umd.edu Norbert Wiener Center for Harmonic Analysis and Applications Department of Mathematics

More information

Aperiodic correlation and the merit factor

Aperiodic correlation and the merit factor Aperiodic correlation and the merit factor Aina Johansen 02.11.2009 Correlation The periodic correlation between two binary sequences {x t } and {y t } of length n at shift τ is defined as n 1 θ x,y (τ)

More information

Objective Type Questions

Objective Type Questions DISTANCE EDUCATION, UNIVERSITY OF CALICUT NUMBER THEORY AND LINEARALGEBRA Objective Type Questions Shyama M.P. Assistant Professor Department of Mathematics Malabar Christian College, Calicut 7/3/2014

More information

MATH 420 FINAL EXAM J. Beachy, 5/7/97

MATH 420 FINAL EXAM J. Beachy, 5/7/97 MATH 420 FINAL EXAM J. Beachy, 5/7/97 1. (a) For positive integers a and b, define gcd(a, b). (b) Compute gcd(1776, 1492). (c) Show that if a, b, c are positive integers, then gcd(a, bc) = 1 if and only

More information

Frames and a vector-valued ambiguity function

Frames and a vector-valued ambiguity function Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu Outline 1 Problem and goal 2 Frames 3 Multiplication problem and A 1 p 4 A d p : Z

More information

Approximating scalable frames

Approximating scalable frames Kasso Okoudjou joint with X. Chen, G. Kutyniok, F. Philipp, R. Wang Department of Mathematics & Norbert Wiener Center University of Maryland, College Park 5 th International Conference on Computational

More information

4 Powers of an Element; Cyclic Groups

4 Powers of an Element; Cyclic Groups 4 Powers of an Element; Cyclic Groups Notation When considering an abstract group (G, ), we will often simplify notation as follows x y will be expressed as xy (x y) z will be expressed as xyz x (y z)

More information

Application of Block Matrix Theory to Obtain the Inverse Transform of the Vector-Valued DFT

Application of Block Matrix Theory to Obtain the Inverse Transform of the Vector-Valued DFT Applied Mathematical Sciences, Vol. 9, 2015, no. 52, 2567-2577 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2015.52125 Application of Block Matrix Theory to Obtain the Inverse Transform

More information

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences.

MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. MATH 433 Applied Algebra Lecture 4: Modular arithmetic (continued). Linear congruences. Congruences Let n be a postive integer. The integers a and b are called congruent modulo n if they have the same

More information

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS

AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS AUTOMORPHISM GROUPS AND SPECTRA OF CIRCULANT GRAPHS MAX GOLDBERG Abstract. We explore ways to concisely describe circulant graphs, highly symmetric graphs with properties that are easier to generalize

More information

arxiv: v1 [math.co] 3 Nov 2014

arxiv: v1 [math.co] 3 Nov 2014 SPARSE MATRICES DESCRIBING ITERATIONS OF INTEGER-VALUED FUNCTIONS BERND C. KELLNER arxiv:1411.0590v1 [math.co] 3 Nov 014 Abstract. We consider iterations of integer-valued functions φ, which have no fixed

More information

Frames and some algebraic forays

Frames and some algebraic forays John J. Benedetto Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu Acknowledgements ARO W911NF-17-1-0014 and NSF DMS 18-14253 Collaborators

More information

CS 6260 Some number theory

CS 6260 Some number theory CS 6260 Some number theory Let Z = {..., 2, 1, 0, 1, 2,...} denote the set of integers. Let Z+ = {1, 2,...} denote the set of positive integers and N = {0, 1, 2,...} the set of non-negative integers. If

More information

ECEN 5022 Cryptography

ECEN 5022 Cryptography Elementary Algebra and Number Theory University of Colorado Spring 2008 Divisibility, Primes Definition. N denotes the set {1, 2, 3,...} of natural numbers and Z denotes the set of integers {..., 2, 1,

More information

18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z).

18.312: Algebraic Combinatorics Lionel Levine. Lecture 22. Smith normal form of an integer matrix (linear algebra over Z). 18.312: Algebraic Combinatorics Lionel Levine Lecture date: May 3, 2011 Lecture 22 Notes by: Lou Odette This lecture: Smith normal form of an integer matrix (linear algebra over Z). 1 Review of Abelian

More information

0 Sets and Induction. Sets

0 Sets and Induction. Sets 0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set

More information

Mathematics for Cryptography

Mathematics for Cryptography Mathematics for Cryptography Douglas R. Stinson David R. Cheriton School of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1, Canada March 15, 2016 1 Groups and Modular Arithmetic 1.1

More information

Notes on tensor products. Robert Harron

Notes on tensor products. Robert Harron Notes on tensor products Robert Harron Department of Mathematics, Keller Hall, University of Hawai i at Mānoa, Honolulu, HI 96822, USA E-mail address: rharron@math.hawaii.edu Abstract. Graduate algebra

More information

18.S34 linear algebra problems (2007)

18.S34 linear algebra problems (2007) 18.S34 linear algebra problems (2007) Useful ideas for evaluating determinants 1. Row reduction, expanding by minors, or combinations thereof; sometimes these are useful in combination with an induction

More information

CAZAC SEQUENCES AND HAAGERUP S CHARACTERIZATION OF CYCLIC N ROOTS

CAZAC SEQUENCES AND HAAGERUP S CHARACTERIZATION OF CYCLIC N ROOTS CAZAC SEQUENCES AND HAAGERUP S CHARACTERIZATION OF CYCLIC N ROOTS JOHN J. BENEDETTO, KATHERINE CORDWELL, AND ARK AGSINO Abstract. Constant amplitude zero autocorrelation (CAZAC) sequences play an important

More information

A Series of Regular Hadamard Matrices

A Series of Regular Hadamard Matrices A Series of Regular Hadamard Matrices Dean Crnković Abstract Let p and p 1 be prime powers and p 3 (mod 4). Then there exists a symmetric design with parameters (4p,p p,p p). Thus there exists a regular

More information

Elementary Number Theory Review. Franz Luef

Elementary Number Theory Review. Franz Luef Elementary Number Theory Review Principle of Induction Principle of Induction Suppose we have a sequence of mathematical statements P(1), P(2),... such that (a) P(1) is true. (b) If P(k) is true, then

More information

Waveform design and quantum detection matched filtering

Waveform design and quantum detection matched filtering Waveform design and quantum detection matched filtering John J. Benedetto Norbert Wiener Center, Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu Waveform

More information

A connection between number theory and linear algebra

A connection between number theory and linear algebra A connection between number theory and linear algebra Mark Steinberger Contents 1. Some basics 1 2. Rational canonical form 2 3. Prime factorization in F[x] 4 4. Units and order 5 5. Finite fields 7 6.

More information

Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach

Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach Generic degree structure of the minimal polynomial nullspace basis: a block Toeplitz matrix approach Bhaskar Ramasubramanian 1, Swanand R. Khare and Madhu N. Belur 3 December 17, 014 1 Department of Electrical

More information

PROBLEMS ON LINEAR ALGEBRA

PROBLEMS ON LINEAR ALGEBRA 1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.

More information

M381 Number Theory 2004 Page 1

M381 Number Theory 2004 Page 1 M81 Number Theory 2004 Page 1 [[ Comments are written like this. Please send me (dave@wildd.freeserve.co.uk) details of any errors you find or suggestions for improvements. ]] Question 1 20 = 2 * 10 +

More information

Math 354 Transition graphs and subshifts November 26, 2014

Math 354 Transition graphs and subshifts November 26, 2014 Math 54 Transition graphs and subshifts November 6, 04. Transition graphs Let I be a closed interval in the real line. Suppose F : I I is function. Let I 0, I,..., I N be N closed subintervals in I with

More information

LOCAL AND GLOBAL STABILITY OF FUSION FRAMES

LOCAL AND GLOBAL STABILITY OF FUSION FRAMES LOCAL AND GLOBAL STABILITY OF FUSION FRAMES Jerry Emidih Norbert Wiener Center Department of Mathematics University of Maryland, College Park November 22 2016 OUTLINE 1 INTRO 2 3 4 5 OUTLINE 1 INTRO 2

More information

Roots of Sparse Polynomials over a Finite Field

Roots of Sparse Polynomials over a Finite Field ANTS-XII August 30, 2016 Sparsity-Dependant Bounds f(x) = c 0 + c 1 x a 1 + c 2 x a 2 + + c t x at R[x]. f is sparse if t deg f. Descartes Rule of Signs: The number of positive, real roots of f is bounded

More information

Matrix Arithmetic. j=1

Matrix Arithmetic. j=1 An m n matrix is an array A = Matrix Arithmetic a 11 a 12 a 1n a 21 a 22 a 2n a m1 a m2 a mn of real numbers a ij An m n matrix has m rows and n columns a ij is the entry in the i-th row and j-th column

More information

Lecture Notes. Advanced Discrete Structures COT S

Lecture Notes. Advanced Discrete Structures COT S Lecture Notes Advanced Discrete Structures COT 4115.001 S15 2015-01-13 Recap Divisibility Prime Number Theorem Euclid s Lemma Fundamental Theorem of Arithmetic Euclidean Algorithm Basic Notions - Section

More information

Galois Theory TCU Graduate Student Seminar George Gilbert October 2015

Galois Theory TCU Graduate Student Seminar George Gilbert October 2015 Galois Theory TCU Graduate Student Seminar George Gilbert October 201 The coefficients of a polynomial are symmetric functions of the roots {α i }: fx) = x n s 1 x n 1 + s 2 x n 2 + + 1) n s n, where s

More information

Construction of latin squares of prime order

Construction of latin squares of prime order Construction of latin squares of prime order Theorem. If p is prime, then there exist p 1 MOLS of order p. Construction: The elements in the latin square will be the elements of Z p, the integers modulo

More information

Chapter 3 Transformations

Chapter 3 Transformations Chapter 3 Transformations An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Linear Transformations A function is called a linear transformation if 1. for every and 2. for every If we fix the bases

More information

Preconditioning techniques in frame theory and probabilistic frames

Preconditioning techniques in frame theory and probabilistic frames Preconditioning techniques in frame theory and probabilistic frames Department of Mathematics & Norbert Wiener Center University of Maryland, College Park AMS Short Course on Finite Frame Theory: A Complete

More information

The Jacobi Symbol. q q 1 q 2 q n

The Jacobi Symbol. q q 1 q 2 q n The Jacobi Symbol It s a little inconvenient that the Legendre symbol a is only defined when the bottom is an odd p prime You can extend the definition to allow an odd positive number on the bottom using

More information

Math 210A: Algebra, Homework 5

Math 210A: Algebra, Homework 5 Math 210A: Algebra, Homework 5 Ian Coley November 5, 2013 Problem 1. Prove that two elements σ and τ in S n are conjugate if and only if type σ = type τ. Suppose first that σ and τ are cycles. Suppose

More information

APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION. Let V be a finite dimensional inner product space spanned by basis vector functions

APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION. Let V be a finite dimensional inner product space spanned by basis vector functions 301 APPENDIX B GRAM-SCHMIDT PROCEDURE OF ORTHOGONALIZATION Let V be a finite dimensional inner product space spanned by basis vector functions {w 1, w 2,, w n }. According to the Gram-Schmidt Process an

More information

Spectra of Semidirect Products of Cyclic Groups

Spectra of Semidirect Products of Cyclic Groups Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with

More information

ELE/MCE 503 Linear Algebra Facts Fall 2018

ELE/MCE 503 Linear Algebra Facts Fall 2018 ELE/MCE 503 Linear Algebra Facts Fall 2018 Fact N.1 A set of vectors is linearly independent if and only if none of the vectors in the set can be written as a linear combination of the others. Fact N.2

More information

1 Determinants. 1.1 Determinant

1 Determinants. 1.1 Determinant 1 Determinants [SB], Chapter 9, p.188-196. [SB], Chapter 26, p.719-739. Bellow w ll study the central question: which additional conditions must satisfy a quadratic matrix A to be invertible, that is to

More information

Math 312/ AMS 351 (Fall 17) Sample Questions for Final

Math 312/ AMS 351 (Fall 17) Sample Questions for Final Math 312/ AMS 351 (Fall 17) Sample Questions for Final 1. Solve the system of equations 2x 1 mod 3 x 2 mod 7 x 7 mod 8 First note that the inverse of 2 is 2 mod 3. Thus, the first equation becomes (multiply

More information

TC08 / 6. Hadamard codes SX

TC08 / 6. Hadamard codes SX TC8 / 6. Hadamard codes 3.2.7 SX Hadamard matrices Hadamard matrices. Paley s construction of Hadamard matrices Hadamard codes. Decoding Hadamard codes A Hadamard matrix of order is a matrix of type whose

More information

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018

Department of Mathematics, University of California, Berkeley. GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018 Department of Mathematics, University of California, Berkeley YOUR 1 OR 2 DIGIT EXAM NUMBER GRADUATE PRELIMINARY EXAMINATION, Part A Fall Semester 2018 1. Please write your 1- or 2-digit exam number on

More information

TC10 / 3. Finite fields S. Xambó

TC10 / 3. Finite fields S. Xambó TC10 / 3. Finite fields S. Xambó The ring Construction of finite fields The Frobenius automorphism Splitting field of a polynomial Structure of the multiplicative group of a finite field Structure of the

More information

Waveform design and Sigma-Delta quantization

Waveform design and Sigma-Delta quantization . p.1/41 Waveform design and Sigma-Delta quantization John J. Benedetto Norbert Wiener Center, Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu . p.2/41 Outline

More information

Lecture # 12. Agenda: I. Vector Program Relaxation for Max Cut problem. Consider the vectors are in a sphere. Lecturer: Prof.

Lecture # 12. Agenda: I. Vector Program Relaxation for Max Cut problem. Consider the vectors are in a sphere. Lecturer: Prof. Lecture # 12 Lecturer: Prof. Allan Borodin Scribe: Yeleiny Bonilla Agenda: I. Finish discussion of Vector Program Relaxation for Max-Cut problem. II. Briefly discuss same approach for Max-2-Sat. III. The

More information

PRODUCT THEOREMS IN SL 2 AND SL 3

PRODUCT THEOREMS IN SL 2 AND SL 3 PRODUCT THEOREMS IN SL 2 AND SL 3 1 Mei-Chu Chang Abstract We study product theorems for matrix spaces. In particular, we prove the following theorems. Theorem 1. For all ε >, there is δ > such that if

More information

Part II. Number Theory. Year

Part II. Number Theory. Year Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler

More information

On The Weights of Binary Irreducible Cyclic Codes

On The Weights of Binary Irreducible Cyclic Codes On The Weights of Binary Irreducible Cyclic Codes Yves Aubry and Philippe Langevin Université du Sud Toulon-Var, Laboratoire GRIM F-83270 La Garde, France, {langevin,yaubry}@univ-tln.fr, WWW home page:

More information

Course 2316 Sample Paper 1

Course 2316 Sample Paper 1 Course 2316 Sample Paper 1 Timothy Murphy April 19, 2015 Attempt 5 questions. All carry the same mark. 1. State and prove the Fundamental Theorem of Arithmetic (for N). Prove that there are an infinity

More information

Complex Hadamard matrices and 3-class association schemes

Complex Hadamard matrices and 3-class association schemes Complex Hadamard matrices and 3-class association schemes Akihiro Munemasa 1 1 Graduate School of Information Sciences Tohoku University (joint work with Takuya Ikuta) June 26, 2013 The 30th Algebraic

More information

AN EXTENSION OF A THEOREM OF EULER. 1. Introduction

AN EXTENSION OF A THEOREM OF EULER. 1. Introduction AN EXTENSION OF A THEOREM OF EULER NORIKO HIRATA-KOHNO, SHANTA LAISHRAM, T. N. SHOREY, AND R. TIJDEMAN Abstract. It is proved that equation (1 with 4 109 does not hold. The paper contains analogous result

More information

Lecture 7 Cyclic groups and subgroups

Lecture 7 Cyclic groups and subgroups Lecture 7 Cyclic groups and subgroups Review Types of groups we know Numbers: Z, Q, R, C, Q, R, C Matrices: (M n (F ), +), GL n (F ), where F = Q, R, or C. Modular groups: Z/nZ and (Z/nZ) Dihedral groups:

More information

88 CHAPTER 3. SYMMETRIES

88 CHAPTER 3. SYMMETRIES 88 CHAPTER 3 SYMMETRIES 31 Linear Algebra Start with a field F (this will be the field of scalars) Definition: A vector space over F is a set V with a vector addition and scalar multiplication ( scalars

More information

Linear Systems and Matrices

Linear Systems and Matrices Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......

More information

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition).

Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Selected exercises from Abstract Algebra by Dummit and Foote (3rd edition). Bryan Félix Abril 12, 2017 Section 2.1 Exercise (6). Let G be an abelian group. Prove that T = {g G g < } is a subgroup of G.

More information

2015 Hypatia Contest

2015 Hypatia Contest The CENTRE for EDUCATION in MATHEMATICS and COMPUTING cemc.uwaterloo.ca 015 Hypatia Contest Thursday, April 16, 015 (in North America and South America) Friday, April 17, 015 (outside of North America

More information

Boolean Inner-Product Spaces and Boolean Matrices

Boolean Inner-Product Spaces and Boolean Matrices Boolean Inner-Product Spaces and Boolean Matrices Stan Gudder Department of Mathematics, University of Denver, Denver CO 80208 Frédéric Latrémolière Department of Mathematics, University of Denver, Denver

More information

MATH 361: NUMBER THEORY FOURTH LECTURE

MATH 361: NUMBER THEORY FOURTH LECTURE MATH 361: NUMBER THEORY FOURTH LECTURE 1. Introduction Everybody knows that three hours after 10:00, the time is 1:00. That is, everybody is familiar with modular arithmetic, the usual arithmetic of the

More information

Topic 3. Design of Sequences with Low Correlation

Topic 3. Design of Sequences with Low Correlation Topic 3. Design of Sequences with Low Correlation M-sequences and Quadratic Residue Sequences 2 Multiple Trace Term Sequences and WG Sequences 3 Gold-pair, Kasami Sequences, and Interleaved Sequences 4

More information

The group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer.

The group (Z/nZ) February 17, In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. The group (Z/nZ) February 17, 2016 1 Introduction In these notes we figure out the structure of the unit group (Z/nZ) where n > 1 is an integer. If we factor n = p e 1 1 pe, where the p i s are distinct

More information

Quantum algorithms for computing short discrete logarithms and factoring RSA integers

Quantum algorithms for computing short discrete logarithms and factoring RSA integers Quantum algorithms for computing short discrete logarithms and factoring RSA integers Martin Ekerå, Johan Håstad February, 07 Abstract In this paper we generalize the quantum algorithm for computing short

More information

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006

Divisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006 Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18

More information

Graph theoretic uncertainty principles

Graph theoretic uncertainty principles Graph theoretic uncertainty principles John J. Benedetto and Paul J. Koprowski Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu Acknowledgements

More information

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA

RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Discussiones Mathematicae General Algebra and Applications 23 (2003 ) 125 137 RANK AND PERIMETER PRESERVER OF RANK-1 MATRICES OVER MAX ALGEBRA Seok-Zun Song and Kyung-Tae Kang Department of Mathematics,

More information

Matrix rigidity and elimination theory

Matrix rigidity and elimination theory Matrix rigidity and elimination theory Abhinav Kumar joint work with Satya Lokam, Vijay Patankar and Jalayal Sarma M.N. MIT April 25, 2012 Abhinav Kumar (MIT) Matrix rigidity and elimination theory April

More information

Cosets and Normal Subgroups

Cosets and Normal Subgroups Cosets and Normal Subgroups (Last Updated: November 3, 2017) These notes are derived primarily from Abstract Algebra, Theory and Applications by Thomas Judson (16ed). Most of this material is drawn from

More information

Simultaneous Linear, and Non-linear Congruences

Simultaneous Linear, and Non-linear Congruences Simultaneous Linear, and Non-linear Congruences CIS002-2 Computational Alegrba and Number Theory David Goodwin david.goodwin@perisic.com 09:00, Friday 18 th November 2011 Outline 1 Polynomials 2 Linear

More information

From Bernstein approximation to Zauner s conjecture

From Bernstein approximation to Zauner s conjecture From Bernstein approximation to Zauner s conjecture Shayne Waldron Mathematics Department, University of Auckland December 5, 2017 Shayne Waldron (University of Auckland) Workshop on Spline Approximation

More information

1. General Vector Spaces

1. General Vector Spaces 1.1. Vector space axioms. 1. General Vector Spaces Definition 1.1. Let V be a nonempty set of objects on which the operations of addition and scalar multiplication are defined. By addition we mean a rule

More information

EIGENVALUES AND EIGENVECTORS 3

EIGENVALUES AND EIGENVECTORS 3 EIGENVALUES AND EIGENVECTORS 3 1. Motivation 1.1. Diagonal matrices. Perhaps the simplest type of linear transformations are those whose matrix is diagonal (in some basis). Consider for example the matrices

More information

Matrices: 2.1 Operations with Matrices

Matrices: 2.1 Operations with Matrices Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,

More information

Advanced Digital Signal Processing -Introduction

Advanced Digital Signal Processing -Introduction Advanced Digital Signal Processing -Introduction LECTURE-2 1 AP9211- ADVANCED DIGITAL SIGNAL PROCESSING UNIT I DISCRETE RANDOM SIGNAL PROCESSING Discrete Random Processes- Ensemble Averages, Stationary

More information

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any

More information

Math 2070BC Term 2 Weeks 1 13 Lecture Notes

Math 2070BC Term 2 Weeks 1 13 Lecture Notes Math 2070BC 2017 18 Term 2 Weeks 1 13 Lecture Notes Keywords: group operation multiplication associative identity element inverse commutative abelian group Special Linear Group order infinite order cyclic

More information

Problem 1A. Use residues to compute. dx x

Problem 1A. Use residues to compute. dx x Problem 1A. A non-empty metric space X is said to be connected if it is not the union of two non-empty disjoint open subsets, and is said to be path-connected if for every two points a, b there is a continuous

More information

EXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients.

EXERCISES IN MODULAR FORMS I (MATH 726) (2) Prove that a lattice L is integral if and only if its Gram matrix has integer coefficients. EXERCISES IN MODULAR FORMS I (MATH 726) EYAL GOREN, MCGILL UNIVERSITY, FALL 2007 (1) We define a (full) lattice L in R n to be a discrete subgroup of R n that contains a basis for R n. Prove that L is

More information

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT

SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT SUMMARY ALGEBRA I LOUIS-PHILIPPE THIBAULT Contents 1. Group Theory 1 1.1. Basic Notions 1 1.2. Isomorphism Theorems 2 1.3. Jordan- Holder Theorem 2 1.4. Symmetric Group 3 1.5. Group action on Sets 3 1.6.

More information

Eigenvalues and Eigenvectors

Eigenvalues and Eigenvectors 5 Eigenvalues and Eigenvectors 5.2 THE CHARACTERISTIC EQUATION DETERMINANATS n n Let A be an matrix, let U be any echelon form obtained from A by row replacements and row interchanges (without scaling),

More information

MULTILINEAR ALGEBRA: THE TENSOR PRODUCT

MULTILINEAR ALGEBRA: THE TENSOR PRODUCT MULTILINEAR ALGEBRA: THE TENSOR PRODUCT This writeup is drawn closely from chapter 27 of Paul Garrett s text Abstract Algebra, available from Chapman and Hall/CRC publishers and also available online at

More information

On Extremal Codes With Automorphisms

On Extremal Codes With Automorphisms On Extremal Codes With Automorphisms Anton Malevich Magdeburg, 20 April 2010 joint work with S. Bouyuklieva and W. Willems 1/ 33 1. Linear codes 2. Self-dual and extremal codes 3. Quadratic residue codes

More information

a 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2,

a 2 + b 2 = (p 2 q 2 ) 2 + 4p 2 q 2 = (p 2 + q 2 ) 2 = c 2, 5.3. Pythagorean triples Definition. A Pythagorean triple is a set (a, b, c) of three integers such that (in order) a 2 + b 2 c 2. We may as well suppose that all of a, b, c are non-zero, and positive.

More information

Laplacians of Graphs, Spectra and Laplacian polynomials

Laplacians of Graphs, Spectra and Laplacian polynomials Mednykh A. D. (Sobolev Institute of Math) Laplacian for Graphs 27 June - 03 July 2015 1 / 30 Laplacians of Graphs, Spectra and Laplacian polynomials Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk

More information

11 Block Designs. Linear Spaces. Designs. By convention, we shall

11 Block Designs. Linear Spaces. Designs. By convention, we shall 11 Block Designs Linear Spaces In this section we consider incidence structures I = (V, B, ). always let v = V and b = B. By convention, we shall Linear Space: We say that an incidence structure (V, B,

More information

A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs

A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly Regular Graphs Journal of Combinatorial Theory, Series A 98, 118 126 (2002) doi:10.1006/jcta.2001.3231, available online at http://www.idealibrary.com on A Block Negacyclic Bush-Type Hadamard Matrix and Two Strongly

More information

Gabor Frames for Quasicrystals II: Gap Labeling, Morita Equivale

Gabor Frames for Quasicrystals II: Gap Labeling, Morita Equivale Gabor Frames for Quasicrystals II: Gap Labeling, Morita Equivalence, and Dual Frames University of Maryland June 11, 2015 Overview Twisted Gap Labeling Outline Twisted Gap Labeling Physical Quasicrystals

More information

Gauss periods as low complexity normal bases

Gauss periods as low complexity normal bases With M. Christopoulou, T. Garefalakis (Crete) and D. Panario (Carleton) July 16, 2009 Outline 1 Gauss periods as normal bases Normal bases Gauss periods 2 Traces of normal bases The trace of Gauss periods

More information

Linear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011

Linear Algebra. Paul Yiu. 6D: 2-planes in R 4. Department of Mathematics Florida Atlantic University. Fall 2011 Linear Algebra Paul Yiu Department of Mathematics Florida Atlantic University Fall 2011 6D: 2-planes in R 4 The angle between a vector and a plane The angle between a vector v R n and a subspace V is the

More information

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra. DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1

More information

Equiangular lines in Euclidean spaces

Equiangular lines in Euclidean spaces Equiangular lines in Euclidean spaces Gary Greaves 東北大学 Tohoku University 14th August 215 joint work with J. Koolen, A. Munemasa, and F. Szöllősi. Gary Greaves Equiangular lines in Euclidean spaces 1/23

More information

A Few Primality Testing Algorithms

A Few Primality Testing Algorithms A Few Primality Testing Algorithms Donald Brower April 2, 2006 0.1 Introduction These notes will cover a few primality testing algorithms. There are many such, some prove that a number is prime, others

More information

Math Introduction to Modern Algebra

Math Introduction to Modern Algebra Math 343 - Introduction to Modern Algebra Notes Rings and Special Kinds of Rings Let R be a (nonempty) set. R is a ring if there are two binary operations + and such that (A) (R, +) is an abelian group.

More information

Short-time Fourier transform for quaternionic signals

Short-time Fourier transform for quaternionic signals Short-time Fourier transform for quaternionic signals Joint work with Y. Fu and U. Kähler P. Cerejeiras Departamento de Matemática Universidade de Aveiro pceres@ua.pt New Trends and Directions in Harmonic

More information

(II.B) Basis and dimension

(II.B) Basis and dimension (II.B) Basis and dimension How would you explain that a plane has two dimensions? Well, you can go in two independent directions, and no more. To make this idea precise, we formulate the DEFINITION 1.

More information

On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem

On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem On the singular elements of a semisimple Lie algebra and the generalized Amitsur-Levitski Theorem Bertram Kostant, MIT Conference on Representations of Reductive Groups Salt Lake City, Utah July 10, 2013

More information

Properties of Linear Transformations from R n to R m

Properties of Linear Transformations from R n to R m Properties of Linear Transformations from R n to R m MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Topic Overview Relationship between the properties of a matrix transformation

More information

Shor s Prime Factorization Algorithm

Shor s Prime Factorization Algorithm Shor s Prime Factorization Algorithm Bay Area Quantum Computing Meetup - 08/17/2017 Harley Patton Outline Why is factorization important? Shor s Algorithm Reduction to Order Finding Order Finding Algorithm

More information

Name: Solutions - AI FINAL EXAM

Name: Solutions - AI FINAL EXAM 1 2 3 4 5 6 7 8 9 10 11 12 13 total Name: Solutions - AI FINAL EXAM The first 7 problems will each count 10 points. The best 3 of # 8-13 will count 10 points each. Total is 100 points. A 4th problem from

More information