Related papers: Integrable boundary conditions for quad equations,…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) with linear equality and bound constraints. The ADMM formulation alternates between an equality constrained…
We investigate quadrature rules for measures supported on real algebraic and rational curves, focusing on the {odd-degree} case \(2s-1\). Adopting an optimization viewpoint, we minimize suitable penalty functions over the space of…
We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of evaluating the partition functions of the monomer-dimer model…
The concept of integrable boundary value problems for soliton equations on $\mathbb{R}$ and $\mathbb{R}_+$ is extended to bounded regions enclosed by smooth curves. Classes of integrable boundary conditions on a circle for the Toda lattice…
In this paper, we introduce a matrix for a mixed graph, called the integrated adjacency matrix. This matrix uniquely determines a mixed graph, as long as the indices of the matrix are specified. Additionally, we associate an (undirected)…
Recently, there has been interest in the question of whether a partial matrix in which many of the fully defined principal submatrices are PSD is approximately PSD completable. These questions are related to graph theory because we can…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
In the context of warped conformal field theories (WCFT), the derivation of the warped Cardy formula relies on the zero mode spectrum being bounded from below. Generically, this is not true for holographic WCFTs in "canonical" ensemble,…
Model-driven software engineering is a suitable method for dealing with the ever-increasing complexity of software development processes. Graphs and graph transformations have proven useful for representing such models and changes to them.…
We study numerical computation of conformal invariants of domains in the complex plane. In particular, we provide an algorithm for computing the conformal capacity of a condenser. The algorithm applies for wide kind of geometries: domains…
This paper explores recent progress related to constraint maps. Building on the exposition in [14], our goal is to provide a clear and accessible account of some of the more intricate arguments behind the main results in this work. Along…
Partition functions arise in statistical physics and probability theory as the normalizing constant of Gibbs measures and in combinatorics and graph theory as graph polynomials. For instance the partition functions of the hard-core model…
We study generalized eigenvalue problems for meet and join matrices with respect to incidence functions on semilattices. We provide new bounds for generalized eigenvalues of meet matrices with respect to join matrices under very general…
We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many connections…
We search and classify two-component versions of the quad equations in the ABS list, under certain assumptions. The independent variables will be called $y,z$ and in addition to multilinearity and irreducibility the equation pair is…
We consider Calderon's inverse problem with partial data in dimensions $n \geq 3$. If the inaccessible part of the boundary satisfies a (conformal) flatness condition in one direction, we show that this problem reduces to the invertibility…
We review boundary rigidity theorems assessing that, under appropriate conditions, Riemannian manifolds with the same spectrum of boundary geodesics are isometric. We show how to apply these theorems to the problem of reconstructing a $d+1$…