Related papers: Simplicial arrangements with up to 27 lines

We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…

We construct two combinatorially equivalent line arrangements in the complex projective plane such that the fundamental groups of their complements are not isomorphic. The proof uses a new invariant of the fundamental group of the…

We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

The Cayley--Salmon theorem implies the existence of a 27-sheeted covering space specifying lines contained in smooth cubic surfaces over $\mathbb{C}$. In this paper we compute the rational cohomology of the total space of this cover, using…

Let $G$ be a transitive permutation group on a finite set with solvable point stabiliser and assume that the solvable radical of $G$ is trivial. In 2010, Vdovin conjectured that the base size of $G$ is at most 5. Burness proved this…

A systematic construction of higher order splines using two hierarchies of polynomials is presented. Explicit instructions on how to implement one of these hierarchies are given. The results are limited to interpolations on regular,…

We introduce near triple arrays as binary row-column designs with at most two consecutive values for the replication numbers of symbols, for the intersection sizes of pairs of rows, pairs of columns and pairs of a row and a column. Near…

A global superalgebra with 32 supercharges and all possible central extensions is studied in order to extract some general properties of duality and hidden dimensions in a theory that treats $p$-branes democratically. The maximal number of…

We enumerate the singular algebraic curves in a complete linear system on a smooth projective surface. The system must be suitably ample in a rather precise sense. The curves may have up to eight nodes, or a triple point of a given type and…

We prove the existence of lattice isomorphic line arrangements having $\pi_1$-equivalent or homotopy-equivalent complements and non homeomorphic embeddings in the complex projective plane. We also provide two explicit examples, one is…

We show that a generic real projective n-dimensional hypersurface of degree 2n-1 contains "many" real lines, namely, not less than (2n-1)!!, which is approximately the square root of the number of complex lines. This estimate is based on…

We present a family of finite unit-distance graphs in the plane that are not 4-colourable, thereby improving the lower bound of the Hadwiger-Nelson problem. The smallest such graph that we have so far discovered has 1581 vertices.

A generalized Davenport-Schinzel sequence is one over a finite alphabet that contains no subsequences isomorphic to a fixed forbidden subsequence. One of the fundamental problems in this area is bounding (asymptotically) the maximum length…

We describe an linear representation for Abel-Grassmann groups. As a consequence, we obtain or improve many previous results. In particular, enumeration of Abel-Grassmann groups up to isomorphism is obtained for orders <512.

We show that in arithmetically-Gorenstein line arrangements with only planar singularities, each line intersects the same number of other lines. This number has an algebraic interpretation: it is the Castelnuovo-Mumford regularity of the…

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

A graph is hypohamiltonian if it is not Hamiltonian, but the deletion of any single vertex gives a Hamiltonian graph. Until now, the smallest known planar hypohamiltonian graph had 42 vertices, a result due to Araya and Wiener. That result…

In this paper we give full classification of rank 3 line arrangements in $\mathbb P^2$ (over a field of characteristic 0) that have a minimal logarithmic derivation of degree 3. The classification presents their defining polynomials, up to…

A linear group is called unisingular if every element of it has eigenvalue 1. A certain aspect of the theory of abelian varieties requires the knowledge of unisingular irreducible subgroups of the symplectic groups over the field of two…