Related papers: Enumeration of general planar hypermaps with an al…
We obtained analytically eigenvalues of a multidimensional Ising Hamiltonian on a hypercube lattice and expressed them in terms of spin-spin interaction constants and the eigenvalues of the one-dimensional Ising Hamiltonian (the latter are…
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 generalized mapping transformation technique is used to obtain the exact solution for the transverse Ising model on decorated planar lattices. Within this scheme, the basic thermodynamic quantities are calculated for different planar…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…
How complex is an Ising model? Usually, this is measured by the computational complexity of its ground state energy problem. Yet, this complexity measure only distinguishes between planar and non-planar interaction graphs, and thus fails to…
In this paper, we propose an incremental abstraction method for dynamically over-approximating nonlinear systems in a bounded domain by solving a sequence of linear programs, resulting in a sequence of affine upper and lower hyperplanes…
Algebraic domains are regions in the plane surrounded by mutually disjoint non-singular real algebraic curves. Poincar'e-Reeb Graphs of them are graphs they naturally collapse: such graphs are formally formulated by Sorea, for example,…
It has been suggested that an information geometric view of statistical mechanics in which a metric is introduced onto the space of parameters provides an interesting alternative characterisation of the phase structure, particularly in the…
Renormalizations can be considered as building blocks of complex dynamical systems. This phenomenon has been widely studied for iterations of polynomials of one complex variable. Concerning non-polynomial hyperbolic rational maps, a recent…
Covering problems are fundamental classical problems in optimization, computer science and complexity theory. Typically an input to these problems is a family of sets over a finite universe and the goal is to cover the elements of the…
This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root…
We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices…
The parameters of a linear compartment model are usually estimated from experimental input-output data. A problem arises when infinitely many parameter values can yield the same result; such a model is called unidentifiable. In this case,…
We prove a determinantal formula for quantities related to the problem of enumeration of (semi-) meanders, namely the topologically inequivalent planar configurations of non-self-intersecting loops crossing a given (half-) line through a…
We consider the Ising model on a cylindrical lattice of L columns, with fixed-spin boundary conditions on the top and bottom rows. The spontaneous magnetization can be written in terms of partition functions on this lattice. We show how we…
We introduce new invariants of the projective plane (and, more generally, of certain toric surfaces) that arise from the appropriate enumeration of real elliptic curves. These invariants admit a refinement (according to the quantum index)…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
In this paper, we consider the positional numeration system, called the Cantor real expansion, on the unit interval $[\gamma, \gamma+1]$, where $\gamma \in \mathbb{R}$, with respect to an alternate base (i.e., a base which is a purely…