Search Results for ""
41 - 50 of 253 for Branch CutSearch Results
A cusp is a point at which two branches of a curve meet such that the tangents of each branch are equal. The above plot shows the semicubical parabola curve x^3-y^2=0, which ...
Elementary methods consist of arithmetic, geometry, and high school algebra. These are the only tools that may be used in the branch of number theory known as elementary ...
A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...
If there is a (nu,nu^') correspondence between two curves of curve genus p and p^' and the number of branch points properly counted are beta and beta^', then ...
Enclose a sphere in a cylinder and cut out a spherical segment by slicing twice perpendicularly to the cylinder's axis. Then the lateral surface area of the spherical segment ...
A graph G that becomes disconnected when removing a suitable complete subgraph K, called a vertex cut, is said to be quasiseparable. The two simplest cases are those where K ...
Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...
A game is defined as a conflict involving gains and losses between two or more opponents who follow formal rules. The study of games belongs to a branch of mathematics known ...
A Riemann surface is a surface-like configuration that covers the complex plane with several, and in general infinitely many, "sheets." These sheets can have very complicated ...
A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...
...
View search results from all Wolfram sites (11304 matches)

