TOPICS
Search

Search Results for ""


1701 - 1710 of 13134 for Extremal graph theorySearch Results
A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...
Let p={a_1,a_2,...,a_n} be a permutation. Then i is a permutation ascent if a_i<a_(i+1). For example, the permutation {1,2,3,4} is composed of three ascents, namely {1,2}, ...
The index of a permutation p is defined as the sum of all subscripts j such that p_j>p_(j+1), for 1<=j<=n. MacMahon (1960) proved that the number of permutations of size n ...
The principal value of an analytic multivalued function is the single value chosen by convention to be returned for a given argument. Complex multivalued functions have ...
A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...
Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.
Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...
Given a set of n men and n women, marry them off in pairs after each man has ranked the women in order of preference from 1 to n, {w_1,...,w_n} and each women has done ...
Stadium billiards refers to the investigation of the path of a billiard ball on a stadium-shaped billiard table, as first investigated by Bunimovich (1974).
A string of length n on an alphabet l of m characters is an arrangement of n not necessarily distinct symbols from l. There are m^n such distinct strings. For example, the ...
1 ... 168|169|170|171|172|173|174 ... 1314 Previous Next

...