相关论文: Lectures on 0/1-polytopes
The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…
Choose a polynomial in three variables with not more than three or four monomials of moderate degree. Take simple coefficients as 1 and -1. Then draw a picture of the solution variety in real three space using a ray-tracing program like…
Lecture 1 provides an introduction to dynamical electroweak symmetry breaking. Lectures 2 and 3 give an introduction to compositeness, with emphasis on effective lagrangians, power-counting, and the 't Hooft anomaly-matching conditions.
These lectures on supersymmetry and extra dimensions are aimed at finishing undergraduate and beginning postgraduate students with a background in quantum field theory and group theory. Basic knowledge in general relativity might be…
We propose to take a look at a new approach to the study of integral polyhedra. The main idea is to give an integral representation, or matrix model representation, for the key combinatorial characteristics of integral polytopes. Based on…
These notes contain part of the lectures of an introductory course on orthogonal polynomials and special functions that I gave in the joint PhD Program in Mathematics UC|UP in the academic years 2015-2016 (at University of Porto) and…
While faces of a polytope form a well structured lattice, in which faces of each possible dimension are present, this is not true for general compact convex sets. We address the question of what dimensional patterns are possible for the…
A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
We explain the notion of the {\em entropy} of a discrete random variable, and derive some of its basic properties. We then show through examples how entropy can be useful as a combinatorial enumeration tool. We end with a few open…
This is an article contributed to the Brill Festschrift, in honor of the 60th birthday of Prof. D.R. Brill, which will appear in the Vol.2 of the Proceedings of the International Symposia on Directions in General Relativity. In this article…
The (combinatorial) diameter of a polytope $P \subseteq \mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
We study the existence and structure of $d$-polytopes for which the number $f_1$ of edges is small compared to the number $f_0$ of vertices. Our results are more elegantly expressed in terms of the excess degree of the polytope, defined as…
We study point particles in 2+1 dimensional first order gravity using a triangulation to fix the connection and frame-field. The Hamiltonian is reduced to a boundary term which yields the total mass. The triangulation is dynamical with…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…
We study the question of when 0-1 polytopes are normal or, equivalently, having the integer decomposition property. In particular, we shall associate to each 0-1 polytope a labeled hypergraph, and examine the equality between its Ehrhart…
We propose a new contact relation between polytopes. Intuitively, we say that two polytopes are in strong contact if a small enough object can pass from one of them to the other while remaining in their union. In the first half of the paper…