Problems
Day 1
Let be a real matrix such that .
(a) Prove that there is a unique real matrix that satisfies the equation (b) Express in terms of .
(proposed by Bekhzod Kurbonboev, Institute of Mathematics, Tashkent)
Let and be fixed positive integers, and let be an arbitrary non-negative integer. Choose a random -element subset of uniformly (i.e., all -element subsets are chosen with the same probability) and, independently of , choose a random -element subset of uniformly.
Prove that the probability does not depend on .
(proposed by Fedor Petrov, St. Petersburg State University)
We say that a positive real number is good if there exists an infinite sequence such that for each , the points partition the interval into segments of length at most each. Find (proposed by Josef Tkadlec)
Let be a function. Suppose that for every , there exists a function such that for every pair of real numbers, Prove that is the pointwise limit of a sequence of continuous functions, i.e., there is a sequence of continuous functions such that for every .
(proposed by Camille Mau, Nanyang Technological University, Singapore)
Day 2
Let be a real matrix and suppose that for every positive integer there exists a real symmetric matrix such that Prove that .
(proposed by Rafael Filipe dos Santos, Instituto Militar de Engenharia, Rio de Janeiro)
For a prime number , let be the group of invertible matrices of residues modulo , and let be the symmetric group (the group of all permutations) on elements. Show that there is no injective group homomorphism .
(proposed by Thiago Landim, Sorbonne University, Paris)
Let be an open set containing the closed unit disk . Let be a holomorphic function, and let be a monic polynomial. Prove that (proposed by Lars Hörmander)
Let be a positive integer. At most how many distinct unit vectors can be selected in such that from any three of them, at least two are orthogonal?
(proposed by Alexander Polyanskii, Moscow Institute of Physics and Technology; based on results of Paul Erdős and Moshe Rosenfeld)