Related papers: Real and complexified configuration spaces for sph…
In a recent publication it has been shown how to generate derivatives with respect to atom coordinates of Slater-Koster matrix elements for the tight binding (TB) modelling of a system. For the special case of a mixed second partial…
This paper extends graphic statics by describing the forces and moments in any 3D rigid-jointed frame structure in terms of cell complexes using homology theory of algebraic topology. Graphic statics provides a highly geometric way to…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
The Epstein deformation space parameterizes marked rational maps with prescribed combinatorial and dynamical structure. For the family of quadratic rational maps with a periodic critical cycle of order 4 and an extra critical point not…
An explicit derivation of the elements of the representation ring of SU(2) needed to implement the four-dimensional Kirby calculus is sketched.
We introduce an axiomatic theory of spherical diagrams as a tool to study certain combinatorial properties of polyhedra in $\mathbb R^3$, which are of central interest in the context of Art Gallery problems for polyhedra and other…
We consider a hierarchy of many particle systems on the line with polynomial potentials separable in parabolic coordinates. Using the Lax representation, written in terms of $2\times 2$ matrices for the whole hierarchy, we construct the…
This paper presents methodology for the computation of whole sets of heteroclinic connections between iso-energetic slices of center manifolds of center x center x saddle fixed points of autonomous Hamiltonian systems. It involves: (a)…
We suggest that the extended Lee-Friedrichs model could be directly used as a practical parametrization method for the experimental analysis of resonance structures. This parametrization incorporates the constraints of relativistic phase…
In the recent literature of Artificial Intelligence, an intensive research effort has been spent, for various algebras of qualitative relations used in the representation of temporal and spatial knowledge, on the problem of classifying the…
A realisation of a graph in the plane as a bar-joint framework is rigid if there are finitely many other realisations, up to isometries, with the same edge lengths. Each of these finitely-many realisations can be seen as a solution to a…
In this paper, we study simplicial hyperplane arrangements in real projective $3$-space. We give a necessary condition for the characteristic polynomial to have only real roots, valid also for non-simplicial arrangements. As application, we…
In this paper the complex dynamical analysis of the parametric fourth-order Kim's iterative family is made on quadratic polynomials, showing the Matlab codes generated to draw the fractal images necessary to complete the study. The…
This work concludes a series of four papers on the foundational theory of orbifolds and stacks. We apply the abstract theory, developed in its predecessors, to orbifolds derived from manifolds. Specifically, we show how the very concrete…
We describe a new method of producing equations for the canonical component of representation variety of a knot group into $PSL_2(\mathbb{C})$. Unlike known methods, this one does not involve any polyhedral decomposition or triangulation of…
We study supersolvable line arrangements in ${\mathbb P}^2$ over the reals and over the complex numbers, as the first step toward a combinatorial classification. Our main results show that a nontrivial (i.e., not a pencil or near pencil)…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
We present a review of the symbol map, a mathematical tool that can be useful in simplifying expressions among multiple polylogarithms, and recall its main properties. A recipe is given for how to obtain the symbol of a multiple…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…