The classical Sperner - KKM (Knaster - Kuratowski - Mazurkiewicz) lemma has many applications in combinatorics, algorithms, game theory and mathematical economics. In this talk we consider generalizations of this lemma as well as Gale's colored KKM lemma and Shapley's KKMS theorem. It is shown that spaces and covers can be much more general and […]
We begin with a review of the Bateman—Horn conjecture, which sheds light on the intimate relationship between polynomials and prime numbers. In this expository talk, we survey a host of applications of the conjecture. For example, Landau’s conjecture, the twin prime conjecture, and the Green—Tao theorem are all consequences of the Bateman—Horn conjecture. Moreover, the […]
In this talk we will survey recent work on Niebzydowski Tribrackets and Niebrydowski Algebras, algebraic structures related to region colorings the planar complements of knots and trivalent spatial graphs.
Lattice valued vector systems have taken an important role in packing, coding, cryptography, and signal processing problems. In compressed sensing, improvements in sparse recovery methods can be reached with an additional assumption that the signal of interest is lattice valued, as demonstrated by A. Flinth and G. Kutyniok. Equiangular tight frames are particular systems of […]
Tight frames in Euclidean spaces are widely used convenient generalizations of orthonormal bases. A particularly nice class of such frames is generated as orbits under irreducible actions of finite groups of orthogonal matrices: these are called irreducible group frames. Integer spans of rational irreducible group frames form Euclidean lattices with some very nice geometric properties, […]
Given integers $k,l$ and a graph $G$, how large can be the fraction of $k$-vertex subsets of $G$ which span exactly $l$ edges? The systematic study of this very natural question was recently initiated by Alon, Hefetz, Krivelevich and Tyomkyn who also proposed several interesting conjectures on this topic. In this talk we discuss a theorem […]
An agent comes to a fork in a road. There is a sign that says that one of the two roads leads to prosperity and another to death. The agent must take the fork, but she does not know which road leads where. Does the agent have a strategy to get to prosperity? On one […]
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 […]
