Related papers: Integrable boundary conditions for quad equations,…
We propose a new homotopy-based conditional gradient method for solving convex optimization problems with a large number of simple conic constraints. Instances of this template naturally appear in semidefinite programming problems arising…
We use conformal maps to study a free boundary problem for a two-fluid electromechanical system, where the interface between the fluids is determined by the combined effects of electrostatic forces, gravity and surface tension. The free…
We revisit the problem of identifying an unknown portion of a boundary subject to a Robin condition based on a pair of Cauchy data on the accessible part of the boundary. It is known that a single measurement may correspond to infinitely…
We investigate the variational structure of discrete Laplace-type equations that are motivated by discrete integrable quad-equations. In particular, we explain why the reality conditions we consider should be all that are reasonable, and we…
Second order accurate Cartesian grid methods have been well developed for interface problems in the literature. However, it is challenging to develop third or higher order accurate methods for problems with curved interfaces and internal…
We consider the problem of measuring the margin of robust feasibility of solutions to a system of nonlinear equations. We study the special case of a system of quadratic equations, which shows up in many practical applications such as the…
In the present work, we demonstrate how the pseudoinverse concept from linear algebra can be used to represent and analyze the boundary conditions of linear systems of partial differential equations. This approach has theoretical and…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
The concepts of differentiation and integration for matrices are known. As far as each matrix is differentiable, it is not clear a priori whether a given matrix is integrable or not. Recently some progress was obtained for diagonalizable…
For generic maps from compact surfaces with boundary into the plane we develop an explicit algorithm for minimizing both the number of cusps and the number of components of the singular locus. More precisely, we minimize among maps with…
This paper proposes a framework to assess the stability of an ordinary differential equation which is coupled to a 1D-partial differential equation (PDE). The stability theorem is based on a new result on Integral Quadratic Constraints…
This \textquoteleft research-survey' is meant for beginners in the studies of integrable systems. Here we outline some analytical methods for dealing with a class of nonlinear partial differential equations. We pay special attention to…
We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
New classes of integrable boundary conditions for the q-deformed (or two-parameter) supersymmetric U model are presented. The boundary systems are solved by using the coordinate space Bethe ansatz technique and Bethe ansatz equations are…
For a given complex square matrix $A$ with constant row sum, we establish two new eigenvalue inclusion sets. Using these bounds, first we derive bounds for the second largest and smallest eigenvalues of adjacency matrices of $k$-regular…
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions. Prior work has shown strong conditional lower bounds for…
We give inductive constructions of independent graphs that contain implied nonedges but do not contain any non-trivial rigid subgraphs, or \emph{nucleations}: some of the constructions and proofs apply to 3-dimensional abstract rigidity…
We have simulated the pure gauge compact QED with fixed boundary conditions, on lattices from $6^4$ to $16^4$. We argue that a lattice with this fixed boundary imposition corresponds actually to a lattice with spherical topology. We have…
We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…