Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, February 21, 2019, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Igor Balla

The Minrank of Random Graphs over Arbitrary Fields

The minrank of a graph G on the set of vertices {1, ..., n} over a field F is the minimum possible rank of an n x n matrix M over F, with nonzero diagonal entries such that M_{i,j} = 0 whenever ij is not an edge of G. We show that the minrank of the random graph G(n,p) over any field F is on the order of n log(1/p) / log(n) with high probability. For the field of real numbers, this settles a problem raised by Knuth in 1994. The proof combines a recent argument of Golovnev, Regev, and Weinstein, who proved the above result for finite fields of size at most n^O(1), with tools from linear algebra, including an estimate of Ronyai, Babai, and Ganapathy for the number of zero-patterns of a sequence of polynomials. Joint work with Noga Alon, Lior Gishboliner, Adva Mond, and Frank Mousset.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login