Related papers: The pinning ideal of a multiloop
We investigate the geometric hitting set problem in the online setup for the range space $\Sigma=({\cal P},{\cal S})$, where the set $\P\subset\mathbb{R}^2$ is a collection of $n$ points and the set $\cal S$ is a family of geometric objects…
In a recent paper by Harada, Seceleanu, and \c{S}ega, the Hilbert function, betti table, and graded minimal free resolution of a general principal symmetric ideal are determined when the number of variables in the polynomial ring is…
To establish a unified framework for studying both discrete and continuous coupling distributions, we introduce the {\it binomial} spin glass, a class of models where the couplings are sums of $m$ identically distributed Bernoulli random…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
The parametrisation method for invariant manifolds is a powerful technique for deriving reduced-order models in the context of nonlinear vibrating systems, allowing accurate computations of nonlinear normal modes. Thanks to arbitrary order…
The subspace approximation problem Subspace($k$,$p$) asks for a $k$-dimensional linear subspace that fits a given set of points optimally, where the error for fitting is a generalization of the least squares fit and uses the $\ell_{p}$ norm…
A permutation graph $G_\pi$ is a simple graph with vertices corresponding to the elements of $\pi$ and an edge between $i$ and $j$ when $i$ and $j$ are inverted in $\pi$. A set of vertices $D$ is said to dominate a graph $G$ when every…
A generic immersion of a planar graph into the 2-space is said to be knotted if there does not exist a trivial embedding of the graph into the 3-space obtained by lifting the immersion with respect to the natural projection from the 3-space…
Existing fine-grained visual categorization methods often suffer from three challenges: lack of training data, large number of fine-grained categories, and high intraclass vs. low inter-class variance. In this work we propose a generic…
A graph $G$ realizes the degree sequence $S$ if the degrees of its vertices is $S$. Hakimi gave a necessary and sufficient condition to guarantee that there exists a connected multigraph realizing $S$. Taylor later proved that any connected…
It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…
Numerical evaluations of Feynman integrals often proceed via a deformation of the integration contour into the complex plane. While valid contours are easy to construct, the numerical precision for a multi-loop integral can depend…
In this paper we consider the Ideal Membership Problem (IMP for short), in which we are given real polynomials $f_0,f_1,\dots, f_k$ and the question is to decide whether $f_0$ belongs to the ideal generated by $f_1,\dots,f_k$. In the more…
Quantum labeling tasks ask one to recover the missing associations between classical outcome labels and the effects forming the POVM. We study labeling in the multiple-shot regime, allowing a finite number of uses of the device and the most…
We study a primal-dual interior point method specialized to clustered low-rank semidefinite programs requiring high precision numerics, which arise from certain multivariate polynomial (matrix) programs through sums-of-squares…
As a fundamental piece of multi-object Bayesian inference, multi-object density has the ability to describe the uncertainty of the number and values of objects, as well as the statistical correlation between objects, thus perfectly matches…
A precise dynamical characterization of quantum impurity models with multiple interacting orbitals is challenging. In quantum Monte Carlo methods, this is embodied by sign problems. A dynamical sign problem makes it exponentially difficult…
An instance $I$ of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in $I$ is the exchange of two consecutive vertices in a preference list. A swap can be viewed as…
Given a set $V$, a subset $S$, and a permutation $\pi$ of $V$, we say that $\pi$ permutes $S$ if $\pi (S) \cap S = \emptyset$. Given a collection $\cS = \{V; S_1,\ldots , S_m\}$, where $S_i \subseteq V ~~(i=1,\ldots ,m)$, we say that $\cS$…
A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…