Related papers: Evasion and prediction II

We study the set--theoretic combinatorics underlying the following two algebraic phenomena. (1) A subgroup G leq Z^omega exhibits the Specker phenomenon iff every homomorphism G to Z maps almost all unit vectors to 0. Let se be the size of…

Let $\mathfrak{e}^\mathsf{const}_2$ be the constant evasion number, that is, the size of the least family $F\subseteq{}^{\omega}2$ of reals such that for each predictor $\pi\colon {}^{<\omega}2\to 2$ there is $x\in F$ which is not…

The Evasiveness conjecture have been proved for properties of graphs on a prime-power number of vertices and the six vertices case. The ten vertices case is still unsolved. In this paper we study the size of the automorphism group of a…

Any finite simple graph $G = (V,E)$ can be represented by a collection $\mathscr{C}$ of subsets of $V$ such that $uv\in E$ if and only if $u$ and $v$ appear together in an odd number of sets in $\mathscr{C}$. Let $c_2(G)$ denote the minimum…

Let $G$ be a graph and $p \in [1, \infty]$. The parameter $f_p(G)$ is the least integer $k$ such that for all $m$ and all vectors $(r_v)_{v \in V(G)} \subseteq \mathbb{R}^m$, there exist vectors $(q_v)_{v \in V(G)} \subseteq \mathbb{R}^k$…

We show that random walks on semisimple algebraic groups do not concentrate on proper algebraic subvarieties with uniform exponential rate of anti-concentration. This is achieved by proving a uniform spectral gap for quasi-regular…

Veit Elser proposed a random graph model for percolation in which physical dimension appears as a parameter. Studying this model combinatorially leads naturally to the consideration of numerical graph invariants which we call \emph{Elser…

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

Given a graph $G$ and $p \in [0,1]$, let $G_p$ denote the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. Alon, Krivelevich, and Sudokov proved $\mathbb{E} [\chi(G_p)] \geq C_p \frac{\chi(G)}{\log…

Every graph $G=(V,E)$ is an induced subgraph of some Kneser graph of rank $k$, i.e., there is an assignment of (distinct) $k$-sets $v \mapsto A_v$ to the vertices $v\in V$ such that $A_u$ and $A_v$ are disjoint if and only if $uv\in E$. The…

First, let $K \subset B(0,1) \subset \mathbb{R}^{2}$ be a set with $\mathcal{H}_{\infty}^{1}(K) \sim 1$, and write $\pi_{e}(K)$ for the orthogonal projection of $K$ into the line spanned by $e \in S^{1}$. For $1/2 \leq s < 1$, write $$E_{s}…

We show that the evasion number $\mathfrak{e}$ can be added to Cicho\'n's maximum with a distinct value. More specifically, it is consistent that…

A group G that is not finitely generated can be written as the union of a chain of proper subgroups. The cofinality spectrum of G, written CF(S), is the set of regular cardinals lambda such that G can be expressed as the union of a chain of…

Slopes of an adelic vector bundle exhibit a behaviour akin to successive minima. Comparisons between the two amount to a Siegel lemma. Here we use Zhang's version for absolute minima over the algebraic numbers. We prove a Minkowski-Hlawka…

Higman proved in 1952 that every free group is non-commutatively slender, this is to say that if G is a free group and h is a homomorphism from the countable complete free product (X_omega Z) to G, then there exists a finite subset F of…

This paper contains the following $\delta$-discretised projection theorem for Ahlfors regular sets in the plane. For all $C,\epsilon > 0$ and $s \in [0,1]$, there exists $\kappa > 0$ such that the following holds for all $\delta > 0$ small…

A fractional matching of a graph $G$ is a function $f:E(G)\rightarrow [0, 1]$ such that for any $v\in V(G)$, $\sum_{e\in E_{G}(v)}f(e)\leq1$, where $E_{G}(v)=\{e\in E(G): e~ \mbox{is incident with} ~v~\mbox{in}~G\}$.The fractional matching…

In this paper we analyze a variant of the pursuit-evasion game on a graph $G$ where the intruder occupies a vertex, is allowed to move to adjacent vertices or remain in place, and is 'invisible' to the searcher, meaning that the searcher…

Consider the random Cayley graph of a finite Abelian group $G$ with respect to $k$ generators chosen uniformly at random, with $1 \ll \log k \ll \log |G|$. Draw a vertex $U \sim \operatorname{Unif}(G)$. We show that the graph distance…

It is well known that the lattice Idc G of all principal {\ell}-ideals of any Abelian {\ell}-group G is a completely normal distributive 0-lattice, and that not every completely normal distributive 0-lattice is a homomorphic image of some…