There are natural interactions between dimension theory, ergodic theory, additive combinatorics, metric number theory and analysis. Each of these fields provides different perspectives on, and complementary approaches to, the hierarchical structures which appear in fractal geometry.

The workshop will focus on recent advances at the interfaces of these fields, including:

• Classical fractals (self-similar and self-affine sets, random fractals)
• Dimension theory and additive combinatorics
• Diophantine approximation and equidistribution
• Schmidt games
• Rigidity phenomena
• Scenery flow methods
• Projection and slice theorems

Since its introduction by Felix Hausdorff in 1919, the concept of the Hausdorff dimension of sets and measures has been a versatile and powerful tool in classical analysis, geometry and geometric measure theory, mathematical physics and their numerous applications. However, there has been a particularly important symbiosis between dynamical systems and dimension theory. This connection arises both from application of dimension theory to the classification and geometric analysis of dynamical systems (and their invariant sets and measures), and the fact that many classical objects of study in mathematics arise from (sometimes implicit) dynamical systems, which often play a role in the dimension theory of said objects.

Recently, there has been substantial progress on a number of central problems in dimension theory, and while many old problems remain, many new ones have also presented themselves. These include a deeper understanding of the relationship between dimension, entropy and... (more)

This conference will revolve around several themes: the computational complexity of L-functions; statistical problems concerning L-functions, such as the distribution of their values, and zeros, moments of L-functions, statistics and size of ranks in families of elliptic curves; practical implementations of algorithms and their applications to testing various conjectures about L-functions; rigorous and certifiable computations of L-functions. One goal is to stimulate dialogue between theoreticians and computationally minded researchers regarding problems to which computation might provide insight or important confirmation of conjectures. In the other direction, we hope that discussions will lead to new ideas concerning algorithms for L-functions.

Only recently has it become feasible to do large scale verification of the predictions of the Langlands program in higher rank cases and to present the results in a way that is accessible widely to mathematicians. Moving from the understanding of Galois representations attached to elliptic curves to those attached to surfaces and other higher-dimensional varieties poses interesting problems in both arithmetic, algebra, geometry, and analysis.

In this workshop, we will consider computational and other explicit aspects of modular forms in higher rank. Topics covered will include: K3 surfaces and their connections to modular forms on orthogonal groups, algebraic modular forms associated to classical groups and their computation, and motives arising from general Calabi-Yau varieties accessible to explicit methods, including hypergeometric motives.

This workshop will bring together researchers who approach the Langlands program from a number of different perspectives, and our goal is to... (more)

One of the crowning achievements of number theory in the 20th century is the construction of the modularity correspondence between elliptic curves with rational coefficients and modular forms of weight 2. The consequences of this result resound throughout number theory; for instance, it enables the resolution of certain problems of diophantine equations (e.g., Fermat's last theorem) as well as the systematic tabulation of elliptic curves, which in turn provides the basis for many new conjectures and results.

The aim of this workshop is to lay the groundwork for extending this correspondence to curves of small genus over number fields. The general framework for this correspondence is predicted by the Langlands program, but much remains to be made explicit. We will explore theoretical, algorithmic, computational, and experimental questions on both sides of the correspondence, with an eye towards tabulation of numerical data and formulation of precise conjectures.

In the late 1960s, Robert Langlands discovered a unifying principle in number theory providing a vast generalization of class field theory to include nonabelian extensions of number fields. This principle gives rise to a web of conjectures called the Langlands program which continues to guide research in number theory to the present day. For example, an important first instance of the Langlands program is the modularity theorem for elliptic curves over the rational numbers, an essential ingredient in the proof of Fermat's last theorem.

Despite its many successes, the Langlands program remains vague in many of its predictions, due in part to an absence of data to guide a precise formulation away from a few special cases. In this thematic program, we will experiment with and articulate refined conjectures relating arithmetic-geometric objects to automorphic forms, improve the computational infrastructure underpinning the Langlands program, and assemble additional supporting... (more)

Over the last 20 years or so, Newton-Krylov methods have developed to maturity, allowing effective fully-coupled treatment of a broad range of large-scale nonlinear problems. This development has set the stage for addressing more difficult problems with more challenging features. Additionally, applications for which state-of-the-art Newton-Krylov approaches are inapplicable have recently exposed several basic research questions. At the same time, there remain many problem-specific methods and legacy codes that are still useful and can be regarded as a resource for further development.

This workshop will include mathematicians and computer scientists who work on algorithm design, implementation, and analysis, together with disciplinary scientists and engineers who use the algorithms in applications and have a working knowledge of their capabilities, weaknesses, and limitations. The major foci of the workshop will be acceleration methods, in particular Anderson acceleration; methods for... (more)

GirlsGetMath is a weeklong mathematics summer day-program for 9th and 10th grade high school girls in the Providence, RI area.

GirlsGetMath occurs in an encouraging environment that builds young women's confidence in math and science.

GirlsGetMath expands participants' understanding and knowledge of mathematics through computations and experimentations.

GirlsGetMath provides expert mathematical training and mentoring.

GirlsGetMath will become a replicable national model of mathematical outreach for high school girls, with an emphasis on mathematical experimentation.

This five-day non-residential mathematics program is open to high school girls from the greater Providence, RI area who will have just completed either grade 9 or grade 10 by July 2015.

GirlsGetMath@ICERM will encourage 20 young women to... (more)

Description Goals
This program has three objectives. First, it provides graduate students with opportunities to acquire fundamental knowledge and skills in high performance computing, including parallel computing and visualization in 3D caves, and to expose them to the research carried out in these areas at Brown and Kobe Universities. Second, graduate students will learn how to work collaboratively in teams, thus preparing them for the changing nature of research. Finally, the program will provide students with opportunities to develop a global perspective and mindset through participation in a culturally rich and diverse program.