Seminar

Title: Constructing Graphs Pseudo-Similar Vertices

Abstract:

Let G be a graph. Let a and b be vertices in G, then a and b are pseudo-similar if G\a is isomorphic to G\b, but there's no automorphism of G that maps a onto b.

Title: Algorithms and complexity for quantum advantage

Abstract:

There is strong evidence that a sufficiently large fault-tolerant quantum computer would solve certain computational problems exponentially faster than any classical computer. How can quantum algorithms and complexity theory help guide the way forward in our current era of small and noisy quantum computers?

Title: ALBANIS: A brief overview of Lattice-Based NIST Submissions

Abstract:

Now that the NIST competition is in the first round of the review process, it is our turn to take a look at the submissions (at least, briefly).

Title: Polynomial systems: Graphical structure, Geometry, and Applications

Abstract:

Various problems in areas such as robotics, power systems, computer vision, cryptography, and chemical reaction networks, can be modeled by systems of polynomial equations, and in many cases the resulting systems have a simple sparsity structure.

Title: Robust counterpart approximations of scalar chance constraints

Abstract:

We will cover section 2.1, section 2.2 and part of section 2.3 of the book Robust Optimization by Ben-Tal et al.

Title: On Pretty Good State Transfer, Entanglement, and Spin Chains

Abstract: 

We discuss the Vieira and Rigolin paper “Almost perfect transport of an entangled two-qubit state through a spin chain”,

Title: The Douglas-Rachford splitting algorithm for inconsistent minimization problems

Abstract:

The Douglas--Rachford (DR) method is one of the most popular splitting methods in optimization. The method was first introduced in 1956 to numerically solve certain types of heat equations.

Title: Type-II Matrices

Abstract:

The Schur product M o N of two matrices M and N is the usual entrywise product. The matrix N is the Schur inverse of M if M o N = J. Denote the Schur inverse of M by M(-). An n x n matrix is a type-II matrix if
WW^(-)T = nI.

Title: Reading Seminar "Robust Optimization"

Abstract:

In this reading seminar, we will go through Section 1. 2-1. 3 of Chapter 1 in the book 'Robust Optimization'

Title: Sparse graphs with forbidden induced subgraphs and the Erdos-Hajnal conjecture

Abstract:

A graph G is called H-free if it does not contain H as an induced subgraph, i.e. H cannot be obtained from G by deleting vertices. A famous conjecture due to Erdos and Hajnal states that for every graph H, there is a constant c > 0 such that in every n-vertex H-free graph G, there is a set of n^c vertices that are either all pairwise adjacent or all pairwise non-adjacent.