Search Results for ""
1121 - 1130 of 13135 for Combinatorial MathematicsSearch Results
The problem of determining (or counting) the set of all solutions to a given problem.
An agreement in which all parties feel as if they have received the best deal.
A morphism f:Y->X in a category is an epimorphism if, for any two morphisms u,v:X->Z, uf=vf implies u=v. In the categories of sets, groups, modules, etc., an epimorphism is ...
The conjecture that Frey's elliptic curve was not modular. The conjecture was quickly proved by Ribet (Ribet's theorem) in 1986, and was an important step in the proof of ...
There are two similar but distinct concepts related to equidecomposability: "equidecomposable" and "equidecomposable by dissection." The difference is in that the pieces ...
A curve in two dimensions on which the value of a function f(x,y) is a constant. Other synonymous terms are isarithm, isopleth, and contour line. A plot of several ...
Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...
An endomorphism is called ergodic if it is true that T^(-1)A=A implies m(A)=0 or 1, where T^(-1)A={x in X:T(x) in A}. Examples of ergodic endomorphisms include the map X->2x ...
The paradox "This statement is false," stated in the fourth century BC. It is a sharper version of the Epimenides paradox, "All Cretans are liars...One of their own poets has ...
An array of "trees" of unit height located at integer-coordinate points in a point lattice. When viewed from a corner along the line y=x in normal perspective, a quadrant of ...
...
View search results from all Wolfram sites (60124 matches)

