Search Results for ""

The breaking up of self-intersecting polygons into simple polygons (illustrated above) is also called tessellation (Woo et al. 1999).

In discrete percolation theory, site percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice vertices ...

The ABC (atom-bond connectivity) index of a graph is defined as half the sum of the matrix elements of its ABC matrix. It was introduced by Estrada et al. (2017) to model the ...

Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...

The metric ds^2=(dx^2+dy^2)/((1-x^2-y^2)^2) for the Poincaré hyperbolic disk, which is a model for hyperbolic geometry. The hyperbolic metric is invariant under conformal ...

An automorphism is an isomorphism of a system of objects onto itself. The term derives from the Greek prefix alphaupsilontauomicron (auto) "self" and ...

Percolation theory deals with fluid flow (or any other similar process) in random media. If the medium is a set of regular lattice points, then there are two main types of ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

A self-adjoint elliptic differential operator defined somewhat technically as Delta=ddelta+deltad, where d is the exterior derivative and d and delta are adjoint to each ...

D^*Dpsi=del ^*del psi+1/4Rpsi-1/2F_L^+(psi), where D is the Dirac operator D:Gamma(W^+)->Gamma(W^-), del is the covariant derivative on spinors, R is the scalar curvature, ...