Related papers: The six-vertex model on random planar maps revisit…
We study the generalisation of Baxter's three-colour problem to a random lattice. Rephrasing the problem as a matrix model problem we discuss the analyticity structure and the critical behaviour of the resulting matrix model. Based on a set…
We introduce efficient Markov chain Monte Carlo methods for inference and model determination in multivariate and matrix-variate Gaussian graphical models. Our framework is based on the G-Wishart prior for the precision matrix associated…
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
In 2010, Vershik proposed a new combinatorial invariant of metric spaces given by a class of polytopes that arise in the theory of optimal transport and are called ``Wasserstein polytopes'' or ``Kantorovich-Rubinstein polytopes'' in the…
We introduce and study symmetric polynomials, which as very special cases include polynomials related to the supersymmetric eight-vertex model, and other elliptic lattice models with $\Delta=\pm 1/2$. There is also a close relation to…
This work is concerned with various aspects of the formulation of the quantum inverse scattering method for the one-dimensional Hubbard model. We first establish the essential tools to solve the eigenvalue problem for the transfer matrix of…
Finite mixtures of matrix normal distributions are a powerful tool for classifying three-way data in unsupervised problems. The distribution of each component is assumed to be a matrix variate normal density. The mixture model can be…
In this letter we establish a connection of Picard-type elliptic solutions of Painleve VI equation with the special solutions of the non-stationary Lame equation. The latter appeared in the study of the ground state properties of Baxter's…
We introduce a notion of balanced configurations of vectors. This is motivated by the study of rational A-hypergeometric functions in the sense of Gelfand, Kapranov and Zelevinsky. We classify balanced configurations of seven plane vectors…
Nonlinear integrable models with two spatial and one temporal variables: Kadomtsev-Petviashvili equation and two-dimensional Toda lattice are investigated on the subject of correct formulation for boundary problem that can be solved within…
In this paper we studied infinite weighted automata and a general methodology to solve a wide variety of classical lattice path counting problems in an uniform way. This counting problems are related to Dyck paths, Motzkin paths and some…
We develop a novel, fundamental and surprisingly simple randomized iterative method for solving consistent linear systems. Our method has six different but equivalent interpretations: sketch-and-project, constrain-and-approximate, random…
This paper presents an iterative method suitable for inverting semilinear problems which are important kernels in many numerical applications. The primary idea is to employ a parametrization that is able to reduce semilinear problems into…
The matroid parity (or matroid matching) problem, introduced as a common generalization of matching and matroid intersection problems, is so general that it requires an exponential number of oracle calls. Nevertheless, Lov\'asz (1980)…
In this paper we investigate the mathematical properties of the integrability of the symmetric six-vertex model towards the view of Algebraic Geometry. We show that the algebraic variety originated from Baxter's commuting transfer method is…
A three-vortex system on a plane is known to be minimally superintegrable in the Liouville sense. In this work, integrable generalisations of the three-vortex planar model, which involve root vectors of simple Lie algebras, are proposed. It…
The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
We continue the work of Belliard, Pimenta and Slavnov (2024) studying the modified rational six vertex model. We find another formula of the partition function for the inhomogeneous model, in terms of a determinant that mix the modified…
We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…