Related papers: Conjugacy search problem and the Andrews-Curtis co…
In this paper we study the automorphism group of the procongruence mapping class group through its action on the associated procongruence curve and pants complexes. Our main result is a rigidity theorem for the procongruence completion of…
We give a general proof of convergence for the Alternating Direction Method of Multipliers (ADMM). ADMM is an optimization algorithm that has recently become very popular due to its capabilities to solve large-scale and/or distributed…
The stable Andrews-Curtis conjecture in combinatorial group theory is the statement that every balanced presentation of the trivial group can be simplified to the trivial form by elementary moves corresponding to "handle-slides" together…
We propose a method to identify and classify evolution equations and systems that can be multipotentialised in given target equations or target systems. We refer to this as the {\it converse problem}. Although we mainly study a method for…
Toral automorphisms are widely used (discrete) dynamical systems, the perhaps most prominent example (in 2D) being Arnold's cat map. Given such an automorphism M, its symmetries (i.e. all automorphisms that commute with M) and reversing…
We give a natural problem over input quantum oracles $U$ which cannot be solved with exponentially many black-box queries to $U$ and $U^\dagger$, but which can be solved with constant many queries to $U$ and $U^*$, or $U$ and…
We establish some new cases of Artin's conjecture. Our results apply to Galois representations over $\Q$ with image $S_5$ satisfying certain local hypotheses, the most important of which is that complex conjugation is conjugate to…
The alternating direction method of multipliers (ADMM) algorithm is a powerful and flexible tool for complex optimization problems of the form $\min\{f(x)+g(y) : Ax+By=c\}$. ADMM exhibits robust empirical performance across a range of…
We consider the problem of minimizing the sum of a convex function and a convex function composed with an injective linear mapping. For such problems, subject to a coercivity condition at fixed points of the corresponding Picard iteration,…
This is the second of two papers in which we investigate the properties of displacement functions of automorphisms of free groups (more generally, free products) on the Culler-Vogtmann Outer space $CV_n$ and its simplicial bordification. We…
We use cobordism theory to analyse anomalies of finite non-abelian symmetries in 4 spacetime dimensions. By applying the method of `anomaly interplay', which uses functoriality of cobordism and naturality of the $\eta$-invariant to relate…
Mixed anomalies, higher form symmetries, two-group symmetries and non-invertible symmetries have proved to be useful in providing non-trivial constraints on the dynamics of quantum field theories. We study mixed anomalies involving discrete…
We propose a new approach to conjugation-invariant random permutations. Namely, we explain how to construct uniform permutations in given conjugacy classes from certain point processes in the plane. This enables the use of geometric tools…
This paper contains an attempt to formulate rigorously and to check predictions in enumerative geometry of curves following from Mirror Symmetry. The main tool is a new notion of stable map. We give an outline of a contsruction of…
This is the third in a series of papers which outlines an approach to the classification of $\mathcal{N}{=}2$ superconformal field theories at rank 2 via the study of their Coulomb branch geometries. Here we use the fact that the encoding…
Non-convex quadratically constrained quadratic programming (QCQP) problems have numerous applications in signal processing, machine learning, and wireless communications, albeit the general QCQP is NP-hard, and several interesting special…
Quantization of the parameters of machine learning models, such as deep neural networks, requires solving constrained optimization problems, where the constraint set is formed by the Cartesian product of many simple discrete sets. For such…
We present a powerful and easy-to-implement iterative algorithm for solving large-scale optimization problems that involve $L_1$/total-variation (TV) regularization. The method is based on combining the Alternating Directions Method of…
When are two germs of analytic systems conjugate or orbitally equivalent under an analytic change of coordinates in the neighborhood of a singular point? A way to answer is to use normal forms. But there are large classes of dynamical…
In numerical relativity simulations with non-trivial matter configurations, one must solve the Hamiltonian and momentum constraints of the ADM formulation for the metric variables in the initial data. We introduce a new scheme based on the…