Mathematica Information Center

SIMPLE SEARCH

Search       for
Advanced Search»
1 - 10 of 59 for inequalities Search Results
Solving inequalities is a very important topic in computational algebra. In fact, the most important computer algebra systems include sophisticated tools for solving ...
Graphing Translations and ...   (Courseware and Class Materials)
In this lesson, the student will learn about the following: Graphing Inequalities Horizontal and Vertical Translations Stretching
Using Assumptions and Solving ...   (Conference Proceedings)
The next version of Mathematica allows specifying assumptions in Simplify and related functions. The underlying mechanism used automatically to check inference of inequality ...
Boole-Bell-Type inequalities in ...   (MathSource: Packages and Programs)
The violation of Bell-type inequalities by the quantum probabilities represents an important aspect of quantum mechanics which is linked to the mind-boggling quantum features ...
Boole-Bell-type inequalities in ...   (Conference Proceedings)
The violation of Bell-type inequalities by quantum probabilities represents an important aspect of quantum mechanics which is linked to the mind-boggling quantum features of ...
New Inequality Graphics (in 2D)   (MathSource: Packages and Programs)
This package incorporates some commands that allows to obtain the inequalities graph in two dimensions. The inequalities can be of the polynomial, trigonometrical, ...
This paper presents a theory of noncommutative functions which results in an algorithm for determining where they are "matrix convex". Of independent interest is a theory of ...
Chebyshev's Inequality: Describing ...   (Courseware and Class Materials)
Students will be able to apply Chebyshev's Inequality to determine the lower bounds for several key values of k and determine the minimum percentage of data elements that lie ...
Classical Pitowsky correlation polytopes are reviewed with particular emphasis on the Minkowski-Weyl representation theorem. The inequalities representing the faces of ...
Let G be a simple undirected graph on n vertices and let S(G) be the class of real symmetric n × n matrices whose nonzero off-diagonal entries correspond exactly to the ...
1 234 ... 6  Next