A classical result of Erdős, Lovász and Spencer from the late 1970s asserts that the dimension of the feasible region of densities of graphs with at most k vertices in large graphs is equal to the number of non-trivial connected graphs with at most k vertices. Indecomposable permutations play the role of connected graphs in the realm of permutations, and Glebov et al. showed that pattern densities of indecomposable permutations are independent, i.e., the dimension of the feasible region of densities of permutation patterns of size at most k is at least the number of non-trivial indecomposable permutations of size at most k. However, this lower bound is not tight already for $k=3$. We prove that the dimension of the feasible region of densities of permutation patterns of size at most k is equal to the number of non-trivial Lyndon permutations of size at most k. The proof exploits an interplay between algebra and combinatorics inherent to the study of Lyndon words.

Given a self-morphism $\phi$ on a projective variety defined over a number field k, we prove two results which bound the largest iterate of $\phi$ whose evaluation at P is quasi-integral with respect to a divisor D, uniformly across P defined over a field of bounded degree over k. The first result applies when the pullback of D by some iterate of $\phi$ breaks up into enough irreducible components which are numerical multiples of each other. The proof uses Le’s algebraic-point version of a result of Ji–Yan–Yu, which is based on Schmidt subspace theorem. The second result applies more generally but relies on a deep conjecture by Vojta for algebraic points. The second result is an extension of a recent result of Matsuzawa, based on the theory of asymptotic multiplicity. Both results are generalisations of Hsia–Silverman, which treated the case of morphisms on ${\mathbb{P}}^1$.

The q-colour Ramsey number of a k-uniform hypergraph H is the minimum integer N such that any q-colouring of the complete k-uniform hypergraph on N vertices contains a monochromatic copy of H. The study of these numbers is one of the central topics in Combinatorics. In 1973, Erdős and Graham asked to maximise the Ramsey number of a graph as a function of the number of its edges. Motivated by this problem, we study the analogous question for hypergaphs. For fixed $k \ge 3$ and $q \ge 2$ we prove that the largest possible q-colour Ramsey number of a k-uniform hypergraph with m edges is at most $\mathrm{tw}_k(O(\sqrt{m})),$ where tw denotes the tower function. We also present a construction showing that this bound is tight for $q \ge 4$. This resolves a problem by Conlon, Fox and Sudakov. They previously proved the upper bound for $k \geq 4$ and the lower bound for $k=3$. Although in the graph case the tightness follows simply by considering a clique of appropriate size, for higher uniformities the construction is rather involved and is obtained by using paths in expander graphs.

Given a surface $\Sigma$ equipped with a set P of marked points, we consider the triangulations of $\Sigma$ with vertex set P. The flip-graph of $\Sigma$ is the graph whose vertices are these triangulations, and whose edges correspond to flipping arcs in these triangulations. The flip-graph of a surface appears in the study of moduli spaces and mapping class groups. We consider the number of geodesics in the flip-graph of $\Sigma$ between two triangulations as a function of their distance. We show that this number grows exponentially provided the surface has enough topology, and that in the remaining cases the growth is polynomial.

We present a construction of left braces of right nilpotency class at most two based on suitable actions of an abelian group on itself with an invariance condition. This construction allows us to recover the construction of a free right nilpotent one-generated left brace of class two.

Let $b \geqslant 3$ be an integer and C(b, D) be the set of real numbers in [0,1] whose base b expansion only consists of digits in a set $D {\subseteq} \{0,...,b-1\}$. We study how close can numbers in C(b, D) be approximated by rational numbers with denominators being powers of some integer t and obtain a zero-full law for its Hausdorff measure in several circumstances. When b and t are multiplicatively dependent, our results correct an error of Levesley, Salp and Velani (Math. Ann. 338 (2007), 97–118) and generalise their theorem. When b and t are multiplicatively independent but have the same prime divisors, we obtain a partial result on the Hausdorff measure and bounds for the Hausdorff dimension, which are close to the multiplicatively dependent case. Based on these results, several conjectures are proposed.

Let $B^{H}$ be a d-dimensional fractional Brownian motion with Hurst index $H\in(0,1)$, $f\,:\,[0,1]\longrightarrow\mathbb{R}^{d}$ a Borel function, and $E\subset[0,1]$, $F\subset\mathbb{R}^{d}$ are given Borel sets. The focus of this paper is on hitting probabilities of the non-centered Gaussian process $B^{H}+f$. It aims to highlight how each component f, E and F is involved in determining the upper and lower bounds of $\mathbb{P}\{(B^H+f)(E)\cap F\neq \emptyset \}$. When F is a singleton and f is a general measurable drift, some new estimates are obtained for the last probability by means of suitable Hausdorff measure and capacity of the graph $Gr_E(f)$. As application we deal with the issue of polarity of points for $(B^H+f)\vert_E$ (the restriction of $B^H+f$ to the subset $E\subset (0,\infty)$).