Related papers: The weighted horizontal linear complementarity pro…
Graph isomorphism, a classical algorithmic problem, determines whether two input graphs are structurally identical or not. Interestingly, it is one of the few problems that is not yet known to belong to either the P or NP-complete…
The Maximum Weight Independent Set of Polygons problem is a fundamental problem in computational geometry. Given a set of weighted polygons in the 2-dimensional plane, the goal is to find a set of pairwise non-overlapping polygons with…
We examine holographic entanglement entropy with higher curvature gravity in the bulk. We show that in general Wald's formula for horizon entropy does not yield the correct entanglement entropy. However, for Lovelock gravity, there is an…
We determine every Jordan type partition that occurs as the Jordan block decomposition for the multiplication map by a linear form in a height two homogeneous complete intersection (CI) Artinian algebra $A$ over an algebraically closed…
We consider the W-extended logarithmic minimal model WLM(p,p'). As in the rational minimal models, the so-called fundamental fusion algebra of WLM(p,p') is described by a simple graph fusion algebra. The fusion matrices in the regular…
Representing a polygon using a set of simple shapes has numerous applications in different use-case scenarios. We consider the problem of covering the interior of a rectilinear polygon with holes by a set of area-weighted, axis-aligned…
We introduce a new class of inverse optimization problems in which an input solution is given together with $k$ linear weight functions, and the goal is to modify the weights by the same deviation vector $p$ so that the input solution…
Let $w$ be an unbounded radial weight on the complex plane. We study the following approximation problem: find a proper holomorphic map $f: \mathbb{C}\to\mathbb{C}^n$ such that $|f|$ is equivalent to $w$. We give several characterizations…
In this thesis, we present results related to complementarity problems. We study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed…
We revisit the stability of black hole saddles for the Euclidean path integral describing the canonical partition function $Z(\beta)$ for gravity inside a spherical reflecting cavity. The boundary condition at the cavity wall couples the…
In this paper, we study linearly constrained optimization problems (LCP). After applying Hadamard parametrization, the feasible set of the parametrized problem (LCPH) becomes an algebraic variety, with conducive geometric properties which…
A real square matrix $A$ is called a $Q$-matrix if the linear complementarity problem $LCP(A,q)$ has a solution for all $q \in \mathbb{R}^n$. This means that for every vector $q$ there exists a vector $x$ such that $x \geq 0, y=Ax+q\geq 0$…
The maximum graph bisection problem is a well known graph partition problem. The problem has been proven to be NP-hard. In the maximum graph bisection problem it is required that the set of vertices is divided into two partition with equal…
We develop a bootstrap approach to Euclidean two-point correlators, in the thermal or ground state of quantum mechanical systems. We formulate the problem of bounding the two-point correlator as a semidefinite programming problem, subject…
The square-peg problem asks if every Jordan curve in the plane has four points which are the vertices of a square. The problem is open for continuous Jordan curves, but it has been resolved for various regularity classes of curves between…
The Euclidean path integral for gravity is enriched by the addition of boundaries, which provide useful probes of thermodynamic properties. Common boundary conditions include Dirichlet conditions on the boundary induced metric;…
Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's…
We establish explicit operator norm bounds and essential self-adjointness criteria for discrete Hodge Laplacians on weighted graphs and simplicial complexes. For unweighted $d$-regular graphs we prove the universal estimate…
This manuscript discusses computation of the Partition Function (PF) and the Minimum Weight Perfect Matching (MWPM) on arbitrary, non-bipartite graphs. We present two novel problem formulations - one for computing the PF of a Perfect…
We study the uniqueness question for two inverse problems on graphs. Both problems consist in finding (possibly complex) edge or nodal based quantities from boundary measurements of solutions to the Dirichlet problem associated with a…