Related papers: Fully Packed O(n=1) Model on Random Eulerian Trian…
A random Eulerian triangulation is a random triangulation where an even number of triangles meet at any given vertex. We argue that the central charge increases by one if the fully packed O(n) model is defined on a random Eulerian…
We explore the physical properties of the completely packed O($n$) loop model on the square lattice, and its generalization to an Eulerian graph model, which follows by including cubic vertices which connect the four incoming loop segments.…
An Eulerian orientation is an orientation of the edges of a graph such that every vertex is balanced: its in-degree equals its out-degree. Counting Eulerian orientations corresponds to the crucial partition function in so-called ``ice-type…
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
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 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…
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2-o(1))n…
In this letter, the 6-vertex model on dynamical random lattices is defined via a matrix model and rewritten (following I. Kostov) as a deformation of the O(2) model. In the large N planar limit, an exact solution is found at criticality.…
We continue our investigation of the nested loop approach to the O(n) model on random maps, by extending it to the case where loops may visit faces of arbitrary degree. This allows to express the partition function of the O(n) loop model as…
We consider a dynamical triangulation model of euclidean quantum gravity where the topology is not fixed. This model is equivalent to a tensor generalization of the matrix model of two dimensional quantum gravity. A set of moves is given…
The Circle Packing Theorem states that every planar graph can be represented as the tangency graph of a family of internally-disjoint circles. A well-known generalization is the Primal-Dual Circle Packing Theorem for 3-connected planar…
Given an edge-weighted metric complete graph with $n$ vertices, the maximum weight metric triangle packing problem is to find a set of $n/3$ vertex-disjoint triangles with the total weight of all triangles in the packing maximized. Several…
Via circle pattern techniques, random planar triangulations (with angle variables) are mapped onto Delaunay triangulations in the complex plane. The uniform measure on triangulations is mapped onto a conformally invariant spatial point…
It has been shown recently [10] that Cauchy transforms of orthogonal polynomials appear naturally in general correlation functions containing ratios of characteristic polynomials of random NxN Hermitian matrices. Our main goal is to…
We present an exact solution of the $O(n)$ model on a random lattice. The coupling constant space of our model is parametrized in terms of a set of moment variables and the same type of universality with respect to the potential as observed…
We consider the O(n) loop model on tetravalent maps and show how to rephrase it into a model of bipartite maps without loops. This follows from a combinatorial decomposition that consists in cutting the O(n) model configurations along their…
Random tensor models can be used as combinatorial devices to generate Euclidean dynamical triangulations. A physical continuum limit of dynamical triangulations requires a suitable generalization of the double-scaling limit of random…
The generalized Euler case (rigid body rotation over the fixed point) is discussed here: - the center of masses of non-symmetric rigid body is assumed to be located at the equatorial plane on axis Oy which is perpendicular to the main…
Rotation representations are foundational in fields such as computer graphics, robotics, and machine learning, where precise and efficient modeling of 3D orientations is critical. This paper comprehensively investigates diverse…
Electron is modeled as a spherically symmetric charged perfect fluid distribution of matter. The existing model is extended assuming a matter source that is characterized by quadratic EoS in the context of general theory of relativity. For…