Related papers: On a new (21_4) polycyclic configuration
Let G be a bridgeless cubic graph. A well-known conjecture of Berge and Fulkerson can be stated as follows: there exist five perfect matchings of G such that each edge of G is contained in at least one of them. Here, we prove that in each…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…
This paper concerns the enumeration of rotation-type and congruence-type convex polyominoes on the square lattice. These can be defined as orbits of the groups C4, of rotations, and D4, of symmetries of the square acting on (translation-…
We consider colored variants of a class of geometric-combinatorial questions on $k$-gons and empty $k$-gons that have been started around 1935 by Erd\H{o}s and Szekeres. In our setting we have $n$ points in general position in the plane,…
In 1978, Robert Kibler at the National Security Agency in Fort Meade, Maryland published a description of all noncyclic difference sets with $k < 20$. Kibler's decision to stop his extensive computer search for difference sets at block size…
We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…
M-theory geometric engineering on non-compact Calabi-Yau fourfolds (CY4) produces 3d theories with 4 supercharges. Carefully establishing a dictionary between the geometry of the CY4 and the QFT in the transverse directions remains, to a…
We discuss questions arising from the work of Schellekens. After introducing the concept of complementary representations, we examine $Z_2$-orbifold constructions in general, and propose a technique for identifying the orbifold theory…
The subdivided double construction on 4-regular graphs was used by Poto\v{c}nik and Wilson to explore semi-symmetric (edge-transitive but not vertex-transitive) graphs, and can be used to construct every semi-symmetric 4-regular graph that…
The spectrum of possible parameters of symmetric configurations is investigated. We both survey known constructions and results, and propose some new construction methods. Many new parameters are obtained, in particular for cyclic symmetric…
Many well-known problems in Combinatorics can be reduced to finding a large rainbow structure in a certain edge-coloured multigraph. Two celebrated examples of this are Ringel's tree packing conjecture and Ryser's conjecture on transversals…
We derive the component structure of 11D, $N=1/8$ supergravity linearized around eleven-dimensional Minkowski space. This theory represents 4 local supersymmetries closing onto 4 of the 11 spacetime translations without the use of equations…
We describe an algorithm to enumerate polytopes. This algorithm is then implemented to give a complete classification of combinatorial spheres of dimension 3 with 9 vertices and decide polytopality of those spheres. In particular, we…
For each nonnegative integer m we show that any closed, oriented topological four-manifold with fundamental group Z_{4m+2} and odd intersection form, with possibly seven exceptions, either admits no smooth structure or admits infinitely…
In the 60s, Micha Perles constructed a point-line arrangement in the plane on nine points, which can not be realized only by points with rational coordinates. Gr\"unbaum conjectured that Perles' construction is the smallest: any geometric…
In this, the last of three papers about $C_2$-equivariant complex quadrics, we complete the calculation of the equivariant ordinary cohomology of smooth symmetric quadrics in the cases where the fixed sets have more than two components.…
We construct two infinite families of algebraic minimal cones in $R^{n}$. The first family consists of minimal cubics given explicitly in terms of the Clifford systems. We show that the classes of congruent minimal cubics are in one to one…
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…
We introduce a rich family of generalizations of the pentagram map sharing the property that each generates an infinite configuration of points and lines with four points on each line. These systems all have a description as $Y$-mutations…