Related papers: Exact enumeration of fullerenes
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
A ball polyhedron is the intersection of a finite number of closed balls in $\mathbb{R}^3$ with the same radius. In this note, we study ball polyhedra in which the set of centers defining the balls have the maximum possible number of…
A ballean $\mathcal{B}$ (or a coarse structure) on a set $X$ is a family of subsets of $X$ called balls (or entourages of the diagonal in $X\times X$) defined in such a way that $\mathcal{B}$ can be considered as the asymptotic counterpart…
For an arbitrary polygon consider a new one by joining the centres of consecutive edges. Iteration of this procedure leads to a shape which is affine equivalent to a regular polygon. This regularisation effect is usually ascribed to Count…
A triangular form is defined to be an integer-valued quadratic polynomial of the form $a_1P_3(x_1)+a_2P_3(x_2)+\cdots+a_kP_3(x_k)$ where $a_i's$ are positive integers and $P_3(x)=x(x+1)/2$. A triangular form is called regular if it…
A chain is an ordering of the integers 1 to n such that adjacent pairs have sums of a particular form, such as squares, cubes, triangular numbers, pentagonal numbers, or Fibonacci numbers. For example 4 1 2 3 5 form a Fibonacci chain while…
The triangulations of a regular convex polygon are enumerated according to the number of diagonals parallel to a fixed edge. The enumeration uses the Shapiro convolution identity, as well as an interpretation of this identity in terms of…
We study two notions. One is that of spindle convexity. A set of circumradius not greater than one is spindle convex if, for any pair of its points, it contains every short circular arc of radius at least one, connecting them. The other…
We review the Fourier-Laguerre transform, an alternative harmonic analysis on the three-dimensional ball to the usual Fourier-Bessel transform. The Fourier-Laguerre transform exhibits an exact quadrature rule and thus leads to a sampling…
Given a complete Heyting algebra we construct an algebraic tensor triangulated category whose Bousfield lattice is the Booleanization of the given Heyting algebra. As a consequence we deduce that any complete Boolean algebra is the…
It is conjectured that every fullerene graph is hamiltonian. Jendrol' and Owens proved [J. Math. Chem. 18 (1995), pp. 83--90] that every fullerene graph on n vertices has a cycle of length at least 4n/5. In this paper, we improve this bound…
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…
We investigate the formation of fullerene-like structures from hot Carbon gas using classical molecular dynamics, employing Brenner's potential. In particular we examine the influence of different annealing strategies on fullerene yield,…
We study the well-known problem of combinatorial classification of fullerenes. By a (mathematical) fullerene we mean a convex simple three dimensional polytope with all facets pentagons and hexagons. We analyse approaches of construction of…
A simple graph is called triangular if every edge of it belongs to a triangle. We conjecture that any graphical degree sequence all terms of which are greater than or equal to 4 has a triangular realisation, and establish this conjecture…
We study the set of lines that meet a fixed line and are tangent to two spheres and classify the configurations consisting of a single line and three spheres for which there are infinitely many lines tangent to the three spheres that also…
The Clar number of a fullerene is the maximum number of independent resonant hexagons in the fullerene. It is known that the Clar number of a fullerene with n vertices is bounded above by [n/6]-2. We find that there are no fullerenes whose…
A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…
A pseudo-triangle is a simple polygon with three convex vertices, and a pseudo-triangulation is a face-to-face tiling of a planar region into pseudo-triangles. Pseudo-triangulations appear as data structures in computational geometry, as…
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…