Search Results for ""
811 - 820 of 1350 for Monomial orderSearch Results
An out-shuffle, also known as a perfect shuffle (Golomb 1961), is a riffle shuffle in which the top half of the deck is placed in the right hand, and cards are then ...
The polylogarithm Li_n(z), also known as the Jonquière's function, is the function Li_n(z)=sum_(k=1)^infty(z^k)/(k^n) (1) defined in the complex plane over the open unit ...
A graph G is distance transitive if its automorphism group is transitive on pairs of vertices at each pairwise distance in the graph. Distance-transitivity is a ...
Let P be a finite partially ordered set, then an antichain in P is a set of pairwise incomparable elements. Antichains are also called Sperner systems in older literature ...
The terms of equational logic are built up from variables and constants using function symbols (or operations). Identities (equalities) of the form s=t, (1) where s and t are ...
There are a number of mathematical curves that produced heart shapes, some of which are illustrated above. A "zeroth" curve is a rotated cardioid (whose name means ...
An irreducible representation of a group is a group representation that has no nontrivial invariant subspaces. For example, the orthogonal group O(n) has an irreducible ...
A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...
A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...
The word quantile has no fewer than two distinct meanings in probability. Specific elements x in the range of a variate X are called quantiles, and denoted x (Evans et al. ...
...
View search results from all Wolfram sites (23006 matches)

