TOPICS
Search

Search Results for ""


9101 - 9110 of 13135 for Finite GeometrySearch Results
Let Q(x) be a real or complex piecewise-continuous function defined for all values of the real variable x and that is periodic with minimum period pi so that Q(x+pi)=Q(x). ...
Also called the Tait flyping conjecture. Given two reduced alternating projections of the same knot, they are equivalent on the sphere iff they are related by a series of ...
A problem listed in a fall issue of Gazeta Matematică in the mid-1970s posed the question if x_1>0 and x_(n+1)=(1+1/(x_n))^n (1) for n=1, 2, ..., then are there any values ...
Let f:R×R->R be a one-parameter family of C^2 map satisfying f(0,0)=0 [(partialf)/(partialx)]_(mu=0,x=0)=0 [(partial^2f)/(partialx^2)]_(mu=0,x=0)>0 ...
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 ...
Let M^n be an n-manifold and let F={F_alpha} denote a partition of M^n into disjoint pathwise-connected subsets. Then F is called a foliation of M^n of codimension c (with ...
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 ...
A technique in set theory invented by P. Cohen (1963, 1964, 1966) and used to prove that the axiom of choice and continuum hypothesis are independent of one another in ...
1 ... 908|909|910|911|912|913|914 ... 1314 Previous Next

...