olymmath

SCHWEITZER 2008

Miklós Schweitzer Competition 2008.

Other problems

Problem 1

Let H⊂P(X)H \subset P(X) be a system of subsets of XX and κ>0\kappa > 0 be a cardinal number such that every x∈Xx \in X is contained in less than κ\kappa members of HH . Prove that there exists an f ⁣:X→κf \colon X \rightarrow \kappa coloring, such that every nonempty A∈HA \in H has a "unique" point, that is, an element x∈Ax \in A such that f(x)≠f(y)f(x) \neq f(y) for all x≠y∈Ax \neq y \in A .

(translated by Miklós Maróti)

Problem 2

Let t≥3t\ge 3 be an integer, and for 1≤i<j≤t1\le i <j\le t let Aij=AjiA_{ij}=A_{ji} be an arbitrary subset of an nn -element set XX . Prove that there exist 1≤i<j≤t1\le i < j\le t for which ∣(X \Aij)∪⋃k≠i,j(Aik∩Ajk)∣≥t−22t−2n\left| \left( X\,\backslash A_{ij}\right) \cup \bigcup_{k\neq i,j}\left( A_{ik}\cap A_{jk}\right) \right| \ge \frac{t-2}{2t-2}n (translated by Miklós Maróti)

Problem 3

A bipartite graph on the sets {x1,…,xn}\{ x_1,\ldots, x_n \} and {y1,…,yn}\{ y_1,\ldots, y_n\} of vertices (that is the edges are of the form xiyjx_iy_j ) is called tame if it has no xiyjxkylx_iy_jx_ky_l path ( i,j,k,l∈{1,…,n}i,j,k,l\in\{ 1,\ldots, n\} ) where j<lj<l and i+j>k+li+j>k+l . Calculate the infimum of those real numbers α\alpha for which there exists a constant c=c(α)>0c=c(\alpha)>0 such that for all tame graphs e≤cnαe\le cn^{\alpha} , where ee is the number of edges and nn is half of the number of vertices.

(translated by Miklós Maróti)

Problem 4

Let AA be a subgroup of the symmetric group SnS_n , and GG be a normal subgroup of AA . Show that if GG is transitive, then ∣A ⁣:G∣≤5n−1|A\colon G|\le 5^{n-1} (translated by Miklós Maróti)

Problem 5

Let AA be an infinite subset of the set of natural numbers, and denote by τA(n)\tau_A(n) the number of divisors of nn in AA . Construct a set AA for which ∑n≤xτA(n)=x+O(log⁡log⁡x)\sum_{n\le x}\tau_A(n)=x+O(\log\log x) and show that there is no set for which the error term is o(log⁡log⁡x)o(\log\log x) in the above formula.

(translated by Miklós Maróti)

Problem 6

Is it possible to draw circles on the plane so that every line intersects at least one of them but no more than 100100 of them?

Problem 7

Let f ⁣:R1→R2f\colon \mathbb{R}^1\rightarrow \mathbb{R}^2 be a continuous function such that f(x)=f(x+1)f(x)=f(x+1) for all xx , and let t∈[0,14]t\in [0,\frac14] . Prove that there exists x∈Rx\in\mathbb{R} such that the vector from f(x−t)f(x-t) to f(x+t)f(x+t) is perpendicular to the vector from f(x)f(x) to f(x+12)f(x+\frac12) .

(translated by Miklós Maróti)

Problem 8

Let SS be the Sierpiński triangle. What can we say about the Hausdorff dimension of the elevation sets f−1(y)f^{-1}(y) for typical continuous real functions defined on SS ? (A property is satisfied for typical continuous real functions on SS if the set of functions not having this property is of the first Baire category in the metric space of continuous S→RS\rightarrow\mathbb{R} functions with the supremum norm.)

(translated by Miklós Maróti)

Problem 9

For a given α>0\alpha >0 let us consider the regular, non-vanishing f(z)f(z) maps on the unit disc {∣z∣<1}\{ |z|<1 \} for which f(0)=1f(0)=1 and Rezf′(z)f(z)>−α\mathrm{Re} z\frac{f'(z)}{f(z)}>-\alpha ( ∣z∣<1|z|<1 ). Show that the range of g(z)=1(1−z)2αg(z)=\frac{1}{(1-z)^{2\alpha}} contains the range of all other such functions. Here we consider that regular branch of g(z)g(z) for which g(0)=1g(0)=1 .

(translated by Miklós Maróti)

Problem 10

Let VV be the set of non-collinear pairs of vectors in R3\mathbb{R}^3 , and HH be the set of lines passing through the origin. Is is true that for every continuous map f ⁣:V→Hf\colon V\rightarrow H there exists a continuous map g ⁣:V→R3 \ {0}g\colon V\rightarrow \mathbb{R}^3\,\backslash\,\{ 0\} such that g(v)∈f(v)g(v)\in f(v) for all v∈Vv\in V ?

(translated by Miklós Maróti)

Problem 11

Let ζ1,…,ζn\zeta_1, \ldots, \zeta_n be (not necessarily independent) random variables with normal distribution for which Eζj=0E\zeta_j=0 and Eζj2≤1E\zeta_j^2\le 1 for all 1≤j≤n1\le j\le n . Prove that E(max⁡1≤j≤nζj)≤2log⁡nE\left( \max_{1\le j\le n} \zeta_j \right)\le\sqrt{2\log n} (translated by Miklós Maróti)