Los 10 principales competidores de math.mit.edu

math.stackexchange.com

Q&A for people studying math at any level and professionals in related fields

mathoverflow.net

Q&A for professional mathematicians

math.libretexts.org

The LibreTexts libraries collectively are a multi-institutional collaborative venture to develop the next generation of open-access texts to improve postsecondary education.

arxiv.org

A system of non-tradable credits that flow between individuals like karma, hence proposed under that name, is a mechanism for repeated resource allocation that comes with attractive efficiency and fairness properties, in theory. In this study, we test karma in an online experiment in which human subjects repeatedly compete for a resource with time-varying and stochastic individual preferences or urgency to acquire the resource. We confirm that karma has significant and sustained welfare benefits even in a population with no prior training. We identify mechanism usage in contexts with sporadic high urgency, more so than with frequent moderate urgency, and implemented as an easy (binary) karma bidding scheme as particularly effective for welfare improvements: relatively larger aggregate efficiency gains are realized that are (almost) Pareto superior. These findings provide guidance for further testing and for future implementation plans of such mechanisms in the real world.

artofproblemsolving.com

Find the right math competition for your student by grade level and cost — from Math Kangaroo through the IMO — plus recommended books, training, and practice resources.

mathworld.wolfram.com

A connected graph G is distance-regular if for any vertices x and y of G and any integers i,j=0, 1, ...d (where d is the graph diameter), the number of vertices at distance i from x and distance j from y depends only on i, j, and the graph distance between x and y, independently of the choice of x and y. In particular, a distance-regular graph is a graph for which there exist integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G and distance i=d(x,y), there are exactly c_i...

math.uchicago.edu

the department of mathematics at the university of chicago

ams.org

Advancing research. Creating connections.