Related papers: Enumeration formulas for (3, 6)-fullerenes
In this paper, we address computational questions surrounding the enumeration of non-isomorphic Andr\'e planes for any prime power order. We are particularly focused on providing a complete enumeration of all such planes for relatively…
The only open case of Vizing's conjecture that every planar graph with $\Delta\geq 6$ is a class 1 graph is $\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of…
We consider the space $F_n$ of configurations of $n$ points in $P^2$ satisfying the condition that no three of the points lie on a line. For $n = 4, 5, 6$, we compute $H^*(F_n; \mathbb{Q})$ as an $S_n$-representation. The cases $n = 5, 6$…
A spanning subgraph of a graph $G$ is called a perfect star packing in $G$ if every component of the spanning subgraph is isomorphic to the star graph $K_{1,3}$. An efficient dominating set of graph $G$ is a vertex subset $D$ of $G$ such…
A convex combination mapping of a planar graph is a plane mapping in which the external vertices are mapped to the corners of a convex polygon and every internal vertex is a proper weighted average of its neighbours. If a planar graph is…
Let K be a field of characteristic zero. We describe an algorithm which requires a homogeneous polynomial F of degree three in K[x_0,x_1,x_2,x_3] and a zero A of F in P^3_K and ensures a linear pfaffian representation of V(F) with entries…
It is classically known that complete flat surfaces in Euclidean 3-space are cylinders over space curves. This implies that the study of global behaviour of flat surfaces requires the study of singular points as well. If a flat surface $f$…
Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…
There are parallelepipeds with edge lengths, face diagonal lengths and body diagonal lengths all positive integers. In particular, there is a parallelepiped with edge lengths 271, 106, 103, minor face diagonal lengths 101, 266, 255, major…
A $3$-polytope is a $3$-connected, planar graph. It is called unigraphic if it does not share its vertex degree sequence with any other $3$-polytope, up to graph isomorphism. The classification of unigraphic $3$-polytopes appears to be a…
A planar Tangle is a smooth simple closed curve piecewise defined by quadrants of circles with constant curvature. We can enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks. The number of…
Barnette conjectured that all cubic $3$-connected plane graphs with maximum face size at most $6$ are hamiltonian. We provide a method of construction of a hamiltonian cycle (in dual terms) in an arbitrary cubic, $3$-connected plane graph…
A natural extension of Heron's 2000 year old formula for the area of a triangle to the volume of a tetrahedron is presented. This gives the fourth power of the volume as a polynomial in six simple rational functions of the areas of its four…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
A {\em $1-$vertex triangulation} of an oriented compact surface $S$ of genus $g$ is an embedded graph $T\subset S$ with a unique vertex such that all connected components of $S\setminus T$ are triangles (adjacent to exactly 3 edges of $T$).…
We consider infinite parametric families of high degree number fields composed of quadratic fields with pure cubic, pure quartic, pure sextic fields and with the so called simplest cubic, simplest quartic fields. We explicitly describe an…
We characterize the extendibility of the normal curvature on frontals and we give a representation formula of this type of frontals. Also we give representation formulas for wavefronts on all types of singularities and others sub classes of…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
Capsets are subsets of $\mathbb{F}_3^n$ with no three points on a line and a capset is complete if it is not a subset of a larger capset. We study some new constructions of capsets via algebraic equations over extensions of $\mathbb{F}_3$.…
We use theory of modular forms to give formulas for $N(1^{l_1},2^{l_2},3^{l_3},6^{l_6};n)$ for all $l_1,l_2,l_3,l_6 \in \mathbb{N}_0$, with $l_1+l_2+l_3+l_6=6$. We also apply our results to write newforms in $S_{3} (\Gamma_0 (24), \chi )$…