相关论文: Lectures on 0/1-polytopes

These five lectures collect elementary facts about 4D supersymmetric theories with emphasis on N=1 supersymmetry, as well as the basic notions of supersymmetric quantum mechanics. Contents: I. From symmetries to supersymmetry; II. Basic…

A popular method in combinatorial optimization is to express polytopes P, which may potentially have exponentially many facets, as solutions of linear programs that use few extra variables to reduce the number of constraints down to a…

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

This monograph presents a detailed analysis of hypercomplex numbers in 2, 3 and 4 dimensions, then presents the properties of hypercomplex numbers in 5 and 6 dimensions. It continues with a detailed analysis of hypercomplex numbers in n…

These notes were prepared for a series of intensive lectures delivered at Hokkaido University, Nagoya University, Kyoto University, and Kyushu University. We begin with a brief review of higher-form symmetries, anomalies, and discrete gauge…

These are notes for some introductory lectures about microstate geometries and their construction. The first lecture considers BPS black holes in four dimensions as a way to introduce what one should expect from the BPS equations. The…

We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…

The aim of this paper is to study alcoved polytopes, which are polytopes arising from affine Coxeter arrangements. This class of convex polytopes includes many classical polytopes, for example, the hypersimplices. We compare two…

Points of an orbit of a finite Coxeter group G, generated by n reflections starting from a single seed point, are considered as vertices of a polytope (G-polytope) centered at the origin of a real n-dimensional Euclidean space. A general…

Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…

Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

A method of constructing an entire function with given zeros and estimates of growth is suggested. It gives a possibility to describe zero sets of certain classes of entire functions of one and several variables in terms of growth of volume…

The expansion of a polytope is an important parameter for the analysis of the random walks on its graph. A conjecture of Mihai and Vazirani states that all $0/1$-polytopes have expansion at least 1. We show that the generalization to…

We give a combinatorial description of shape theory using finite topological $T_0$-spaces (finite partially ordered sets). This description may lead to a sort of computational shape theory. Then we introduce the notion of core for inverse…

These are a set of lecture notes on generalized global symmetries in quantum field theory. The focus is on invertible symmetries with a few comments regarding non-invertible symmetries. The main topics covered are the basics of higher-form…

We use the notions of reflexivity and of reflexive dimensions in order to introduce probability measures for lattice polytopes and initiate the investigation of their statistical properties. Examples of applications to discrete geometry…

We present an extremely elementary construction of the simple Lie algebras over the complex numbers in all of their minuscule representations, using the vertices of various polytopes. The construction itself requires no complicated…

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…