Related papers: Enumeration of general planar hypermaps with an al…
We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…
Welschinger invariants enumerate real nodal rational curves in the plane or in another real rational surface. We analyze the existence of similar enumerative invariants that count real rational plane curves having prescribed non-nodal…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Quantum annealing is a heuristic algorithm for searching the ground state of an Ising model. Heuristic algorithms aim to obtain near-optimal solutions with a reasonable computation time. Accordingly, many algorithms have so far been…
In this note, we study the equivalence between planar Ising networks and cells in the positive orthogonal Grassmannian. We present a microscopic construction based on amalgamation, which establishes the correspondence for any planar Ising…
The non-linearities of the dynamics of Earth artificial satellites are encapsulated by two formal integrals that are customarily computed by perturbation methods. Standard procedures begin with a Hamiltonian simplification that removes…
We present a procedure to solve the inverse Ising problem, that is to find the interactions between a set of binary variables from the measure of their equilibrium correlations. The method consists in constructing and selecting specific…
In this essay, we briefly discuss recent developments, started a decade ago in the seminal work of Smirnov and continued by a number of authors, centered around the conformal invariance of the critical planar Ising model on $\mathbb{Z}^2$…
The partition function with boundary conditions for various two-dimensional Ising models is examined and previously unobserved properties of conformal invariance and universality are established numerically.
The multilinear Pagerank model [Gleich, Lim and Yu, 2015] is a tensor-based generalization of the Pagerank model. Its computation requires solving a system of polynomial equations that contains a parameter $\alpha \in [0,1)$. For $\alpha…
We discuss a geometrical interpretation of the Z-invariant Ising model in terms of isoradial embeddings of planar lattices. The Z-invariant Ising model can be defined on an arbitrary planar lattice if and only if certain paths on the…
We address the enumeration of planar 4-valent maps equipped with an Eulerian orientation by two different methods, and compare the solutions we thus obtain. With the first method we enumerate these orientations as well as a restricted class…
We present a new approach to compute selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. Our method requires computing generalized eigenvalue problems of the same size as the matrices of the initial two-parameter…
In this paper we consider the problem of quantizing theories defined over configuration spaces described by non-commuting parameters. If one tries to do that by generalizing the path-integral formalism, the first problem one has to deal…
In recent work of Cachazo, Guevara, Mizera and the author, a generalization of the biadjoint scattering amplitude $m^{(k)}(\mathbb{I}_n,\mathbb{I}_n)$ was introduced as an integral over the moduli space of $n$ points in $\mathbb{CP}^{k-1}$,…
We study the thermodynamic and magnetic properties of an Ising bilayer ferrimagnet. The system is composed of two interacting non-equivalent planes in which the intralayer couplings are ferromagnetic while the interlayer interactions are…
In this paper, we propose a new mathematical optimization model for multiclass classification based on arrangements of hyperplanes. Our approach preserves the core support vector machine (SVM) paradigm of maximizing class separation while…
We present a thorough experimental evaluation of several crossing minimization heuristics that are based on the construction and iterative improvement of a planarization, i.e., a planar representation of a graph with crossings replaced by…
We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…
A spatially one dimensional coupled map lattice possessing the same symmetries as the Miller Huse model is introduced. Our model is studied analytically by means of a formal perturbation expansion which uses weak coupling and the vicinity…