A Game of "Society"

Here I have attached a document presenting my solution to the following problem, which was asked in  IISc  Bangalore’s  2020  Pravega  event  :  "Gaussian Gambit". Specifically, the last  question  of  Problem Set 1  : 

"A group  of  n  students  in  a  classroom are playing  a game of  ‘Society’.  Each student has  some friends  (possibly  none), and  friendship  is  mutual.  Every student begins  with  an  integral  amount of  dollars  (possibly  negative). A  move consists  of  some student giving  $1  to each  of  their  friends.  We say  that the game is  fair  if  it is  possible to  transform  the original  distribution  of  money  into any  other  arbitrary  one with  the same amount of  total  money  using  some finite sequence of  moves. Given  that  the game  is  fair, find  the number  of friendships  among  the students."

I have constructed my solution from the ground up, without directly using any results from Graph theory or Group theory. I have come to learn that this can be solved using a result of graph theory known as the Matrix Tree Theorem 

https://documentcloud.adobe.com/link/review?uri=urn:aaid:scds:US:c53f5893-cd69-416c-8ea3-97a5c3a2cdb8 

Comments

Popular posts from this blog

The Incentre of a Tetrahedron

The MUB Project

QM Notes (Shankar)