Search Results for ""

A geodesic mapping f:M->N between two Riemannian manifolds is a diffeomorphism sending geodesics of M into geodesics of N, whose inverse also sends geodesics to geodesics ...

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

An approach for the calculation of a Gröbner basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of inequalities.

A dozen dozen, or the square number 144.

The problem of deciding if four colors are sufficient to color any map on a plane or sphere.

Let A=a_(ik) be an arbitrary n×n nonsingular matrix with real elements and determinant |A|, then |A|^2<=product_(i=1)^n(sum_(k=1)^na_(ik)^2).

The half-altitude circle is the circumcircle of the half-altitude triangle. The circle function is given by l=(f(a,b,c))/(128a^2b^3c^3cosAcosBcosC), (1) where (2) which is ...

An interval in which one endpoint is included but not the other. A half-closed interval is denoted [a,b) or (a,b] and is also called a half-open interval. The non-standard ...

Let F be a finite field with q elements, and let F_s be a field containing F such that [F_s:F]=s. Let chi be a nontrivial multiplicative character of F and chi^'=chi ...