Changing Perspectives
|
|
- Dominic Thornton
- 5 years ago
- Views:
Transcription
1 Harvey Mudd College
2 Applied Representation Theory Group at HMC Thesis Students Zajj Daugherty 05 Eric Malm 05 Melissa Banister 04 Will Chang 04 Nate Eldredge 03 Matthew Macauley 03 David Uminsky 03 Elizabeth Norton 01
3 Research Students Gregory Minton 08 Alex Eustis 06 Masanori Koyama 07 Zajj Daugherty 05 Mike Hansen 06 Marshall Pierce 06 Moana Evans 06 Julijana Gjorgjieva 06 Grant Clifford 04 Ruben Arenas 05 Nate Eldredge 03 David Uminsky 03
4 Connections
5 Connections Linear Algebra linear transformations, inner products, projections, norms
6 Connections Linear Algebra linear transformations, inner products, projections, norms Abstract Algebra symmetry, representation theory, module theory
7 Connections Linear Algebra linear transformations, inner products, projections, norms Abstract Algebra symmetry, representation theory, module theory Graph Theory adjacency matrices, distance transitve graphs, linear complexity
8 Connections Linear Algebra linear transformations, inner products, projections, norms Abstract Algebra symmetry, representation theory, module theory Graph Theory adjacency matrices, distance transitve graphs, linear complexity Numerical Analysis Lanczos Algorithm
9 New Views
10 Sum Fun
11 Sum Fun Adding
12 Sum Fun Adding
13 Sum Fun Adding
14 Sum Fun Adding
15 Sum Fun Adding ( ) + (2 + 99) + (3 + 98) + (4 + 97) + = 5050
16 Sum Fun Adding ( ) + (2 + 99) + (3 + 98) + (4 + 97) + = 5050 Child s Play 10 year old Carl Friederich Gauss ( )
17 Ants on a Stick
18 Ants on a Stick Situation 100 ants dropped on meter stick
19 Ants on a Stick Situation 100 ants dropped on meter stick each ant moving either left or right at 1 meter per min
20 Ants on a Stick Situation 100 ants dropped on meter stick each ant moving either left or right at 1 meter per min if two meet, bounce off and reverse direction
21 Ants on a Stick Situation 100 ants dropped on meter stick each ant moving either left or right at 1 meter per min if two meet, bounce off and reverse direction if ant reaches end, it falls off
22 Ants on a Stick Situation 100 ants dropped on meter stick each ant moving either left or right at 1 meter per min if two meet, bounce off and reverse direction if ant reaches end, it falls off Question How long do we have to wait for all of the ants to fall off?
23 Ants on a Stick Situation 100 ants dropped on meter stick each ant moving either left or right at 1 meter per min if two meet, bounce off and reverse direction if ant reaches end, it falls off Question How long do we have to wait for all of the ants to fall off? Answer No more than a minute!
24 Change of Perspective is Everywhere
25 Change of Perspective is Everywhere Mathematics
26 Change of Perspective is Everywhere Mathematics Substitution (Algebra, Calculus)
27 Change of Perspective is Everywhere Mathematics Substitution (Algebra, Calculus) Integration by Parts (Calculus, Differential Equations)
28 Change of Perspective is Everywhere Mathematics Substitution (Algebra, Calculus) Integration by Parts (Calculus, Differential Equations) Bayes Theorem (Probability, Statistics)
29 Change of Perspective is Everywhere Mathematics Substitution (Algebra, Calculus) Integration by Parts (Calculus, Differential Equations) Bayes Theorem (Probability, Statistics) Change of Basis (Linear Algebra, Signal Processing)
30 Change of Perspective is Everywhere Mathematics Substitution (Algebra, Calculus) Integration by Parts (Calculus, Differential Equations) Bayes Theorem (Probability, Statistics) Change of Basis (Linear Algebra, Signal Processing) Life
31 Change of Perspective is Everywhere Mathematics Substitution (Algebra, Calculus) Integration by Parts (Calculus, Differential Equations) Bayes Theorem (Probability, Statistics) Change of Basis (Linear Algebra, Signal Processing) Life insert just about anything here
32
33 Voting
34 Voting Example Eleven voters have the following preferences: 2 ABC 3 ACB 4 BCA 2 CBA.
35 Voting Example Eleven voters have the following preferences: 2 ABC 3 ACB 4 BCA 2 CBA. Change of Perspective Focus on the procedure, not the preferences.
36 The Will of the People?
37 The Will of the People?...rather than reflecting the views of the voters, it is entirely possible for an election outcome to more accurately reflect the choice of an election procedure. D. Saari
38 Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA
39 Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Favorite
40 Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Favorite A: 5 points
41 Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Favorite A: 5 points B: 4 points
42 Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Favorite A: 5 points B: 4 points C: 2 points
43 Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Favorite A: 5 points B: 4 points C: 2 points Outcome A > B > C
44 Anti-Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA
45 Anti-Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Top Two Favorites
46 Anti-Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Top Two Favorites A: 5 points
47 Anti-Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Top Two Favorites A: 5 points B: 8 points
48 Anti-Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Top Two Favorites A: 5 points B: 8 points C: 9 points
49 Anti-Plurality Preferences 2 ABC 3 ACB 4 BCA 2 CBA Vote for Top Two Favorites A: 5 points B: 8 points C: 9 points Outcome C > B > A
50 Borda Count Preferences 2 ABC 3 ACB 4 BCA 2 CBA
51 Borda Count Preferences 2 ABC 3 ACB 4 BCA 2 CBA 1 Point for First, 1 2 Point for Second
52 Borda Count Preferences 2 ABC 3 ACB 4 BCA 2 CBA 1 Point for First, 1 2 A: 5 points Point for Second
53 Borda Count Preferences 2 ABC 3 ACB 4 BCA 2 CBA 1 Point for First, 1 Point for Second 2 A: 5 points B: 6 points
54 Borda Count Preferences 2 ABC 3 ACB 4 BCA 2 CBA 1 Point for First, 1 Point for Second 2 A: 5 points B: 6 points C: points
55 Borda Count Preferences 2 ABC 3 ACB 4 BCA 2 CBA 1 Point for First, 1 Point for Second 2 A: 5 points B: 6 points C: points Outcome B > C > A
56 Common Thread
57 Common Thread Positional Voting
58 Common Thread Positional Voting 1st: 1 point
59 Common Thread Positional Voting 1st: 1 point 2nd: t points, 0 t 1
60 Common Thread Positional Voting 1st: 1 point 2nd: t points, 0 t 1 3rd: 0 points
61 Common Thread Positional Voting 1st: 1 point 2nd: t points, 0 t 1 3rd: 0 points Tally Matrix
62 Common Thread Positional Voting 1st: 1 point 2nd: t points, 0 t 1 3rd: 0 points Tally Matrix 2 ABC 1 1 t 0 t 0 3 ACB t t 0 BAC 0 t 0 t BCA 0 CAB 2 CBA
63 Common Thread Positional Voting 1st: 1 point 2nd: t points, 0 t 1 3rd: 0 points Tally Matrix 2 ABC 1 1 t 0 t 0 3 ACB t t 0 5 A BAC 0 t 0 t = 4 + 4t B BCA t C CAB 2 CBA
64
65
66 Main Idea
67 Main Idea Decompose the voting profile into symmetry-invariant pieces.
68 Main Idea Decompose the voting profile into symmetry-invariant pieces. Each piece should capture some fundamental characteristic.
69 Main Idea Decompose the voting profile into symmetry-invariant pieces. Each piece should capture some fundamental characteristic. Use the pieces to tell a story or build paradoxes.
70 Main Idea Decompose the voting profile into symmetry-invariant pieces. Each piece should capture some fundamental characteristic. Use the pieces to tell a story or build paradoxes. Symmetry
71 Main Idea Decompose the voting profile into symmetry-invariant pieces. Each piece should capture some fundamental characteristic. Use the pieces to tell a story or build paradoxes. Symmetry Based on permuting the labels of the candidates.
72 Main Idea Decompose the voting profile into symmetry-invariant pieces. Each piece should capture some fundamental characteristic. Use the pieces to tell a story or build paradoxes. Symmetry Based on permuting the labels of the candidates. Commutative gives classical harmonic analysis.
73 Main Idea Decompose the voting profile into symmetry-invariant pieces. Each piece should capture some fundamental characteristic. Use the pieces to tell a story or build paradoxes. Symmetry Based on permuting the labels of the candidates. Commutative gives classical harmonic analysis. Noncommutative gives noncommutative harmonic analysis.
74 Framework
75 Framework Situation
76 Framework Situation Voters are given list of n candidates.
77 Framework Situation Voters are given list of n candidates. They return their votes.
78 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied.
79 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied. The winner(s) are announced.
80 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied. The winner(s) are announced. Algebraic Insights
81 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied. The winner(s) are announced. Algebraic Insights There is no set order on the candidates.
82 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied. The winner(s) are announced. Algebraic Insights There is no set order on the candidates. The votes form a vector.
83 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied. The winner(s) are announced. Algebraic Insights There is no set order on the candidates. The votes form a vector. Tallying is a linear transformation.
84 Framework Situation Voters are given list of n candidates. They return their votes. The votes are tallied. The winner(s) are announced. Algebraic Insights There is no set order on the candidates. The votes form a vector. Tallying is a linear transformation. Winner depends on tallying method.
85 Big Idea
86 Big Idea Decompositions Use symmetry to decompose the profile space V = V 0 V 1 V k+1 V k.
87 Big Idea Decompositions Use symmetry to decompose the profile space V = V 0 V 1 V k+1 V k. Analysis Use the projections of the profile into these subspaces to explain the profile.
88 Big Idea Decompositions Use symmetry to decompose the profile space V = V 0 V 1 V k+1 V k. Analysis Use the projections of the profile into these subspaces to explain the profile. Paradoxes Compare the impact that different voting procedures have on these subspaces to construct paradoxical profiles.
89 Example
90 Example If the profile is p = [ ] 6 18 A B
91 Example If the profile is p = then it decomposes as [ ] 6 = 18 [ ] 6 18 [ ] A B [ ] 6. 6
92 Example If the profile is 4 p = A B C
93 Example If the profile is 4 p = A B C then it decomposes as =
94 Bigger Example 2 AB 12 AC 11 AD 6 AE 17 BC p = 8 BD 4 BE 24 CD 20 CE 6 DE
95 Bigger Example p = AB AC AD AE BC BD BE CD CE DE = /3 16/3 8/3 7 16/3 8/3 7 34/ /3 13/3 8/3 2 2/3 1/3 0 5/3 2 4
96 Bigger Example (cont.)
97 Bigger Example (cont.) Analysis p 0 2 = 1210, p , and p
98 Bigger Example (cont.) Analysis p 0 2 = 1210, p , and p Inner products for first order effects: A B C D E
99 Bigger Example (cont.) Analysis p 0 2 = 1210, p , and p Inner products for first order effects: A B C D E Inner products for second order effects: AB AC AD AE BC BD BE CD CE DE
100 Bigger Example (cont.) Analysis p 0 2 = 1210, p , and p Inner products for first order effects: A B C D E Inner products for second order effects: AB AC AD AE BC BD BE CD CE DE Story People seem to really like C.
101 Committee Voting Data
102 Committee Voting Data Situation Given n-member committee.
103 Committee Voting Data Situation Given n-member committee. Each vote yields winners and losers.
104 Committee Voting Data Situation Given n-member committee. Each vote yields winners and losers. New Perspective
105 Committee Voting Data Situation Given n-member committee. Each vote yields winners and losers. New Perspective Let the issues do all of the voting!
106 Committee Voting Data Situation Given n-member committee. Each vote yields winners and losers. New Perspective Let the issues do all of the voting! Look for coalitions.
107 Supreme Court Table: Rehnquist Court , 192 non-unanimous cases split subspace norm 2 four largest (using absolute value) inner products 8-1 M Sv.996 By Gi Sc M ThSc.732 SvGi.476 SvBy.354 SvSc M 1 59 Sv.695 O So Ke M 3 72 ReThSc.647 O ThSc.345 ByThSc ReO Sc M ThSc.626 SvGi.345 GiTh ReTh M 1 16 Th.656 Sc.540 Ke By M SvGiBySo.954 KeReThSc.344 O ReThSc.341 SvBySoSc M SvBySo.379 SvGiSo.368 GiBySo.293 SvGiBy M SvSo.315 SvBy.301 ThSc.282 SvGi M 1 22 Ke So.418 O Gi.380 Sv Stevens Gi Ginsburg By Breyer So Souter Ke Kennedy O O Connor Re Rehnquist Th Thomas Sc Scalia
108 Paradoxes
109 Paradoxes Positional vs Pairwise
110 Paradoxes Positional vs Pairwise D. Saari Borda Count is best (geometry).
111 Paradoxes Positional vs Pairwise D. Saari Borda Count is best (geometry). Z. Daugherty Borda-like Count is best (algebra).
112 Paradoxes Positional vs Pairwise D. Saari Borda Count is best (geometry). Z. Daugherty Borda-like Count is best (algebra). Positional vs Approval
113 Paradoxes Positional vs Pairwise D. Saari Borda Count is best (geometry). Z. Daugherty Borda-like Count is best (algebra). Positional vs Approval G. Minton and A. Eustis Borda Count is close, but not close enough! (algebra)
114 Thanks!
115
Algebraic Voting Theory
Algebraic Voting Theory Michael Orrison Harvey Mudd College Collaborators and Sounding Boards Don Saari (UC Irvine) Anna Bargagliotti (University of Memphis) Steven Brams (NYU) Brian Lawson (Santa Monica
More informationAlgebraic Voting Theory
Algebraic Voting Theory Michael Orrison Harvey Mudd College People Don Saari Anna Bargagliotti Steven Brams Zajj Daugherty 05 Alex Eustis 06 Mike Hansen 07 Marie Jameson 07 Gregory Minton 08 Rachel Cranfill
More informationSpectral Analysis of the Supreme Court
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship --2006 Spectral Analysis of the Supreme Court Brian L. Lawson University of Cincinnati - Main
More informationWreath Products in Algebraic Voting Theory
Wreath Products in Algebraic Voting Theory Committed to Committees Ian Calaway 1 Joshua Csapo 2 Dr. Erin McNicholas 3 Eric Samelson 4 1 Macalester College 2 University of Michigan-Flint 3 Faculty Advisor
More informationPoints-based rules respecting a pairwise-change-symmetric ordering
Points-based rules respecting a pairwise-change-symmetric ordering AMS Special Session on Voting Theory Karl-Dieter Crisman, Gordon College January 7th, 2008 A simple idea Our usual representations of
More informationVoting Paradoxes Caused by Dropping Candidates in an Election
Voting Paradoxes Caused by Dropping Candidates in an Election Marie K. Jameson Michael Orrison, Advisor Nathan Ryan, Reader April, 7 Department of Mathematics Copyright c 7 Marie K. Jameson. The author
More informationVoting. José M Vidal. September 29, Abstract. The problems with voting.
Voting José M Vidal Department of Computer Science and Engineering, University of South Carolina September 29, 2005 The problems with voting. Abstract The Problem The Problem The Problem Plurality The
More informationDECOMPOSITION BEHAVIOR IN AGGREGATED DATA SETS
DECOMPOSITION BEHAVIOR IN AGGREGATED DATA SETS SARAH BERUBE AND KARL-DIETER CRISMAN Abstract. One kind of aggregation of nonparametric data sets involves combining two (or more) sets with the same structure,
More informationNontransitive Dice and Arrow s Theorem
Nontransitive Dice and Arrow s Theorem Undergraduates: Arthur Vartanyan, Jueyi Liu, Satvik Agarwal, Dorothy Truong Graduate Mentor: Lucas Van Meter Project Mentor: Jonah Ostroff 3 Chapter 1 Dice proofs
More informationBest reply dynamics for scoring rules
Best reply dynamics for scoring rules R. Reyhani M.C Wilson Department of Computer Science University of Auckland 3rd Summer workshop of CMSS, 20-22 Feb 2012 Introduction Voting game Player (voter) action
More informationCONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES
CONNECTING PAIRWISE AND POSITIONAL ELECTION OUTCOMES DONALD G SAARI AND TOMAS J MCINTEE INSTITUTE FOR MATHEMATICAL BEHAVIORAL SCIENCE UNIVERSITY OF CALIFORNIA, IRVINE, CA 9697-5100 Abstract General conclusions
More informationSurvey of Voting Procedures and Paradoxes
Survey of Voting Procedures and Paradoxes Stanford University ai.stanford.edu/ epacuit/lmh Fall, 2008 :, 1 The Voting Problem Given a (finite) set X of candidates and a (finite) set A of voters each of
More informationWinning probabilities in a pairwise lottery system with three alternatives
Economic Theory 26, 607 617 (2005) DOI: 10.1007/s00199-004-059-8 Winning probabilities in a pairwise lottery system with three alternatives Frederick H. Chen and Jac C. Heckelman Department of Economics,
More informationMath for Liberal Studies
Math for Liberal Studies We want to measure the influence each voter has As we have seen, the number of votes you have doesn t always reflect how much influence you have In order to measure the power of
More informationLecture 3: Probability
Lecture 3: Probability 28th of October 2015 Lecture 3: Probability 28th of October 2015 1 / 36 Summary of previous lecture Define chance experiment, sample space and event Introduce the concept of the
More informationProbability Calculus
Probability Calculus Josemari Sarasola Statistics for Business Gizapedia Josemari Sarasola Probability Calculus 1 / 39 Combinatorics What is combinatorics? Before learning to calculate probabilities, we
More informationAN ABSTRACT OF THE THESIS OF
AN ABSTRACT OF THE THESIS OF Leslie M. McDonald for the degree of Master of Science in Mathematics presented on March, 205. Title: robabilities of Voting aradoxes with Three Candidates Abstract approved:
More informationBHP BILLITON UNIVERSITY OF MELBOURNE SCHOOL MATHEMATICS COMPETITION, 2003: INTERMEDIATE DIVISION
BHP BILLITON UNIVERSITY OF MELBOURNE SCHOOL MATHEMATICS COMPETITION, 00: INTERMEDIATE DIVISION 1. A fraction processing machine takes a fraction f and produces a new fraction 1 f. If a fraction f = p is
More informationSAMPLE TEX FILE ZAJJ DAUGHERTY
SAMPLE TEX FILE ZAJJ DAUGHERTY Contents. What is the partition algebra?.. Graphs and equivalence relations.. Diagrams and their compositions.. The partition algebra. Combinatorial representation theory:
More informationMATH 19-02: HW 5 TUFTS UNIVERSITY DEPARTMENT OF MATHEMATICS SPRING 2018
MATH 19-02: HW 5 TUFTS UNIVERSITY DEPARTMENT OF MATHEMATICS SPRING 2018 As we ve discussed, a move favorable to X is one in which some voters change their preferences so that X is raised, while the relative
More informationThe Pairwise-Comparison Method
The Pairwise-Comparison Method Lecture 12 Section 1.5 Robb T. Koether Hampden-Sydney College Mon, Sep 19, 2016 Robb T. Koether (Hampden-Sydney College) The Pairwise-Comparison Method Mon, Sep 19, 2016
More informationPartial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS
Partial lecture notes THE PROBABILITY OF VIOLATING ARROW S CONDITIONS 1 B. Preference Aggregation Rules 3. Anti-Plurality a. Assign zero points to a voter's last preference and one point to all other preferences.
More informationDiscrete Math. Background Knowledge/Prior Skills Commutative and associative properties Solving systems of equations
Discrete Math Numbers and Operations Standard: Understands and applies concepts of numbers and operations. Power 1: Understands numbers, ways of representing numbers, relationships among numbers, and number
More information4/17/2012. NE ( ) # of ways an event can happen NS ( ) # of events in the sample space
I. Vocabulary: A. Outcomes: the things that can happen in a probability experiment B. Sample Space (S): all possible outcomes C. Event (E): one outcome D. Probability of an Event (P(E)): the likelihood
More informationThe Best Way to Choose a Winner
The Best Way to Choose a Winner Vicki Powers Emory University, Atlanta, GA currently: National Science Foundation, Division of Mathematical Sciences Universität Konstanz, April 14, 2014 What is this talk
More informationGroup Theory in Particle Physics
Group Theory in Particle Physics Joshua Albert Phy 205 http://en.wikipedia.org/wiki/image:e8_graph.svg Where Did it Come From? Group Theory has it's origins in: Algebraic Equations Number Theory Geometry
More informationVoting Handout. Election from the text, p. 47 (for use during class)
Voting Handout Election from the text, p. 47 (for use during class) 3 2 1 1 2 1 1 1 1 2 A B B B D D E B B E C C A C A A C E E C D D C A B E D C C A E E E E E B B A D B B A D D C C A D A D 1. Use the following
More informationPermutation. Permutation. Permutation. Permutation. Permutation
Conditional Probability Consider the possible arrangements of the letters A, B, and C. The possible arrangements are: ABC, ACB, BAC, BCA, CAB, CBA. If the order of the arrangement is important then we
More information5 Constructions of connections
[under construction] 5 Constructions of connections 5.1 Connections on manifolds and the Levi-Civita theorem We start with a bit of terminology. A connection on the tangent bundle T M M of a manifold M
More informationRecap Social Choice Fun Game Voting Paradoxes Properties. Social Choice. Lecture 11. Social Choice Lecture 11, Slide 1
Social Choice Lecture 11 Social Choice Lecture 11, Slide 1 Lecture Overview 1 Recap 2 Social Choice 3 Fun Game 4 Voting Paradoxes 5 Properties Social Choice Lecture 11, Slide 2 Formal Definition Definition
More informationLecture 3 : Probability II. Jonathan Marchini
Lecture 3 : Probability II Jonathan Marchini Puzzle 1 Pick any two types of card that can occur in a normal pack of shuffled playing cards e.g. Queen and 6. What do you think is the probability that somewhere
More informationWorking with Block Structured Matrices
Working with Block Structured Matrices Numerical linear algebra lies at the heart of modern scientific computing and computational science. Today it is not uncommon to perform numerical computations with
More informationVoting and Mechanism Design
José M Vidal Department of Computer Science and Engineering, University of South Carolina March 26, 2010 Abstract Voting, Mechanism design, and distributed algorithmics mechanism design. Chapter 8. Voting
More information5 Irreducible representations
Physics 129b Lecture 8 Caltech, 01/1/19 5 Irreducible representations 5.5 Regular representation and its decomposition into irreps To see that the inequality is saturated, we need to consider the so-called
More informationInequality of Representation
Inequality of Representation Hannu Nurmi Public Choice Research Centre University of Turku Institutions in Context: Inequality (HN/PCRC) Inequality of Representation June 3 9, 2013 1 / 31 The main points
More informationDot Products. K. Behrend. April 3, Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem.
Dot Products K. Behrend April 3, 008 Abstract A short review of some basic facts on the dot product. Projections. The spectral theorem. Contents The dot product 3. Length of a vector........................
More information1. Groups Definitions
1. Groups Definitions 1 1. Groups Definitions A group is a set S of elements between which there is defined a binary operation, usually called multiplication. For the moment, the operation will be denoted
More informationCondorcet Efficiency: A Preference for Indifference
Condorcet Efficiency: A Preference for Indifference William V. Gehrlein Department of Business Administration University of Delaware Newark, DE 976 USA Fabrice Valognes GREBE Department of Economics The
More informationCoxeter-Knuth Graphs and a signed Little Bijection
Coxeter-Knuth Graphs and a signed Little Bijection Sara Billey University of Washington http://www.math.washington.edu/ billey AMS-MAA Joint Meetings January 17, 2014 0-0 Outline Based on joint work with
More informationLecture 4: Probability and Discrete Random Variables
Error Correcting Codes: Combinatorics, Algorithms and Applications (Fall 2007) Lecture 4: Probability and Discrete Random Variables Wednesday, January 21, 2009 Lecturer: Atri Rudra Scribe: Anonymous 1
More informationMAT2377. Ali Karimnezhad. Version September 9, Ali Karimnezhad
MAT2377 Ali Karimnezhad Version September 9, 2015 Ali Karimnezhad Comments These slides cover material from Chapter 1. In class, I may use a blackboard. I recommend reading these slides before you come
More informationChabot College Fall Course Outline for Mathematics 47 MATHEMATICS FOR LIBERAL ARTS
Chabot College Fall 2013 Course Outline for Mathematics 47 Catalog Description: MATHEMATICS FOR LIBERAL ARTS MTH 47 - Mathematics for Liberal Arts 3.00 units An introduction to a variety of mathematical
More informationChapter 1 Problem Solving: Strategies and Principles
Chapter 1 Problem Solving: Strategies and Principles Section 1.1 Problem Solving 1. Understand the problem, devise a plan, carry out your plan, check your answer. 3. Answers will vary. 5. How to Solve
More informationCombining Voting Rules Together
Combining Voting Rules Together Nina Narodytska and Toby Walsh and Lirong Xia 3 Abstract. We propose a simple method for combining together voting rules that performs a run-off between the different winners
More informationProbabilistic Aspects of Voting
Probabilistic Aspects of Voting UUGANBAATAR NINJBAT DEPARTMENT OF MATHEMATICS THE NATIONAL UNIVERSITY OF MONGOLIA SAAM 2015 Outline 1. Introduction to voting theory 2. Probability and voting 2.1. Aggregating
More informationOn the probabilistic modeling of consistency for iterated positional election procedures
University of Iowa Iowa Research Online Theses and Dissertations Spring 2014 On the probabilistic modeling of consistency for iterated positional election procedures Mark A. Krines University of Iowa Copyright
More information2007 Hypatia Contest
Canadian Mathematics Competition An activity of the Centre for Education in Mathematics and Computing, University of Waterloo, Waterloo, Ontario 007 Hypatia Contest Wednesday, April 18, 007 Solutions c
More informationCoxeter-Knuth Classes and a Signed Little Bijection
Coxeter-Knuth Classes and a Signed Little Bijection Sara Billey University of Washington Based on joint work with: Zachary Hamaker, Austin Roberts, and Benjamin Young. UC Berkeley, February, 04 Outline
More informationMethods in Mathematics
Write your name here Surname Other names Edexcel GCSE Centre Number Candidate Number Methods in Mathematics Unit 1: Methods 1 For Approved Pilot Centres ONLY Higher Tier Monday 17 June 2013 Morning Time:
More informationMatrix Operations and Equations
C H A P T ER Matrix Operations and Equations 200 Carnegie Learning, Inc. Shoe stores stock various sizes and widths of each style to accommodate buyers with different shaped feet. You will use matrix operations
More informationHamiltonian Matrices and the Algebraic Riccati Equation. Seminar presentation
Hamiltonian Matrices and the Algebraic Riccati Equation Seminar presentation by Piyapong Yuantong 7th December 2009 Technische Universität Chemnitz 1 Hamiltonian matrices We start by introducing the square
More information221B Lecture Notes Many-Body Problems I
221B Lecture Notes Many-Body Problems I 1 Quantum Statistics of Identical Particles If two particles are identical, their exchange must not change physical quantities. Therefore, a wave function ψ( x 1,
More informationSTRAND J: TRANSFORMATIONS, VECTORS and MATRICES
Mathematics SKE, Strand J STRAND J: TRANSFORMATIONS, VECTORS and MATRICES J4 Matrices Text Contents * * * * Section J4. Matrices: Addition and Subtraction J4.2 Matrices: Multiplication J4.3 Inverse Matrices:
More informationSpring 2016 Indiana Collegiate Mathematics Competition (ICMC) Exam
Spring 2016 Indiana Collegiate Mathematics Competition (ICMC) Exam Mathematical Association of America Indiana Section Written by: Paul Fonstad, Justin Gash, and Stacy Hoehn (Franklin College) PROBLEM
More informationIntroduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2)
Introduction to Game Theory Lecture Note 2: Strategic-Form Games and Nash Equilibrium (2) Haifeng Huang University of California, Merced Best response functions: example In simple games we can examine
More informationREPRESENTATIONS OF GROUP ALGEBRAS. Contents. 1. Maschke s theorem: every submodule is a direct summand. References 6
REPRESENTATIONS OF GROUP ALGEBRAS ZAJJ DAUGHERTY MARCH 27, 28 Contents. Maschke s theorem: every submodule is a direct summand References 6 See [DF, Ch. 8] for proofs and more examples. Jumping back into
More informationPre-Calculus 12 Learning Guides
LG 1 Function Transformations 1 trans for ma tion A change made to a figure or a relation such that the figure or the graph of the relation is shifted or changed in shape. Examples are translations, reflections,
More informationDesigning Information Devices and Systems I Spring 2019 Lecture Notes Note 2
EECS 6A Designing Information Devices and Systems I Spring 9 Lecture Notes Note Vectors and Matrices In the previous note, we introduced vectors and matrices as a way of writing systems of linear equations
More informationFormalizing Arrow s Theorem in Logics of Dependence and Independence
1/22 Formalizing Arrow s Theorem in Logics of Dependence and Independence Fan Yang Delft University of Technology Logics for Social Behaviour ETH Zürich 8-11 February, 2016 Joint work with Eric Pacuit
More informationMathematical Background
Chapter 1 Mathematical Background When we analyze various algorithms in terms of the time and the space it takes them to run, we often need to work with math. That is why we ask you to take MA 2250 Math
More informationLinear Algebra, Summer 2011, pt. 3
Linear Algebra, Summer 011, pt. 3 September 0, 011 Contents 1 Orthogonality. 1 1.1 The length of a vector....................... 1. Orthogonal vectors......................... 3 1.3 Orthogonal Subspaces.......................
More informationCMPSCI 240: Reasoning about Uncertainty
CMPSCI 240: Reasoning about Uncertainty Lecture 7: More Advanced Counting Andrew McGregor University of Massachusetts Last Compiled: February 21, 2017 Outline 1 Recap 2 Partitions 3 More Examples 4 Clicker
More informationThe second Rehnquist Court begins with the Supreme
A pattern analysis of the second Rehnquist U.S. Supreme Court Lawrence Sirovich Laboratory of Applied Mathematics, Department of Biomathematical Sciences, Mount Sinai School of Medicine, One Gustave L.
More informationDependence and Independence in Social Choice Theory
Dependence and Independence in Social Choice Theory Eric Pacuit Department of Philosophy University of Maryland, College Park pacuit.org epacuit@umd.edu March 4, 2014 Eric Pacuit 1 Competing desiderata
More informationReview of Matrices and Block Structures
CHAPTER 2 Review of Matrices and Block Structures Numerical linear algebra lies at the heart of modern scientific computing and computational science. Today it is not uncommon to perform numerical computations
More informationSMT 2011 General Test and Solutions February 19, F (x) + F = 1 + x. 2 = 3. Now take x = 2 2 F ( 1) = F ( 1) = 3 2 F (2)
SMT 0 General Test and Solutions February 9, 0 Let F () be a real-valued function defined for all real 0, such that ( ) F () + F = + Find F () Answer: Setting =, we find that F () + F ( ) = Now take =,
More informationSet Notation and Axioms of Probability NOT NOT X = X = X'' = X
Set Notation and Axioms of Probability Memory Hints: Intersection I AND I looks like A for And Union U OR + U looks like U for Union Complement NOT X = X = X' NOT NOT X = X = X'' = X Commutative Law A
More informationThe Category of Simple Voting Games
The Category of Simple Voting Games Simon Terrington July 11th, 2004 In this paper I describe a notation for simple voting games that has three properties: It facilitates the calculation of the measures
More informationCMU Social choice 2: Manipulation. Teacher: Ariel Procaccia
CMU 15-896 Social choice 2: Manipulation Teacher: Ariel Procaccia Reminder: Voting Set of voters Set of alternatives Each voter has a ranking over the alternatives means that voter prefers to Preference
More informationThe Gelfand-Tsetlin Basis (Too Many Direct Sums, and Also a Graph)
The Gelfand-Tsetlin Basis (Too Many Direct Sums, and Also a Graph) David Grabovsky June 13, 2018 Abstract The symmetric groups S n, consisting of all permutations on a set of n elements, naturally contain
More informationA Pattern Analysis of the Second Rehnquist U.S. Supreme Court
1 A Pattern Analysis of the Second Rehnquist U.S. Supreme Court Lawrence Sirovich Laboratory of Applied Mathematics Department of Biomathematical Sciences Mount Sinai School of Medicine One Gustave L.
More informationSummer Packet. 8 th Grade Math Name
Summer Packet 8 th Grade Math Name Page of 15 8 th Grade MSA Formative #3 Non Calculator Section 1B1b b 1. Evaluate this expression for a 4 and b 16 : ab 4 a a. a. 84 b. 5 c. 44 d. 4 1B1c. Evaluate this
More informationNOTES FOR 128: COMBINATORIAL REPRESENTATION THEORY OF COMPLEX LIE ALGEBRAS AND RELATED TOPICS
NOTES FOR 128: COMBINATORIAL REPRESENTATION THEORY OF COMPLEX LIE ALGEBRAS AND RELATED TOPICS (FIRST COUPLE LECTURES MORE ONLINE AS WE GO) Recommended reading [Bou] N. Bourbaki, Elements of Mathematics:
More informationDiscrete Probability. Chemistry & Physics. Medicine
Discrete Probability The existence of gambling for many centuries is evidence of long-running interest in probability. But a good understanding of probability transcends mere gambling. The mathematics
More informationSocial Choice and Networks
Social Choice and Networks Elchanan Mossel UC Berkeley All rights reserved Logistics 1 Different numbers for the course: Compsci 294 Section 063 Econ 207A Math C223A Stat 206A Room: Cory 241 Time TuTh
More informationIntroduction to Formal Epistemology Lecture 5
Introduction to Formal Epistemology Lecture 5 Eric Pacuit and Rohit Parikh August 17, 2007 Eric Pacuit and Rohit Parikh: Introduction to Formal Epistemology, Lecture 5 1 Plan for the Course Introduction,
More information6.5: Generalized permutations and combinations continued
6.5: Generalized permutations and combinations continued Last time: Placing objects in boxes (combination problems) How many ways can you place n objects into k boxes, if...? For each question, ask yourself:
More informationDesigning Information Devices and Systems I Fall 2018 Lecture Notes Note 2
EECS 6A Designing Information Devices and Systems I Fall 08 Lecture Notes Note Vectors and Matrices In the previous note, we introduced vectors and matrices as a way of writing systems of linear equations
More informationAntipodality in committee selection. Abstract
Antipodality in committee selection Daniel Eckert University of Graz Christian Klamler University of Graz Abstract In this paper we compare a minisum and a minimax procedure as suggested by Brams et al.
More informationGiven. Segment Addition. Substitution Property of Equality. Division. Subtraction Property of Equality
Mastery Test Questions (10) 1. Question: What is the missing step in the following proof? Given: ABC with DE AC. Prove: Proof: Statement Reason
More informationAlgorithmic Game Theory Introduction to Mechanism Design
Algorithmic Game Theory Introduction to Mechanism Design Makis Arsenis National Technical University of Athens April 216 Makis Arsenis (NTUA) AGT April 216 1 / 41 Outline 1 Social Choice Social Choice
More informationThe Basics: Twenty-Seven Problems
The Basics: Twenty-Seven Problems Keone Hon 1 Problems 1. The measure of an angle is 3 times the measure of its complement. Find the measure of the angle in degrees.. Three calculus books weigh as much
More informationProf. Thistleton MAT 505 Introduction to Probability Lecture 5
Sections from Text and MIT Video Lecture: Sections 3.3, 3.4, 3.5 http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-041-probabilistic-systems-analysis-andapplied-probability-fall-2010/video-lectures/lecture-2-conditioning-and-bayes-rule/
More information1 Preliminaries Sample Space and Events Interpretation of Probability... 13
Summer 2017 UAkron Dept. of Stats [3470 : 461/561] Applied Statistics Ch 2: Probability Contents 1 Preliminaries 3 1.1 Sample Space and Events...........................................................
More informationLinear Algebra March 16, 2019
Linear Algebra March 16, 2019 2 Contents 0.1 Notation................................ 4 1 Systems of linear equations, and matrices 5 1.1 Systems of linear equations..................... 5 1.2 Augmented
More informationUNIT Explain about the partition of a sampling space theorem?
UNIT -1 1. Explain about the partition of a sampling space theorem? PARTITIONS OF A SAMPLE SPACE The events B1, B2. B K represent a partition of the sample space 'S" if (a) So, when the experiment E is
More informationVolume 31, Issue 1. Manipulation of the Borda rule by introduction of a similar candidate. Jérôme Serais CREM UMR 6211 University of Caen
Volume 31, Issue 1 Manipulation of the Borda rule by introduction of a similar candidate Jérôme Serais CREM UMR 6211 University of Caen Abstract In an election contest, a losing candidate a can manipulate
More informationEdexcel Mathematics Higher Tier, November 2011 (1380/3H) (Paper 3, non-calculator)
Link to examining board: www.edexcel.com This question paper is not yet available to download for free from the Edexcel website. You can purchase your own copy by phoning the Edexcel order line on 01623
More informationLose Big, Win Big, Sum Big: An Exploration of Ranked Voting Systems
Bard College Bard Digital Commons Senior Projects Spring 016 Bard Undergraduate Senior Projects 016 Lose Big, Win Big, Sum Big: An Exploration of Ranked Voting Systems Erin Else Stuckenbruck Bard College
More informationRECOGNIZING GALOIS GROUPS S n AND A n
RECOGNIZING GALOIS GROUPS S n AND A n KEITH CONRAD 1. Introduction If f(x) K[X] is a separable irreducible polynomial of degree n and G f is its Galois group over K (the Galois group of the splitting field
More informationCosine similarity and the Borda rule
Cosine siilarity and the Borda rule Yoko Kawada Abstract Cosine siilarity is a coonly used siilarity easure in coputer science. We propose a voting rule based on cosine siilarity, naely, the cosine siilarity
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More informationA NEW WAY TO ANALYZE PAIRED COMPARISONS
A NEW WAY TO ANALYZE PAIRED COMPARISONS DONALD G. SAARI Abstract. The importance of paired comparisons, whether ordinal or cardinal, has motivated the creation of several methodological approaches; missing,
More informationProperties of Continuous Probability Distributions The graph of a continuous probability distribution is a curve. Probability is represented by area
Properties of Continuous Probability Distributions The graph of a continuous probability distribution is a curve. Probability is represented by area under the curve. The curve is called the probability
More informationUniversity of Technology, Building and Construction Engineering Department (Undergraduate study) PROBABILITY THEORY
ENGIEERING STATISTICS (Lectures) University of Technology, Building and Construction Engineering Department (Undergraduate study) PROBABILITY THEORY Dr. Maan S. Hassan Lecturer: Azhar H. Mahdi Probability
More informationA geometric proof of the spectral theorem for real symmetric matrices
0 0 0 A geometric proof of the spectral theorem for real symmetric matrices Robert Sachs Department of Mathematical Sciences George Mason University Fairfax, Virginia 22030 rsachs@gmu.edu January 6, 2011
More informationWeek 6: Differential geometry I
Week 6: Differential geometry I Tensor algebra Covariant and contravariant tensors Consider two n dimensional coordinate systems x and x and assume that we can express the x i as functions of the x i,
More informationGeometry of distance-rationalization
Geometry of distance-rationalization B.Hadjibeyli M.C.Wilson Department of Computer Science, University of Auckland Benjamin Hadjibeyli (ENS Lyon) Geometry of distance-rationalization Talk CMSS 1 / 31
More informationGCSE Mathematics Non-Calculator Higher Tier Free Practice Set 1 1 hour 45 minutes ANSWERS. Grade Boundaries A* A B C D E.
MathsMadeEasy GCSE Mathematics Non-Calculator Higher Tier Free Practice Set 1 1 hour 45 minutes ANSWERS Grade Boundaries A* A B C D E 88 71 57 43 22 13 3 Authors Note Every possible effort has been made
More informationYou must have: Ruler graduated in centimetres and millimetres, protractor, compasses, pen, HB pencil, eraser, calculator. Tracing paper may be used.
Write your name here Surname Other names Pearson Edexcel International GCSE Centre Number Mathematics B Paper 1 Candidate Number Tuesday 6 January 2015 Afternoon Time: 1 hour 30 minutes Paper Reference
More information