DOCSLIB.ORG

Combinatorics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Combinatorics Combinatorics MAT230 Discrete Mathematics Fall 2019 MAT230 (Discrete Math) Combinatorics Fall 2019 1 / 29 Outline 1 Basic Counting Techniques|The Rule of Products 2 Permutations 3 Combinations 4 Permutations and Combinations with Repetition 5 Summary of Combinatorics 6 The Binomial Theorem and Principle of Inclusion-Exclusion MAT230 (Discrete Math) Combinatorics Fall 2019 2 / 29 There are 256 + 128 = 384 people, so there are 384 different ways to choose a president. There are 256 ways to choose a president. For each of those ways there are 128 ways to choose a vice president. Thus there are 256 × 128 = 32; 768 ways to choose both. Basic Counting Techniques 1 How many ways are there to pick a president from a class of 256 women and 128 men? 2 How many ways are there to pick a president from 256 women and a vice president from 128 men? MAT230 (Discrete Math) Combinatorics Fall 2019 3 / 29 There are 256 ways to choose a president. For each of those ways there are 128 ways to choose a vice president. Thus there are 256 × 128 = 32; 768 ways to choose both. Basic Counting Techniques 1 How many ways are there to pick a president from a class of 256 women and 128 men? There are 256 + 128 = 384 people, so there are 384 different ways to choose a president. 2 How many ways are there to pick a president from 256 women and a vice president from 128 men? MAT230 (Discrete Math) Combinatorics Fall 2019 3 / 29 Basic Counting Techniques 1 How many ways are there to pick a president from a class of 256 women and 128 men? There are 256 + 128 = 384 people, so there are 384 different ways to choose a president. 2 How many ways are there to pick a president from 256 women and a vice president from 128 men? There are 256 ways to choose a president. For each of those ways there are 128 ways to choose a vice president. Thus there are 256 × 128 = 32; 768 ways to choose both. MAT230 (Discrete Math) Combinatorics Fall 2019 3 / 29 Basic Counting Techniques These problems are examples of counting problems. Our first two counting rules are: 1 The Rule of Sums: If a first task can be done n ways and a second task can be done m ways, and if these tasks cannot be done at the same time, then there are n + m ways to do either task. 2 The Rule of Products: If a first task can be done n ways and a second task can be done m ways, and if the tasks must be done sequentially, then there are n · m ways to do the two tasks. MAT230 (Discrete Math) Combinatorics Fall 2019 4 / 29 Basic Counting Techniques The first question we encountered required the Sum Rule because we needed to choose a president and we could do that from the group of women (task 1) or from the group of men (task 2). The two tasks could not both be done; we could only do one or the other. The second question required the Rule of Products because we had to pick a president from the group of women (task 1) and then pick a vice president from the group of men (task 2). The order of the tasks is not important, just that each one is independent of the other. MAT230 (Discrete Math) Combinatorics Fall 2019 5 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: bit string: Basic Counting Techniques Example How many different bit strings having 5 bits are there? MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: bit string: MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 bit string: MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 bit string:0 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 bit string: 0 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 bit string: 01 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 2 bit string: 0 1 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 2 bit string: 0 11 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 2 2 bit string: 0 1 1 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 2 2 bit string: 0 1 10 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5. Basic Counting Techniques Example How many different bit strings having 5 bits are there? A bit string with 5 bits has five \slots" that can hold bits. To \create" a bit string we need to first choose the first bit, then the second bit, and so on. Thus the product rule will apply here. number of choices: 2 2 2 2 2 bit string: 0 1 1 0 MAT230 (Discrete Math) Combinatorics Fall 2019 6 / 29 If we find the product of all the \number of choices" values we see that there are 32 different bit strings of length 5.
Load more

Recommended publications
  • Research Statement
    D. A. Williams II June 2021 Research Statement I am an algebraist with expertise in the areas of representation theory of Lie superalgebras, associative superalgebras, and algebraic objects related to mathematical physics. As a post- doctoral fellow, I have extended my research to include topics in enumerative and algebraic combinatorics. My research is collaborative, and I welcome collaboration in familiar areas and in newer undertakings. The referenced open problems here, their subproblems, and other ideas in mind are suitable for undergraduate projects and theses, doctoral proposals, or scholarly contributions to academic journals. In what follows, I provide a technical description of the motivation and history of my work in Lie superalgebras and super representation theory. This is then followed by a description of the work I am currently supervising and mentoring, in combinatorics, as I serve as the Postdoctoral Research Advisor for the Mathematical Sciences Research Institute's Undergraduate Program 2021. 1 Super Representation Theory 1.1 History 1.1.1 Superalgebras In 1941, Whitehead dened a product on the graded homotopy groups of a pointed topological space, the rst non-trivial example of a Lie superalgebra. Whitehead's work in algebraic topol- ogy [Whi41] was known to mathematicians who dened new graded geo-algebraic structures, such as -graded algebras, or superalgebras to physicists, and their modules. A Lie superalge- Z2 bra would come to be a -graded vector space, even (respectively, odd) elements g = g0 ⊕ g1 Z2 found in (respectively, ), with a parity-respecting bilinear multiplication termed the Lie g0 g1 superbracket inducing1 a symmetric intertwining map of -modules.
    [Show full text]
  • Introduction to Computational Social Choice
    1 Introduction to Computational Social Choice Felix Brandta, Vincent Conitzerb, Ulle Endrissc, J´er^omeLangd, and Ariel D. Procacciae 1.1 Computational Social Choice at a Glance Social choice theory is the field of scientific inquiry that studies the aggregation of individual preferences towards a collective choice. For example, social choice theorists|who hail from a range of different disciplines, including mathematics, economics, and political science|are interested in the design and theoretical evalu- ation of voting rules. Questions of social choice have stimulated intellectual thought for centuries. Over time the topic has fascinated many a great mind, from the Mar- quis de Condorcet and Pierre-Simon de Laplace, through Charles Dodgson (better known as Lewis Carroll, the author of Alice in Wonderland), to Nobel Laureates such as Kenneth Arrow, Amartya Sen, and Lloyd Shapley. Computational social choice (COMSOC), by comparison, is a very young field that formed only in the early 2000s. There were, however, a few precursors. For instance, David Gale and Lloyd Shapley's algorithm for finding stable matchings between two groups of people with preferences over each other, dating back to 1962, truly had a computational flavor. And in the late 1980s, a series of papers by John Bartholdi, Craig Tovey, and Michael Trick showed that, on the one hand, computational complexity, as studied in theoretical computer science, can serve as a barrier against strategic manipulation in elections, but on the other hand, it can also prevent the efficient use of some voting rules altogether. Around the same time, a research group around Bernard Monjardet and Olivier Hudry also started to study the computational complexity of preference aggregation procedures.
    [Show full text]
  • An Exploration of the Relationship Between Mathematics and Music
    An Exploration of the Relationship between Mathematics and Music Shah, Saloni 2010 MIMS EPrint: 2010.103 Manchester Institute for Mathematical Sciences School of Mathematics The University of Manchester Reports available from: http://eprints.maths.manchester.ac.uk/ And by contacting: The MIMS Secretary School of Mathematics The University of Manchester Manchester, M13 9PL, UK ISSN 1749-9097 An Exploration of ! Relation"ip Between Ma#ematics and Music MATH30000, 3rd Year Project Saloni Shah, ID 7177223 University of Manchester May 2010 Project Supervisor: Professor Roger Plymen ! 1 TABLE OF CONTENTS Preface! 3 1.0 Music and Mathematics: An Introduction to their Relationship! 6 2.0 Historical Connections Between Mathematics and Music! 9 2.1 Music Theorists and Mathematicians: Are they one in the same?! 9 2.2 Why are mathematicians so fascinated by music theory?! 15 3.0 The Mathematics of Music! 19 3.1 Pythagoras and the Theory of Music Intervals! 19 3.2 The Move Away From Pythagorean Scales! 29 3.3 Rameau Adds to the Discovery of Pythagoras! 32 3.4 Music and Fibonacci! 36 3.5 Circle of Fifths! 42 4.0 Messiaen: The Mathematics of his Musical Language! 45 4.1 Modes of Limited Transposition! 51 4.2 Non-retrogradable Rhythms! 58 5.0 Religious Symbolism and Mathematics in Music! 64 5.1 Numbers are God"s Tools! 65 5.2 Religious Symbolism and Numbers in Bach"s Music! 67 5.3 Messiaen"s Use of Mathematical Ideas to Convey Religious Ones! 73 6.0 Musical Mathematics: The Artistic Aspect of Mathematics! 76 6.1 Mathematics as Art! 78 6.2 Mathematical Periods! 81 6.3 Mathematics Periods vs.
    [Show full text]
  • 18.703 Modern Algebra, Permutation Groups
    5. Permutation groups Definition 5.1. Let S be a set. A permutation of S is simply a bijection f : S −! S. Lemma 5.2. Let S be a set. (1) Let f and g be two permutations of S. Then the composition of f and g is a permutation of S. (2) Let f be a permutation of S. Then the inverse of f is a permu­ tation of S. Proof. Well-known. D Lemma 5.3. Let S be a set. The set of all permutations, under the operation of composition of permutations, forms a group A(S). Proof. (5.2) implies that the set of permutations is closed under com­ position of functions. We check the three axioms for a group. We already proved that composition of functions is associative. Let i: S −! S be the identity function from S to S. Let f be a permutation of S. Clearly f ◦ i = i ◦ f = f. Thus i acts as an identity. Let f be a permutation of S. Then the inverse g of f is a permutation of S by (5.2) and f ◦ g = g ◦ f = i, by definition. Thus inverses exist and G is a group. D Lemma 5.4. Let S be a finite set with n elements. Then A(S) has n! elements. Proof. Well-known. D Definition 5.5. The group Sn is the set of permutations of the first n natural numbers. We want a convenient way to represent an element of Sn. The first way, is to write an element σ of Sn as a matrix.
    [Show full text]
  • Introduction to Computational Social Choice Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D
    Introduction to Computational Social Choice Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia To cite this version: Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia. Introduction to Computational Social Choice. Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, Ariel D. Procaccia, Handbook of Computational Social Choice, Cambridge University Press, pp.1-29, 2016, 9781107446984. 10.1017/CBO9781107446984. hal-01493516 HAL Id: hal-01493516 https://hal.archives-ouvertes.fr/hal-01493516 Submitted on 21 Mar 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. 1 Introduction to Computational Social Choice Felix Brandta, Vincent Conitzerb, Ulle Endrissc, J´er^omeLangd, and Ariel D. Procacciae 1.1 Computational Social Choice at a Glance Social choice theory is the field of scientific inquiry that studies the aggregation of individual preferences towards a collective choice. For example, social choice theorists|who hail from a range of different disciplines, including mathematics, economics, and political science|are interested in the design and theoretical evalu- ation of voting rules. Questions of social choice have stimulated intellectual thought for centuries. Over time the topic has fascinated many a great mind, from the Mar- quis de Condorcet and Pierre-Simon de Laplace, through Charles Dodgson (better known as Lewis Carroll, the author of Alice in Wonderland), to Nobel Laureates such as Kenneth Arrow, Amartya Sen, and Lloyd Shapley.
    [Show full text]
  • Permutation Group and Determinants (Dated: September 16, 2021)
    Permutation group and determinants (Dated: September 16, 2021) 1 I. SYMMETRIES OF MANY-PARTICLE FUNCTIONS Since electrons are fermions, the electronic wave functions have to be antisymmetric. This chapter will show how to achieve this goal. The notion of antisymmetry is related to permutations of electrons’ coordinates. Therefore we will start with the discussion of the permutation group and then introduce the permutation-group-based definition of determinant, the zeroth-order approximation to the wave function in theory of many fermions. This definition, in contrast to that based on the Laplace expansion, relates clearly to properties of fermionic wave functions. The determinant gives an N-particle wave function built from a set of N one-particle waves functions and is called Slater’s determinant. II. PERMUTATION (SYMMETRIC) GROUP Definition of permutation group: The permutation group, known also under the name of symmetric group, is the group of all operations on a set of N distinct objects that order the objects in all possible ways. The group is denoted as SN (we will show that this is a group below). We will call these operations permutations and denote them by symbols σi. For a set consisting of numbers 1, 2, :::, N, the permutation σi orders these numbers in such a way that k is at jth position. Often a better way of looking at permutations is to say that permutations are all mappings of the set 1, 2, :::, N onto itself: σi(k) = j, where j has to go over all elements. Number of permutations: The number of permutations is N! Indeed, we can first place each object at positions 1, so there are N possible placements.
    [Show full text]
  • The Mathematics Major's Handbook
    The Mathematics Major’s Handbook (updated Spring 2016) Mathematics Faculty and Their Areas of Expertise Jennifer Bowen Abstract Algebra, Nonassociative Rings and Algebras, Jordan Algebras James Hartman Linear Algebra, Magic Matrices, Involutions, (on leave) Statistics, Operator Theory Robert Kelvey Combinatorial and Geometric Group Theory Matthew Moynihan Abstract Algebra, Combinatorics, Permutation Enumeration R. Drew Pasteur Differential Equations, Mathematics in Biology/Medicine, Sports Data Analysis Pamela Pierce Real Analysis, Functions of Generalized Bounded Variation, Convergence of Fourier Series, Undergraduate Mathematics Education, Preparation of Pre-service Teachers John Ramsay Topology, Algebraic Topology, Operations Research OndˇrejZindulka Real Analysis, Fractal geometry, Geometric Measure Theory, Set Theory 1 2 Contents 1 Mission Statement and Learning Goals 5 1.1 Mathematics Department Mission Statement . 5 1.2 Learning Goals for the Mathematics Major . 5 2 Curriculum 8 3 Requirements for the Major 9 3.1 Recommended Timeline for the Mathematics Major . 10 3.2 Requirements for the Double Major . 10 3.3 Requirements for Teaching Licensure in Mathematics . 11 3.4 Requirements for the Minor . 11 4 Off-Campus Study in Mathematics 12 5 Senior Independent Study 13 5.1 Mathematics I.S. Student/Advisor Guidelines . 13 5.2 Project Topics . 13 5.3 Project Submissions . 14 5.3.1 Project Proposal . 14 5.3.2 Project Research . 14 5.3.3 Annotated Bibliography . 14 5.3.4 Thesis Outline . 15 5.3.5 Completed Chapters . 15 5.3.6 Digitial I.S. Document . 15 5.3.7 Poster . 15 5.3.8 Document Submission and oral presentation schedule . 15 6 Independent Study Assessment Guide 21 7 Further Learning Opportunities 23 7.1 At Wooster .
    [Show full text]
  • Universal Invariant and Equivariant Graph Neural Networks
    Universal Invariant and Equivariant Graph Neural Networks Nicolas Keriven Gabriel Peyré École Normale Supérieure CNRS and École Normale Supérieure Paris, France Paris, France [email protected] [email protected] Abstract Graph Neural Networks (GNN) come in many flavors, but should always be either invariant (permutation of the nodes of the input graph does not affect the output) or equivariant (permutation of the input permutes the output). In this paper, we consider a specific class of invariant and equivariant networks, for which we prove new universality theorems. More precisely, we consider networks with a single hidden layer, obtained by summing channels formed by applying an equivariant linear operator, a pointwise non-linearity, and either an invariant or equivariant linear output layer. Recently, Maron et al. (2019b) showed that by allowing higher- order tensorization inside the network, universal invariant GNNs can be obtained. As a first contribution, we propose an alternative proof of this result, which relies on the Stone-Weierstrass theorem for algebra of real-valued functions. Our main contribution is then an extension of this result to the equivariant case, which appears in many practical applications but has been less studied from a theoretical point of view. The proof relies on a new generalized Stone-Weierstrass theorem for algebra of equivariant functions, which is of independent interest. Additionally, unlike many previous works that consider a fixed number of nodes, our results show that a GNN defined by a single set of parameters can approximate uniformly well a function defined on graphs of varying size. 1 Introduction Designing Neural Networks (NN) to exhibit some invariance or equivariance to group operations is a central problem in machine learning (Shawe-Taylor, 1993).
    [Show full text]
  • Lecture 9: Permutation Groups
    Lecture 9: Permutation Groups Prof. Dr. Ali Bülent EKIN· Doç. Dr. Elif TAN Ankara University Ali Bülent Ekin, Elif Tan (Ankara University) Permutation Groups 1 / 14 Permutation Groups Definition A permutation of a nonempty set A is a function s : A A that is one-to-one and onto. In other words, a pemutation of a set! is a rearrangement of the elements of the set. Theorem Let A be a nonempty set and let SA be the collection of all permutations of A. Then (SA, ) is a group, where is the function composition operation. The identity element of (SA, ) is the identity permutation i : A A, i (a) = a. ! 1 The inverse element of s is the permutation s such that 1 1 ss (a) = s s (a) = i (a) . Ali Bülent Ekin, Elif Tan (Ankara University) Permutation Groups 2 / 14 Permutation Groups Definition The group (SA, ) is called a permutation group on A. We will focus on permutation groups on finite sets. Definition Let In = 1, 2, ... , n , n 1 and let Sn be the set of all permutations on f g ≥ In.The group (Sn, ) is called the symmetric group on In. Let s be a permutation on In. It is convenient to use the following two-row notation: 1 2 n s = ··· s (1) s (2) s (n) ··· Ali Bülent Ekin, Elif Tan (Ankara University) Permutation Groups 3 / 14 Symmetric Groups 1 2 3 4 1 2 3 4 Example: Let f = and g = . Then 1 3 4 2 4 3 2 1 1 2 3 4 1 2 3 4 1 2 3 4 f g = = 1 3 4 2 4 3 2 1 2 4 3 1 1 2 3 4 1 2 3 4 1 2 3 4 g f = = 4 3 2 1 1 3 4 2 4 2 1 3 which shows that f g = g f .
    [Show full text]
  • Diagrams of Affine Permutations and Their Labellings Taedong
    Diagrams of Affine Permutations and Their Labellings by Taedong Yun Submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 2013 c Taedong Yun, MMXIII. All rights reserved. The author hereby grants to MIT permission to reproduce and to distribute publicly paper and electronic copies of this thesis document in whole or in part in any medium now known or hereafter created. Author.............................................................. Department of Mathematics April 29, 2013 Certified by. Richard P. Stanley Professor of Applied Mathematics Thesis Supervisor Accepted by . Paul Seidel Chairman, Department Committee on Graduate Theses 2 Diagrams of Affine Permutations and Their Labellings by Taedong Yun Submitted to the Department of Mathematics on April 29, 2013, in partial fulfillment of the requirements for the degree of Doctor of Philosophy Abstract We study affine permutation diagrams and their labellings with positive integers. Bal- anced labellings of a Rothe diagram of a finite permutation were defined by Fomin- Greene-Reiner-Shimozono, and we extend this notion to affine permutations. The balanced labellings give a natural encoding of the reduced decompositions of affine permutations. We show that the sum of weight monomials of the column-strict bal- anced labellings is the affine Stanley symmetric function which plays an important role in the geometry of the affine Grassmannian. Furthermore, we define set-valued balanced labellings in which the labels are sets of positive integers, and we investi- gate the relations between set-valued balanced labellings and nilHecke words in the nilHecke algebra. A signed generating function of column-strict set-valued balanced labellings is shown to coincide with the affine stable Grothendieck polynomial which is related to the K-theory of the affine Grassmannian.
    [Show full text]
  • Discrete Mathematics Discrete Probability
    Introduction Probability Theory Discrete Mathematics Discrete Probability Prof. Steven Evans Prof. Steven Evans Discrete Mathematics Introduction Probability Theory 7.1: An Introduction to Discrete Probability Prof. Steven Evans Discrete Mathematics Introduction Probability Theory Finite probability Definition An experiment is a procedure that yields one of a given set os possible outcomes. The sample space of the experiment is the set of possible outcomes. An event is a subset of the sample space. Laplace's definition of the probability p(E) of an event E in a sample space S with finitely many equally possible outcomes is jEj p(E) = : jSj Prof. Steven Evans Discrete Mathematics By the product rule, the number of hands containing a full house is the product of the number of ways to pick two kinds in order, the number of ways to pick three out of four for the first kind, and the number of ways to pick two out of the four for the second kind. We see that the number of hands containing a full house is P(13; 2) · C(4; 3) · C(4; 2) = 13 · 12 · 4 · 6 = 3744: Because there are C(52; 5) = 2; 598; 960 poker hands, the probability of a full house is 3744 ≈ 0:0014: 2598960 Introduction Probability Theory Finite probability Example What is the probability that a poker hand contains a full house, that is, three of one kind and two of another kind? Prof. Steven Evans Discrete Mathematics Introduction Probability Theory Finite probability Example What is the probability that a poker hand contains a full house, that is, three of one kind and two of another kind? By the product rule, the number of hands containing a full house is the product of the number of ways to pick two kinds in order, the number of ways to pick three out of four for the first kind, and the number of ways to pick two out of the four for the second kind.
    [Show full text]
  • Why Theory of Quantum Computing Should Be Based on Finite Mathematics Felix Lev
    Why Theory of Quantum Computing Should be Based on Finite Mathematics Felix Lev To cite this version: Felix Lev. Why Theory of Quantum Computing Should be Based on Finite Mathematics. 2018. hal-01918572 HAL Id: hal-01918572 https://hal.archives-ouvertes.fr/hal-01918572 Preprint submitted on 11 Nov 2018 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Why Theory of Quantum Computing Should be Based on Finite Mathematics Felix M. Lev Artwork Conversion Software Inc., 1201 Morningside Drive, Manhattan Beach, CA 90266, USA (Email: [email protected]) Abstract We discuss finite quantum theory (FQT) developed in our previous publica- tions and give a simple explanation that standard quantum theory is a special case of FQT in the formal limit p ! 1 where p is the characteristic of the ring or field used in FQT. Then we argue that FQT is a more natural basis for quantum computing than standard quantum theory. Keywords: finite mathematics, quantum theory, quantum computing 1 Motivation Classical computer science is based on discrete mathematics for obvious reasons. Any computer can operate only with a finite number of bits, a bit represents the minimum amount of information and the notions of one half of the bit, one third of the bit etc.
    [Show full text]