Related papers: Representation of Geometric Objects by Color
This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…
We propose a new geometrical model of matter, in which neutral atoms are modelled by compact, complex algebraic surfaces. Proton and neutron numbers are determined by a surface's Chern numbers. Equivalently, they are determined by…
In this series of papers I examine a special kind of geometric objects that can be defined in space-time --- five-dimensional tangent vectors. Similar objects exist in any other differentiable manifold, and their dimension is one unit…
We introduce an asymptotic notion of positivity in algebraic geometry that turns out to be related to some high-dimensional convex sets. The dimension of the convex sets grows with the number of birational operations. In the case of complex…
A polygonal surface in the pseudo-hyperbolic space H^(2,n) is a complete maximal surface bounded by a lightlike polygon in the Einstein universe Ein^(1,n) with finitely many vertices. In this article, we give several characterizations of…
We consider a product of three copies of infinite symmetric group and its representations spherical with respect to the diagonal subgroup. We show that such representations generate functors from a certain category of simplicial…
We explicitly construct and list all unitary superconformal multiplets, along with their index contributions, in five and six dimensions. From this data, we uncover various unifying themes in the representation theory of five- and…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
We present a new object representation, called Dense RepPoints, that utilizes a large set of points to describe an object at multiple levels, including both box level and pixel level. Techniques are proposed to efficiently process these…
A general (convex) polytope $P\subset\mathbb R^d$ and its edge-graph $G_P$ can have very distinct symmetry properties. We construct a coloring (of the vertices and edges) of the edge-graph so that the combinatorial symmetry group of the…
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…
In this paper, we discuss f- and flag-vectors of 4-dimensional convex polytopes and cellular 3-spheres. We put forward two crucial parameters of fatness and complexity: Fatness F(P) := (f_1+f_2-20)/(f_0+f_3-10) is large if there are many…
The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…
The Poincar\'e sphere is a graphical representation in a three-dimensional space for the polarization of light. Similarly, an optical element with spatially varying birefringence can be represented by a surface on a four-dimensional…
Suppose that a finite-dimensional cube is orthogonally projected onto a central section of itself by a subspace of one dimension less. Up to dimension $9$, at least one vertex is projected onto the section, but for dimension $10$ or larger,…
A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions…
The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
We give formulas for the number of representations of non negative integers by various quadratic forms. We also give evaluations in the case of sum of two cubes (cubic case) and the quintic case, as well. We introduce a class of generalized…