Related papers: Explicit construction of spherical $5$- and $7$-de…
In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…
The authors present SHarmonic, a new implementation of the spherical harmonics targeted for electronic-structure calculations. Their approach is to use explicit formulas for the harmonics written in terms of normalized Cartesian…
In this note we discuss some aspects of the frame formulation of conformal higher spins in three dimensions. We give some exact formulae for the coupled spin two - spin three part of the full higher spin theory and propose a star product…
We explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only 5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or polytopal) with only 5- and 6-gonal 2-faces. First,…
In this paper, we present a method to efficiently generate large, free, and guaranteed convex space among arbitrarily cluttered obstacles. Our method operates directly on point clouds, avoids expensive calculations, and processes thousands…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We construct new families of direct serendipity and direct mixed finite elements on general planer convex polygons that are $H^1$ and $H(div)$ conforming, respectively, and possess optimal order of accuracy for any order. They have a…
We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume. This construction can be used either to efficiently "simplify a complicated space" by realizing it…
Evidence is presented to suggest that, in three dimensions, spherical 6-designs with N points exist for N=24, 26, >= 28; 7-designs for N=24, 30, 32, 34, >= 36; 8-designs for N=36, 40, 42, >= 44; 9-designs for N=48, 50, 52, >= 54; 10-designs…
Determining the number of (complex) realisations of a rigid graph for a specific choice of edge lengths is a fundamental problem in discrete geometry. In this article we provide two new tools for determining realisation numbers in arbitrary…
Inversive geometry can be used to generate exactly self-similar space-filling sphere packings. We present a construction method in two dimensions and generalize it to search for packings in higher dimensions. We newly discover 29…
Blending schemes based on circles provide smooth `fair' interpolations between series of points. Here we demonstrate a simple, robust set of algorithms for performing circle blends for a range of cases. An arbitrary level of G-continuity…
We will first clarify the loop group formulations for both hyperbolic and elliptic definite affine spheres in R^3. Then we classify the rational elements with 3 poles or 6 poles in a real twisted loop group, and compute dressing actions of…
Any simple elliptic singularity of type $\tilde{D}_5$ can be obtained by taking the intersection of the nilpotent variety and the 4-dimensional "good slices" in the semi-simple Lie algebra ${\frak sl}(2, {\mathbb C}) \oplus {\frak sl}(2,…
The dimension of a block design is the maximum positive integer $d$ such that any $d$ of its points are contained in a proper subdesign. Pairwise balanced designs PBD$(v,K)$ have dimension at least two as long as not all points are on the…
The concept of spherical $t$-design, which is a finite subset of the unit sphere, was introduced by Delsarte-Goethals-Seidel (1977). The concept of Euclidean $t$-design, which is a two step generalization of spherical design in the sense…
Given a finite subset of a sphere or projective space, known as a design, we can compute the strength and angle set of that design. When the strength and angle set meet certain bounds, the design is called tight. Hoggar sought to prove…
Many remarkably robust, rapid and spontaneous self-assembly phenomena in nature can be modeled geometrically starting from a collection of rigid bunches of spheres. This paper highlights the role of symmetry in sphere-based assembly…
This paper introduces cutting planes that involve minimal structural assumptions, enabling the generation of strong polyhedral relaxations for a broad class of problems. We consider valid inequalities for the set $S\cap P$, where $S$ is a…
Let $p$ be an odd prime. In this paper we provide a construction which gives four non-Schurian association schemes for every $p\geq 5$ and two for $p=3$. This construction is explained using incidences between points and lines of a biaffine…