Related papers: On a new (21_4) polycyclic configuration
The colourful simplicial depth conjecture states that any point in the convex hull of each of d+1 sets, or colours, of d+1 points in general position in R^d is contained in at least d^2+1 simplices with one vertex from each set. We verify…
Multi-Higgs models equipped with global symmetry groups, either exact or softly broken, offer a rich framework for constructions beyond the Standard Model and lead to remarkable phenomenological consequences. Knowing all the symmetry…
For planar graphs, it is well known that high connectivity implies a Hamiltonian cycle and hence any 4-connected planar graph has a near-perfect matching. Nevertheless, whether 6-connected 1-planar graphs admit near-perfect matchings…
Brehm and K\"uhnel (1992) constructed three 15-vertex combinatorial 8-manifolds `like the quaternionic projective plane' with symmetry groups $\mathrm{A}_5$, $\mathrm{A}_4$, and $\mathrm{S}_3$, respectively. Gorodkov (2016) proved that…
A subclassification of stationary spacetimes, endowed with one timelike and one spacelike Killing vectors, i.e., Petrov $G{_2}I$ on $T_2$ spaces, is proposed. Special attention deserves the Collison's theorem [1] and the branch of metrics…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
A famous configuration of 27 lines on a non-singular cubic surface in $\mathbb P^3$ contains remarkable subconfigurations, and in particular the ones formed by six pairwise disjoint lines. We study such six-line configurations in the case…
We show that a system of four particles in a one-dimensional box with a two-particle harmonic interaction can by described by means of the symmetry point group $O_h$. Group theory proves useful for the discussion of both the small-box and…
We apply combinatorial methods to a geometric problem: the classification of polytopes, in terms of Minkowski decomposability. Various properties of skeletons of polytopes are exhibited, each sufficient to guarantee indecomposability of a…
We describe a construction for d-polytopes generalising the well known stacking operation. The construction is applied to produce 2-simplicial and 2-simple 4-polytopes with g_2=0 on any number of n >= 13 vertices. In particular, this…
An old problem in discrete geometry, originating with Kupitz, asks whether there is a fixed natural number $k$ such that every finite set of points in the plane has a line through at least two of its points where the number of points on…
We consider arrangements of axis-aligned rectangles in the plane. A geometric arrangement specifies the coordinates of all rectangles, while a combinatorial arrangement specifies only the respective intersection type in which each pair of…
The paper is devoted to the study of combinatorial determinacy properties of a family of substitution complexes consisting of quadrilaterals glued side-to-side with each other. These properties are useful in constructing algebraic…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
To any two-dimensional rational plane in four-dimensional space one can naturally attach a point in the Grassmannian Gr(2,4) and four lattices of rank two. Here, the first two lattices originate from the plane and its orthogonal complement…
A linear $r$-uniform hypergraph is called acycilc if it can be constructed starting from one single edge then at each step adding a new edge that intersect the union of the vertices of the previous edges in at most one vertex. Recently,…
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of…
We complete the classification of almost commutative geometries from a particle physics point of view given in hep-th/0312276. Four missing Krajewski diagrams will be presented after a short introduction into irreducible, non-degenerate…
We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…
The satisfactory development of Quaternionic Analysis has indicated new solutions for physical and mathematical problems. It is worth mentioning the fact that quaternions possess four dimensions, and in this way they may be considered as…