TOPICS
Search

Search Results for ""


351 - 360 of 455 for symmetricSearch Results
Fuglede (1974) conjectured that a domain Omega admits an operator spectrum iff it is possible to tile R^d by a family of translates of Omega. Fuglede proved the conjecture in ...
A generalized hexagon is a generalized polygon of order 6. GH(1,2) is more commonly known as the Heawood graph, but is also the (3,6)-cage graph, the cubic vertex-transitive ...
A generalized octagon GO(n,k) is a generalized polygon of order 8. GO(1,2) is the (3,8)-cage graph, the incidence graph of the Cremona-Richmond configuration, the cubic ...
The unique (modulo rotations) scalene triangle formed from three vertices of a regular heptagon, having vertex angles pi/7, 2pi/7, and 4pi/7. There are a number of amazing ...
A graph G is a hypotraceable graph if G has no Hamiltonian path (i.e., it is not a traceable graph), but G-v has a Hamiltonian path (i.e., is a traceable graph) for every v ...
An irreducible representation of a group is a group representation that has no nontrivial invariant subspaces. For example, the orthogonal group O(n) has an irreducible ...
The Jacobi method is a method of solving a matrix equation on a matrix that has no zeros along its main diagonal (Bronshtein and Semendyayev 1997, p. 892). Each diagonal ...
The Jacobi polynomials, also known as hypergeometric polynomials, occur in the study of rotation groups and in the solution to the equations of motion of the symmetric top. ...
The Laplacian matrix, sometimes also called the admittance matrix (Cvetković et al. 1998, Babić et al. 2002) or Kirchhoff matrix, of a graph G, where G=(V,E) is an ...
A group whose group operation is identified with multiplication. As with normal multiplication, the multiplication operation on group elements is either denoted by a raised ...
1 ... 33|34|35|36|37|38|39 ... 46 Previous Next

...