A New Use of Group Representation Theory in Statistics

Size: px
Start display at page:

Download "A New Use of Group Representation Theory in Statistics"

Transcription

1

2 The (imprecise) Math Problem symmetrize f(x, y) Given a function of two variables, f(x, y), symmetrize it to produce a new function f(x, y) that satisfies the following: f(x, y) = f( x, y x) = f(y, x) = f(x y, y) = f( y, x y) = f(y x, x) /

3 The (imprecise) Math Problem symmetrize f(x, y) Given a function of two variables, f(x, y), symmetrize it to produce a new function f(x, y) that satisfies the following: f(x, y) = f( x, y x) = f(y, x) = f(x y, y) = f( y, x y) = f(y x, x) ( ) ( ) f(x, y) = f(x, 1 0 y) f(x, y) = 0 1 f(x 1 1 y, y) 0 1 ( ) ( ) f(x, y) = f( x, 1 0 y x) f(x, y) = 1 1 f( y, 0 1 x y) 1 1 ( ) ( ) f(x, y) = f(y, 0 1 x) f(x, y) = 1 0 f(y 1 1 x, x) /

4 Stationarity A Statistical Notion Definition (third-order stationarity) A mean zero sequence of random variables {X t } is called third-order stationary if C(x, y) := E(X t, X t+x X t+y ) is the same for all t. Example (identity induced by σ = (12)) C(x, y) = E[X t X t+x X t+y ] (12) = E[X t+x X t X t+y ] t t x = E[X t X t x X t x+y ] = C( x, y x) 3 /

5 Identifying a Group Representation Define τ : R 2 R 3 as τ(a, b) (0, a, b). Let σ be a permutation in S 3. Define ψ : R 3 R 2 as ψ(a, b, c) (b a, c a). Example (σ = (12) S 3 ) (x, y) τ (0, x, y) σ (x, 0, y) ψ ( x, y x) ( 1 ) This leads to a three-way correspondence among permutations in S 3, matrices in GL 2 (R), and symmetries imposed on f(x, y). Example (σ = (1234) S 4 ) (x, y, z) τ (0, x, y, z) σ (z, 0, x, y) ψ ( z, x z, y z) /

6 Identifying a Group Representation Define τ : R 2 R 3 as τ(a, b) (0, a, b). Let σ be a permutation in S 3. Define ψ : R 3 R 2 as ψ(a, b, c) (b a, c a). Example (σ = (12) S 3 ) (x, y) τ (0, x, y) σ (x, 0, y) ψ ( x, y x) ( 1 ) This leads to a three-way correspondence among permutations in S 3, matrices in GL 2 (R), and symmetries imposed on f(x, y). Example (σ = (1234) S 4 ) (x, y, z) τ (0, x, y, z) σ (z, 0, x, y) ψ ( z, x z, y z) /

7 Spectral Density and its Estimator Definition (third-order spectral density) Let {X t } be third-order stationary. The 3 rd -order spectral density is f(u, v) = 1 (2π) 2 C(x, y)e ixu iyv x= y= f(u, v) inherits symmetries induced by C(x, y). Definition (third-order spectral density estimate) Let x 1, x 2,..., x n be an observation of a 3 rd -order stationary time series. f(u, v) = 1 n n (2π) 2 κ(x, y)ĉ(x, y)e ixu iyv where Ĉ(x, y) = Ê[X tx t+x X t+y ]. x=1 y=1 5 /

8 Spectral Density and its Estimator Definition (third-order spectral density) Let {X t } be third-order stationary. The 3 rd -order spectral density is f(u, v) = 1 (2π) 2 C(x, y)e ixu iyv x= y= f(u, v) inherits symmetries induced by C(x, y). Definition (third-order spectral density estimate) Let x 1, x 2,..., x n be an observation of a 3 rd -order stationary time series. f(u, v) = 1 n n (2π) 2 κ(x, y)ĉ(x, y)e ixu iyv where Ĉ(x, y) = Ê[X tx t+x X t+y ]. x=1 y=1 5 /

9 Symmetries of C(x, y) and f(u, v) 6 /

10 Summarizing the motivation... For a given function κ(x, y), construct a symmetrized form, κ(x, y), with the same symmetries as C(x, y). Before the group representation link k(x, y) was constructed as k(x, y) = k(x)k(y)k(x y) where k( ) is any even function. This is too restrictive 7 /

11 The representation Theorem (Berg 2008) The mapping ρ : S n GL n 1 (R), previously described, is a faithful group representation. Corollary (symmetrizing f(x, y)) Let h(x 1,..., x 6 ) be a symmetric function of its six arguments. f(x, y) = h(f(x, y), f( x, y x), f(y, x), f(x y, y), f( y, x y), f(y x, x)) 8 /

12 Example Symmetrizing the upside-down bowl Let f(x, y) = (1 x 2 y 2 ) + upside-down bowl h = x i, h = max(x i ), h = min(x i ) 9 /

13 Generalizing the Optimal Kernel The Subba-Rao-Gabr optimal kernel is { 3 ( ( Λ opt (ω 1, ω 2 ) = π π ω ω2 2 + ω )) 1ω 2, if ω ω2 2 + ω 1ω 2 π 2 0, otherwise Define Theorem (Berg 2008) k 1 Λ opt (ω) = α 1 β i=1 ω 2 i + i<j ω i ω j Let Λ(ω) be any nonnegative kernel that integrates to one and satisfies all the necessary symmetries. Also assume ωj 2 Λ(ω) dω = ωj 2 Λ opt (ω) dω R k 1 R k 1 for j = 1,..., n 1. Then Λ L2 Λ opt L /

14 The End...Thank You! /

On Quasirandom Permutations

On Quasirandom Permutations On Quasirandom Permutations Eric K. Zhang Mentor: Tanya Khovanova Plano West Senior High School PRIMES Conference, May 20, 2018 Eric K. Zhang (PWSH) On Quasirandom Permutations PRIMES 2018 1 / 20 Permutations

More information

REU 2006 Discrete Math Lecture 3

REU 2006 Discrete Math Lecture 3 REU 006 Discrete Math Lecture 3 Instructor: László Babai Scribe: Elizabeth Beazley Editors: Eliana Zoque and Elizabeth Beazley NOT PROOFREAD - CONTAINS ERRORS June 6, 006. Last updated June 7, 006 at :4

More information

II. Random Processes Review

II. Random Processes Review II. Random Processes Review - [p. 2] RP Definition - [p. 3] RP stationarity characteristics - [p. 7] Correlation & cross-correlation - [p. 9] Covariance and cross-covariance - [p. 10] WSS property - [p.

More information

Slinky vs. guitar. W.E. Bailey, APAM/MSE EN1102

Slinky vs. guitar. W.E. Bailey, APAM/MSE EN1102 Slinky vs. guitar W.E. Bailey, APAM/MSE EN1102 Differential spring element Figure: Differential length dx of spring under tension T with curvature is not a constant. θ = θ(x) W.E. Bailey, APAM/MSE EN1102

More information

Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks

Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Transport Capacity and Spectral Efficiency of Large Wireless CDMA Ad Hoc Networks Yi Sun Department of Electrical Engineering The City College of City University of New York Acknowledgement: supported

More information

Avoiding consecutive patterns in permutations

Avoiding consecutive patterns in permutations Avoiding consecutive patterns in permutations R. E. L. Aldred M. D. Atkinson D. J. McCaughan January 3, 2009 Abstract The number of permutations that do not contain, as a factor (subword), a given set

More information

Combinatorics in the group of parity alternating permutations

Combinatorics in the group of parity alternating permutations Combinatorics in the group of parity alternating permutations Shinji Tanimoto (tanimoto@cc.kochi-wu.ac.jp) arxiv:081.1839v1 [math.co] 10 Dec 008 Department of Mathematics, Kochi Joshi University, Kochi

More information

Permutations of a Multiset Avoiding Permutations of Length 3

Permutations of a Multiset Avoiding Permutations of Length 3 Europ. J. Combinatorics (2001 22, 1021 1031 doi:10.1006/eujc.2001.0538 Available online at http://www.idealibrary.com on Permutations of a Multiset Avoiding Permutations of Length 3 M. H. ALBERT, R. E.

More information

Some t-homogeneous sets of permutations

Some t-homogeneous sets of permutations Some t-homogeneous sets of permutations Jürgen Bierbrauer Department of Mathematical Sciences Michigan Technological University Houghton, MI 49931 (USA) Stephen Black IBM Heidelberg (Germany) Yves Edel

More information

Asymptotic behaviour of permutations avoiding generalized patterns

Asymptotic behaviour of permutations avoiding generalized patterns Asymptotic behaviour of permutations avoiding generalized patterns Ashok Rajaraman 311176 arajaram@sfu.ca February 19, 1 Abstract Visualizing permutations as labelled trees allows us to to specify restricted

More information

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups.

MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. MATH 433 Applied Algebra Lecture 12: Sign of a permutation (continued). Abstract groups. Permutations Let X be a finite set. A permutation of X is a bijection from X to itself. The set of all permutations

More information

Classes of permutations avoiding 231 or 321

Classes of permutations avoiding 231 or 321 Classes of permutations avoiding 231 or 321 Nik Ruškuc nik.ruskuc@st-andrews.ac.uk School of Mathematics and Statistics, University of St Andrews Dresden, 25 November 2015 Aim Introduce the area of pattern

More information

Dynamic Fair Channel Allocation for Wideband Systems

Dynamic Fair Channel Allocation for Wideband Systems Outlines Introduction and Motivation Dynamic Fair Channel Allocation for Wideband Systems Department of Mobile Communications Eurecom Institute Sophia Antipolis 19/10/2006 Outline of Part I Outlines Introduction

More information

LDPC codes for OFDM over an Inter-symbol Interference Channel

LDPC codes for OFDM over an Inter-symbol Interference Channel LDPC codes for OFDM over an Inter-symbol Interference Channel Dileep M. K. Bhashyam Andrew Thangaraj Department of Electrical Engineering IIT Madras June 16, 2008 Outline 1 LDPC codes OFDM Prior work Our

More information

EE 451: Digital Signal Processing

EE 451: Digital Signal Processing EE 451: Digital Signal Processing Stochastic Processes and Spectral Estimation Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 29, 2011 Aly El-Osery (NMT)

More information

The Brownian limit of separable permutations

The Brownian limit of separable permutations The Brownian limit of separable permutations Mathilde Bouvel (Institut für Mathematik, Universität Zürich) talk based on a joint work with Frédérique Bassino, Valentin Féray, Lucas Gerin and Adeline Pierrot

More information

Multihop Routing in Ad Hoc Networks

Multihop Routing in Ad Hoc Networks Multihop Routing in Ad Hoc Networks Dr. D. Torrieri 1, S. Talarico 2 and Dr. M. C. Valenti 2 1 U.S Army Research Laboratory, Adelphi, MD 2 West Virginia University, Morgantown, WV Nov. 18 th, 20131 Outline

More information

Random permutations avoiding some patterns

Random permutations avoiding some patterns Random permutations avoiding some patterns Svante Janson Knuth80 Piteå, 8 January, 2018 Patterns in a permutation Let S n be the set of permutations of [n] := {1,..., n}. If σ = σ 1 σ k S k and π = π 1

More information

Math 232. Calculus III Limits and Continuity. Updated: January 13, 2016 Calculus III Section 14.2

Math 232. Calculus III Limits and Continuity. Updated: January 13, 2016 Calculus III Section 14.2 Math 232 Calculus III Brian Veitch Fall 2015 Northern Illinois University 14.2 Limits and Continuity In this section our goal is to evaluate its of the form f(x, y) = L Let s take a look back at its in

More information

Permutation group and determinants. (Dated: September 19, 2018)

Permutation group and determinants. (Dated: September 19, 2018) Permutation group and determinants (Dated: September 19, 2018) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter

More information

Patterns and random permutations II

Patterns and random permutations II Patterns and random permutations II Valentin Féray (joint work with F. Bassino, M. Bouvel, L. Gerin, M. Maazoun and A. Pierrot) Institut für Mathematik, Universität Zürich Summer school in Villa Volpi,

More information

SOLUTIONS 2. PRACTICE EXAM 2. HOURLY. Problem 1) TF questions (20 points) Circle the correct letter. No justifications are needed.

SOLUTIONS 2. PRACTICE EXAM 2. HOURLY. Problem 1) TF questions (20 points) Circle the correct letter. No justifications are needed. SOLUIONS 2. PRACICE EXAM 2. HOURLY Math 21a, S03 Problem 1) questions (20 points) Circle the correct letter. No justifications are needed. A function f(x, y) on the plane for which the absolute minimum

More information

Alternating Permutations

Alternating Permutations Alternating Permutations p. Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic definitions A sequence a 1, a 2,..., a k of distinct integers is alternating if a 1 > a

More information

Corners in Tree Like Tableaux

Corners in Tree Like Tableaux Corners in Tree Like Tableaux Pawe l Hitczenko Department of Mathematics Drexel University Philadelphia, PA, U.S.A. phitczenko@math.drexel.edu Amanda Lohss Department of Mathematics Drexel University Philadelphia,

More information

EE 451: Digital Signal Processing

EE 451: Digital Signal Processing EE 451: Digital Signal Processing Power Spectral Density Estimation Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA December 4, 2017 Aly El-Osery (NMT) EE 451:

More information

An Erdős-Lovász-Spencer Theorem for permutations and its. testing

An Erdős-Lovász-Spencer Theorem for permutations and its. testing An Erdős-Lovász-Spencer Theorem for permutations and its consequences for parameter testing Carlos Hoppen (UFRGS, Porto Alegre, Brazil) This is joint work with Roman Glebov (ETH Zürich, Switzerland) Tereza

More information

Know how to represent permutations in the two rowed notation, and how to multiply permutations using this notation.

Know how to represent permutations in the two rowed notation, and how to multiply permutations using this notation. The third exam will be on Monday, November 21, 2011. It will cover Sections 5.1-5.5. Of course, the material is cumulative, and the listed sections depend on earlier sections, which it is assumed that

More information

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA

A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA A NEW COMPUTATION OF THE CODIMENSION SEQUENCE OF THE GRASSMANN ALGEBRA JOEL LOUWSMA, ADILSON EDUARDO PRESOTO, AND ALAN TARR Abstract. Krakowski and Regev found a basis of polynomial identities satisfied

More information

SUPPLEMENT TO THE PAPER TESTING EQUALITY OF SPECTRAL DENSITIES USING RANDOMIZATION TECHNIQUES

SUPPLEMENT TO THE PAPER TESTING EQUALITY OF SPECTRAL DENSITIES USING RANDOMIZATION TECHNIQUES SUPPLEMENT TO THE PAPER TESTING EQUALITY OF SPECTRAL DENSITIES USING RANDOMIZATION TECHNIQUES CARSTEN JENTSCH AND MARKUS PAULY Abstract. In this supplementary material we provide additional supporting

More information

Section 7.2 Logarithmic Functions

Section 7.2 Logarithmic Functions Math 150 c Lynch 1 of 6 Section 7.2 Logarithmic Functions Definition. Let a be any positive number not equal to 1. The logarithm of x to the base a is y if and only if a y = x. The number y is denoted

More information

PATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE

PATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE PATTERN AVOIDANCE IN PERMUTATIONS ON THE BOOLEAN LATTICE SAM HOPKINS AND MORGAN WEILER Abstract. We extend the concept of pattern avoidance in permutations on a totally ordered set to pattern avoidance

More information

On Hultman Numbers. 1 Introduction

On Hultman Numbers. 1 Introduction 47 6 Journal of Integer Sequences, Vol 0 (007, Article 076 On Hultman Numbers Jean-Paul Doignon and Anthony Labarre Université Libre de Bruxelles Département de Mathématique, cp 6 Bd du Triomphe B-050

More information

On k-crossings and k-nestings of permutations

On k-crossings and k-nestings of permutations FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 461 468 On k-crossings and k-nestings of permutations Sophie Burrill 1 and Marni Mishna 1 and Jacob Post 2 1 Department of Mathematics, Simon Fraser

More information

Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks

Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks Page 1 of 10 Throughput-optimal number of relays in delaybounded multi-hop ALOHA networks. Nekoui and H. Pishro-Nik This letter addresses the throughput of an ALOHA-based Poisson-distributed multihop wireless

More information

Topic 6: Joint Distributions

Topic 6: Joint Distributions Topic 6: Joint Distributions Course 003, 2017 Page 0 Joint distributions Social scientists are typically interested in the relationship between many random variables. They may be able to change some of

More information

An evolution of a permutation

An evolution of a permutation An evolution of a permutation Huseyin Acan April 28, 204 Joint work with Boris Pittel Notation and Definitions S n is the set of permutations of {,..., n} Notation and Definitions S n is the set of permutations

More information

Multivariate Permutation Tests: With Applications in Biostatistics

Multivariate Permutation Tests: With Applications in Biostatistics Multivariate Permutation Tests: With Applications in Biostatistics Fortunato Pesarin University ofpadova, Italy JOHN WILEY & SONS, LTD Chichester New York Weinheim Brisbane Singapore Toronto Contents Preface

More information

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations

Chapter 1. The alternating groups. 1.1 Introduction. 1.2 Permutations Chapter 1 The alternating groups 1.1 Introduction The most familiar of the finite (non-abelian) simple groups are the alternating groups A n, which are subgroups of index 2 in the symmetric groups S n.

More information

Permutation Tableaux and the Dashed Permutation Pattern 32 1

Permutation Tableaux and the Dashed Permutation Pattern 32 1 Permutation Tableaux and the Dashed Permutation Pattern William Y.C. Chen and Lewis H. Liu Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin, P.R. China chen@nankai.edu.cn, lewis@cfc.nankai.edu.cn

More information

A Coloring Problem. Ira M. Gessel 1 Department of Mathematics Brandeis University Waltham, MA Revised May 4, 1989

A Coloring Problem. Ira M. Gessel 1 Department of Mathematics Brandeis University Waltham, MA Revised May 4, 1989 A Coloring Problem Ira M. Gessel Department of Mathematics Brandeis University Waltham, MA 02254 Revised May 4, 989 Introduction. Awell-known algorithm for coloring the vertices of a graph is the greedy

More information

1111: Linear Algebra I

1111: Linear Algebra I 1111: Linear Algebra I Dr. Vladimir Dotsenko (Vlad) Lecture 7 Dr. Vladimir Dotsenko (Vlad) 1111: Linear Algebra I Lecture 7 1 / 8 Invertible matrices Theorem. 1. An elementary matrix is invertible. 2.

More information

Week 3-4: Permutations and Combinations

Week 3-4: Permutations and Combinations Week 3-4: Permutations and Combinations February 20, 2017 1 Two Counting Principles Addition Principle. Let S 1, S 2,..., S m be disjoint subsets of a finite set S. If S = S 1 S 2 S m, then S = S 1 + S

More information

Pin-Permutations and Structure in Permutation Classes

Pin-Permutations and Structure in Permutation Classes and Structure in Permutation Classes Frédérique Bassino Dominique Rossin Journées de Combinatoire de Bordeaux, feb. 2009 liafa Main result of the talk Conjecture[Brignall, Ruškuc, Vatter]: The pin-permutation

More information

Connected Permutations, Hypermaps and Weighted Dyck Words. Robert Cori Mini course, Maps Hypermaps february 2008

Connected Permutations, Hypermaps and Weighted Dyck Words. Robert Cori Mini course, Maps Hypermaps february 2008 1 Connected Permutations, Hypermaps and Weighted Dyck Words 2 Why? Graph embeddings Nice bijection by Patrice Ossona de Mendez and Pierre Rosenstiehl. Deduce enumerative results. Extensions? 3 Cycles (or

More information

THE SIGN OF A PERMUTATION

THE SIGN OF A PERMUTATION THE SIGN OF A PERMUTATION KEITH CONRAD 1. Introduction Throughout this discussion, n 2. Any cycle in S n is a product of transpositions: the identity (1) is (12)(12), and a k-cycle with k 2 can be written

More information

ON SOME PROPERTIES OF PERMUTATION TABLEAUX

ON SOME PROPERTIES OF PERMUTATION TABLEAUX ON SOME PROPERTIES OF PERMUTATION TABLEAUX ALEXANDER BURSTEIN Abstract. We consider the relation between various permutation statistics and properties of permutation tableaux. We answer some of the questions

More information

#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION

#A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION #A13 INTEGERS 15 (2015) THE LOCATION OF THE FIRST ASCENT IN A 123-AVOIDING PERMUTATION Samuel Connolly Department of Mathematics, Brown University, Providence, Rhode Island Zachary Gabor Department of

More information

Simple permutations and pattern restricted permutations

Simple permutations and pattern restricted permutations Simple permutations and pattern restricted permutations M.H. Albert and M.D. Atkinson Department of Computer Science University of Otago, Dunedin, New Zealand. Abstract A simple permutation is one that

More information

Computer Vision, Lecture 3

Computer Vision, Lecture 3 Computer Vision, Lecture 3 Professor Hager http://www.cs.jhu.edu/~hager /4/200 CS 46, Copyright G.D. Hager Outline for Today Image noise Filtering by Convolution Properties of Convolution /4/200 CS 46,

More information

Ma/CS 6a Class 16: Permutations

Ma/CS 6a Class 16: Permutations Ma/CS 6a Class 6: Permutations By Adam Sheffer The 5 Puzzle Problem. Start with the configuration on the left and move the tiles to obtain the configuration on the right. The 5 Puzzle (cont.) The game

More information

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel

RESTRICTED PERMUTATIONS AND POLYGONS. Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, Haifa, Israel RESTRICTED PERMUTATIONS AND POLYGONS Ghassan Firro and Toufik Mansour Department of Mathematics, University of Haifa, 905 Haifa, Israel {gferro,toufik}@mathhaifaacil abstract Several authors have examined

More information

Chapter 2: Signal Representation

Chapter 2: Signal Representation Chapter 2: Signal Representation Aveek Dutta Assistant Professor Department of Electrical and Computer Engineering University at Albany Spring 2018 Images and equations adopted from: Digital Communications

More information

Solution of ECE 342 Test 3 S12

Solution of ECE 342 Test 3 S12 Solution of ECE 34 Test 3 S1 1 A random power signal has a mean of three and a standard deviation of five Find its numerical total average signal power Signal Power P = 3 + 5 = 34 A random energy signal

More information

Sensors, Signals and Noise

Sensors, Signals and Noise Sensors, Signals and Noise COURSE OUTLINE Introduction Signals and Noise Filtering Noise Sensors and associated electronics Sergio Cova SENSORS SIGNALS AND NOISE SSN04b FILTERING NOISE rv 2017/01/25 1

More information

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition

Topic 1: defining games and strategies. SF2972: Game theory. Not allowed: Extensive form game: formal definition SF2972: Game theory Mark Voorneveld, mark.voorneveld@hhs.se Topic 1: defining games and strategies Drawing a game tree is usually the most informative way to represent an extensive form game. Here is one

More information

Frequency Domain Enhancement

Frequency Domain Enhancement Tutorial Report Frequency Domain Enhancement Page 1 of 21 Frequency Domain Enhancement ESE 558 - DIGITAL IMAGE PROCESSING Tutorial Report Instructor: Murali Subbarao Written by: Tutorial Report Frequency

More information

Walking on Numbers and a Self-Referential Formula

Walking on Numbers and a Self-Referential Formula Walking on Numbers and a Self-Referential Formula Awesome Math Summer Camp, Cornell University August 3, 2017 Coauthors for Walking on Numbers Figure: Kevin Kupiec, Marina Rawlings and me. Background Walking

More information

Lab 8. Signal Analysis Using Matlab Simulink

Lab 8. Signal Analysis Using Matlab Simulink E E 2 7 5 Lab June 30, 2006 Lab 8. Signal Analysis Using Matlab Simulink Introduction The Matlab Simulink software allows you to model digital signals, examine power spectra of digital signals, represent

More information

NETW 701: Wireless Communications. Lecture 5. Small Scale Fading

NETW 701: Wireless Communications. Lecture 5. Small Scale Fading NETW 701: Wireless Communications Lecture 5 Small Scale Fading Small Scale Fading Most mobile communication systems are used in and around center of population. The transmitting antenna or Base Station

More information

Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns

Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns Vahid Fazel-Rezai Phillips Exeter Academy Exeter, New Hampshire, U.S.A. vahid fazel@yahoo.com Submitted: Sep

More information

CDMA Channel Parameters Maximizing TCP Throughput

CDMA Channel Parameters Maximizing TCP Throughput CDMA Channel Parameters Maximizing TCP Throughput Francois Baccelli INRIA-ENS, France Rene L. Cruz UCSD, USA Antonio Nucci Narus, USA Abstract We consider a single TCP session traversing a wireless channel,

More information

Fast Sorting and Pattern-Avoiding Permutations

Fast Sorting and Pattern-Avoiding Permutations Fast Sorting and Pattern-Avoiding Permutations David Arthur Stanford University darthur@cs.stanford.edu Abstract We say a permutation π avoids a pattern σ if no length σ subsequence of π is ordered in

More information

On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing

On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing 1 On the Unicast Capacity of Stationary Multi-channel Multi-radio Wireless Networks: Separability and Multi-channel Routing Liangping Ma arxiv:0809.4325v2 [cs.it] 26 Dec 2009 Abstract The first result

More information

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun

UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES. with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun UNIVERSALITY IN SUBSTITUTION-CLOSED PERMUTATION CLASSES ADELINE PIERROT with Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Mickaël Maazoun The aim of this work is to study the asymptotic

More information

Struct: Finding Structure in Permutation Sets

Struct: Finding Structure in Permutation Sets Michael Albert, Christian Bean, Anders Claesson, Bjarki Ágúst Guðmundsson, Tómas Ken Magnússon and Henning Ulfarsson April 26th, 2016 Classical Patterns What is a permutation? π = 431265 = Classical Patterns

More information

An improvement to the Gilbert-Varshamov bound for permutation codes

An improvement to the Gilbert-Varshamov bound for permutation codes An improvement to the Gilbert-Varshamov bound for permutation codes Yiting Yang Department of Mathematics Tongji University Joint work with Fei Gao and Gennian Ge May 11, 2013 Outline Outline 1 Introduction

More information

Section II.9. Orbits, Cycles, and the Alternating Groups

Section II.9. Orbits, Cycles, and the Alternating Groups II.9 Orbits, Cycles, Alternating Groups 1 Section II.9. Orbits, Cycles, and the Alternating Groups Note. In this section, we explore permutations more deeply and introduce an important subgroup of S n.

More information

The Cauchy Criterion

The Cauchy Criterion The Cauchy Criterion MATH 464/506, Real Analysis J. Robert Buchanan Department of Mathematics Summer 2007 Cauchy Sequences Definition A sequence X = (x n ) of real numbers is a Cauchy sequence if it satisfies

More information

Review Sheet for Math 230, Midterm exam 2. Fall 2006

Review Sheet for Math 230, Midterm exam 2. Fall 2006 Review Sheet for Math 230, Midterm exam 2. Fall 2006 October 31, 2006 The second midterm exam will take place: Monday, November 13, from 8:15 to 9:30 pm. It will cover chapter 15 and sections 16.1 16.4,

More information

2.1 BASIC CONCEPTS Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal.

2.1 BASIC CONCEPTS Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal. 1 2.1 BASIC CONCEPTS 2.1.1 Basic Operations on Signals Time Shifting. Figure 2.2 Time shifting of a signal. Time Reversal. 2 Time Scaling. Figure 2.4 Time scaling of a signal. 2.1.2 Classification of Signals

More information

2.1 Partial Derivatives

2.1 Partial Derivatives .1 Partial Derivatives.1.1 Functions of several variables Up until now, we have only met functions of single variables. From now on we will meet functions such as z = f(x, y) and w = f(x, y, z), which

More information

Domino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations

Domino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations Domino Tilings of Aztec Diamonds, Baxter Permutations, and Snow Leopard Permutations Benjamin Caffrey 212 N. Blount St. Madison, WI 53703 bjc.caffrey@gmail.com Eric S. Egge Department of Mathematics and

More information

Chapter 6.1. Cycles in Permutations

Chapter 6.1. Cycles in Permutations Chapter 6.1. Cycles in Permutations Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 6.1. Cycles in Permutations Math 184A / Fall 2017 1 / 27 Notations for permutations Consider a permutation in 1-line

More information

Math 259 Winter Recitation Handout 9: Lagrange Multipliers

Math 259 Winter Recitation Handout 9: Lagrange Multipliers Math 259 Winter 2009 Recitation Handout 9: Lagrange Multipliers The method of Lagrange Multipliers is an excellent technique for finding the global maximum and global minimum values of a function f(x,

More information

Problem Sheet 1 Probability, random processes, and noise

Problem Sheet 1 Probability, random processes, and noise Problem Sheet 1 Probability, random processes, and noise 1. If F X (x) is the distribution function of a random variable X and x 1 x 2, show that F X (x 1 ) F X (x 2 ). 2. Use the definition of the cumulative

More information

Ranging detection algorithm for indoor UWB channels and research activities relating to a UWB-RFID localization system

Ranging detection algorithm for indoor UWB channels and research activities relating to a UWB-RFID localization system Ranging detection algorithm for indoor UWB channels and research activities relating to a UWB-RFID localization system Dr Choi Look LAW Founding Director Positioning and Wireless Technology Centre School

More information

Probabilistic Models for Permutations. Guy Lebanon Georgia Institute of Technology

Probabilistic Models for Permutations. Guy Lebanon Georgia Institute of Technology Georgia Institute of Technology Outline Basic facts Models on permutations Models on with-ties and incomplete preferences Non-parametric approaches Important challenges and open problems Basic Facts 1

More information

From permutations to graphs

From permutations to graphs From permutations to graphs well-quasi-ordering and infinite antichains Robert Brignall Joint work with Atminas, Korpelainen, Lozin and Vatter 28th November 2014 Orderings on Structures Pick your favourite

More information

Honors Algebra 2 Assignment Sheet - Chapter 1

Honors Algebra 2 Assignment Sheet - Chapter 1 Assignment Sheet - Chapter 1 #01: Read the text and the examples in your book for the following sections: 1.1, 1., and 1.4. Be sure you read and understand the handshake problem. Also make sure you copy

More information

Equivalence classes of length-changing replacements of size-3 patterns

Equivalence classes of length-changing replacements of size-3 patterns Equivalence classes of length-changing replacements of size-3 patterns Vahid Fazel-Rezai Mentor: Tanya Khovanova 2013 MIT-PRIMES Conference May 18, 2013 Vahid Fazel-Rezai Length-Changing Pattern Replacements

More information

Permutations with short monotone subsequences

Permutations with short monotone subsequences Permutations with short monotone subsequences Dan Romik Abstract We consider permutations of 1, 2,..., n 2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres

More information

1.Discuss the frequency domain techniques of image enhancement in detail.

1.Discuss the frequency domain techniques of image enhancement in detail. 1.Discuss the frequency domain techniques of image enhancement in detail. Enhancement In Frequency Domain: The frequency domain methods of image enhancement are based on convolution theorem. This is represented

More information

Lesson 6.1 Linear Equation Review

Lesson 6.1 Linear Equation Review Name: Lesson 6.1 Linear Equation Review Vocabulary Equation: a math sentence that contains Linear: makes a straight line (no Variables: quantities represented by (often x and y) Function: equations can

More information

M.Tolotti - Mathematics (Preparatory) - September Exercises. Maximize p(g(x))g(x) q x subject to x R +

M.Tolotti - Mathematics (Preparatory) - September Exercises. Maximize p(g(x))g(x) q x subject to x R + M.Tolotti - Mathematics (Preparatory) - September 2010 1 Exercises EXERCISE 1. where Maximize p(g(x))g(x) q x subject to x R + p : R R is constant, i.e. p(g(x)) = p = 1 for all x. g(x) = 35x x 2. q = 10.

More information

THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS

THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS THE ERDŐS-KO-RADO THEOREM FOR INTERSECTING FAMILIES OF PERMUTATIONS A Thesis Submitted to the Faculty of Graduate Studies and Research In Partial Fulfillment of the Requirements for the Degree of Master

More information

Adaptive MIMO Antenna Selection

Adaptive MIMO Antenna Selection Adaptive MIMO Antenna Selection Inaki Berenguer Xiaodong Wang Vikram Krishnamurthy Lab. for Commun. Engineering Dept. of Electrical Engineering Dept. of Electrical Engineering University of Cambridge Columbia

More information

LECTURE 8: DETERMINANTS AND PERMUTATIONS

LECTURE 8: DETERMINANTS AND PERMUTATIONS LECTURE 8: DETERMINANTS AND PERMUTATIONS MA1111: LINEAR ALGEBRA I, MICHAELMAS 2016 1 Determinants In the last lecture, we saw some applications of invertible matrices We would now like to describe how

More information

Derandomized Constructions of k-wise (Almost) Independent Permutations

Derandomized Constructions of k-wise (Almost) Independent Permutations Derandomized Constructions of k-wise (Almost) Independent Permutations Eyal Kaplan Moni Naor Omer Reingold Abstract Constructions of k-wise almost independent permutations have been receiving a growing

More information

Some algorithmic and combinatorial problems on permutation classes

Some algorithmic and combinatorial problems on permutation classes Some algorithmic and combinatorial problems on permutation classes The point of view of decomposition trees PhD Defense, 2009 December the 4th Outline 1 Objects studied : Permutations, Patterns and Classes

More information

Pattern Avoidance in Poset Permutations

Pattern Avoidance in Poset Permutations Pattern Avoidance in Poset Permutations Sam Hopkins and Morgan Weiler Massachusetts Institute of Technology and University of California, Berkeley Permutation Patterns, Paris; July 5th, 2013 1 Definitions

More information

A New Analysis of the DS-CDMA Cellular Uplink Under Spatial Constraints

A New Analysis of the DS-CDMA Cellular Uplink Under Spatial Constraints A New Analysis of the DS-CDMA Cellular Uplink Under Spatial Constraints D. Torrieri M. C. Valenti S. Talarico U.S. Army Research Laboratory Adelphi, MD West Virginia University Morgantown, WV June, 3 the

More information

University of California, Berkeley Department of Mathematics 5 th November, 2012, 12:10-12:55 pm MATH 53 - Test #2

University of California, Berkeley Department of Mathematics 5 th November, 2012, 12:10-12:55 pm MATH 53 - Test #2 University of California, Berkeley epartment of Mathematics 5 th November, 212, 12:1-12:55 pm MATH 53 - Test #2 Last Name: First Name: Student Number: iscussion Section: Name of GSI: Record your answers

More information

Finite homomorphism-homogeneous permutations via edge colourings of chains

Finite homomorphism-homogeneous permutations via edge colourings of chains Finite homomorphism-homogeneous permutations via edge colourings of chains Igor Dolinka dockie@dmi.uns.ac.rs Department of Mathematics and Informatics, University of Novi Sad First of all there is Blue.

More information

Tetsuo JAIST EikD Erik D. Martin L. MIT

Tetsuo JAIST EikD Erik D. Martin L. MIT Tetsuo Asano @ JAIST EikD Erik D. Demaine @MIT Martin L. Demaine @ MIT Ryuhei Uehara @ JAIST Short History: 2010/1/9: At Boston Museum we met Kaboozle! 2010/2/21 accepted by 5 th International Conference

More information

Formal Verification. Lecture 5: Computation Tree Logic (CTL)

Formal Verification. Lecture 5: Computation Tree Logic (CTL) Formal Verification Lecture 5: Computation Tree Logic (CTL) Jacques Fleuriot 1 jdf@inf.ac.uk 1 With thanks to Bob Atkey for some of the diagrams. Recap Previously: Linear-time Temporal Logic This time:

More information

Math 32, October 22 & 27: Maxima & Minima

Math 32, October 22 & 27: Maxima & Minima Math 32, October 22 & 27: Maxima & Minima Section 1: Critical Points Just as in the single variable case, for multivariate functions we are often interested in determining extreme values of the function.

More information

Notes On Card Shuffling

Notes On Card Shuffling Notes On Card Shuffling Nathanaël Berestycki March 1, 2007 Take a deck of n = 52 cards and shuffle it. It is intuitive that if you shuffle your deck sufficiently many times, the deck will be in an approximately

More information

ELEC Dr Reji Mathew Electrical Engineering UNSW

ELEC Dr Reji Mathew Electrical Engineering UNSW ELEC 4622 Dr Reji Mathew Electrical Engineering UNSW Filter Design Circularly symmetric 2-D low-pass filter Pass-band radial frequency: ω p Stop-band radial frequency: ω s 1 δ p Pass-band tolerances: δ

More information

Chapter 3 Signal Degradation in Optical Fibers

Chapter 3 Signal Degradation in Optical Fibers What about the loss in optical fiber? Why and to what degree do optical signals gets distorted as they propagate along a fiber? Fiber links are limited by in path length by attenuation and pulse distortion.

More information

PART I: Emmett s teacher asked him to analyze the table of values of a quadratic function to find key features. The table of values is shown below:

PART I: Emmett s teacher asked him to analyze the table of values of a quadratic function to find key features. The table of values is shown below: Math (L-3a) Learning Targets: I can find the vertex from intercept solutions calculated by quadratic formula. PART I: Emmett s teacher asked him to analyze the table of values of a quadratic function to

More information