A podcast you can count on http://podcast.mathzorro.com en-us ©2015 Christopher Hanusa Christopher Hanusa Professor Christopher R. H. Hanusa (Queens College of the City University of New York) interviews fellow mathematicians and student researchers about their research in combinatorics. Guests present counting problems and discuss their methods of attack. Professor Christopher R. H. Hanusa (Queens College of the City University of New York) interviews fellow mathematicians and student researchers about their research in combinatorics. Guests present counting problems and discuss their methods of attack. Christopher Hanusa chanusa@qc.cuny.edu (Christopher Hanusa) chanusa@qc.cuny.edu (Christopher Hanusa) http://qcpages.qc.edu/~chanusa/podcasts/zorrop.png http://podcast.mathzorro.com Christopher Hanusa chanusa@qc.cuny.edu math, maths, mathematics, combinatorics, counting, research, interview, Queens College, CUNY, no Thu, 16 Jul 2015 10:00:00 EDT Thu, 16 Jul 2015 10:00:00 EDT Christopher Hanusa Ray Chin answers a counting question related to card collecting. Ray Chin discusses his childhood hobby involving card collecting. (Cards such as Pokemon, Yu-Gi-Oh, Magic the Gathering, Baseball cards, etc.) He asks the question "In how many ways can you collect a full set of 10 cards when every deck you buy contains five random cards each?". This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Ray Chin discusses his childhood hobby involving card collecting. (Cards such as Pokemon, Yu-Gi-Oh, Magic the Gathering, Baseball cards, etc.) He asks the question "In how many ways can you collect a full set of 10 cards when every deck you buy contains five random cards each?". This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. CardCollecting 9:58 Wed, 15 Jul 2015 20:00:00 EDT Christopher Hanusa Candice Sands and Gaitrie Sackichand count non-attacking placements of chess pieces on a chessboard. Candice Sands and Gaitrie Sackichand ask the question "In how many ways can you place two chess pieces on a chessboard so that they don't attack one another?". They investigate the king, rook, bishop, queen, and nightrider. Part of the interview is a discussion of teamwork in research. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Candice Sands and Gaitrie Sackichand ask the question "In how many ways can you place two chess pieces on a chessboard so that they don't attack one another?". They investigate the king, rook, bishop, queen, and nightrider. Part of the interview is a discussion of teamwork in research. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. ChessPiecePlacements 11:47 Wed, 15 Jul 2015 19:00:00 EDT Christopher Hanusa Varindra Hart counts square and domino tilings of a region composed of nested chevrons. Varindra Hart counts square and domino tilings of a region composed of nested chevrons. Varindra Hart counts square and domino tilings of a region composed of nested chevrons. Includes a surprise appearance by the square root of 17. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. ChevronTilings 14:59 Wed, 15 Jul 2015 18:00:00 EDT Christopher Hanusa Nikki counts solvable Nurikabe boards. Nikki investigates her favorite puzzle game Nurikabe, and asks how many 4x4 solvable Nurikabe boards exist. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Nikki investigates her favorite puzzle game Nurikabe, and asks how many 4x4 solvable Nurikabe boards exist. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Nurikabe 8:19 Wed, 15 Jul 2015 17:00:00 EDT Christopher Hanusa Jan Bazant counts lattice paths in Manhattan. Jan Bazant asks the question "How many lattice paths are there from (0,0) to (m,n) where each step can be North, East, or West?". He addresses the trials he faced throughout his research. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Jan Bazant asks the question "How many lattice paths are there from (0,0) to (m,n) where each step can be North, East, or West?". He addresses the trials he faced throughout his research. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. LatticePaths 6:16 Wed, 15 Jul 2015 16:00:00 EDT Christopher Hanusa Seung Park counts the number of ways in which the NY Knicks can shoot the basketball. Seung Park asks "In how many ways can the New York Knicks shoot the basketball?". He explains how he uses generating functions to answer this question. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Seung Park asks "In how many ways can the New York Knicks shoot the basketball?". He explains how he uses generating functions to answer this question. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Basketball 9:53 Wed, 15 Jul 2015 15:00:00 EDT Christopher Hanusa Connie Durso and Davida investigate the game Dominosa. Connie Durso and Davida investigate the game Dominosa. They count the number of possible ways to place dominoes on boards of different sizes before researching the number of possible valid Dominosa boards. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Connie Durso and Davida investigate the game Dominosa. They count the number of possible ways to place dominoes on boards of different sizes before researching the number of possible valid Dominosa boards. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Dominosa 19:53 Wed, 15 Jul 2015 14:00:00 EDT Christopher Hanusa Annette Paciorek investigates graphs that have the same degree sequence. Annette Paciorek investigates graphs that have the same degree sequence, focusing mainly on cycle graphs and when one additional edge is added. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Annette Paciorek investigates graphs that have the same degree sequence, focusing mainly on cycle graphs and when one additional edge is added. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. CycleGraphs 10:39 Wed, 15 Jul 2015 13:00:00 EDT Christopher Hanusa Alex Yaroslavskiy investigates a question related to the board game Monopoly. Alex Yaroslavskiy likes board games and focused his research on the classic game Monopoly. He counts the number of ways to land on Boardwalk before passing Go and without landing in jail. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Alex Yaroslavskiy likes board games and focused his research on the classic game Monopoly. He counts the number of ways to land on Boardwalk before passing Go and without landing in jail. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Monopoly 8:30 Wed, 15 Jul 2015 12:00:00 EDT Christopher Hanusa Shao Xin counts the number of triangles on an nxn square grid. Shao Xin is interested in polygons with integer vertex coordinates. He counts the number of triangles that have vertices somewhere on an nxn square grid. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Shao Xin is interested in polygons with integer vertex coordinates. He counts the number of triangles that have vertices somewhere on an nxn square grid. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Triangles 11:10 Wed, 15 Jul 2015 11:00:00 EDT Christopher Hanusa Hanying Dong investigates the ways in which children can grow from ages 3 to 13. Hanying Dong is interested in the factors that contribute to the growth of children. He uses generating functions to count the number of ways in which children can grow from ages 3 to 13. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Hanying Dong is interested in the factors that contribute to the growth of children. He uses generating functions to count the number of ways in which children can grow from ages 3 to 13. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. GrowingChildren 11:18 Wed, 15 Jul 2015 10:00:00 EDT Christopher Hanusa Yidi Yao counts the number of walking paths in a city containing a park. Yidi Yao takes inspiration from a walk in Manhattan; she counts the number of walking paths from one corner of a city to the other that do not pass through a park along the way. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Yidi Yao takes inspiration from a walk in Manhattan; she counts the number of walking paths from one corner of a city to the other that do not pass through a park along the way. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. WalkingPaths 8:15 Wed, 15 Jul 2015 9:00:00 EDT Christopher Hanusa InSu Chang answers a question about playing Go on a 5x5 board. InSu Chang is interested in the game Go, which has simple rules but is both mentally challenging and mathematically complex. He answers a question about the end game possibilities when playing Go on a 5x5 board. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. InSu Chang is interested in the game Go, which has simple rules but is both mentally challenging and mathematically complex. He answers a question about the end game possibilities when playing Go on a 5x5 board. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Go 20:14 Wed, 15 Jul 2015 8:00:00 EDT Christopher Hanusa Synthia Viaud asks a question about walking on hallway tiles. Synthia Viaud noticed the patterns involved in the tiles on the hallway floor, and asks about the number of ways in which a person can walk around a closed square hallway respecting certain rules about walking on hallway tiles. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Synthia Viaud noticed the patterns involved in the tiles on the hallway floor, and asks about the number of ways in which a person can walk around a closed square hallway respecting certain rules about walking on hallway tiles. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. HallwayTiles 7:50 Wed, 15 Jul 2015 7:00:00 EDT Christopher Hanusa Elisse Ferraro investigates the structure of stable marriages. Elisse Ferraro investigates the structure of stable marriages by using the Gale-Shapely algorithm. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. Elisse Ferraro investigates the structure of stable marriages by using the Gale-Shapely algorithm. This research was conducted during Fall 2014 in Professor Hanusa's Combinatorics class at Queens College of the City University of New York. StableMarriages 6:35 Wed, 15 Jul 2015 6:00:00 EDT