Related papers: The classification of football patterns

We show that convex pentagons that can generate edge-to-edge monohedral tilings of the plane can be classified into exactly eight types. Using these results, it is also proved that no single convex polygon can be an aperiodic prototile…

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex. By analogy to Steinitz's theorem characterizing the graphs of…

A spherical system is a combinatorial object, arising in the theory of wonderful varieties, defined in terms of a root system. All spherical systems can be obtained by means of some general combinatorial procedures (such as parabolic…

The availability of massive data about sports activities offers nowadays the opportunity to quantify the relation between performance and success. In this study, we analyze more than 6,000 games and 10 million events in six European leagues…

We describe the structure of the different hexagonal grids in dimension d=3, propose short notation for them, investigate the contact numbers of ball packings in these grids and share some computational results up to 200 balls, using mainly…

We obtain an explicit expression for the number of ramified coverings of the sphere by the torus with given ramification type for a small number of ramification points, and conjecture this to be true for an arbitrary number of ramification…

By the theorem of Mantel $[5]$ it is known that a graph with $n$ vertices and $\lfloor \frac{n^{2}}{4} \rfloor+1$ edges must contain a triangle. A theorem of Erd\H{o}s gives a strengthening: there are not only one, but at least…

The Berge-Fulkerson conjecture states that every bridgeless cubic graph can be covered with six perfect matchings such that each edge is covered exactly twice. An equivalent reformulation is that it's possible to find a 6-cycle 4-cover. In…

The Bier sphere $Bier(\mathcal{G}) = Bier(K) = K\ast_\Delta K^\circ$ and the canonical fan $Fan(\Gamma) = Fan(K)$ are combinatorial/geometric companions of a simple game $\mathcal{G} = (P,\Gamma)$ (equivalently the associated simplicial…

We prove that any fusion category over $\mathbb{C}$ with exactly one non-invertible simple object is spherical. Furthermore, we classify all such categories that come equipped with a braiding.

This paper shows that there are symplectic four-manifolds M with the following property: a single isotopy class of smooth embedded two-spheres in M contains infinitely many Lagrangian submanifolds, no two of which are isotopic as Lagrangian…

A countable band $B$ is called homogeneous if every isomorphism between finitely generated subbands extends to an automorphism of $B$. In this paper we give a complete classification of all the homogeneous bands. We prove that a homogeneous…

We consider proper holomorphic maps of ball complements and differences in complex euclidean spaces of dimension at least two. Such maps are always rational, which naturally leads to a related problem of classifying rational maps taking…

For any alternating knot, it is known that the double branched cover of the $3$-sphere branched over the knot is an $L$-space. We show that the three-fold cyclic branched cover is also an $L$-space for any genus one alternating knot.

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

A coloured graph is k-ultrahomogeneous if every isomorphism between two induced subgraphs of order at most k extends to an automorphism. A coloured graph is t-tuple regular if the number of vertices adjacent to every vertex in a set S of…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

We classify all products of flag varieties with finitely many orbits under the diagonal action of the general linear group. We also classify the orbits in each case and construct explicit representatives. This generalizes the classical…

We work with combinatorial maps to represent graph embeddings into surfaces up to isotopy. The surface in which the graph is embedded is left implicit in this approach. The constructions herein are proof-relevant and stated with a subset of…

We show that every heptagon is a section of a $3$-polytope with $6$ vertices. This implies that every $n$-gon with $n\geq 7$ can be obtained as a section of a $(2+\lfloor\frac{n}{7}\rfloor)$-dimensional polytope with at most…