Graph coloring reconfiguration systems (Prateek Bhakta, University of Richmond)
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 […]
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 […]
The orthosymplectic Lie superalgebra $\mathfrak{osp}(1|2n)$ is rich in representation theory: while the finite dimensional $\mathfrak{osp}(1|2n)$-module category is semisimple, the study of infinite dimensional representations of $\mathfrak{osp}(1|2n)$ is wide open. In […]
Given a homogeneous multilinear polynomial F(x) in n variables with integer coefficients, we obtain some sufficient conditions for it to represent all the integers. Further, we derive effective results, establishing […]
In this talk we will survey recent developments in the use of ternary algebraic structures known as Niebrzydowski Tribrackets in defining invariants of knots, with some perhaps surprising applications.
In this talk we introduce a new modification of the Jacobi-Perron algorithm in the three dimensional case. This algorithm is periodic for the case of totally-real conjugate cubic vectors. To […]
When first learning how to write mathematical proofs, it is often easier for students to work with statements using the universal quantifier. Results that single out special cases might initially […]
The Kauffman bracket skein algebra was originally defined as a generalization of the Jones polynomial for knots and links on a surface and is one of the few quantum invariants […]