TOPICS
Search

Search Results for ""


11431 - 11440 of 13135 for Finite GeometrySearch Results
Given a square n×n nonsingular integer matrix A, there exists an n×n unimodular matrix U and an n×n matrix H (known as the Hermite normal form of A) such that AU=H. ...
A square matrix is called Hermitian if it is self-adjoint. Therefore, a Hermitian matrix A=(a_(ij)) is defined as one for which A=A^(H), (1) where A^(H) denotes the conjugate ...
A natural extension of the Riemann p-differential equation given by (d^2w)/(dx^2)+(gamma/x+delta/(x-1)+epsilon/(x-a))(dw)/(dx)+(alphabetax-q)/(x(x-1)(x-a))w=0 where ...
The base 16 notational system for representing real numbers. The digits used to represent numbers using hexadecimal notation are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, ...
A polygonal number and 6-polygonal number of the form n(2n-1). The first few are 1, 6, 15, 28, 45, ... (OEIS A000384). The generating function for the hexagonal numbers is ...
Given a sequence of values {a_k}_(k=1)^n, the high-water marks are the values at which the running maximum increases. For example, given a sequence (3,5,7,8,8,5,7,9,2,5) with ...
A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...
The notion of a Hilbert C^*-module is a generalization of the notion of a Hilbert space. The first use of such objects was made by Kaplansky (1953). The research on Hilbert ...
The Hochberg-O'Donnell fish graph is the unit-distance graph on 23 nodes and 42 edges illustrated above. It is triangle-free and is the smallest example of a unit-distance ...
The prime HP(n) reached starting from a number n, concatenating its prime factors, and repeating until a prime is reached. For example, for n=9, 9=3·3->33=3·11->311, so 311 ...

...