Search Results for ""
1091 - 1100 of 2903 for Minimum Total Dominating SetSearch Results
Eliminate each knot crossing by connecting each of the strands coming into the crossing to the adjacent strand leaving the crossing. The resulting strands no longer cross but ...
A spherical polyhedron is set of arcs on the surface of a sphere corresponding to the projections of the edges of a polyhedron. The images above illustrate the spherical ...
The structure factor S_Gamma of a discrete set Gamma is the Fourier transform of delta-scatterers of equal strengths on all points of Gamma, S_Gamma(k)=intsum_(x in ...
A submonoid is a subset of the elements of a monoid that are themselves a monoid under the same monoid operation. For example, consider the monoid formed by the nonnegative ...
One of a set of numbers defined in terms of an invariant generated by the finite cyclic covering spaces of a knot complement. The torsion numbers for knots up to 9 crossings ...
A set of n cells in an n×n square such that no two come from the same row and no two come from the same column. The number of transversals of an n×n square is n! (n ...
The span of subspace generated by vectors v_1 and v_2 in V is Span(v_1,v_2)={rv_1+sv_2:r,s in R}. A set of vectors m={v_1,...,v_n} can be tested to see if they span ...
Let f_n(z) be a sequence of functions, each regular in a region D, let |f_n(z)|<=M for every n and z in D, and let f_n(z) tend to a limit as n->infty at a set of points ...
A set of three conjectures proposed by Weil in 1942 for extending Riemann hypothesis-like statements to classes of mathematical structures. The conjectures were proved by ...
Two patterns T_1 and T_2 belong to the same Wilf class if |S_n(T_1)|=|S_n(T_2)| for all n, where S_n(T) denotes the set of permutations on {1,...,n} that avoid the pattern T. ...
...
View search results from all Wolfram sites (39588 matches)

