Search Results

Let us recall that $\mathfrak u$ is the smallest cardinality of a base of a free ultrafilter on $\omega$. It is known (and easy to see) that $\omega_1\le\mathfrak u\le\mathfrak c$. Example. There exis …

$\DeclareMathOperator\Dil{Dil}\DeclareMathOperator\Trans{Trans}\DeclareMathOperator\Col{Col}$An affine plane is a set of points $X$ endowed with a family $\mathcal L$ of subsets of $X$, called lines, …

The answer to this question is "No". A non-affine biaffine Cartesian plane can be constructed as follows. First, we fix a suitable terminology. Every function $F:X\to Y$ is identified with its graph …

This question concerns the (synthetic) geometry of linear spaces. Definition 1. A linear space is a pair $(P,\mathcal L)$ consisting of a set $P$ whose elements are called points and a family $\mathca …

I start with definitions. Definition 1. A linear space is a pair $(X,\mathcal L)$ consisting of a set $X$ and a family $\mathcal L$ of subsets of $X$ satisfying three axioms: (L1) for any distinct poi …

Definition 1. A binary operation $\cdot:X\times X\to X$, $\cdot:(xy)\mapsto xy$, on a set $X$ will be called a line operation if $$xx=x,\quad xy=yx,\quad (xy)x=y$$ for every $x,y\in X$. Remark 1. Ever …

Definition 1. An affine plane is a pair $(X,\mathcal L)$ consisting of a set $X$ and a family $\mathcal L$ of subsets of $X$ called lines which satisfy the following axioms: Any distinct points $x,y\ …

I am thinking on a strict definition of the notion of parallel affine sets in a linear space and came to the following Definition 1: An affine set $A$ is parallel to an affine set $B$ in a linear spa …

I am interested in the interplay between the Playfair and Proclus Axioms in linear spaces. By a linear space I understand a pair $(X,\mathcal L)$ consisting of a set $X$ and a family $\mathcal L$ of s …

This question is follow up of this MO-post. First let us recall the necessary definitions. A function $f:X\to X$ on a group $X$ is called a polynomial if there exists $n\in\mathbb N$ and elements $a_0 …

This question is motivated by the comments and the answer to this MO-question. First let us recall some definitions. A function $f:X\to X$ on a group $X$ is called a polynomial if there exists $n\in\m …

A function $f:X\to X$ on a group $X$ is called a polynomial if there exist $n\in\mathbb N=\{1,2,3,\dots\}$ and elements $a_0,a_1,\dots,a_n\in X$ such that $f(x)=a_0xa_1x\cdots xa_n$ for all $x\in X$. …

The question concerns statistic properties of random words in a finite alphabet $A$. By $A^{<\omega}$ we denote the set of all words in the alphabet $A$, i.e. finite sequences of elements of $A$. Let …

Writing down the details of the argument of Ilya Bogdanov, we can obtain the following upper bound: Theorem. $f(n)\le\frac83n-1$ for every $n\ge 2$. Proof. If $n=3k+1$ or $n=3k+2$, then following th …

In this preprint (written jointly with Alex Ravsky) we prove the following partial answers to this problem. First some definitions. A non-empty subset $D$ of an Abelian group is called decomposable if …