Related papers: Several examples of neigbourly polyhedra in co-dim…
The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…
We consider compact hyperbolic Coxeter polytopes whose Coxeter diagram contains a unique dotted edge. We prove that such a polytope in d-dimensional hyperbolic space has at most d+3 facets. In view of results of Lann\'er, Kaplinskaja,…
In this paper, we make use of the relations between the braid and mapping class groups of a compact, connected, non-orientable surface N without boundary and those of its orientable double covering S to study embeddings of these groups and…
A $\textit{regular polygon surface}$ $M$ is a surface graph $(\Sigma, \Gamma)$ together with a continuous map $\psi$ from $\Sigma$ into Euclidean 3-space which maps faces to regular Euclidean polygons. When $\Sigma$ is homeomorphic to the…
We derive a formula for the generating function of d-irreducible bipartite planar maps with several boundaries, i.e. having several marked faces of controlled degrees. It extends a formula due to Collet and Fusy for the case of arbitrary…
We introduce polyhedral cones associated with $m$-hemimetrics on $n$ points, and, in particular, with $m$-hemimetrics coming from partitions of an $n$-set into $m+1$ blocks. We compute generators and facets of the cones for small values of…
Vertex algebras in higher dimensions correspond to models of quantum field theory with global conformal invariance. Any vertex algebra in dimension D admits a restriction to a vertex algebra in any lower dimension and, in particular, to…
We prove that every three-dimensional polyhedron is uniquely determined by its dihedral angles and edge lengths, even if nonconvex or self-intersecting, under two plausible sufficient conditions: (i) the polyhedron has only convex faces and…
A four dimensional non-trivial extension of the Poincar\'e algebra different from supersymmetry is explicitly studied. Representation theory is investigated and an invariant Lagrangian is exhibited. Some discussion on the Noether theorem is…
Closed form expressions for a logarithm of general multivector (MV) in base-free form in real geometric algebras (GAs) Cl(p,q) are presented for all n=p+q=3. In contrast to logarithm of complex numbers (isomorphic to Cl(0,1), 3D logarithmic…
We define a centrally symmetric analogue of the cyclic polytope and study its facial structure. We conjecture that our polytopes provide asymptotically the largest number of faces in all dimensions among all centrally symmetric polytopes…
The geography problem is usually stated for simply connected symplectic 4-manifolds. When the first cohomology is nontrivial, however, one can restate the problem taking into account how close the symplectic manifold is to satisfying the…
The prism over a graph $G$ is the Cartesian product of $G$ with the complete graph on two vertices. A graph $G$ is prism-hamiltonian if the prism over $G$ is hamiltonian. We prove that every polyhedral graph (i.e. 3-connected planar graph)…
We develop a geometric procedure for finding the Ap\'ery set of any numerical semigroup with embedding dimension four. Previous methods of comparable strength worked only for embedding dimension three or under very specific conditions. We…
A combinatorial theorem on families of disjoint sub-boxes of a discrete cube, which implies that there at most $2^{d+1}-2$ neighbourly simplices in $\mathbb R^d$, is presented.
An i-hedrite is a 4-regular plane graph with faces of size 2, 3 and 4. We do a short survey of their known properties and explain some new algorithms that allow their efficient enumeration. Using this we give the symmetry groups of all…
We introduce and study a new graph representation where vertices are embedded in three or more dimensions, and in which the edges are drawn on the projections onto the axis-parallel planes. We show that the complete graph on $n$ vertices…
The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…
We prove that every $n$-vertex complete simple topological graph generates at least $\Omega(n)$ pairwise disjoint $4$-faces. This improves upon a recent result by Hubard and Suk. As an immediate corollary, every $n$-vertex complete simple…
We study the geometric structure of Poncelet $n$-gons from a projective point of view. In particular we present explicit constructions of Poncelet $n$-gons for certain $n$ and derive algebraic characterisations in terms of bracket…