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

We prove Union-Closed sets conjecture.

This paper presents both a method and a result. The result presents a closed formula for the sum of the first $m+1,m \ge 0,$ squares of the sequence $F^{(k)}$ where each member is the sum of the previous $k$ members and with initial…

We prove a unified convergence theorem, which presents in four equivalent forms of the famous Antosik-Mikusinski Theorems. In particular, we show that Swartz' three uniform convergence principles are all equivalent to the Antosik-Mikusinski…

Recently Sober\'on proved a far-reaching generalization of the colorful KKM Theorem due to Gale: let $n\geq k$, and assume that a family of closed sets $(A^i_j\mid i\in [n], j\in [k])$ has the property that for every $I\in…

We give a proof for the fundamental theorem of algebra,using the Fredholm index phenomena

The purpose of the present paper is to prove for finitely generated groups of type I the following conjecture of A.Fel'shtyn and R.Hill, which is a generalization of the classical Burnside theorem. Let G be a countable discrete group, f one…

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Let $m,n\ge 2$ be positive integers, $M_m$ the set of $m\times m$ complex matrices and $M_n$ the set of $n\times n$ complex matrices. Regard $M_{mn}$ as the tensor space $M_m\otimes M_n$. Suppose $|\cdot|$ is the Ky Fan $k$-norm with $1 \le…

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

We give a new proof Tverberg's famous theorem: For every set $X \subset \R^d$ with $|X|=(r-1)(d+1)+1$, there is a partition of $X$ into $r$ sets $X_1,\ldots,X_r$ such that $\bigcap_{p=1}^r \conv X_p\ne \emptyset$. The new proof uses linear…

Let $R = k[x_1,\ldots, x_d]$ denote a standard graded polynomial ring over an algebraically closed field $k$, and let $I \subset R$ be a perfect ideal of codimension $2$ with an $n\times (n-1)$ linear presentation matrix $\phi$. We prove an…

In this paper we go on to discuss about Stanley's theorem in Integer partitions. We give two different versions for the proof of the generalization of Stanley's theorem illustrating different techniques that may be applied to profitably…

We give an elementary and self-contained proof of the uniformization theorem for non-compact simply-connected Riemann surfaces.

If F is a type-definable family of commensurable subsets, subgroups or sub-vector spaces in a metric structure, then there is an invariant subset, subgroup or sub-vector space commensurable with F. This in particular applies to…

The representation theorem for odd or even involutive FLe-chains by bunches of layer groups, as discussed in [10], is redefined to demonstrate a more straightforward constructional relationship between odd or even involutive FLe-chains and…

The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…

Let F be a finite nonempty family of finite nonempty sets. We prove the following: (i) F satisfies the condition of the title if and only if for every pair of distinct subfamilies {A_1,...,A_r}, {B_1,...,B_s} of F, the union of the A_i is…

The general theme of this note is illustrated by the following theorem: Theorem 1. Suppose $K$ is a compact set in the complex plane and 0 belongs to the boundary $\partial K$. Let ${\cal A}(K)$ denote the space of all functions $f$ on $K$…

Given a uniform algebra A on a compact Hausdorff space X and a point x in X, denote by M_x the ideal of functions in A that vanish at x and by J_x the ideal of functions in A that vanish on a neighborhood of x. It is shown that for each…

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.