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 […]
In this talk we link discrete Markov spectrum to geometry of continued fractions. As a result of that we get a natural generalization of classical Markov tree which leads to […]
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 […]
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 […]
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 […]
An elliptic curve $ E: y^2 + a_1 \, x \, y + a_3 \, y = x^3 + a_2 \, x^2 + a_1 \, x + a_6 $ is […]
The existence of a set $A\subset \N_0$ of positive upper Banach density such that $A-A:=\{m-n:m, n\in A, m>n\}$ does not contain a set of the form $S-S$ with $S$ a […]
An arithmetical structure on a finite, connected graph G without loops is given by an assignment of positive integers to the vertices such that, at each vertex, the integer there […]
This talk discusses a puzzle called “Spinning Switches,” based on a problem popularized by Martin Gardner in his February 1979 column of “Mathematical Games". This puzzle can be generalized to […]
The slice rank polynomial method, motivated by groundbreaking work of Croot, Lev and Pach and refined by Tao, has opened the door to the resolution of many problems in extremal […]
Given a lattice L, an extension of L is a lattice M of strictly greater rank so that L is equal to the intersection of the subspace spanned by L […]
Markov chains have become widely-used to generate random political districting plans. These random districting plans can be used to form a baseline for comparison, and any proposed districting plans that differ significantly from this baseline can be flagged as potentially gerrymandered. However, very little is rigorously known about these Markov chains - Are they irreducible? […]
