Related papers: Strongly minimal Steiner Systems III: Path graphs …

Let $n \in \mathbb{N}_{\geq 2}$. We prove that for every $k \geq 4$ there exist uniform but non-homogeneous Steiner bundles on $\mathbb{P}^n$ of $k$-type with disconnected splitting type, and we further investigate almost-uniform Steiner…

Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…

We discuss counterexamples to the validity of the weak Maximum Principle for linear elliptic systems with zero and first order couplings and prove, through a suitable reduction to a nonlinear scalar equation, a quite general result showing…

We study $S(t-1,t,2t)$, which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs.…

In this work we study $k$-type uniform Steiner bundles, being $k$ the lowest degree of the splitting. We prove sharp upper and lower bounds for the rank in the case $k=1$ and moreover we give families of examples for every allowed possible…

Two approaches to Lipschitz structures for any set are presented, studied and compared. The first approach is similar to the one proposed in Fraser, Jr. R. B., Axiom systems for Lipschitz structures, Fundamenta Mathematicae, (1970), where…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

The class of $\left(\binom{n+1}{2}_{n-1} \binom{n+1}{3}_3\right)$-configurations which contain at least $n-2$ $K_n$-graphs coincides with the class of so called systems of triangle perspectives i.e. of configurations which contain a bundle…

In this article we construct uncountably many new homogeneous locally finite Steiner triple systems of countably infinite order as Fra\"{\i}ss\'{e} limits of classes of finite Steiner triple systems avoiding certain subsystems. The…

In 1973, Erd\H{o}s conjectured the existence of high girth $(n,3,2)$-Steiner systems. Recently, Glock, K\"{u}hn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erd\H{o}s' conjecture. Just this year,…

This article consists in two independent parts. In the first one, we investigate the geometric properties of almost periodicity of model sets (or cut-and-project sets, defined under the weakest hypotheses); in particular we show that they…

Nested Steiner quadruple systems are designs derived from Steiner quadruple systems (SQSs) by partitioning each block into pairs. A nested SQS is completely uniform if every possible pair appears with equal multiplicity, and completely…

We prove asymptotic upper bounds on the number of $d$-partitions (paving matroids of fixed rank) and partial Steiner systems (sparse paving matroids of fixed rank), using a mixture of entropy counting, sparse encoding, and the probabilistic…

A $\delta$-colouring of the point set of a block design is said to be {\em weak} if no block is monochromatic. The {\em chromatic number} $\chi(S)$ of a block design $S$ is the smallest integer $\delta$ such that $S$ has a weak…

We investigate various forms of (model-theoretic) stability for hypergraphs and their corresponding strengthenings of the hypergraph regularity lemma with respect to partitions of vertices. On the one hand, we provide a complete…

This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path $P_4$ as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite…

Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…

For a family ${\mathcal F}$ of $r$-graphs, let $\mathrm{ex}(n,{\mathcal F})$ denote the maximum number of edges in an ${\mathcal F}$-free $r$-graph on $n$ vertices. Let ${\mathcal F}_r(v,e)$ denote the family of all $r$-graphs with $e$…

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…