Related papers: Lectures on 0/1-polytopes
This paper is an introductory and informal exposition on the topology of polygonal meshes. We begin with a broad overview of topological notions and discuss how homeomorphisms, homotopy, and homology can be used to characterise topology. We…
Polytope complexes are the generalisation of polygon meshes in geo-information systems (GIS) to arbitrary dimension, and a natural concept for accessing spatio-temporal information. Complexes of each dimension have a straight-forward…
This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…
Basic concepts of higher local fields and topologies on their additive and multiplicative groups are introduced.
A \emph{fractal} is an object exhibiting complexity at arbitrarily small scales. In order to study and characterise fractals, one is often interested in quantifying how they fill up space on small scales. This gives rise to various notions…
We develop theory concerning non-uniform complexity in a setting in which the notion of single-pass instruction sequence considered in program algebra is the central notion. We define counterparts of the complexity classes P/poly and…
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…
This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.
In these lectures I will discuss the following topics: (1) Twistors in 4 flat dimensions: Massless particles; constrained phase space (x,p) versus twistors; Physical states in twistor space. (2) Introduction to 2T-physics and derivation of…
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are,…
This article is an exposition of recent results on self-similar sets, asserting that if the dimension is smaller than the trivial upper bound then there are almost overlaps between cylinders. We give a heuristic derivation of the theorem…
Over the past two decades polymer nanocomposites have received tremendous interest from industry and academia due to their advanced properties comparative to polymer blends. Many computational studies have revealed that the macroscopic…
These lecture notes provide a self-contained introduction to Euler integrals, which are frequently encountered in applications. In particle physics, they arise as Feynman integrals or string amplitudes. Our four selected topics demonstrate…
An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
We generalize the construction of connected branched polymers and the notion of the volume of the space of connected branched polymers studied by Brydges and Imbrie, and Kenyon and Winkler to any hyperplane arrangement A. The volume of the…
We consider the lowest--degree nonconforming finite element methods for the approximation of elliptic problems in high dimensions. The $P_1$--nonconforming polyhedral finite element is introduced for any high dimension. Our finite element…
Using combinatorial methods, we derive several formulas for the volume of convex bodies obtained by intersecting a unit hypercube with a halfspace, or with a hyperplane of codimension 1, or with a flat defined by two parallel hyperplanes.…