Algebra / Number Theory / Combinatorics Seminar

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 […]

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 […]

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 […]

In this talk, I will describe an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of permutation modules, and it uses the multiplicities of irreducible submodules within individual orbital spaces to express […]

Several conditions are known for a self-inversive polynomial that ascertain the location of its roots, and we present a framework for comparison of those conditions. We associate a parametric family of polynomials p_α(x) to each such polynomial p, and define cn(p), il(p) to be the sharp threshold values of α that guarantee that, for all […]

Let K be a field and S = K be the polynomial ring in n variables over K. For a graded S-module M with minimal free resolution the Castelnuovo-Mumford regularity  is defined. We survey a number of recent studies of the Castelnuovo-Mumford regularity of the ideals related to a graph and their (symbolic) powers. Our […]

Let S be a set of k > n points in n-dimensional Euclidean space. How many parallel hyperplanes are needed to cover it? In fact, it is easy to prove that every such set can be covered by k-n+1 parallel hyperplanes, but do there exist sets that cannot be covered by fewer parallel hyperplanes? We […]

Quandle coloring quivers categorify the quandle counting invariant. In this talk we enhance the quandle coloring quiver invariant with quandle modules, generalizing both the quiver invariant and the quandle module polynomial invariant. This is joint work with Karma Istanbouli (Scripps College).

It is well known that a real number is badly approximable if and only if the partial quotients in its continued fraction expansion are bounded. Motivated by a recent wonderful paper by Ngoc Ai Van Nguyen, Anthony Poels and Damien Roy (where the authors give a simple alternative solution of Schmidt-Summerer's problem) we found an […]

The talk will concentrate on open questions related to the optimal bounds for the discrepancy of an $N$-point set in the $d$-dimensional unit cube. The so-called star-discrepancy measures the difference between the actual and expected number of […]

For k >= 2, the k-coloring graph C(G) of a base graph G has a vertex set consisting of the proper k-colorings of G with edges connecting two vertices corresponding to two different colorings of G if those two colorings differ in the color assigned to a single vertex of G. A base graph whose […]