}?>
By Joining you agree to MachPrinciple's Terms and Conditions and Privacy Policy
Click to Login
Please check your email. A registration confirmation link will be sent to your mailbox..
A registration confirmation link has been sent to your email. Please check your email and finish the registration process.
Search a Conference through our dedicated search page
Many theorems in discrete geometry may be interpreted as relatives or combinatorial analogues of results on concentration of maps and measures. Configuration spaces of mixed combinatorial/geometric nature, such as arrangements of points, lines, convex polytopes, decorated trees, graphs, and partitions, often arise via the Configuration Space/Test Maps scheme, as spaces parameterizing feasible candidates for the solution of a problem in discrete geometry. One of the basic ideas is to link the key questions of social sciences dealing with fair allocations, such as the existence of certain Nash equilibria, equipartitions, or balanced configurations, with the existence of partitions of point sets satisfying some geometric constraints. In both contexts, combinatorial and geometric aspects of Fourier analysis on finite groups arise naturally.