Related papers: The squish map and the $\text{SL}_2$ double dimer …
We study maps from a 2D world-sheet to a 2D target space which include folds. The geometry of folds is discussed and a metric on the space of folded maps is written down. We show that the latter is not invariant under area preserving…
We summarize features and results on the problem of the existence of Ground States for the Nonlinear Schr\"odinger Equation on doubly-periodic metric graphs. We extend the results known for the two--dimensional square grid graph to the…
The proximity effect between a superconductor and a highly diffusive two-dimensional metal was revealed in a Scanning Tunneling Spectroscopy experiment. The in-situ elaborated samples consisted of superconducting single crystalline Pb…
We consider a scattering map that arises in the $\bar \partial $-approach to the scattering theory for the Davey-Stewartson II equation and show that the map is an invertible map between certain weighted $L^2$ Sobolev spaces.
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified approach for the enumeration of several classes of cubic…
Studies in environmental and epidemiological sciences are often spatially varying and observational in nature with the aim of establishing cause and effect relationships. One of the major challenges with such studies is the presence of…
We study a weighted generalization of the fractional cut-covering problem, which we relate to the maximum cut problem via antiblocker and gauge duality. This relationship allows us to introduce a semidefinite programming (SDP) relaxation…
Large tensors are frequently encountered in various fields such as computer vision, scientific simulations, sensor networks, and data mining. However, these tensors are often too large for convenient processing, transfer, or storage.…
In the early 1980's an elementary algorithm for computing conformal maps was discovered by R. K\"uhnau and the first author. The algorithm is fast and accurate, but convergence was not known. Given points z_0,...,z_n in the plane, the…
Two-dimensional (2D) fully-addressed arrays can conveniently realize three-dimensional (3D) ultrasound imaging while fully controlled such arrays usually demands thousands of independent channels, which is costly. Sparse array technique…
In this work, we present a general framework for the design and analysis of two-level AMG methods. The approach is to find a basis for locally optimal or quasi-optimal coarse space, such as the space of constant vectors for standard…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
We study the complexity of approximating the partition function of the $q$-state Potts model and the closely related Tutte polynomial for complex values of the underlying parameters. Apart from the classical connections with quantum…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
We report a computational study of cutting plane algorithms for multi-stage stochastic mixed-integer programming models with the following cuts: (i) Benders', (ii) Integer L-shaped, and (iii) Lagrangian cuts. We first show that Integer…
For a general dyadic grid, we give a Calder\'{o}n-Zygmund type decomposition, which is the principle fact about the multilinear maximal function $\mathfrak{M}$ on the upper half-spaces. Using the decomposition, we study the boundedness of…
Column-sparse packing problems arise in several contexts in both deterministic and stochastic discrete optimization. We present two unifying ideas, (non-uniform) attenuation and multiple-chance algorithms, to obtain improved approximation…
We analyse the singularity formation of congruences of solutions of systems of second order PDEs via the construction of \emph{shape maps}. The trace of such maps represents a congruence volume whose collapse we study through an appropriate…
In recent years, the use of sparse recovery techniques in the approximation of high-dimensional functions has garnered increasing interest. In this work we present a survey of recent progress in this emerging topic. Our main focus is on the…