Abstract: To determine a minimum set of arcs of an arbitrary directed graph which, if removed, leave the graph without directed circuits, is an outstanding problem in graph theory. A related problem ...

In this assignment we will explore how to flatten a surface embedded (or even just immersed) in $\mathbb{R}^3$ to the flat plane (i.e. $\mathbb{R}^2$). This process is often referred to as ...

A quadratic equation is drawn as a curve on a set of axes. This type of curve is called a parabola and it is symmetrical. To draw the graph we need coordinates. We generate these coordinates by ...

Abstract: Control Lyapunov functions (CLFs) and control barrier functions (CBFs) have been used to develop provably safe controllers by means of quadratic programs (QPs), guaranteeing safety in the ...

This project includes the constraint programming (CP) models presented in the paper New Bounds and Constraint Programming Models for the Weighted Vertex Coloring Problem, IJCAI 2023. The vertex ...

We define the partition and n n-point correlation functions for a vertex operator superalgebra on a genus two Riemann surface formed by sewing two tori together. For the free fermion vertex operator ...