Algebra / Number Theory / Combinatorics Seminar

Modular forms are ubiquitous in modern number theory.  For instance, showing that elliptic curves are secretly modular forms was the key to the proof of Fermat's Last Theorem.  In addition to number theory, modular forms show up in diverse areas such as coding theory and particle physics.  Roughly speaking, a modular form is a complex-valued […]

Chebotarev's theorem on roots of unity says that every minor of a discrete Fourier transform matrix of prime order is nonzero. We present a generalization of this result that includes analogues for discrete cosine and discrete sine transform matrices as special cases.  This leads to a generalization of the Biro-Meshulam-Tao uncertainty principle to functions with […]

In 1897, Indiana physician Edwin J. Goodwin believed he had discovered a way to square the circle, and proposed a bill to Indiana Representative Taylor I. Record which would secure Indiana's the claim to fame for his discovery.  About the time the debate about the bill concluded, Purdue University professor Clarence A. Waldo serendipitously came […]

I will talk about a few graph-theoretic metrics then introduce the concept of refinements on a class of functions that include all metrics. As a case study, we will construct various refinements on the shortest-path distance. Consequently, we obtain a few "better" versions of the Erdos number. In the course of our investigation, we realized various construction […]

A Fibonomial is what is obtained when you replace each term of the binomial coefficients $ {n \choose k}$ by the corresponding Fibonacci number.  For example, the Fibonomial $${ 6\brace 3 } = \frac{F_6 \cdot F_5 \cdot \dots \cdot F_1}{(F_3\cdot F_2 \cdot F_1)(F_3\cdot F_2 \cdot F_1)} = \frac{8\cdot5\cdot3\cdot2\cdot1\cdot1}{(2\cdot1\cdot1)(2\cdot1\cdot1)} = 60$$ since the first six Fibonacci […]