Past

What is the minimal size of a separating set? -- Emilie Dufresne

[[{"fid":"23334","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Emilie Dufresne","field_file_image_title_text[und][0][value]":"Emilie Dufresne"},"type":"media","attributes":{"alt":"Emilie Dufresne","title":"Emilie Dufresne","height":"258","width":"258","class":"media-element file-media-square"}}]]

Abstract: The problem of classifying objects up to certain allowed transformations figures prominently in almost all branches of Mathematics, and Invariants are used to decide if two objects are equivalent. A separating set is a set of invariants which achieve the desired classification. In this talk we take the point of view of Invariant Theory, where the objects correspond to points on an affine variety (often a vector space) and equivalence is given by the action of an algebraic group on this affine variety. We explain how the geometry and combinatorics of the group action govern the minimal size of separating sets.

Predator-Prey-Subsidy Dynamics and the Paradox of Enrichment on Networks -- Robert Van Gorder

[[{"fid":"23335","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Robert Van Gorder","field_file_image_title_text[und][0][value]":"Robert Van Gorder"},"type":"media","attributes":{"alt":"Robert Van Gorder","title":"Robert Van Gorder","height":"258","width":"258","class":"media-element file-media-square"}}]]

Abstract: The phrase "paradox of enrichment" was coined by Rosenzweig (1971) to describe the observation that increasing the food available to prey participating in predator-prey interactions can destabilize the predator's population. Subsequent work demonstrated that food-web connectance on networks can stabilize the predator-prey dynamics, thereby dampening the paradox of enrichment in networked domains (such as those used in stepping-stone models). However, when a resource subsidy is available to predators which migrate between nodes on such a network (as is actually observed in some real systems), we may show that predator-prey systems can exhibit a paradox of enrichment - induced by the motion of predators between nodes - provided that such networks are sufficiently densely connected. 

Strombolian volcanoes are thought to maintain their semi-permanent eruptive style by means of counter-current two-phase convective flow in the volcanic conduit leading from the magma chamber, driven by the buoyancy provided by exsolution of volatiles such as water vapour and carbon dioxide in the upwelling magma, due to pressure release. A model of bubbly two-phase flow is presented to describe this, but it is found that the solution breaks down before the vent at the surface is reached. We propose that the mathematical breakdown of the solution is associated with the physical breakdown of the two-phase flow regime from a bubbly flow to a churn-turbulent flow. We provide a second two-phase flow model to describe this regime, and we show that the solution can be realistically continued to the vent. The model is also in keeping with observations of eruptive style.

We will introduce variants of the optimal transport problem, namely martingale optimal transport problem and subharmonic martingale transport problem. Their motivation is partly from mathematical finance. We will see that in dimension greater than one, the additional constraints imply interesting and deep mathematical subtlety on the attainment of dual problem, and it also affects heavily on the geometry of optimal solutions. If time permits, we will introduce still another variant of the martingale transport problem, called the multi-martingale optimal transport problem.

A Fueter map between two hyperKaehler manifolds is a solution of a Cauchy-Riemann-type equation in the quaternionic context. In this talk I will describe relations between Fueter maps, generalized Seiberg-Witten equations, and Yang-Mills instantons on G2-manifolds (so called G2-instantons).

Currently all medical x-ray imaging is performed using point-like sources which produce cone or fan beams. In planar radiology the source is fixed relative to the patient and detector array and therefore only 2D images can be produced. In CT imaging, the source and detector are rotated about the patient and through reconstruction (such as Radon methods), a 3D image can be formed. In Tomosynthesis, a limited range of angles are captured which greatly reduces the complexity and cost of the device and the dose exposure to the patient while largely preserving the clinical utility of the 3D images. Conventional tomosynthesis relies on mechanically moving a source about a fixed trajectory (e.g. an arc) and capturing multiple images along that path. Adaptix is developing a fixed source with an electronically addressable array that allows for a motion-free tomosynthesis system. The Adaptix approach has many advantages including reduced cost, portability, angular information acquired in 2D, and the ability to shape the radiation field (by selectively activating only certain emitters).

The proposed work would examine the effects of patient motion and apply suitable corrections to the image reconstruction (or raw data). Many approaches have been considered in the literature for motion correction, and only some of these may be of use in tomosynthesis. The study will consider which approaches are optimal, and apply them to the present geometry.

A related but perhaps distinct area of investigation is the use of “structured light” techniques to encode the x-rays and extract additional information from the imaging. Most conventional structured light approaches are not suitable for transmissive operation nor for the limited control available in x-rays. Selection of appropriate techniques and algorithms, however, could prove very powerful and yield new ways of performing medical imaging.

Adaptix is a start-up based at the Begbroke Centre for Innovation and Enterprise. Adaptix is transforming planar X-ray – the diagnostic imaging modality most widely used in healthcare worldwide. We are adding low-dose 3D capability – digital tomosynthesis - to planar X-ray while making it more affordable and truly portable so radiology can more easily travel to the patient. This transformation will enhance patient’s access to the world’s most important imaging technologies and likely increases the diagnostic accuracy for many high incidence conditions such as cardiovascular and pulmonary diseases, lung cancer and osteoporosis. 
 

We are increasingly better at predicting things about our environment. Modern weather forecasts are a lot better than they used to be, and our ability to predict climate change illustrates our better understanding of our effect on our environment. But what about predicting our collective effect on ourselves?  We now use tools like Google maps to predict how long it will take us to drive to work, and other small things, but we fail miserably when it comes to many of the big things. For example, the recent financial crisis cost the world tens of trillions of pounds, yet our ability to forecast, understand and mitigate the next economic crisis is very low. Is this inherently impossible? Or perhaps we are just not going about it the right way? The complex systems approach to economics, which brings in insights from the physical and natural sciences, presents an alternative to standard methods. Doyne will explain what this new approach is and give a few examples of its successes so far. He will then present a vision of the economics of the future which will need to confront the serious problems that the world will soon face.
 

Please email @email to register

In 2000, Vojta solved the n-squares problem under the Bombieri-Lang conjecture, by explicitly finding all the curves of genus 0 or 1 on the surfaces related to this problem. The fundamental notion used by him is $\omega$-integrality of curves. 
In this talk, I will show a generalization of Vojta's method to find all curves of low genus in some surfaces, with arithmetic applications.
I will also explain how to use $\omega$-integrality to obtain a bound of the height of a non-constant morphism from a curve to $\mathbb{P}^2$ in terms of the number of intersections (without multiplicities) of its image with a divisor of a particular kind. This proves some new special cases of Vojta's conjecture for function fields.
 

One of the fundamental tools in numerical analysis and PDE
is the finite element method (FEM). A main ingredient in
FEM are splines: piecewise polynomial functions on a
mesh. Even for a fixed mesh in the plane, there are many open
questions about splines: for a triangular mesh T and
smoothness order one, the dimension of the vector space
  C^1_3(T) of splines of polynomial degree at most three
is unknown. In 1973, Gil Strang conjectured a formula
for the dimension of the space C^1_2(T) in terms of the
combinatorics and geometry of the mesh T, and in 1987 Lou
Billera used algebraic topology to prove the conjecture
(and win the Fulkerson prize). I'll describe recent progress
on the study of spline spaces, including a quick and self
contained introduction to some basic but quite useful tools
from topology.

In 2000, Vojta solved the n-squares problem under the Bombieri-Lang conjecture, by explicitly finding all the curves of genus 0 or 1 on the surfaces related to this problem. The fundamental notion used by him is $\omega$-integrality of curves. 

In this talk, I will show a generalization of Vojta's method to find all curves of low genus in some surfaces, with arithmetic applications.

I will also explain how to use $\omega$-integrality to obtain a bound of the height of a non-constant morphism from a curve to $\mathbb{P}^2$ in terms of the number of intersections (without multiplicities) of its image with a divisor of a particular kind.
This proves some new special cases of Vojta's conjecture for function fields.
 

We consider the problem of computing a nonnegative low rank factorization to a given nonnegative input matrix under the so-called "separabilty condition".  This assumption makes this otherwise NP hard problem polynomial time solvable, and we will use first order optimization techniques to compute such a factorization. The optimization model use is based on sparse regression with a self-dictionary, in which the low rank constraint is relaxed to the minimization of an l1-norm objective function.  We apply these techniques to endmember detection and classification in hyperspecral imaging data.

Stallings' theorem states that a finitely generated group splits over a finite subgroup if and only if it has more than one end. As a consequence of this, group splittings over finite subgroups are invariant under quasi-isometry. I will discuss a generalisation of Stallings' theorem which shows that under suitable hypotheses, group splittings over classes of infinite groups, namely coarse $PD_n$ groups, are also invariant under quasi-isometry.

Not considering classified work, the first person to have asked and solved the problem of secure communication over insecure communication channels was Ralph Merkle, in a project for a Computer securitjohn y course at UC Berkeley in 1974. In this work, he gave a protocol that allow two legitimate parties to establish a secret key with an effort of the order of N, but such that an eavesdropper can not discover the secret key with non-vanishing probability if he is not willing to spend an effort of at least the order of N^2.
In this talk, we will consider key exchange protocols in the presence of a quantum eavesdropper. Unfortunately, it is easy to see that in this case, breaking Merkle’s original protocol only requires an effort of the order of N, similar to the one of the legitimate parties. We will show how to restore the security by presenting two sequences of protocols with the following properties:
- In the first sequence, the legitimate parties have access to a quantum computer, and the eavesdropper's effort is arbitrarily close to N^2.
- In the second sequence, the protocols are classical, but the eavesdropper’s effort is arbitrarily close to N^{3/2}.
We will show the key exchange protocols, the quantum attacks with the proof of their optimality. We will focus mostly on the techniques from quantum algorithms and complexity theory used to devise quantum algorithms and to prove lower bounds. The underlying tools are the quantum walk formalism, and the quantum adversary lower bound method, respectively. Finally, we will introduce a new method to prove average-case quantum query complexity lower bounds.

The problem of computing the Galois group of an irreducible, rational polynomial has been studied for many years. I will discuss the methods developed over the years to approach this problem, and give some examples of them in practice. These methods mainly involve constructing and factorising resolvent polynomials, and thereby determining better upper bounds for the conjugacy class of the Galois group within the symmetric group, i.e. describe its action on the roots of the polynomial explicitly. I will describe how using approximations to the zeros of the polynomial allows us to construct resolvents, and in particular, how using p-adic approximations can be advantageous over numerical approximations, and how this can yield a direct and systematic method of determining the Galois group.

The Hall algebra can be constructed using the Waldhausen S-construction. We will give a systematic recipe for this and show how it extends naturally to give a bi-algebraic structure. As a result we obtain a more transparent proof of Green's theorem about the bi-algebra structure on the Hall algebra.

For a graph $G$, the $k$-colour Ramsey number $R_k(G)$ is the least integer $N$ such that every $k$-colouring of the edges of the complete graph $K_N$ contains a monochromatic copy of $G$. Let $C_n$ denote the cycle on $n$ vertices. We show that for fixed $k\geq2$ and $n$ odd and sufficiently large,
$$
R_k(C_n)=2^{k-1}(n-1)+1.
$$
This resolves a conjecture of Bondy and Erdős for large $n$. The proof is analytic in nature, the first step of which is to use the regularity method to relate this problem in Ramsey theory to one in nonlinear optimisation.  This allows us to prove a stability-type generalisation of the above and establish a correspondence between extremal $k$-colourings for this problem and perfect matchings in the $k$-dimensional hypercube $Q_k$.

It has long been expected, and is now proved in many important cases, 
that quantum algebras are more rigid than their classical limits. That is, they 
have much smaller automorphism groups. This begs the question of whether this 
broken symmetry can be recovered.

I will outline an approach to this question using the ideas of noncommutative 
projective geometry, from which we see that the correct object to study is a 
groupoid, rather than a group, and maps in this groupoid are the replacement 
for automorphisms. I will illustrate this with the example of quantum 
projective space.

This is joint work with Nicholas Cooney (Clermont-Ferrand).