Related papers: Problems on Polytopes, Their Groups, and Realizati…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
Chapters : Old and new inequalities; Surfaces with $\chi=1$ and the bicanonical map; Surfaces with $p_g=4$; Surfaces isogeneous to a product, Beauville surfaces and the absolute Galois group;Lefschetz pencils and braid monodromies;DEF, DIFF…
We review the literature on the localization transition for the class of polymers with random potentials that goes under the name of copolymers near selective interfaces. We outline the results, sketch some of the proofs and point out the…
This paper is a survey of recent advances as well as open problems in the study of face numbers of centrally symmetric simplicial polytopes and spheres. The topics discussed range from neighborliness of centrally symmetric polytopes and the…
Recent developments of affine algebraic geometry, especially the theory of open algebraic surfaces, provide means to systematically explore geometric and topological properties of polynomials in two variables. Nevertheless, there is one…
This paper is aimed at presenting a systematic survey of the existing now different formulations for the problem of projection of the origin of the Euclidean space onto the convex polyhedron (PPOCP). In the present paper, there are…
In this text we expose basic cases of some fundamental ideas and methods of topology. Namely, of homotopy, degree, fundamental group, covering, Whitehead invariant, etc. This is done by considering the elementary example: closed polygonal…
These notes were intended as support material for a minicourse on Anosov flows in the conference "Symplectic geometry and Anosov flows'' which took place in Heidelberg in July 2024 organized by Peter Albers, Jonathan Bowden and Agust\'in…
We consider two polytopes. The quadratic assignment polytope $QAP(n)$ is the convex hull of the set of tensors $x\otimes x$, $x \in P_n$, where $P_n$ is the set of $n\times n$ permutation matrices. The second polytope is defined as follows.…
The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…
In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…
The notion of entropy appears in many fields and this paper is a survey about entropies in several branches of Mathematics. We are mainly concerned with the topological and the algebraic entropy in the context of continuous endomorphisms of…
This expository paper discusses some conjectures related to visibility and blockers for sets of points in the plane.
Some Open Problems Concerning Orthogonal Polynomials.
Opening Lecture at the Second Rencontres du Vietnam, October 21-28, 1995.
This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.
The purpose of this paper is to present some results on the existence of homologous, nonisotopic symplectic or lagrangian surfaces embedded in a simply connected symplectic 4-dimensional manifold.
This is a list of problems that were collected from participants at the Comparative Prime Number Theory Symposium held at UBC from June 17 to June 21, 2024. Its goal is to stimulate research and future collaborations in this growing field.…
These notes combine material from short lecture courses given in Paris, France, in July 2001 and in Srni, the Czech Republic, in January 2003. They discuss groups of symplectomorphisms of closed symplectic manifolds (M,\om) from various…
The Quadratic Assignment Problem (QAP) is a well-known NP-hard problem that is equivalent to optimizing a linear objective function over the QAP polytope. The QAP polytope with parameter $n$ - \qappolytope{n} - is defined as the convex hull…