left-arrowleft-arrowright-arrowleft-arrowAsset 9
'

On the spectra of syntactic structures (Isabella Senturia, Yale University)

On Zoom

We explore the application of spectral graph theory to the problem of characterizing linguistically-significant classes of tree structures. We focus on various classes of syntactically-defined tree graphs, and show that the spectral properties of different matrix representations of these classes of trees provide insight into the linguistic properties that characterize these classes. More generally, our […]

Partial orders on standard Young tableaux( Gizem Karaali, Pomona)

On Zoom

Young diagrams are all possible arrangements of n boxes into rows and columns, with the number of boxes in each subsequent row weakly decreasing. For a partition λ of n, a standard Young tableau S of shape λ is built from the Young diagram of shape λ by filling it with the numbers 1 to […]

Beran’s tests of uniformity for discrete data (Michael Orrison, HMC)

On Zoom

Suppose you are given a data set that can be viewed as a nonnegative integer-valued function defined on a finite set. A natural question to ask is whether the data can be viewed as a sample from the uniform distribution on the set, in which case you might want to apply some sort of test […]

Bounds for nonzero Littlewood-Richardson coefficients (Müge Taskin, Boğaziçi University, Turkey)

On Zoom

As  $\lambda$ runs through all integer partitions, the set of   Schur functions $\{s_{\lambda}\}_\lambda$ forms a basis in the ring of symmetric functions. Hence the rule $$s_{\lambda}s_{\mu}=\sum c_{\lambda,\mu}^{\gamma} s_{\gamma}$$ makes sense and the coefficients $c_{\lambda,\mu}^{\gamma}$ are called \textit{Littlewood-Richardson (LR) coefficients}. The calculations of Littlewood-Richardson coefficients has been an important problem from the first time they were […]

A conjugacy criterion for two pairs of 2 x 2 matrices over a commutative ring (Bogdan Petrenko, Eastern Illinois University)

On Zoom

I will explain how to apply presentations of algebras (together with some classical results from non-commutative algebra) to obtain some 5 polynomial invariants telling us when two pairs of 2x2 matrices over a commutative ring are conjugate, assuming that each of these pairs generate the matrix algebra. This talk is based on my joint paper […]

Covering by polynomial planks (Alexey Glazyrin, University of Texas Rio Grande Valley)

On Zoom

In 1932, Tarski conjectured that a convex body of width 1 can be covered by planks, regions between two parallel hyperplanes, only if the total width of planks is at least 1. In 1951, Bang proved the conjecture of Tarski. In this work we study the polynomial version of Tarski's plank problem. We note that […]

Peg solitaire in multiple colors on graphs (Tara Davis, Hawaii Pacific University and Roberto Soto, Cal State Fullerton)

On Zoom

Peg solitaire is a popular one person board game that has been played in many countries on various board shapes. Recently, peg solitaire has been studied extensively in two colors on mathematical graphs. We will present our rules for multiple color peg solitaire on graphs. We will present some student and faculty results classifying the solvability of the game […]

Continuous extensions of Ramanujan-expandable arithmetic functions (Matthew Fox, Perimeter Institute for Theoretical Physics and Chai Karamchedu, Sandia National Labs)

On Zoom

We describe a natural way to continuously extend arithmetic functions that admit a Ramanujan expansion and derive the conditions under which such an extension exists. In particular, we show that the absolute convergence of a Ramanujan expansion does not guarantee the convergence of its real variable generalization. We take the divisor function as a case […]