Related papers: On Heron Simplices and Integer Embedding
A reformulation of the three circles theorem of Johnson with distance coordinates to the vertices of a triangle is explicitly represented in a polynomial system and solved by symbolic computation. A similar polynomial system in distance…
A Heron quadrilateral is a cyclic quadrilateral whose area and side lengths are rational. In this work, we establish a correspondence between Heron quadrilaterals and a family of elliptic curves of the form $y^2 = x3+/alpha x^2-n^2x.$ This…
The tetrahedron equation arises as a generalization of the famous Yang--Baxter equation to the 2+1-dimensional quantum field theory and the 3-dimensional statistical mechanics. Very little is still known about its solutions. Here a…
Vacuum Einstein theory in three spacetime dimensions is locally trivial, but admits many solutions that are globally different, particularly if there is a negative cosmological constant. The classical theory of such locally "anti-de Sitter"…
Tetrahedron equation is a three dimensional analogue of the Yang-Baxter equation. It allows a formulation in terms of the Coxeter group $A_3$. This short note includes miscellaneous remarks on the generalizations along $B_3, C_3, F_4$ and…
How should you choose a good set of (say) 48 planes in four dimensions? More generally, how do you find packings in Grassmannian spaces? In this article I give a brief introduction to the work that I have been doing on this problem in…
Some aspects of the geometry of superembeddings and its application to supersymmetric extended objects are discussed. In particular, the embeddings of (3|16) and (6|16) dimensional superspaces into (11|32) dimensional superspace,…
A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular but "fails geometric regularity by a factor of 2"; its combinatorial automorphism group is flag-transitive but its geometric…
Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…
In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.
We investigate the space of simplices in Euclidean Space
For a set $X$ of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with $X$ is called the relaxation complexity $\mathrm{rc}(X)$. This parameter was introduced by Kaibel &…
This paper addresses two problems needed to support four-dimensional ($3d + t$) spacetime numerical simulations. The first contribution is a general algorithm for producing conforming spacetime meshes of moving geometries. Here, the surface…
Some new properties of symmetries that disappear as point symmetries after the first reduction of order of an ODE and reappear after the second are analyzed from the aspect of three-dimensional subalgebra of symmetries of differential…
The sample range of uniform random points $X_1, \dots , X_n$ chosen in a given convex set is the convex hull ${\rm conv}[X_1, \dots, X_n]$. It is shown that in dimension three the expected volume of the sample range is not monotone with…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
We study intersection of two polyhedral spheres without self-intersections in 3-space. We find necessary and sufficient conditions on sequences x = x_1,x_2,...,x_n, y = y_1,y_2,...,y_n of positive integers, for existence of 2-dimensional…
A major factor contributing to the success of modern representation learning is the ease of performing various vector operations. Recently, objects with geometric structures (eg. distributions, complex or hyperbolic vectors, or regions such…
This work is motivated by two problems: 1) The approach of manifolds and spaces by triangulations. 2) The complexity growth in sequences of polyhedra. Considering both problems as related, new criteria and methods for approximating smooth…
In this article we explore a symplectic packing problem where the targets and domains are $2n$-dimensional symplectic manifolds. We work in the context where the manifolds have first homology group equal to $\mathbb{Z}^n$, and we require…