Combinatorics: Distributing Identical Walls into Multiple Boxes with Constraints

  • Context: Undergrad 
  • Thread starter Thread starter saint_n
  • Start date Start date
  • Tags Tags
    Combinatorics
Click For Summary

Discussion Overview

The discussion revolves around combinatorial methods for distributing 27 identical walls into 7 boxes, with the constraint that the first box can hold at most 9 walls. Participants explore generating functions and counting methods, while also addressing related examples and seeking clarification on combinatorial principles.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant requests a step-by-step method for finding the number of distributions of walls into boxes, indicating a lack of clarity on the topic.
  • Another participant suggests starting with simpler examples to understand the counting process, emphasizing that the solution does not require a clever trick but rather straightforward counting.
  • A different participant proposes a conceptual approach by visualizing walls and balls in a linear arrangement, questioning how this relates to distributing into boxes.
  • One participant shares a related example from their notes involving a generating function for distributing objects with constraints, expressing confusion about how to apply a similar method to their original question.
  • Another participant explains the concept of generating functions and their utility in combinatorial problems, highlighting the importance of coefficients in polynomial expansions.
  • A participant seeks recommendations for combinatorics books due to insufficient explanations in their current notes.

Areas of Agreement / Disagreement

Participants express varying levels of understanding and approaches to the problem, with no consensus on a single method or solution. Some advocate for direct counting, while others explore generating functions, indicating multiple competing views on how to tackle the problem.

Contextual Notes

The discussion includes references to specific constraints and examples that may not be fully resolved, such as the application of generating functions and the interpretation of counting methods. There is also mention of potential confusion regarding the representation of combinatorial problems.

Who May Find This Useful

This discussion may be useful for students or individuals interested in combinatorial mathematics, particularly those seeking to understand generating functions and counting techniques in constrained distributions.

saint_n
Messages
31
Reaction score
0
i need help with combinatorics...i need to finda ogf to compute the how many ways can 27 identical walls be distributed into 7 boxes, where the first box can contain at most 9 balls

How do this??can you give me a method or explain to me how to do this step by step PLEASE!

sAint
 
Physics news on Phys.org
i think you ought to at least start trying to count the ways of doing this yourself. because that's all you're doing. there is no clever trick necessary, just count them, how many can you put in the first one, how many in the second, and so on. do you count putting no balls in a box as being permissible. think about smaller examples first, say 3 boxes 6 balls, no more than two in the first, or even smaller than that so you get the idea.

just to reiterate, the solution is to just count the ways, and that's something you can do if you don't presume it's beyond your capabilities.
 
Imagine the balls were laid out in a straight line. What happens when you insert a wall at some point between 2 of the balls ? Is this at all like putting the balls into boxes ? How many walls do you need, to simulate 2 boxes, or 3, or 4, ...or n ? How many ways are there of inserting these walls ?
 
Sorrie haven't replied for a while been kinda busy and sorrie again i thought there was a method because in our notes(which doesn't really help much) he has an example
Suppose choose 25 objects from 7 types of objects s.t. every type of object appears at least twice and at most 6 times..
he wrote some formula
[x^25](x^2 + x^3 +x^4 +x^5 +x^6)^7

so i thought x^25 is the 25 objects and the exponents 2 to 6 is the "at least twice and at most 6 times" and ^7 is the seven types of objects then he did some calculations which i understand and he got 6055.

I just got confused when the question i asked you before because i didnt know how to represent the way he did but I am not sure since you were helping me out could my answer for the prev. question be
[x^27](1 + x + x^2 + ... + x^9)(1 + x + .. + x^27)^6

am i on the rite track?
 
Last edited:
btw can you recommend a combinatorics book because he's notes help only a lil plus sometimes he doesn't explain himself properly(by the way we don't have a prescribed textbook) so anything we would be appreciated...
 
what you have written there as a polynomial is called a generating function, these are very useful and powerful tools. what is important is the coefficients of the powers of x.

For instance, fix n, then the number of ways of choosing r objects from n (order unimportant) is the coefficient of x^r in the expansion of (1+x)^n
 
ok,,so what i have now is correct?Just so i can get started...
 

Similar threads

  • · Replies 29 ·
Replies
29
Views
5K
  • · Replies 22 ·
Replies
22
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
Replies
23
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 15 ·
Replies
15
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K