Related papers: Madness in vector spaces
We study connections between definability in generalized descriptive set theory and large cardinals, under ZFC. We show that if $\kappa$ is a limit of measurables then there is no wellorder of a subset of $P(\kappa)$ of length…
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We show a dichotomy for the size of the smallest identifying code in classes…
We study families of infinite block sequences of elements of the space $\FIN_k$. In particular we study Ramsey properties of such families and Ramsey properties localized to a selective or semiselective coideal. We show how the stable…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…
For any family of measurable sets in a probability space, we show that either (i) the family has infinite Vapnik-Chervonenkis (VC) dimension or (ii) for every epsilon > 0 there is a finite partition pi such the pi-boundary of each set has…
We discuss the proximal game and semi-proximality in $\Psi$-spaces of almost disjoint families over an infinite countable set and $\Psi$-spaces of ladder systems on $\omega_1$. We show that a semi-proximal almost disjoint families must be…
We study the minimal dimension of the classifying space of the family of virtually cyclic subgroups of a discrete group. We give a complete answer for instance if the group is virtually poly-Z, word-hyperbolic or countable locally virtually…
We show that all maximal almost disjoint families have pseudocompact Vietoris hyperspace if and only if $\mathsf{MA}_\mathfrak c (\mathcal P(\omega)/\mathrm{fin})$ holds. We further study the question whether there is a maximal almost…
We answer Question~3.2 from Shelah \cite{Sh:666}: Given a maximal almost disjoint (mad) family $\mathcal A$ of size $\aleph_1$, we construct a forcing ${\mathbb Q}(\mathcal A)$ that has Axiom A, is ${}^\omega \omega$-bounding, preserves…
Given a Banach space we consider the $\sigma$-ideal of all of its subsets which are covered by countably many hyperplanes and investigate its standard cardinal characteristics as the additivity, the covering number, the uniformity, the…
An infinite graph is said to be highly connected if the induced subgraph on the complement of any set of vertices of smaller size is connected. We continue the study of weaker versions of Ramsey Theorem on uncountable cardinals asserting…
A family of subsets of the set {1,2,...,n} is said to be unbalanced if the convex hull of its characteristic vectors misses the diagonal in the n-cube.The purpose of this article is to develop the combinatorics of maximal unbalanced…
We investigate an extension of ZFC set theory (in an extended language) that stipulates the existence of a proper class of indiscernibles over the universe. One of the main results of the paper shows that the purely set-theoretical…
We show that it is relatively consistent with ZFC that 2^omega is arbitrarily large and every sequence s=(s_i:i<omega_2) of infinite cardinals with s_i<=2^omega is the cardinal sequence of some locally compact scattered space.
Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…
Starting from a model with a Laver-indestructible supercompact cardinal $\kappa$, we construct a model of $ZF+DC_{\kappa}$ where there are no $\kappa$-mad families.
We prove new upper bounds on the size of families of vectors in $\Z_m^n$ with restricted modular inner products, when $m$ is a large integer. More formally, if $\vec{u}_1,\ldots,\vec{u}_t \in \Z_m^n$ and $\vec{v}_1,\ldots,\vec{v}_t \in…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…
Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…