Related papers: Enumeration of general planar hypermaps with an al…
Our main result is an explicit operator-theoretic formula for the number of colored planar maps with a fixed set of stars each of which has a fixed set of half-edges with fixed coloration. The formula bounds the number of such colored…
In this paper we describe an algorithm for implicitizing rational hypersurfaces in case there exists at most a finite number of base points. It is based on a technique exposed in math.AG/0210096, where implicit equations are obtained as…
We describe a new Maple package for treating boundary problems for linear ordinary differential equations, allowing two-/multipoint as well as Stieltjes boundary conditions. For expressing differential operators, boundary conditions, and…
On various regular lattices (simple cubic, body centred cubic..) decorating an edge with an Ising spin coupled by bonds of strength L to the original vertex spins and competing with a direct anti-ferromagnetic bond of strength alpha L can…
In this paper, we give the first combinatorial proof of a rationality scheme for the generating series of maps in positive genus enumerated by both vertices and faces, which was first obtained by Bender, Canfield and Richmond in 1993 by…
We explore various techniques for counting the number of straight-edge crossing-free graphs that can be embedded on a planar point set. In particular, we derive a lower bound on the ratio of the number of such graphs with $m+1$ edges to the…
We introduce an infinitesimal Hopf algebra of planar trees, generalising the construction of the non-commutative Connes-Kreimer Hopf algebra. A non-degenerate pairing and a dual basis are defined, and a combinatorial interpretation of the…
We provide new examples of integrable rational maps in four dimensions with two rational invariants, which have unexpected geometric properties, as for example orbits confined to non algebraic varieties, and fall outside classes studied by…
Polynomial optimization problems over binary variables can be expressed as integer programs using a linearization with extra monomials in addition to those arising in the given polynomial. We characterize when such a linearization yields an…
In this paper we combine the theory of reproducing kernel Hilbert spaces with the field of collocation methods to solve boundary value problems with special emphasis on reproducing property of kernels. From the reproducing property of…
We characterize the set of ground states that can be synthesized by classical 2-body Ising Hamiltonians. We then construct simple Ising planar blocks that simulates efficiently a universal set of logic gates and connections, and hence any…
This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…
The present work continues the program of summing planar Feynman graphs on the world sheet. Although it is based on the same classical action introduced in the earlier work, there are important new features: Instead of the path integral…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models,…
The purpose of this paper is to enumerate various classes of cyclically colored m-gonal plane cacti, called m-ary cacti. This combinatorial problem is motivated by the topological classification of complex polynomials having at most m…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…