TITLE

partitioning

PUB. DATE
January 2005
SOURCE
Hutchinson Dictionary of Scientific Biography;2005, p1
SOURCE TYPE
Biography
DOC. TYPE
Other
ABSTRACT
Of an integer in number theory, breaking the integer down into its constituent parts in as many ways as possible; for example, the number 6 can be partitioned in three ways: 5 + 1, 4 + 2, and 3 + 3. Each of these contributory numbers is known as a summand.
ACCESSION #
19932221

 

Related Articles

  • MacMahon's Partition Analysis: II Fundamental Theorems. Andrews, George E. // Annals of Combinatorics;2000, Vol. 4 Issue 3/4, p327 

    Provides information on a study which proposed MacMahon's Partition Analysis as a tool to provide an alternative proof of the Lecture Hall Partition Theorem. Background on MacMahon's Partition Analysis; Discussion on partitions with higher order difference conditions; Details on partitions with...

  • Efficient Partition of N-Dimensional Intervals in the Framework of One-Point-Based Algorithms. Sergeyev, Ya. D. // Journal of Optimization Theory & Applications;Feb2005, Vol. 124 Issue 2, p503 

    In this paper, the problem of the minimal description of the structure of a vector function f(x) over an N-dimensional interval is studied. Methods adaptively subdividing the original interval in smaller subintervals and evaluating f(x) at only one point within each subinterval are considered....

  • A quick spreadsheet to find partitions. Robin, Anthony C. // Mathematics in School;Sep2004, Vol. 33 Issue 4, p6 

    Offers a solution to finding partitions using a spreadsheet. Example illustrating the concept behind the solution; Applications of the solution.

  • Solving a continuous nonlinear problem of optimal set partition with arrangement of subset centers in the case of a convex objective functional. E. Kiselyova; M. Dunaichuk // Cybernetics & Systems Analysis;Mar2008, Vol. 44 Issue 2, p261 

    Abstract  A continuous nonlinear single-commodity problem of optimal partition of a set Ω in an n-measurable Euclidean space into disjoint subsets with arrangement of their centers is analyzed using equality and inequality constraints in the case of a convex objective functional. A...

  • PARTITIONING A CIRCULAR REGION. Ayoub, Ayoub B. // Mathematics & Computer Education;Fall2004, Vol. 38 Issue 3, p321 

    Discusses two special partitions of a circular region. Interpretation of the emerging pattern; Rule for deriving the correct number of regions; Types of vertices in the network formed by the n points chosen on the circle and the chords joining these points.

  • DETERMINATION OF LARGE FAMILIES AND DIAMETER OF EQUISEPARABLE TREES. Stanić, Zoran // Publications de l'Institut Mathematique;2006, Issue 93, p29 

    We consider the problem of determining all the members of an arbitrary family of equiseparable trees. We introduce the concept of saturation (based on the number partitions). After that, we use the same concept to obtain the least upper bound for the difference in the diameters of two...

  • On the distribution of the summands of partitions in residue classes. Dartyge, C.; S�rk�zy, A.; Szalay, M. // Acta Mathematica Hungarica;Nov2005, Vol. 109 Issue 3, p215 

    It is proved that the summands of almost all partitions of nare well-distributed modulo dfor dup to d= n 1/2-e.

  • Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques. Steinley, Douglas; Brusco, Michael J. // Journal of Classification;2007, Vol. 24 Issue 1, p99 

    K-means clustering is arguably the most popular technique for partitioning data. Unfortunately, K-means suffers from the well-known problem of locally optimal solutions. Furthermore, the final partition is dependent upon the initial configuration, making the choice of starting partitions all the...

  • Arithmetic Properties of Overpartitions into Odd Parts. Hirschhorn, Michael D.; Sellers, James A. // Annals of Combinatorics;2006, Vol. 10 Issue 3, p353 

    In this article, we consider various arithmetic properties of the function $$ \overline{{p_{o} }} (n) $$ which denotes the number of overpartitions of n using only odd parts. This function has arisen in a number of recent papers, but in contexts which are very different from overpartitions. We...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics