Related papers: A uniform version of a theorem by Lindstr\"om

We give a simple proof of a recent result by J. Schleischitz dealing with a counterexample to the uniform Littlewood conjecture. Our construction is based on simple properties of Fibonacci numbers.

Let I be a dense linear order with a left endpoint but no right endpoint. We consider the lattice L(I) of finite unions of closed intervals of I. This lattice arises naturally in the setting of o-minimality, as these are precisely the…

We prove an optimal version of Wigner's unitary-antiunitary theorem. The main tool in our proof is Gleason's theorem.

A set $P\subset \mathbb{F}_p^n\times\mathbb{F}_p^n$ is called $\textit{bilinear}$ when it is the zero set of a family of linear and bilinear forms, and $\textit{transverse}$ when it is stable under vertical and horizontal sums. A theorem of…

We prove that $K_n+I$, the complete graph of an even order with a $1$-factor duplicated, admits a decomposition into $2$-factors, each a disjoint union of cycles of length $m \geq 5$ if and only if $m \mid n$, except possibly when $m$ is…

We provide a short proof for the Figiel, Lindenstrauss and Milman inequality regarding the number of vertices and faces of certain polytope, with an explicit bound on the universal constant involved. The proof is completely elementary and…

The Boolean lattice $2^{[n]}$ is the family of all subsets of $[n]=\{1,\dots,n\}$ ordered by inclusion, and a chain is a family of pairwise comparable elements of $2^{[n]}$. Let $s=2^{n}/\binom{n}{\lfloor n/2\rfloor}$, which is the average…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

We call a family of sets intersecting, if any two sets in the family intersect. In this paper we investigate intersecting families $\mathcal{F}$ of $k$-element subsets of $[n]:=\{1,\ldots, n\},$ such that every element of $[n]$ lies in the…

The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…

A $k$-wise $\ell$-divisible set family is a collection $\mathcal{F}$ of subsets of ${ \{1,\ldots,n \} }$ such that any intersection of $k$ sets in $\mathcal{F}$ has cardinality divisible by $\ell$. If $k=\ell=2$, it is well-known that…

We prove that for any isomorphism $h: \mathcal{K}_1 \to \mathcal{K}_2$ between pure union-closed families, there exists a hyperisomorphism $H: \bigcup \mathcal{K}_1 \to \bigcup \mathcal{K}_2$ such that $h(A) = \{ H(a) \mid a \in A \}$, for…

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

We prove that the union-closed sets conjecture is true for separating union-closed families $\mathcal{A}$ with $|\mathcal{A}| \leq 2\left(m+\frac{m}{\log_2(m)-\log_2\log_2(m)}\right)$ where $m$ denotes the number of elements in…

Let $t$ be a non-negative integer and $\mbox{$\cal P$}=\{(A_i,B_i)\}_{1\leq i\leq m}$ be a set-pair family satisfying $|A_i \cap B_i|\leq t$ for $1\leq i \leq m$. $\mbox{$\cal P$}$ is called strong Bollob\'as $t$-system, if $|A_i\cap…

I give a proof of the uniform boundedness theorem that is elementary (i.e. does not use any version of the Baire category theorem) and also extremely simple.

For integers $2 \leq t \leq k$, we consider a collection of $k$ set families $\mathcal{A}_j: 1 \leq j \leq k$ where $\mathcal{A}_j = \{ A_{j,i} \subseteq [n] : 1 \leq i \leq m \}$ and $|A_{1, i_1} \cap \cdots \cap A_{k,i_k}|$ is even if and…

In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$…

We prove a normality theorem for the "true" elementary subgroups of $SL_n(A)$ defined by the ideals of a commutative unital ring $A$. Our result is an analogue of a normality theorem, due to Suslin, for the standard elementary subgroups,…

We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…