TOPICS
Search

Search Results for ""


2721 - 2730 of 2903 for Minimum Total Dominating SetSearch Results
In general, a singularity is a point at which an equation, surface, etc., blows up or becomes degenerate. Singularities are often also called singular points. Singularities ...
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 ...
A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...
There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...
For every even dimension 2n, the symplectic group Sp(2n) is the group of 2n×2n matrices which preserve a nondegenerate antisymmetric bilinear form omega, i.e., a symplectic ...
For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...
The ten-of-diamonds decahedron is a stereohedron and space-filling polyhedron on 8 vertices, 16 edges, and 10 faces (8 of which are non-equilateral triangles and two of which ...
The number of colors sufficient for map coloring on a surface of genus g is given by the Heawood conjecture, chi(g)=|_1/2(7+sqrt(48g+1))_|, where |_x_| is the floor function. ...
A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...
Voronin (1975) proved the remarkable analytical property of the Riemann zeta function zeta(s) that, roughly speaking, any nonvanishing analytic function can be approximated ...
1 ... 270|271|272|273|274|275|276 ... 291 Previous Next

...