L4

Following an idea of Bridgeland, we study the operator on the K-group of algebraic stacks, which takes a stack to its inertia stack.  We prove that the inertia operator is diagonalizable when restricted to nice enough stacks, including those with algebra stabilizers.  We use these results to prove a structure theorem for the motivic Hall algebra of a projective variety, and give a more conceptual definition of virtually indecomposable stack function.  This is joint work with Pooya Ronagh.

Let $G$ be a compact Lie group and $k$ be a field of characteristic $p\ge 0$ such that $H^*(G)$ does not have $p$-torsion. We show that a free Lagrangian orbit of a Hamiltonian $G$-action on a compact, monotone, symplectic manifold $X$ split-generates an idempotent summand of the monotone Fukaya category over $k$ if and only if it represents a non-zero object of that summand. Our result is based on: an explicit understanding of the wrapped Fukaya category through Koszul twisted complexes involving the zero-section and a cotangent fibre; and a functor canonically associated to the Hamiltonian $G$-action on $X$. Several examples can be studied in a uniform manner including toric Fano varieties and certain Grassmannians. 

I will explain how to relate the center of a cyclotomic quiver Hecke algebras to the cohomology of Nakajima quiver varieties using a current algebra action. This is a joint work with M. Varagnolo and E. Vasserot.
 

The security of pairings-based cryptography relies on the difficulty of two problems: computing discrete logarithms over elliptic curves and, respectively, finite fields GF(p^n) when n is a small integer larger than 1. The real-life difficulty of the latter problem was tested in 2006 by a record in a field GF(p^3) and in 2014 and 2015 by new records in GF(p^2), GF(p^3) and GF(p^4). We will present the new methods of polynomial selection which allowed to obtain these records. Then we discuss the difficulty of DLP in GF(p^6) and GF(p^12) when p has a special form (SNFS) for which two theoretical algorithms were presented recently.

We will briefly review the notions of Dirac cohomology and of $A_{\mathfrak{q}}(\lambda)$ modules of real reductive groups, and recall a formula for the Dirac cohomology of an $A_{\mathfrak{q}}(\lambda)$ module. Then we will discuss to what extent an $A_{\mathfrak{q}}(\lambda)$ module is determined by its Dirac cohomology. This is joint work with Jing-Song Huang and David Vogan.

Blenders and food processors have been around for years.  However, detailed understanding of the fluid and particle dynamics going on with in the multi-phase flow of the processing chamber as well as the influence of variables such as the vessel geometry, blade geometry, speeds, surface properties etc., are not well understood.  SharkNinja would like Oxford Universities help in developing a model that can be used to gain insight into fluid dynamics within the food processing chamber with the goal being to develop a system that will produce better food processing performance as well as predict loading on food processing elements to enable data driven product design.

Many vacuum cleaners sold claim “no loss of suction” which is defined as having only a very small reduction in peak air power output over the life of the unit under normal operating conditions.  This is commonly achieved by having a high efficiency cyclonic separator combined with a filter which the user washes at regular intervals (typically every 3 months).  It has been observed that some vacuum cleaners show an increase in peak air watts output after a small amount of dust is deposited on the filter.  This effect is beneficial since it prolongs the time between filter washing.  SharkNinja are currently working on validating their theory as to why this occurs.  SharkNinja would like Oxford University’s help in developing a model that can be used to better understand this effect and provide insight towards optimizing future designs.

Although a very simple system from a construction standpoint, creating a drip coffee maker that can be produce a range of coffee sizes from a single cup to a multi-cup carafe presents unique problems.  Challenges within this system result from varying pressure heads on the inlet side, accurate measurement of relatively low flow rates, fluid motive force generated by boilers, and head above the boiler on the outlet side.  Getting all of these parameters right to deliver the proper strength, proper temp, and proper volume of coffee requires in depth understanding of the fluid dynamics involved in the system.  An ideal outcome from this work would be an adaptive model that enables a fluid system model to be created from building blocks.  This system model would include component models for tubing, boilers, flow meters, filters, pumps, check valves, and the like.

In this talk, I'll discuss some personal experiences - good, bad, and
ugly - of disclosing vulnerabilities in a range of different cryptographic
standards and implementations. I'll try to draw some general lessons about
what works well and what does not.

The Learning with Errors (LWE) problem has become a central building block of modern cryptographic constructions. We will discuss hardness results for concrete instances of LWE. In particular, we discuss algorithms proposed in the literature and give the expected resources required to run them. We consider both generic instances of LWE as well as small secret variants. Since for several methods of solving LWE we require a lattice reduction step, we also review lattice reduction algorithms and propose a refined model for estimating their running times. We also give concrete estimates for various families of LWE instances, provide a Sage module for computing these estimates and highlight gaps in the knowledge about algorithms for solving the Learning with Errors problem.

The concept of delegated quantum computing is a quantum extension of  
the classical task of computing with encrypted data without decrypting  
them first. Many quantum protocols address this challenge for a  
futuristic quantum client-server setting achieving a wide range of  
security properties. The central challenge of all these protocols to  
be applicable for classical tasks (such as secure multi party  
computation or fully homomorphic encryption) is the requirement of a  
server with a universal quantum computer. By restricting the task to  
classical computation only, we derive a protocol for unconditionally  
secure delegation of classical computation to a remote server that has  
access to basic quantum devices.