Related papers: Tessellations
In this paper, we introduce the Grassmann tensor by tensor product of vectors and some basic terminology in tensor theory. Some basic properties of the Grassmann tensors are investigated and the tensor language is used to rewrite some…
We study the geometric structure of Poncelet $n$-gons from a projective point of view. In particular we present explicit constructions of Poncelet $n$-gons for certain $n$ and derive algebraic characterisations in terms of bracket…
The generalized projection-tensor geometry introduced in an earlier paper is extended. A compact notation for families of projected objects is introduced and used to summarize the results of the previous paper and obtain fully projected…
There is a very extensive literature dealing with convex polytopes from the standpoints of combinatorics and numerical analysis. By contrast, the current paper adopts an alternative viewpoint that regards a polytope as an autonomous space…
We give a brief introduction to tensor triangulated geometry, a brief introduction to various motivic categories, and then make some observations about the conjectural structure of the tensor triangulated spectrum of the Morel-Voevodsky…
In the first part we review some topological and algebraic aspects in the theory of Artin and Coxeter groups, both in the finite and infinite case (but still, finitely generated). In the following parts, among other things, we compute the…
A new generalisation of the notion of space, called "vectoid", is suggested in this work. Basic definitions, examples and properties are presented, as well as a construction of direct product of vectoids. Proofs of more complicated…
Tensors are multidimensional arrays of numerical values and therefore generalize matrices to multiple dimensions. While tensors first emerged in the psychometrics community in the $20^{\text{th}}$ century, they have since then spread to…
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an \emph{introduction} and \emph{invitation}. Rather than heading for an extensive survey on 0/1-polytopes I present some interesting aspects of these objects;…
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on…
A new and extensive formalism is developed for monads and galaxies in non-standard enlargements. It is shown that monads and galaxies can be manipulated using order-preserving and order-reversing set-to-set maps, and that set properties…
Guided by the ideas of chirality in the abstract polytope theory, the present paper aims to extend the concept to a more general setting of incidence geometries. The purpose of this paper is to explore the more general framework of thin…
We describe in this note a torsor structure arising on the affine scheme defined by a system of rationnal algebraic relations between polyzetas at roots of unity (values of hyperlogarithmic functions on a fixed finite group of complex roots…
There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…
We expand the basic geometric elements of the simplex method to linear programs in locally convex topological vector spaces and provide conditions under which the method converges in value to optimality. This setting generalizes many…
We associate a homotopy Poisson-n algebra to any higher symplectic structure, which generalizes the common symplectic Poisson algebra of smooth functions. This provides robust n-plectic prequantum data for most approaches to quantization.…
We define a family of convex polytopes called constrainahedra, which index collisions of horizontal and vertical lines. Our construction proceeds by first defining a poset $C(m,n)$ of good rectangular preorders, then proving that $C(m,n)$…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
In this short note we discuss the interplay between finite Coxeter groups and construction of wavelet sets, generalized multiresolution analysis and sampling.
Kazhdan-Lusztig-Stanley polynomials are a combinatorial generalization of Kazhdan-Lusztig polynomials of for Coxeter groups that include g-polynomials of polytopes and Kazhdan-Lusztig polynomials of matroids. In the cases of Weyl groups,…