Search Results for ""
3881 - 3890 of 13134 for Donaldson theorySearch Results
The Sombor spectral radius rho_(Sombor) of a graph is defined as the largest eigenvalue of the Sombor matrix. Liu et al. (2022) shows that for any tree, ...
The sequence produced by sorting the digits of a number and adding them to the previous number. The values starting with n=1, 2, ... are 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...
The special orthogonal group SO_n(q) is the subgroup of the elements of general orthogonal group GO_n(q) with determinant 1. SO_3 (often written SO(3)) is the rotation group ...
Let A be an n×n matrix with complex or real elements with eigenvalues lambda_1, ..., lambda_n. Then the spectral radius rho(A) of A is rho(A)=max_(1<=i<=n)|lambda_i|, i.e., ...
A sphenic number is a positive integer n which is the product of exactly three distinct primes. The first few sphenic numbers are 30, 42, 66, 70, 78, 102, 105, 110, 114, ... ...
In particle physics, a spinor field of order 2s describes a particle of spin s, where s is an integer or half-integer. Therefore, a spinor of order 4s contains as much ...
A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...
The extension field K of a field F is called a splitting field for the polynomial f(x) in F[x] if f(x) factors completely into linear factors in K[x] and f(x) does not factor ...
Consider a star graph S_(n+1) consisting of a central hub vertex and n spokes, but instead of placing a single point at the end of each spoke, place k points along it (in ...
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 (24788 matches)

