Search Results
Jewellery from tessellations of hyperbolic space
In this snapshot, we will first give an introduction to hyperbolic geometry and we will then show how certain matrix groups of a number-theoretic origin give rise to a large variety of interesting tessellations of 3-dimensional hyperbolic space. Many of the building blocks of these tessellations exhibit beautiful symmetry and have inspired the design of 3D printed jewellery.
Searching for the Monster in the Trees
The Monster finite simple group is almost unimaginably large, with about 8 × 1053 elements in it. Trying to understand such an immense object requires both theory and computer programs. In this snapshot, we discuss finite groups, representations, and finally Brauer trees, which offer some new understanding of this vast and intricate structure.
Expander graphs and where to find them
Graphs are mathematical objects composed of a collection of “dots” called vertices, some of which are joined by lines called edges. Graphs are ideal for visually representing relations between things, and mathematical properties of graphs can provide an insight into real-life phenomena. One interesting property is how connected a graph is, in the sense of how easy it is to move between the vertices along the edges. The topic dealt with here is the construction of particularly well-connected graphs, and whether or not such graphs can happily exist in worlds similar to ours.
Algebra, matrices, and computers
What part does algebra play in representing the real world abstractly? How can algebra be used to solve hard mathematical problems with the aid of modern computing technology? We provide answers to these questions that rely on the theory of matrix groups and new methods for handling matrix groups in a computer.
Ultrafilter methods in combinatorics
Given a set X, ultrafilters determine which subsets of X should be considered as large. We illustrate the use of ultrafilter methods in combinatorics by discussing two cornerstone results in Ramsey theory, namely Ramsey’s theorem itself and Hindman’s theorem. We then present a recent result in combinatorial number theory that verifies a conjecture of Erdos known as the “B + C conjecture”.
Snake graphs, perfect matchings and continued fractions
A continued fraction is a way of representing a real number by a sequence of integers. We present a new way to think about these continued fractions using snake graphs, which are sequences of squares in the plane. You start with one square, add another to the right or to the top, then another to the right or the top of the previous one, and so on. Each continued fraction corresponds to a snake graph and vice versa, via “perfect matchings” of the snake graph. We explain what this means and why a mathematician would call this a combinatorial realization of continued fractions.
Invitation to quiver representation and Catalan combinatorics
Representation theory is an area of mathematics that deals with abstract algebraic structures and has numerous applications across disciplines. In this snapshot, we will talk about the representation theory of a class of objects called quivers and relate them to the fantastic combinatorics of the Catalan numbers.
Computing with symmetries
Group theory is the study of symmetry, and has many applications both within and outside mathematics. In this snapshot, we give a brief introduction to symmetries, and how to compute with them.
Touching the transcendentals: tractional motion from the bir th of calculus to future perspectives
When the rigorous foundation of calculus was developed, it marked an epochal change in the approach of mathematicians to geometry. Tools from geometry had been one of the foundations of mathematics until the 17th century but today, mainstream conception relegates geometry to be merely a tool of visualization. In this snapshot, however, we consider geometric and constructive components of calculus. We reinterpret “tractional motion”, a late 17th century method to draw transcendental curves, in order to reintroduce “ideal machines” in math foundation for a constructive approach to calculus that avoids the concept of infinity.
From the dollar game to the Riemann-Roch Theorem
What is the dollar game? What can you do to win it? Can you always win it? In this snapshot you will find answers to these questions as well as several of the mathematical surprises that lurk in the background, including a new perspective on a century-old theorem.