Related papers: Fully Packed O(n=1) Model on Random Eulerian Trian…

We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…

We prove a compactness theorem for full Boolean-valued models. As an application, we show that if $T$ is a complete countable theory and $\mathcal{B}$ is a complete Boolean algebra, then $\lambda^+$-saturated $\mathcal{B}$-valued models of…

Unbiased random vectors i.e. distributed uniformly in n-dimensional space, are widely applied and the computational cost of generating a vector increases only linearly with n. On the other hand, generating uniformly distributed random…

The gauge fixed polygon model of 2+1 gravity with zero cosmological constant and arbitrary number of spinless point particles is reconstructed from the first order formalism of the theory in terms of the triad and the spin connection. The…

We define a new large $N$ limit for general $\text{O}(N)^{R}$ or $\text{U}(N)^{R}$ invariant tensor models, based on an enhanced large $N$ scaling of the coupling constants. The resulting large $N$ expansion is organized in terms of a…

We introduce a new approach to a linear-circular regression problem that relates multiple linear predictors to a circular response. We follow a modeling approach of a wrapped normal distribution that describes angular variables and angular…

Consider the random graph~\(G(n,p)\) obtained by allowing each edge in the complete graph on~\(n\) vertices to be present with probability~\(p\) independent of the other edges. In this paper, we study the minimum number of edge edit…

We show that for all $n \equiv 0 \pmod{6}$, $n \geq 18$, there is an orientable triangular embedding of the octahedral graph on $n$ vertices that can be augmented with handles to produce a genus embedding of the complete graph of the same…

Weighted variants of triangle detection are an important object of study because of their prominence in fine-grained complexity. We revisit the Node-Weighted Triangle problem, where the goal is to decide if a vertex-weighted graph contains…

We study point particles in 2+1 dimensional first order gravity using a triangulation to fix the connection and frame-field. The Hamiltonian is reduced to a boundary term which yields the total mass. The triangulation is dynamical with…

We study the problem of detecting outlier pairs of strongly correlated variables among a collection of $n$ variables with otherwise weak pairwise correlations. After normalization, this task amounts to the geometric task where we are given…

Mixture modeling, which considers the potential heterogeneity in data, is widely adopted for classification and clustering problems. Mixture models can be estimated using the Expectation-Maximization algorithm, which works with the complete…

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…

It is shown that the Truncated Euler Equations, i.e. a finite set of ordinary differential equations for the amplitude of the large-scale modes, can correctly describe the complex transitional dynamics that occur within the turbulent regime…

We study two types of random matrix ensembles that emerge when considering the same probability measure on partitions. One is the Meixner ensemble with a hard wall and the other are two families of unitary matrix models, with weight…

We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…

In this work, we propose a new method for a unified study of some of the main features of the theory of the center of the enveloping algebra U(gl(n)) and of the algebra of shifted symmetric polynomials, that allows the whole theory to be…

We consider the two-dimensional random tiling model introduced by Cockayne, i.e. the ensemble of all possible coverings of the plane without gaps or overlaps with squares and various hexagons. At the appropriate relative densities the…

The translative intersection formula of integral geometry yields an expression for the mean Euler characteristic of a stationary random closed set intersected with a fixed observation window. We formulate this result in the setting of sets…

Following the procedures by which O(N)-invariant real vector models and their large-N behavior have previously been solved, we extend similar techniques to the study of real symmetric N x N-matrix models with O(N)-invariant interactions.…