TOPICS
Search

Search Results for ""


3851 - 3860 of 13134 for binomial theorySearch Results
A folding function is a function that maps the integers Z={...,-3,-2,-1,0,1,2,3,...} onto the nonnegative integers Z^*={0,1,2,3,...}. This type of function arises naturally ...
A graph is a forbidden (vertex-)induced subgraph if its presence as a vertex-induced subgraph of a given graph means it is not a member of some family of graphs. For example, ...
A graph is a forbidden subgraph if its presence as a subgraph of a given graph means it is not a member of some family of graphs. For example, a bipartite graph is a graph ...
A graph is a forbidden topological minor (also known as a forbidden homeomorphic subgraph) if its presence as a homeomorphic subgraph of a given graph (i.e., there is an ...
The fourth group isomorphism theorem, also called the lattice group isomorphism theorem, lets G be a group and let N⊴G, where N⊴G indicates that N is a normal subgroup of G. ...
Let R be a ring, and let I be an ideal of R. The correspondence A<->A/I is an inclusion preserving bijection between the set of subrings A of R that contain I and the set of ...
The Fransén-Robinson constant F is defined by F=int_0^infty(dx)/(Gamma(x))=2.8077702420... (OEIS A058655) where Gamma(x) is the gamma function. No closed-form expression in ...
A function f is Fréchet differentiable at a if lim_(x->a)(f(x)-f(a))/(x-a) exists. This is equivalent to the statement that phi has a removable discontinuity at a, where ...
A free Abelian group is a group G with a subset which generates the group G with the only relation being ab=ba. That is, it has no group torsion. All such groups are a direct ...
A group action G×X->X is called free if, for all x in X, gx=x implies g=I (i.e., only the identity element fixes any x). In other words, G×X->X is free if the map G×X->X×X ...
1 ... 383|384|385|386|387|388|389 ... 1314 Previous Next

...