Discrete Mathematics and Foundations

mathemathical subject image: 

The Robinson–Schensted algorithm

I am going to describe the Robinson–Schensted algorithm which transforms a permutation of the numbers from 1 to n into a pair of combinatorial objects called “standard Young tableaux”. I will then say a little bit about a few of the fascinating properties of this transformation, and how it connects to current research.

Invitation to quiver representation and Catalan combinatorics

Representation theory is an area of mathematics that deals with abstract algebraic structures and has nu- merous applications across disciplines. In this snap- shot, 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.

Formation Control and Rigidity Theory

Formation control is one of the fundamental coordination tasks for teams of autonomous vehicles. Autonomous formations are used in applications ranging from search-and-rescue operations to deep space exploration, with benefits including increased robustness to failures and risk mitigation for human operators. The challenge of formation control is to develop distributed control strategies using vehicle on-board sensing that ensures the desired formation is obtained.

Limits of graph sequences

Graphs are simple mathematical structures used to model a wide variety of real-life objects. With the rise of computers, the size of the graphs used for these models has grown enormously. The need to efficiently represent and study properties of extremely large graphs led to the development of the theory of graph limits.

Sombrero Vueltiao –Weaving Mathematics

This paper describes the weaving technique of a traditional Colombian hat called sombrero vueltiao and some of its patterns. The making of the hat–and weaving in general–involves interesting mathematical thoughts and concepts and offers many learning opportunities, for all of which we provide examples in this paper.

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.

Seiten