Search Results for ""
1331 - 1340 of 3570 for Matrix Tree TheoremSearch Results
A quartic surface which is the locus of zeros of the determinant of a symmetric 4×4 matrix of linear forms. A general symmetroid has 10 ordinary double points (Jessop 1916, ...
The third Brocard triangle is Gibert's term for the isogonal conjugate of the first Brocard triangle. It has trilinear vertex matrix [b^2c^2 ab^3 ac^3; a^3b a^2c^2 bc^3; a^3c ...
The theorem in set theory and logic that for all sets A and B, B=(A intersection B^_) union (B intersection A^_)<=>A=emptyset, (1) where A^_ denotes complement set of A and ...
A "pointwise-bounded" family of continuous linear operators from a Banach space to a normed space is "uniformly bounded." Symbolically, if sup||T_i(x)|| is finite for each x ...
For every positive integer n, there exists a circle which contains exactly n lattice points in its interior. H. Steinhaus proved that for every positive integer n, there ...
Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...
Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...
Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...
Given a factor a of a number n=ab, the cofactor of a is b=n/a. A different type of cofactor, sometimes called a cofactor matrix, is a signed version of a minor M_(ij) defined ...
A square-free graph is a graph containing no graph cycles of length four. A simple graph is square-free iff c_4=1/8[Tr(A^4)-2m-2sum_(i!=j)a_(ij)^((2))]=0, where A is the ...
...
View search results from all Wolfram sites (23765 matches)

