Search results for "kombinatoriikka"
showing 5 items of 5 documents
Combinatorial proofs of two theorems of Lutz and Stull
2021
Recently, Lutz and Stull used methods from algorithmic information theory to prove two new Marstrand-type projection theorems, concerning subsets of Euclidean space which are not assumed to be Borel, or even analytic. One of the theorems states that if $K \subset \mathbb{R}^{n}$ is any set with equal Hausdorff and packing dimensions, then $$ \dim_{\mathrm{H}} π_{e}(K) = \min\{\dim_{\mathrm{H}} K,1\} $$ for almost every $e \in S^{n - 1}$. Here $π_{e}$ stands for orthogonal projection to $\mathrm{span}(e)$. The primary purpose of this paper is to present proofs for Lutz and Stull's projection theorems which do not refer to information theoretic concepts. Instead, they will rely on combinatori…
On several notions of complexity of polynomial progressions
2021
For a polynomial progression $$(x,\; x+P_1(y),\; \ldots,\; x+P_{t}(y)),$$ we define four notions of complexity: Host-Kra complexity, Weyl complexity, true complexity and algebraic complexity. The first two describe the smallest characteristic factor of the progression, the third one refers to the smallest-degree Gowers norm controlling the progression, and the fourth one concerns algebraic relations between terms of the progressions. We conjecture that these four notions are equivalent, which would give a purely algebraic criterion for determining the smallest Host-Kra factor or the smallest Gowers norm controlling a given progression. We prove this conjecture for all progressions whose ter…
On arithmetic sums of Ahlfors-regular sets
2021
Let $A,B \subset \mathbb{R}$ be closed Ahlfors-regular sets with dimensions $\dim_{\mathrm{H}} A =: \alpha$ and $\dim_{\mathrm{H}} B =: \beta$. I prove that $$\dim_{\mathrm{H}} [A + \theta B] \geq \alpha + \beta \cdot \tfrac{1 - \alpha}{2 - \alpha}$$ for all $\theta \in \mathbb{R} \, \setminus \, E$, where $\dim_{\mathrm{H}} E = 0$.
The N-dimensional N-person chesslike game strategy analysis model
2016
In this research a mathematical, symmetric n-player game model, based on chess is designed. Symmetry in this context refers to players' positions with respect to each other. While the order of move naturally violates the symmetry, this problem may also be solved. The motivation for building this kind of game model stems from the difficulty of finding mathematical solutions for multi-player games in general. The number of varying factors is so huge, that finding optimal strategies is mathematically almost impossible. The best way to attempt this is to use simulation. Once the model has been built, it can be applied in many ways by using computational algorithms based on the created model. Ch…