|
Modify search criterions Results n° 1 to 8 of 44 matches
| Title |
Maximum of the transfer distance to a given partition |
| Author |
CHARON Irène, HUDRY Olivier, DENOEUD-BELGACEM Lucile |
| Keywords |
Distance, Partitions, Transferts |
| Topics |
Classification - Clustering - Partitioning, Combinatorics, Discrete Mathematics, Distances |
| Abstract |
In this paper, we study a distance defined over the partitions of a finite set. Given two partitions P and Q, this distance, called the transfer distance, is defined as the minimum number of transfers of an element from one class to another, required to transform P into Q or equivalently Q in P. We give some formulae for the maximum distance value between a given partition and any partition, then the maximum distance value between a given partition and a partition with an upper-bounded number of classes. |
| Number |
179, Fall 2007 |
| Language |
French | Read the article
| Title |
Orally transmitted mathematics |
| Author |
CHEMILLIER Marc |
| Keywords |
Asymmetric rhythms, Cognition, Divination, Ethnomathematics, Musical canon, Sand drawing |
| Topics |
Anthropology - Ethnology, Discrete Mathematics, Drawing, Music |
| Abstract |
Ethnomathematics is a new domain studying mathematical structures in particular activities of traditional societies. The main difficulty in this approach is to establish a link between formal structures, studied « in laboratory », and mental representations of native people, as they can be observed during fieldworks. We describe these difficulties in different situations: visual arts, music, divination. In the latter case, we present the results of fieldworks done in Madagascar where mathematical mental representations of native people have been discovered |
| Number |
178, Summer 2007, special issue: Art, mathematics, language and emotion |
| Language |
French | Read the article
| Title |
Invariant relations in a finite domain |
| Author |
BURIGANA Luigi |
| Keywords |
Boolean operation, Galois connection, Invariance, Lattice, Relation, Semigroup |
| Topics |
Algebra, Discrete Mathematics, Orders and preorders |
| Abstract |
Some results of an abstract inquiry into the concept of invariance are presented. The objects to be judged in their possible invariance are relations of arbitrary degrees in one single domain, when they are represented as sets of strings of elements in that domain. The domain itself is presumed to be a finite size, and the transformations with respect to which invariance is judged are injective functions between parts of it. The study focuses on correspondences between algebraic structures of possible relations and algebraic structures of possible transformations, as they are dually interrelated through the invariance condition. |
| Number |
169, Spring 2005 |
| Language |
English | Read the article
| Title |
Quasi-sets and approximations of r-ordered partitions |
| Author |
SERFATI Michel |
| Keywords |
None |
| Topics |
Approximation, Classification - Clustering - Partitioning, Discrete Mathematics, Distances, Lattices, Orders and preorders |
| Abstract |
From a mathematical viewpoint, the theory of r-ordered repartitions deals with some extension of the concept of "power set", by the mean of a complete distributive lattice. As to interpretaiton, one may consider each r-repartition as the exhaustive distribution of some character (or quality) to all the elements of some set ü, according to r viewpoints, the viewpoints forming a chain (linearly ordered set). This paper deals uniquely with the establishing of some distance d on the set pr(ü) of all the r-repartitions of ü, and also of the approximation of any given r-ordered partition P by the subsets of ü which are the nearest from P, according to the metric d. Any of these subsets may then be considered as convenient for replacing P, and one may interpret this replacement as the result of some terminal decision. |
| Number |
143, Fall 1998 |
| Language |
French | Read the article
Read the article
Read the article
Read the article
Document unavailable
Users rights :

The entire journal is licensed under a Creative Commons license
|