Solving Coverage with Sets: Min Info Needed?

  • Thread starter axelmorack
  • Start date
  • Tags
    Sets
In summary, the conversation revolves around a question about sets and covering a floor with weird shaped flat objects. The only information given is that the overlap between any two objects is at a minimum possible. The topic of tilings and tessellations is suggested as a possible solution, with a mention of an interesting historical discovery by an amateur mathematician. The conversation also touches on the possibility of using covering theorems, but notes that without symmetry or regularity in the shapes, there may not be a quick solution. Overall, there is not enough information provided to come to any definitive conclusions.
  • #1
axelmorack
10
0
A question about sets??

I have a number of weird shaped flat objects. I am interested in covering as much of the floor as I can. After placing the objects on the floor, the only info I have is:

Choosing any two objects on the floor, the overlap between them is at a minimum possible.

What can I say about the coverage? Do I have too little information to say anything?
 
Mathematics news on Phys.org
  • #2


Too little info, but the general subjects you're interested in are tilings and tesselations.

http://en.wikipedia.org/wiki/Tessellation

http://en.wikipedia.org/wiki/Tiling_by_regular_polygons

An interesting historical aside is the discovery of new classes of tesselations in the 70's by an amateur mathematician, a housewife with a high school education. Her name is Marjorie Rice. She read a Scientific American article on tesselations and started working with them in her spare time. She'd work out her formulas on her kitchen counter and cover up her work whenever anyone came into the kitchen.

She eventually developed her own system of notation, sent her results off to the local university, and was recognized for having made brand new mathematical discoveries.

http://en.wikipedia.org/wiki/Marjorie_Rice

Her website is here.

http://tessellations.home.comcast.net/~tessellations/

You didn't mention if your flat objects are all the same shape or not. That's going to make a huge difference in being able to solve the problem.
 
Last edited by a moderator:
  • #3
Last edited:
  • #4


Perhaps you are interested in covering theorems? You may start with the 5-r covering theorem (it's one of the most basic and easier to understand), then maybe the Vitali or Besicovitch covering theorem, though they get very technical.

Though your phrasing makes me think that you have some kind of optimization in mind, in which case if there isn't any symmetry or regularity in your shapes, then there wouldn't be a quick solution.
 
  • #5


I would first clarify what is meant by "coverage" in this context. Is it the total area covered by the objects on the floor, or the percentage of the floor that is covered? Once that is established, I would suggest using mathematical modeling and set theory to solve this problem. By representing the objects as sets and using concepts such as intersection and union, we can determine the exact coverage of the floor. Additionally, we can explore different arrangements and combinations of the objects to optimize the coverage. Therefore, I would say that with the information provided, we can make meaningful conclusions about the coverage, but further analysis and experimentation may be needed to find the optimal solution.
 

FAQ: Solving Coverage with Sets: Min Info Needed?

What is "Solving Coverage with Sets: Min Info Needed?"

"Solving Coverage with Sets: Min Info Needed" is a mathematical problem that involves finding the minimum number of sets needed to cover a given set of elements. It is commonly used in computer science, operations research, and other fields to optimize resource allocation and decision making.

How is "Solving Coverage with Sets: Min Info Needed" used in real-world applications?

"Solving Coverage with Sets: Min Info Needed" has many real-world applications, such as optimizing network routing, scheduling tasks, and designing experiments. It is also used in data mining, machine learning, and data compression algorithms.

What is the difference between "Solving Coverage with Sets: Min Info Needed" and other set covering problems?

"Solving Coverage with Sets: Min Info Needed" is a specific type of set covering problem that focuses on finding the minimum number of sets needed to cover a given set of elements. Other set covering problems may have different objectives, such as maximizing coverage or minimizing overlap between sets.

What are the key principles behind "Solving Coverage with Sets: Min Info Needed"?

The key principles behind "Solving Coverage with Sets: Min Info Needed" include understanding the concept of set coverage, identifying the minimum number of sets needed to cover a given set, and using algorithms and mathematical techniques to find an optimal solution.

What are some common algorithms used for "Solving Coverage with Sets: Min Info Needed"?

Some common algorithms used for "Solving Coverage with Sets: Min Info Needed" include the greedy algorithm, the branch and bound method, and integer programming techniques. Other heuristic and metaheuristic algorithms may also be used depending on the specific problem and constraints.

Similar threads

Back
Top