Unless otherwise indicated, the seminar will be in LeConte 317R from 1:30 p.m. to 2:20 p.m.
If you are interested in giving a talk contact Joe Foster at josephcf@math.sc.edu.
A recent paper of William Sawin, Mark Shusterman and Michael Stoll introduces the notion of robust pairs of polynomials in
The number
Define a weak prime to be a prime with the property that if you change any one of its digits to some other digit, the resulting number is composite. Our discussion will be confined to primes that are weak base 10, but the notation makes sense in any base. We will give Erdos' 1979 proof that the set of such primes is infinite. If time allows, we will delve into other results in the literature related to weak primes.
Let
Then we show that there is a explicitly computed number
This is joint work with Ognian Trifonov.
In 2007, Roberts and Schmidt had a satisfactory local new- and oldform theory for
At an earlier time, when we didn't have the faculty with the interests of our current faculty, I conceived of the idea of teaching a course on "algebraic Number Theory" different from courses I had taken on "Algebraic number theory" where the emphasis in "algebraic Number Theory" would be on using algebraic concepts to resolve Number Theoretic problems rather than creating Algebraic concepts reflecting number theoretic notions. Glancing at some notes written by David Richman, I decided to steal ideas of his for a first lecture. Now, years later, after my PhD students have completed a course in Algebraic number theory and finding that they don't know algebraic Number Theory and that they need this first lecture to understand an aspect of their dissertation work, I feel compelled to give David's first lecture again, introducing Number Theory in action via a simple algebraic concept.
Filaseta, Kozek, Nicol, and Selfridge showed in 2011 how covering systems can be leveraged to produce an infinite number of composite numbers which remain composite if a single digit in their decimal representation is replaced by some other digit. We present this result and show how it can be modified, along with ideas of Erdos and Tao, to show a positive proportion of prime numbers become composite if any digit in their decimal representation - including any of the infinitely many leading 0’s - is changed to some other digit. This work is joint with Michael Filaseta.
The speaker has found that the best way to get his adviser thinking about the speaker's research is to present a talk on said research. With this goal in mind, the speaker will talk about a thing we did part of - something involving a sequence of polynomial sequences and irreducibility. The we is Joe Foster and the speaker, but not Jacob Juillerat.
This a survey talk on recent progress on estimating exponential sums, and on some of the ideas that went into it.