相关论文: Cross Ratios of Quadrilateral Linkages

In this paper the problem of finding a normal form of triangles and plane quadrilaterals up to similarity is considered. Several normal forms for triangles and a normal form for quadrilaterals of special case are described. Normal forms of…

Structural properties of large random maps and lambda-terms may be gleaned by studying the limit distributions of various parameters of interest. In our work we focus on restricted classes of maps and their counterparts in the…

Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…

The paper presents a new cross-ratio of hypercomplex numbers based on projective geometry. We discuss the essential properties of the projective cross-ratio, notably its invariance under Mobius transformations. Applications to the geometry…

We analyze correlation functions in a toy model of a random geometry interacting with matter. We show that in general the connected correlator will contain a long-range scaling part which is in some sense a remnant of the disconnected part.…

It is known that the vertex connectivity of a planar graph can be computed in linear time. We extend this result to the class of locally maximal 1-plane graphs: graphs that have an embedding with at most one crossing per edge such that the…

In this paper, we consider a special kind of overconstrained 6R closed linkages which we call angle-symmetric 6R linkages. These are linkages with the property that the rotation angles are equal for each of the three pairs of opposite…

Multivariate spatial phenomena are ubiquitous, spanning domains such as climate, pandemics, air quality, and social economy. Cross-correlation between different quantities of interest at different locations is asymmetric in general. This…

We introduce the triple crossing number, a variation of crossing number, of a graph, which is the minimal number of crossing points in all drawings with only triple crossings of the graph. It is defined to be zero for a planar graph, and to…

In this paper we present a systematic method to generate prime knot and prime link minimal triple-point projections, and then classify all classical prime knots and prime links with triple-crossing number at most four. We also extend the…

We prove a number of double-sided estimates relating discrete counterparts of several classical conformal invariants of a quadrilateral: cross-ratios, extremal lengths and random walk partition functions. The results hold true for any…

We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…

We obtain a bound on the girth g of a quaternion unit gain graph in terms of the rank r of its adjacency matrix. In particular, we show that g <= r + 2 and characterize all quaternion unit gain graphs for which g = r+2. This extends…

The geometry of parallelizable manifolds (i.e., teleparallelism) is summarized in the language of local frame fields. Some problems in continuum mechanics that relate to the couple-stresses that are produced in the bending and twisting of…

The problem of mesh matching is addressed in this work. For a given n-sided planar region bounded by one loop of n polylines we are selecting optimal quadrilateral mesh from existing catalogue of meshes. The formulation of matching between…

In this short note, we investigate the effect of region crossing change on planar trivalent graphs.

We analyze the threshold network model in which a pair of vertices with random weights are connected by an edge when the summation of the weights exceeds a threshold. We prove some convergence theorems and central limit theorems on the…

For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-connected 1-planar graphs admit near-perfect matchings…

Consider a random geometric graph over a random point process in $\mathbb{R}^d$. Two points are connected by an edge if and only if their distance is bounded by a prescribed distance parameter. We show that projecting the graph onto a two…

Recent developments in machine-learning based molecular fragment linking have demonstrated the importance of informing the generation process with structural information specifying the relative orientation of the fragments to be linked.…