Title	Progression-free sets and rank of matrices
Creator	Pach, Péter Pál
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2019-11-14T11:30
Description	In this talk we will discuss lower and upper bounds for the size of $k$-AP-free subsets of $\mathbb{Z}_m^n$, that is, for $r_k(\mathbb{Z}_m^n$, in certain cases. Specifically, we will discuss some lower bounds given by Elsholtz and myself. In the case $m=4,k=3$ we present a construction which gives the tight answer up to $n\leq 5$ and point out some connection with coding theory. We will also mention some open questions (and some partial answers) about related linear algebraic problems.
Extent	29.0 minutes
Subject	Mathematics; Combinatorics; Number theory; Discrete mathematics
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Budapest University of Technology and Economics
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2020-05-13
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0390468
URI	http://hdl.handle.net/2429/74418
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Researcher
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos