Related papers: Planar maps and random partitions
The exactly solvable four-vertex model with the fixed boundary conditions in the presence of inhomogeneous linearly growing external field is considered. The partition function of the model is calculated and represented in the determinantal…
Given a sequence of $N$ positive real numbers $\{a_1,a_2,..., a_N \}$, the number partitioning problem consists of partitioning them into two sets such that the absolute value of the difference of the sums of $a_j$ over the two sets is…
Prime numbers appeared in contexts spanning statistical mechanics, quantum mechanics and dynamical systems. However, the mechanisms governing the irregularities observed in their sequence and linking them to physical systems remained…
The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…
The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…
The chapter presents mathematical models intended for creating a topological drawing of a non-separable non-planar graph based on the methods of G. Ringel's vertex rotation theory. The induced system of cycles generates a topological…
Routing and scheduling problems are fundamental problems in combinatorial optimization, and also have many applications. Most variations of these problems are NP-Hard, so we need to use heuristics to solve these problems on large instances,…
This paper revisits the notion of classical orthogonal polynomials from a broader functional-analytic point of view. It is intended neither as a survey of known results nor as a review of the literature, but rather as a conceptual…
Disordered and frustrated graphical systems are ubiquitous in physics, biology, and information science. For models on complete graphs or random graphs, deep understanding has been achieved through the mean-field replica and cavity methods.…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
In this work we study qualitative properties of real analytic bounded maps. The main tool is approximation of real valued functions analytic in rectangular domains of the complex plane by continued g-fractions of Wall. As an application,…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…
The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…
Let $L$ be a simplicial complex. In this paper, we study random sub-hypergraphs and random sub-complexes of $L$. By considering the minimal complex that a sub-hypergraph can be embedded in and the maximal complex that can be embedded in a…
This is the first of two papers on partition functions and the index theory of transversally elliptic operators. In this paper we only discuss algebraic and combinatorial issues related to partition functions. The applications to index…
In this dissertation we study basic local differential geometry, projective differential geometry, and prolongations of overdetermined geometric partial differential equations. It is simple to prolong an n-th order linear ordinary…
We revisit, in a self contained way, the Markov property on planar maps and decorated planar maps from three perspectives. First, we characterize the laws on these planar maps that satisfy both the Markov property and rerooting invariance,…
Graph partitioning is a key fundamental problem in the area of big graph computation. Previous works do not consider the practical requirements when optimizing the big data analysis in real applications. In this paper, motivated by…
The second part of the paper is devoted to enumeration of $r$-regular toroidal maps up to all homeomorphisms of the torus (unsensed maps). We describe in detail the periodic orientation reversing homeomorphisms of the torus which turn out…
This book intends to deepen the study of the fractional calculus, giving special emphasis to variable-order operators. It is organized in two parts, as follows. In the first part, we review the basic concepts of fractional calculus (Chapter…