Search Results for ""
1041 - 1050 of 2399 for Set ClosureSearch Results
Let S be a semigroup and alpha a positive real-valued function on S such that alpha(st)<=alpha(s)alpha(t) (s,t in S). If l^1(S,alpha) is the set of all complex-valued ...
Two sextuples of skew lines on the general cubic surface such that each line of one is skew to one line in the other set. In all, there are 30 points, with two lines through ...
The term endomorphism derives from the Greek adverb endon ("inside") and morphosis ("to form" or "to shape"). In algebra, an endomorphism of a group, module, ring, vector ...
An equalizer of a pair of maps f,g:X->Y in a category is a map e:E->X such that 1. f degreese=g degreese, where degrees denotes composition. 2. For any other map e^':E^'->X ...
Is there a planar convex set having two distinct equichordal points? The problem was first proposed by Fujiwara (1916) and Blaschke et al. (1917), but long defied solution. ...
If a function f(x) is continuous on a closed interval [a,b], then f(x) has both a maximum and a minimum on [a,b]. If f(x) has an extremum on an open interval (a,b), then the ...
The determination of a set of factors (divisors) of a given integer ("prime factorization"), polynomial ("polynomial factorization"), etc., which, when multiplied together, ...
A graph with a finite number of nodes and edges. If it has n nodes and has no multiple edges or graph loops (i.e., it is simple), it is a subgraph of the complete graph K_n. ...
A formal power series, sometimes simply called a "formal series" (Wilf 1994), of a field F is an infinite sequence {a_0,a_1,a_2,...} over F. Equivalently, it is a function ...
Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...
...
View search results from all Wolfram sites (33217 matches)

