Data Structures and Algorithms


Algebraic Generalization of Venn Diagram

Authors: Florentin Smarandache

It is easy to deal with a Venn Diagram for 1 ≤ n ≤ 3 sets. When n gets larger, the picture becomes more complicated, that's why we thought at the following codification. That's why we propose an easy and systematic algebraic way of dealing with the representation of intersections and unions of many sets.

Comments: 3 pages

Download: PDF

Submission history

[v1] 8 Mar 2010
[v2] 12 Apr 2010

Unique-IP document downloads: 303 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus