Related papers: Circle patterns and critical Ising models

We give a necessary and sufficient condition for two circles, each with finitely many points added inside, to be betweenness isomorphic. We fully characterize the betweenness isomorphism classes in the family consisting of all circles with…

Critical behavior of the Ising model is investigated at the center of large scale finite size systems, where the lattice is represented as the tiling of pentagons. The system is on the hyperbolic plane, and the recursive structure of the…

Let $A$ be a finite commutative ring with unity $1 \neq 0.$ An ideal of $A$ is said to be essential if it has a non-zero intersection with every non-zero ideal of $A.$ The essential graph of $A$ is a simple undirected graph whose vertex set…

We characterize all translation invariant half planar maps satisfying a certain natural domain Markov property. For p-angulations with p \ge 3 where all faces are simple, we show that these form a one-parameter family of measures…

Disordered magnets, martensitic mixed crystals, and glassy solids can be irreversibly deformed by subjecting them to external deformation. The deformation produces a smooth, reversible response punctuated by abrupt relaxation "glitches".…

A signed graph is a graph whose edges are labelled positive or negative. The sign of a circle (cycle, circuit) is the product of the signs of its edges. Most of the essential properties of a signed graph depend on the signs of its circles.…

A planar portrait of a manifold is the pair of the image and the critical values of the manifold through a stable map into the plane. It can be considerd a geometric representation of the manifold drawn in the plane. The cusped fan is its…

The isotropic matroid $M[IAS(G)]$ of a looped simple graph $G$ is a binary matroid equivalent to the isotropic system of $G$. In general, $M[IAS(G)]$ is not regular, so it cannot be represented over fields of characteristic $\neq 2$. The…

In a ferromagnetic Ising system, domain pattern formation, i.e., phase-ordering, occurs after a sudden quench. We propose the method to simulate the pattern formation dynamics by an Ising machine. We demonstrate that the method reproduces…

Using the strong disorder renormalization group method we study numerically the critical behavior of the random transverse Ising model at a free surface, at a corner and at an edge in D=2, 3 and 4-dimensional lattices. The surface…

A projective rectangle is like a projective plane that may have different lengths in two directions. We develop properties of the graph of lines, in which adjacency means having a common point, especially its strong regularity and clique…

In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some…

Ortho-Radial drawings are a generalization of orthogonal drawings to grids that are formed by concentric circles and straight-line spokes emanating from the circles' center. Such drawings have applications in schematic graph layouts, e.g.,…

In [17], the authors have defined an annealed Ising model on random graphs and proved limit theorems for the magnetization of this model on some random graphs including random 2-regular graphs. Then in [11], we generalized their results to…

A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…

Visibility graphs are spatial interpretations of time series. When derived from the time evolution of physical systems, the graphs associated with such series may exhibit properties that can reflect aspects such as ergodicity, criticality,…

A corner in a map is an edge-vertex-edge triple consisting of two distinct edges incident to the same vertex. A corneration is a set of corners that covers every arc of the map exactly once. Cornerations in a dart-transitive map generalize…

An orientation-preserving branched covering map $f\colon S^2 \to S^2$ is called a critically fixed Thurston map if $f$ fixes each of its critical points. It was recently shown that there is an explicit one-to-one correspondence between…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

The critical behavior of a family of fully connected mean-field models with quenched disorder, the $M-p$ Ising spin glass, is analyzed, displaying a crossover between a continuous and a random first order phase transition as a control…