The classical Frobenius problem asks for the largest integer not representable as a non-negative integer linear combination of a relatively prime integer n-tuple. This problem and its various generalizations have […]
In Euclidean geometry, the sum of two sides of any triangle is greater than the third side. We introduce this idea to labeling of graphs. A (p,q)-graph G=(V,E) is said to […]
An “Adinkra” is a graphical tool to describe a branch of particle physics known as supersymmetry. Understanding the mathematics of Adinkras shines a light on the underlying physics, as well […]
The classical, one-boundary, and two-boundary Temperley-Lieb algebras arise in mathematical physics related to solving certain rectangular lattice models.They also have beautiful presentations as "diagram algebras", meaning that they have basis […]
In this talk, I will give an overview of the theory of matroids. These are mathematical objects which capture the combinatorial essence of linear independence. Besides providing some basic definitions […]
A classic and fundamental result in number theory is due to Mordell who proved that the set of points on an elliptic curve defined over a number field forms a […]
Counting points on algebraic curves over finite fields has numerous applications in communications and cryptology, and has led to some of the most beautiful results in 20th century arithmetic geometry. A natural generalization […]
If $F$ is a finite field and $d$ is a positive integer relatively prime to $|F^\times|$, then the power map $x \mapsto x^d$ is a permutation of $F$, and so is called […]
Mathematicians like to count things. Often in very complicated and fancy ways. In this talk I will explain how we can use quantum Airy structures -- an abstract formalism recently […]
We review some recent developments in the study of biquandle brackets and other quantum enhancements.
Domination in graphs has been an important and active topic in graph theory for over 40 years. It has immediate applications in visibility and controllability. In this talk we will discuss a generalization of domination called exponential domination. A vertex $v$ in an exponential dominating set assigns weight $2^{1−dist(v,u)}$ to vertex $u$. An exponential dominating […]
Probability is a now-classic tool in combinatorics, especially graph theory. Some applications of probabilistic techniques are: (1) describing the typical/expected properties of a class of objects, (2) uncovering phase transitions and sudden thresholds in the dependence of one property on another, and (3) producing examples of conjectured or unusual objects. (This last technique is sometimes […]
