Related papers: Enumeration of general planar hypermaps with an al…
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
In this paper, we provide new discrete uniformization theorems for bounded, $m$-connected planar domains. To this end, we consider a planar, bounded, $m$-connected domain $\Omega$ and let $\bord\Omega$ be its boundary. Let $\mathcal{T}$…
We consider the problem of solving TAP mean field equations by iteration for Ising model with coupling matrices that are drawn at random from general invariant ensembles. We develop an analysis of iterative algorithms using a dynamical…
We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide some effective and computable criteria for birationality in terms of their algebraic and geometric properties. We also extend the Jacobian…
We discuss a class of binary parametric families with conditional probabilities taking the form of generalized linear models and show that this approach allows to model high-dimensional random binary vectors with arbitrary mean and…
We study Ising chains with arbitrary multispin finite-range couplings, providing an explicit solution of the associated inverse Ising problem, i.e. the problem of inferring the values of the coupling constants from the correlation…
Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…
Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we…
We consider the problem of obtaining higher order in regularization parameter $\epsilon$ analytical results for master integrals with elliptics. The two commonly employed methods are provided by the use of differential equations and direct…
We study the problem of hierarchical clustering on planar graphs. We formulate this in terms of an LP relaxation of ultrametric rounding. To solve this LP efficiently we introduce a dual cutting plane scheme that uses minimum cost perfect…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
Machine learning for phase transition has received intensive research interest in recent years. However, its application in percolation still remains challenging. We propose an auxiliary Ising mapping method for machine learning study of…
A connected planar cubic graph is called an $m$-barrel fullerene and denoted by $F(m,k)$, if it has the following structure: The first circle is an $m$-gon. Then $m$-gon is bounded by $m$ pentagons. After that we have additional k layers of…
Ising models of emergent geometry are well known to possess ground states with many of the desired features of a low dimensional, Ricci flat vacuum. Further, excitations of these ground states can be shown to replicate the quantum dynamics…
We present an alternative procedure to eliminate irregular contributions in the perturbation expansion of c=0-matrix models representing the sum over triangulations of random surfaces, thereby reproducing the results of Tutte [1] and Brezin…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
A binarization of a bounded variable $x$ is a linear formulation with variables $x$ and additional binary variables $y_1,\dots, y_k$, so that integrality of $x$ is implied by the integrality of $y_1,\dots, y_k$. A binary extended…
In this paper, we present a novel approach to construct multiclass classifiers by means of arrangements of hyperplanes. We propose different mixed integer (linear and non linear) programming formulations for the problem using extensions of…
It is shown that rational extensions of the isotropic Dunkl oscillator in the plane can be obtained by adding some terms either to the radial equation or to the angular one obtained in the polar coordinates approach. In the former case, the…