Related papers: Enumeration of general planar hypermaps with an al…
In an earlier work we used a path integral analysis to propose a higher genus generalization of the elliptic genus. We found a cobordism invariant parametrized by Teichmuller space. Here we simplify the formula and study the behavior of our…
We give a combinatorial characterization of isotropic subspaces in the Orlik- Solomon algebra of a hyperplane arrangement in terms of decorations of its intersection lattice. We then use this characterization to prove a result that relates…
We introduce a methodology for generating benchmark problem sets for Ising machines---devices designed to solve discrete optimization problems cast as Ising models. In our approach, linear systems of equations are cast as Ising cost…
Physical systems defined on hyperbolic lattices may exhibit phases of matter that only emerge due to negative curvature. We focus on the case of the Ising model under open boundary conditions and show that an ``intermediate'' phase emerges…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
We study relaxations for linear programs with complementarity constraints, especially instances whose complementary pairs of variables are not independent. Our formulation is based on identifying vertex covers of the conflict graph of the…
We show how a boundary state different from the (1,1) Cardy state may be realised in the (m,m+1) minimal string by the introduction of an auxiliary matrix into the standard two hermitian matrix model. This boundary is a natural…
We consider the planar Ising model in rectangle $(\Omega; x^L, x^R, y^R, y^L)$ with alternating boundary condition: $\ominus$ along $(x^Lx^R)$ and $(y^Ry^L)$, $\xi^R\in\{\oplus, \text{free}\}$ along $(x^Ry^R)$, and $\xi^L\in\{\oplus,…
Ellipses are a meta-linguistic notation for denoting terms the size of which are specified by a meta-variable that ranges over the natural numbers. In this work, we present a systematic approach for encoding such meta-expressions in the…
We completely describe by inequalities the set of boundary correlation matrices of planar Ising networks embedded in a disk. Specifically, we build on a recent result of M.~Lis to give a simple bijection between such correlation matrices…
The angular and the radial parts of the dynamics of the perturbed Kepler motion are separable in many important cases. In this paper we study the radial motion and its parametrizations. We develop in detail a generalized eccentric anomaly…
We characterize in simple terms the Pak-Stanley labels $\lambda(R)$ of the regions $R$ of the $m$-Catalan arrangement. We also propose a simple algorithm that returns $R$ from $\lambda(R)$. Finally, we characterize in close terms the labels…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…
To study asymptotic structures, we regularize Einstein's field equations by means of conformal transformations. The conformal factor is chosen so that it carries a dimensional scale that captures crucial asymptotic features. By choosing a…
The Euler characteristic of a very affine variety encodes the number of critical points of the likelihood equation on this variety. In this paper, we study the Euler characteristic of the complement of a hypersurface arrangement with…
Parameterized algebraic curves and surfaces are widely used in geometric modeling and their manipulation is an important task in the processing of geometric models. In particular, the determination of the intersection loci between points,…
To enumerate 3-manifold triangulations with a given property, one typically begins with a set of potential face pairing graphs (also known as dual 1-skeletons), and then attempts to flesh each graph out into full triangulations using an…
In this paper we accomplish the development of the fast rank-adaptive solver for tensor-structured symmetric positive definite linear systems in higher dimensions. In [arXiv:1301.6068] this problem is approached by alternating minimization…
Counterfactual explanations are viewed as an effective way to explain machine learning predictions. This interest is reflected by a relatively young literature with already dozens of algorithms aiming to generate such explanations. These…