Proposals
Below are some proposals for talks from the past (and current). By clicking on the ID number, more details are shown. By default, these are sorted chronologically (recent first) and by then by last name. The data can be sorted by alternate means by using the links at the top right, each allowing ascending or descending orders.
Displaying 361-380 of 471 results.
Sort by:
ID:
459
Year: 2016
Name: Theron Hitchman
Institution: University of Northern Iowa
Subject area(s): topology
Title of Talk: Butterfly Diagrams for Knots and Links
Abstract: A “butterfly diagram” for a knot is a way to represent that knot with a kind of graph on the sphere. This generalization of Thurston’s construction of the Borromean rings was introduced by Hilden, Montesinos, Tejada, and Toro to give a new approach to the study of the bridge index of knots. We will introduce the ideas with lots of examples (pictures and physical models) and discuss the connection with the classical bridge index invariant.
Year: 2016
Name: Theron Hitchman
Institution: University of Northern Iowa
Subject area(s): topology
Title of Talk: Butterfly Diagrams for Knots and Links
Abstract: A “butterfly diagram” for a knot is a way to represent that knot with a kind of graph on the sphere. This generalization of Thurston’s construction of the Borromean rings was introduced by Hilden, Montesinos, Tejada, and Toro to give a new approach to the study of the bridge index of knots. We will introduce the ideas with lots of examples (pictures and physical models) and discuss the connection with the classical bridge index invariant.
ID:
460
Year: 2016
Name: Mark Ronnenberg
Institution: University of Northern Iowa
Subject area(s): topology
Title of Talk: Reidemeister Moves and Equivalence of Butterfly Diagrams for Links
Abstract: By a theorem of Reidemeister, two links are equivalent if and only if they have regular projections which can be related by a finite sequence of special changes called Reidemeister moves. It is an open problem to find a complete set of "butterfly moves" to turn a butterfly diagram for a given link into a butterfly diagram for an equivalent link. In this talk, we will translate the Reidemeister moves into butterfly moves and present some examples.
Year: 2016
Name: Mark Ronnenberg
Institution: University of Northern Iowa
Subject area(s): topology
Title of Talk: Reidemeister Moves and Equivalence of Butterfly Diagrams for Links
Abstract: By a theorem of Reidemeister, two links are equivalent if and only if they have regular projections which can be related by a finite sequence of special changes called Reidemeister moves. It is an open problem to find a complete set of "butterfly moves" to turn a butterfly diagram for a given link into a butterfly diagram for an equivalent link. In this talk, we will translate the Reidemeister moves into butterfly moves and present some examples.
ID:
461
Year: 2016
Name: Matt Rissler
Institution: Loras College
Subject area(s):
Title of Talk: Sports Analytics in Lower Level Courses
Abstract: I'll provide examples from baseball and basketball of sports analytics problems I have done in lower level classes, from College Algebra to Calculus II.
Year: 2016
Name: Matt Rissler
Institution: Loras College
Subject area(s):
Title of Talk: Sports Analytics in Lower Level Courses
Abstract: I'll provide examples from baseball and basketball of sports analytics problems I have done in lower level classes, from College Algebra to Calculus II.
ID:
462
Year: 2016
Name: ypmvqq ypmvqq
Institution: raCweZrhMNjKxbics
Subject area(s): UvVwwTilpXhZkD
Title of Talk: VgMIpGhcdwlkdWXBUw
Abstract: LqvU33 ewqgylyyvvtc, [url=http://foqciatqtnfi.com/]foqciatqtnfi[/url], [link=http://uitmnsyixbuy.com/]uitmnsyixbuy[/link], http://evplpanuzgzt.com/
Year: 2016
Name: ypmvqq ypmvqq
Institution: raCweZrhMNjKxbics
Subject area(s): UvVwwTilpXhZkD
Title of Talk: VgMIpGhcdwlkdWXBUw
Abstract: LqvU33 ewqgylyyvvtc, [url=http://foqciatqtnfi.com/]foqciatqtnfi[/url], [link=http://uitmnsyixbuy.com/]uitmnsyixbuy[/link], http://evplpanuzgzt.com/
ID:
464
Year: 2017
Name: Michael Heeren
Institution: Kaplan University
Subject area(s): Number Theory
Title of Talk: Sums and Differences of Two Prime Numbers
Abstract: Two unsolved number theory questions are "Is every even whole number greater than 2 the sum of two primes numbers?" and "For every whole even integer, does there exist two prime numbers with that difference?" This presentation will look at these two questions by using a single table created by the addition of integers. The cells that have the sums of odd prime numbers, the opposite of odd prime numbers, or the sum of an odd prime number and the opposite of an odd prime number will be shaded. There will then be two inductive proofs concerning the shaded cells whose results can be used to help answer those two questions.
Year: 2017
Name: Michael Heeren
Institution: Kaplan University
Subject area(s): Number Theory
Title of Talk: Sums and Differences of Two Prime Numbers
Abstract: Two unsolved number theory questions are "Is every even whole number greater than 2 the sum of two primes numbers?" and "For every whole even integer, does there exist two prime numbers with that difference?" This presentation will look at these two questions by using a single table created by the addition of integers. The cells that have the sums of odd prime numbers, the opposite of odd prime numbers, or the sum of an odd prime number and the opposite of an odd prime number will be shaded. There will then be two inductive proofs concerning the shaded cells whose results can be used to help answer those two questions.
ID:
465
Year: 2017
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: "Honest" Numbers in the Languages of the Native Americans of North America
Abstract: Like so many ideas in recreational mathematics, the concept of an “honest” number was created by Martin Gardner. A number is considered “honest” if the number of letters in the name is the value of the number. For example, “four” is the only “honest” number in English. In a later paper titled “The Lucky Languages,” Sidney Kravitz examined 17 other western languages, looking for more “honest” numbers. In this paper, the languages of Native Americans of North America are examined in a search for additional “honest” numbers. Some of those languages are extinct, others are endangered and for many, there is a concerted effort to preserve them.
Year: 2017
Name: Charles Ashbacher
Institution: Charles Ashbacher Technologies
Subject area(s): Recreational mathematics
Title of Talk: "Honest" Numbers in the Languages of the Native Americans of North America
Abstract: Like so many ideas in recreational mathematics, the concept of an “honest” number was created by Martin Gardner. A number is considered “honest” if the number of letters in the name is the value of the number. For example, “four” is the only “honest” number in English. In a later paper titled “The Lucky Languages,” Sidney Kravitz examined 17 other western languages, looking for more “honest” numbers. In this paper, the languages of Native Americans of North America are examined in a search for additional “honest” numbers. Some of those languages are extinct, others are endangered and for many, there is a concerted effort to preserve them.
ID:
466
Year: 2017
Name: Ranthony A.C. Edmonds
Institution: University of Iowa
Subject area(s): Blended learning; flipped instruction; trigonometry
Title of Talk: A Case for Blended Learning: A Partially Flipped Trigonometry Course
Abstract: Blended learning is an instructional approach that combines online digital media with traditional classroom methods. Blended courses are sometimes known as hybrid courses in that some of the introduction is occurring outside of the classroom, and it has gained recent attention as a method to address remediation and student motivation in introductory math courses in higher education. Flipped instruction is a type of blended learning that has gained a lot of attention as an alternative to lecture based instruction in its own right. However, common pitfalls of this technique include resistance from instructors due to the perceived amount of time to create instructional videos and materials, and from students due to the amount of independent learning required outside of class. Partially flipped instruction addresses these concerns by incorporating both independent and face-to-face instruction. It can also alleviate the amount of time spent on additional materials by instructors, while still holding students accountable for their own learning outside of class. This talk will give a brief introduction to blending learning, what is it, and what it is not. Next, we will focus on a particular type of blended learning, flipped instruction, and subsequently a partially flipped model used in the Spring of 2017 at the University of Iowa for a College Trigonometry course. The main features of this model included instructional videos, created with Doceri for iPad, which were viewed outside of class once a week by students, coupled with a short assessment based on that instruction. The following ‘flipped’ period involved individual and/or group activities expanding upon concepts introduced in the videos. Canvas by Instructure was used heavily throughout the course. Motivation and implementation of the design will be described, quantitative data with regards to course assessments will be given, and the results of a qualitative survey given to students about their experience in the course will be shared. Last, we will describe some specific efforts of certain math departments to incorporate blended learning in their curricula.
Year: 2017
Name: Ranthony A.C. Edmonds
Institution: University of Iowa
Subject area(s): Blended learning; flipped instruction; trigonometry
Title of Talk: A Case for Blended Learning: A Partially Flipped Trigonometry Course
Abstract: Blended learning is an instructional approach that combines online digital media with traditional classroom methods. Blended courses are sometimes known as hybrid courses in that some of the introduction is occurring outside of the classroom, and it has gained recent attention as a method to address remediation and student motivation in introductory math courses in higher education. Flipped instruction is a type of blended learning that has gained a lot of attention as an alternative to lecture based instruction in its own right. However, common pitfalls of this technique include resistance from instructors due to the perceived amount of time to create instructional videos and materials, and from students due to the amount of independent learning required outside of class. Partially flipped instruction addresses these concerns by incorporating both independent and face-to-face instruction. It can also alleviate the amount of time spent on additional materials by instructors, while still holding students accountable for their own learning outside of class. This talk will give a brief introduction to blending learning, what is it, and what it is not. Next, we will focus on a particular type of blended learning, flipped instruction, and subsequently a partially flipped model used in the Spring of 2017 at the University of Iowa for a College Trigonometry course. The main features of this model included instructional videos, created with Doceri for iPad, which were viewed outside of class once a week by students, coupled with a short assessment based on that instruction. The following ‘flipped’ period involved individual and/or group activities expanding upon concepts introduced in the videos. Canvas by Instructure was used heavily throughout the course. Motivation and implementation of the design will be described, quantitative data with regards to course assessments will be given, and the results of a qualitative survey given to students about their experience in the course will be shared. Last, we will describe some specific efforts of certain math departments to incorporate blended learning in their curricula.
ID:
467
Year: 2017
Name: Christopher Frayer
Institution: University of Wisconsin - Platteville
Subject area(s):
Title of Talk: Geometry of Polynomials with Three Roots
Abstract: Given a complex-valued polynomials of the form p(z)=(z-1)^k (z-r_1 )^m (z-r_2 )^n with k,m,n in the natural numbers and r_1 and r_2 on the unit circle, where are the critical points located? The Gauss-Lucas Theorem guarantees that the critical points of such a polynomial will lie within the unit disk. We will further explores the location and structure of these critical points. Surprisingly, when m≠n, the unit disk contains two `desert' regions in which critical points cannot occur, and each c inside the unit disk and outside of the desert regions is the critical point of exactly two such polynomials. Special attention will be given to the development of geometric intuition and using GeoGebra to provide graphical illustrations.
Year: 2017
Name: Christopher Frayer
Institution: University of Wisconsin - Platteville
Subject area(s):
Title of Talk: Geometry of Polynomials with Three Roots
Abstract: Given a complex-valued polynomials of the form p(z)=(z-1)^k (z-r_1 )^m (z-r_2 )^n with k,m,n in the natural numbers and r_1 and r_2 on the unit circle, where are the critical points located? The Gauss-Lucas Theorem guarantees that the critical points of such a polynomial will lie within the unit disk. We will further explores the location and structure of these critical points. Surprisingly, when m≠n, the unit disk contains two `desert' regions in which critical points cannot occur, and each c inside the unit disk and outside of the desert regions is the critical point of exactly two such polynomials. Special attention will be given to the development of geometric intuition and using GeoGebra to provide graphical illustrations.
ID:
468
Year: 2017
Name: Maria Gommel
Institution: University of Iowa
Subject area(s):
Title of Talk: The Shape of Data: An Introduction to Topological Data Analysis
Abstract: What does it mean for data to have "shape"? Can this idea of "shape" help us better analyze data? In this talk, I will introduce some basic ideas of algebraic topology that allow us to describe the "shape" of a data set, and discuss how these ideas can help us analyze data. We'll also see an example of how these techniques have been applied to fMRI brain data. This talk is entirely self-contained and appropriate for undergraduates at any level.
Year: 2017
Name: Maria Gommel
Institution: University of Iowa
Subject area(s):
Title of Talk: The Shape of Data: An Introduction to Topological Data Analysis
Abstract: What does it mean for data to have "shape"? Can this idea of "shape" help us better analyze data? In this talk, I will introduce some basic ideas of algebraic topology that allow us to describe the "shape" of a data set, and discuss how these ideas can help us analyze data. We'll also see an example of how these techniques have been applied to fMRI brain data. This talk is entirely self-contained and appropriate for undergraduates at any level.
ID:
469
Year: 2017
Name: Benjamin Collins
Institution: University of Wisconsin-Platteville
Subject area(s):
Title of Talk: Flipping the Precalculus Classroom
Abstract: The flipped classroom is becoming a popular course structure in many academic disciplines, but particularly in STEM disciplines, including mathematics. Considerable research has addressed potential advantages and challenges of teaching a flipped course, as well as examining students' attitudes towards the flipped classroom. Studies on students' academic performance in a flipped classroom remain relatively scarce, and have shown mixed results. This talk reports on a study using a flipped classroom design in a 5-credit precalculus course at a regional 4-year university. I evaluated the students' performance on the final compared to a similarly sized random sample of students from non-flipped sections of the same course, and also tracked students success in first-semester calculus.
Year: 2017
Name: Benjamin Collins
Institution: University of Wisconsin-Platteville
Subject area(s):
Title of Talk: Flipping the Precalculus Classroom
Abstract: The flipped classroom is becoming a popular course structure in many academic disciplines, but particularly in STEM disciplines, including mathematics. Considerable research has addressed potential advantages and challenges of teaching a flipped course, as well as examining students' attitudes towards the flipped classroom. Studies on students' academic performance in a flipped classroom remain relatively scarce, and have shown mixed results. This talk reports on a study using a flipped classroom design in a 5-credit precalculus course at a regional 4-year university. I evaluated the students' performance on the final compared to a similarly sized random sample of students from non-flipped sections of the same course, and also tracked students success in first-semester calculus.
ID:
470
Year: 2017
Name: Mu-Ling Chang
Institution: University of Wisconsin-Platteville
Subject area(s):
Title of Talk: The Area of Rational Right Triangles
Abstract: A right triangle is called rational when all of its three sides are all rational numbers. Any rational right triangle has a rational area, but not all positive rational numbers can be the area of a rational right triangle. For example, the area of a right triangle with sides 3-4-5 is 6. Is it possible that there exists a rational right triangle with area 5? More information related to this problem will be given in this talk.
Year: 2017
Name: Mu-Ling Chang
Institution: University of Wisconsin-Platteville
Subject area(s):
Title of Talk: The Area of Rational Right Triangles
Abstract: A right triangle is called rational when all of its three sides are all rational numbers. Any rational right triangle has a rational area, but not all positive rational numbers can be the area of a rational right triangle. For example, the area of a right triangle with sides 3-4-5 is 6. Is it possible that there exists a rational right triangle with area 5? More information related to this problem will be given in this talk.
ID:
471
Year: 2017
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Mathfest and Beyond!
Abstract: In this talk, Dr. Matson will be sharing insights she picked up at Mathfest and welcome participants to also share teaching tidbits/professional advice they gleaned from attending Mathfest.
Year: 2017
Name: Amanda Matson
Institution: Clarke University
Subject area(s):
Title of Talk: Mathfest and Beyond!
Abstract: In this talk, Dr. Matson will be sharing insights she picked up at Mathfest and welcome participants to also share teaching tidbits/professional advice they gleaned from attending Mathfest.
ID:
472
Year: 2017
Name: Corissa Goertzen
Institution: University of Dubuque
Subject area(s):
Title of Talk: STEMulating Activities
Abstract: With the emphasis on STEM in the K-12 grades, colleges are stepping up to hold STEM related events. We will discuss the activities we have used at STEM festivals and how we encouraged college students to get involved. Time will allow for sharing of ideas.
Year: 2017
Name: Corissa Goertzen
Institution: University of Dubuque
Subject area(s):
Title of Talk: STEMulating Activities
Abstract: With the emphasis on STEM in the K-12 grades, colleges are stepping up to hold STEM related events. We will discuss the activities we have used at STEM festivals and how we encouraged college students to get involved. Time will allow for sharing of ideas.
ID:
473
Year: 2017
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): cryptography, algebra, number theory
Title of Talk: Cryptography - Secure Communication
Abstract: Essential to our modern technological world, cryptography is the study of secure communication. In this talk we will discuss some of the basic ideas in cryptography, explain the differences between symmetric and asymmetric-key cryptosystems, and explore some basic examples of cryptosystems. As an illustration of the mathematics involved, we will do a simplified computational example by computing keys using the RSA algorithm. This talk will be self-contained; no prior knowledge of cryptography will be assumed.
Year: 2017
Name: Kevin Bombardier
Institution: University of Iowa
Subject area(s): cryptography, algebra, number theory
Title of Talk: Cryptography - Secure Communication
Abstract: Essential to our modern technological world, cryptography is the study of secure communication. In this talk we will discuss some of the basic ideas in cryptography, explain the differences between symmetric and asymmetric-key cryptosystems, and explore some basic examples of cryptosystems. As an illustration of the mathematics involved, we will do a simplified computational example by computing keys using the RSA algorithm. This talk will be self-contained; no prior knowledge of cryptography will be assumed.
ID:
474
Year: 2017
Name: Aqeeb Sabree
Institution: University of Iowa
Subject area(s): Advanced Calculus would be helpful
Title of Talk: Research Topics from Reproducing Kernel Hilbert Spaces
Abstract: Reproducing Kernel Hilbert Spaces (RKHS) have applications to statistics, machine learning, differential equations, and more. The goal of this presentation is to introduce the concept of a RKHS, and discuss it’s applications to many research areas. The amazing thing about this research area is that there are many research questions/topics for dissertations or undergraduate research experiences. I will give a brief history of RKHSs, highlighting where it has appeared and how it has been applied. Then I will present the theoretical foundation(s) of the subject; from here I will go into its applications. Below, you will find highlights of the theory that I will present, and some highlights of its application. You can discuss the existence of RKHSs in different ways: one, you can prove that the evaluation functional is bounded; or, two, you can prove that (given a Hilbert space) the Hilbert space has a reproducing kernel function. A nice property of the reproducing kernel is that it is unique. Thus, every RKHS has exactly one reproducing kernel; furthermore, every reproducing kernel is the reproducing kernel for a unique RKHS (Moore--Aronszajn). The process of recreating the RKHS from the kernel function is termed the it reconstruction problem, and is an interesting research area. The usefulness of the theory of RKHSs can be seen in the fact that the finite energy Fourier, Hankel, sine, and cosine transformed band-limited signals are specific realizations of the abstract reproducing kernel Hilbert space (RKHS). Sampling Theory: Sampling theory deals with the reconstruction of functions (or signals) from their values (or samples) on an appropriate set of points. When given a reproducing kernel Hilbert space, H; one asks: What are some (suitable) sets of points which reproduce (or interpolate) the full values of functions from H? And when given points in a set S, one asks: What are the RKHSs for which S is a complete set of sample points? Meaning the values of functions from H are reproduced by interpolation from S.
Year: 2017
Name: Aqeeb Sabree
Institution: University of Iowa
Subject area(s): Advanced Calculus would be helpful
Title of Talk: Research Topics from Reproducing Kernel Hilbert Spaces
Abstract: Reproducing Kernel Hilbert Spaces (RKHS) have applications to statistics, machine learning, differential equations, and more. The goal of this presentation is to introduce the concept of a RKHS, and discuss it’s applications to many research areas. The amazing thing about this research area is that there are many research questions/topics for dissertations or undergraduate research experiences. I will give a brief history of RKHSs, highlighting where it has appeared and how it has been applied. Then I will present the theoretical foundation(s) of the subject; from here I will go into its applications. Below, you will find highlights of the theory that I will present, and some highlights of its application. You can discuss the existence of RKHSs in different ways: one, you can prove that the evaluation functional is bounded; or, two, you can prove that (given a Hilbert space) the Hilbert space has a reproducing kernel function. A nice property of the reproducing kernel is that it is unique. Thus, every RKHS has exactly one reproducing kernel; furthermore, every reproducing kernel is the reproducing kernel for a unique RKHS (Moore--Aronszajn). The process of recreating the RKHS from the kernel function is termed the it reconstruction problem, and is an interesting research area. The usefulness of the theory of RKHSs can be seen in the fact that the finite energy Fourier, Hankel, sine, and cosine transformed band-limited signals are specific realizations of the abstract reproducing kernel Hilbert space (RKHS). Sampling Theory: Sampling theory deals with the reconstruction of functions (or signals) from their values (or samples) on an appropriate set of points. When given a reproducing kernel Hilbert space, H; one asks: What are some (suitable) sets of points which reproduce (or interpolate) the full values of functions from H? And when given points in a set S, one asks: What are the RKHSs for which S is a complete set of sample points? Meaning the values of functions from H are reproduced by interpolation from S.
ID:
475
Year: 2017
Name: Brian Birgen
Institution: Wartburg College
Subject area(s):
Title of Talk: What is Financial Math?
Abstract: One of the early Actuary Exams is titled Financial Math. What does that mean? What does that include? This talk will discuss the content covered on this exam.
Year: 2017
Name: Brian Birgen
Institution: Wartburg College
Subject area(s):
Title of Talk: What is Financial Math?
Abstract: One of the early Actuary Exams is titled Financial Math. What does that mean? What does that include? This talk will discuss the content covered on this exam.
ID:
476
Year: 2017
Name: Sabah Munir
Institution: Wartburg College
Subject area(s): Biostatistics
Title of Talk: Genetic Risk Factors for Preterm Birth
Abstract: Preterm birth, which affects 5-18% of pregnancies worldwide, occurs when an infant is born before 37 weeks of gestation. Studying the factors associated with preterm birth is important, for it is the leading cause of death in children under five years old. Besides many environmental factors, genetics also dictate the risk of preterm birth. This current research project is based upon the sequenced exomes of 93 pairs and 2 trios of sisters from Denmark who have a history of preterm birth. The goals of this project were to (1) develop gene burden tests to analyze the experimental data against the general population data obtained from the Exome Aggregation Consortium, (2) identify rare variants that may contribute to the risk of preterm birth, and (3) compare the two methods of statistical analysis that we developed. Gene burden tests collapse all variants on the same gene together, and then analyze each gene as a whole by determining the significance of its impact on preterm birth. Through R language, we developed a count-based method based on the Poisson distribution and a weighted version using the normal distribution. The genes producing the smallest p-values were examined further, which led to the identification of several promising variants to be studied more in future research.
Year: 2017
Name: Sabah Munir
Institution: Wartburg College
Subject area(s): Biostatistics
Title of Talk: Genetic Risk Factors for Preterm Birth
Abstract: Preterm birth, which affects 5-18% of pregnancies worldwide, occurs when an infant is born before 37 weeks of gestation. Studying the factors associated with preterm birth is important, for it is the leading cause of death in children under five years old. Besides many environmental factors, genetics also dictate the risk of preterm birth. This current research project is based upon the sequenced exomes of 93 pairs and 2 trios of sisters from Denmark who have a history of preterm birth. The goals of this project were to (1) develop gene burden tests to analyze the experimental data against the general population data obtained from the Exome Aggregation Consortium, (2) identify rare variants that may contribute to the risk of preterm birth, and (3) compare the two methods of statistical analysis that we developed. Gene burden tests collapse all variants on the same gene together, and then analyze each gene as a whole by determining the significance of its impact on preterm birth. Through R language, we developed a count-based method based on the Poisson distribution and a weighted version using the normal distribution. The genes producing the smallest p-values were examined further, which led to the identification of several promising variants to be studied more in future research.
ID:
477
Year: 2017
Name: Theron Hitchman
Institution: University of Northern Iowa
Subject area(s): topology - knot theory
Title of Talk: A Naive Computational Approach to Bridge Index for Knots
Abstract: The bridge index of a knot is a classical geometric invariant introduced by Schubert in the 1930's. It is difficult to compute, in general. But a naive approach with pencil and paper will easily produce upper bounds. In this joint work with MA student Genevieve Johnson, we implement a version of this naive approach in Python, and compute the bridge index for all prime knots in Rolfsen's table with no more than 12 crossings.
Year: 2017
Name: Theron Hitchman
Institution: University of Northern Iowa
Subject area(s): topology - knot theory
Title of Talk: A Naive Computational Approach to Bridge Index for Knots
Abstract: The bridge index of a knot is a classical geometric invariant introduced by Schubert in the 1930's. It is difficult to compute, in general. But a naive approach with pencil and paper will easily produce upper bounds. In this joint work with MA student Genevieve Johnson, we implement a version of this naive approach in Python, and compute the bridge index for all prime knots in Rolfsen's table with no more than 12 crossings.
ID:
478
Year: 2017
Name: Diego Rojas
Institution: Iowa State University
Subject area(s): Computability Theory, Analysis
Title of Talk: Differentiation of Functions on the Cantor Space and Connections to Real-Valued Functions
Abstract: The notion of online functions of the Cantor space $2^{\mathbb{N}}$, and more generally, of continuous and of computable functions on $2^{\mathbb{N}}$, have been studied recently in connection with algorithmic randomness. In this talk, we present a notion of the derivative of functions on $2^{\mathbb{N}}$, and we establish some connections between functions and their derivatives on $2^{\mathbb{N}}$ and on $\mathbb{R}$, where we can represent real-valued functions as functions acting on the dyadic representation of real numbers. This is joint work with Douglas Cenzer.
Year: 2017
Name: Diego Rojas
Institution: Iowa State University
Subject area(s): Computability Theory, Analysis
Title of Talk: Differentiation of Functions on the Cantor Space and Connections to Real-Valued Functions
Abstract: The notion of online functions of the Cantor space $2^{\mathbb{N}}$, and more generally, of continuous and of computable functions on $2^{\mathbb{N}}$, have been studied recently in connection with algorithmic randomness. In this talk, we present a notion of the derivative of functions on $2^{\mathbb{N}}$, and we establish some connections between functions and their derivatives on $2^{\mathbb{N}}$ and on $\mathbb{R}$, where we can represent real-valued functions as functions acting on the dyadic representation of real numbers. This is joint work with Douglas Cenzer.
ID:
479
Year: 2017
Name: Jake Weber
Institution: University of Northern Iowa
Subject area(s):
Title of Talk: Exploration of Counter Examples of Balance Sets
Abstract: With large data sets, one might ask if substructure exists, and if so, how large should the data subset be in order to guarantee this substructure. We investigated data subsets of Zp × Zp which are on the boundary, just short of enough data to guarantee substructure, specifically categorizing the data subsets that don’t have substruc- ture. First by brute force checking, we determined the counter examples (graphs with no substructure) for Z5 × Z5. These exam- ples guided our search into Zp × Zp where p ≥ 7. From there, we proved there are four categories of counter examples that do not have a balanced subset in Zp × Zp.
Year: 2017
Name: Jake Weber
Institution: University of Northern Iowa
Subject area(s):
Title of Talk: Exploration of Counter Examples of Balance Sets
Abstract: With large data sets, one might ask if substructure exists, and if so, how large should the data subset be in order to guarantee this substructure. We investigated data subsets of Zp × Zp which are on the boundary, just short of enough data to guarantee substructure, specifically categorizing the data subsets that don’t have substruc- ture. First by brute force checking, we determined the counter examples (graphs with no substructure) for Z5 × Z5. These exam- ples guided our search into Zp × Zp where p ≥ 7. From there, we proved there are four categories of counter examples that do not have a balanced subset in Zp × Zp.