Search Results for ""
421 - 430 of 1642 for Equivalence problemSearch Results
An integer whose decimal digits contain no zeros is said to be zerofree. The first few positive zerofree integers are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, ...
Riemann's moduli space R_p is the space of analytic equivalence classes of Riemann surfaces of fixed genus p.
A simple unlabeled graph whose connectivity is considered purely on the basis of topological equivalence, so that two edges (v_1,v_2) and (v_2,v_3) joined by a node v_2 of ...
An equation is said to be a closed-form solution if it solves a given problem in terms of functions and mathematical operations from a given generally-accepted set. For ...
Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...
The Jacobian conjecture in the plane, first stated by Keller (1939), states that given a ring map F of C[x,y] (the polynomial ring in two variables over the complex numbers ...
The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...
The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...
The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...
Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) (1) is the multinomial coefficient ...
...
View search results from all Wolfram sites (163187 matches)

