Related papers: Slicing and dicing polytopes
This book is an introduction to the nascent field of Fourier analysis on polytopes, and cones. There is a rapidly growing number of applications of these methods, so it is appropriate to invite students, as well as professionals, to the…
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…
In this paper we develop methods to extend the minimal hypersurface approach to positive scalar curvature problems to all dimensions. This includes a proof of the positive mass theorem in all dimensions without a spin assumption. It also…
Polyfold theory was developed by Hofer-Wysocki-Zehnder by finding commonalities in the analytic framework for a variety of geometric elliptic PDEs, in particular moduli spaces of pseudoholomorphic curves. It aims to systematically address…
Simple proofs of the midpoint, trapezoidal and Simpson's rules are proved for numerical integration on a compact interval. The integrand is assumed to be twice continuously differentiable for the midpoint and trapezoidal rules, and to be…
Recently, the $L_p$ dual Minkowski problem for unbounded closed convex sets in a pointed closed convex cone was proposed and a weak solution to this problem was provided. In smooth setting, this problem is equivalent to solving the…
We systematically study the moduli theory of symplectic varieties (in the sense of Beauville) which admit a resolution by an irreducible symplectic manifold. In particular, we prove an analog of Verbitsky's global Torelli theorem for the…
Fold maps are higher dimensional versions of Morse functions, which play important roles in the studies of smooth manifolds, and such general maps also have been fundamental tools in the studies of smooth manifolds by using generic maps. In…
The present paper deals with the discrete inverse problem of reconstructing binary matrices from their row and column sums under additional constraints on the number and pattern of entries in specified minors. While the classical…
This paper develops and compares algorithms to compute inner approximations of the Minkowski sum of convex polytopes. As an application, the paper considers the computation of the feasibility set of aggregations of distributed energy…
Two of the most useful tools in topological combinatorics are the nerve lemma and discrete Morse theory. In this note we introduce a theorem that interpolates between them and allows decompositions of complexes into non-contractible pieces…
A convergence theorem is proved for a class of Nystrom methods for weakly singular integral equations on surfaces in three dimensions. Fredholm equations of the second kind as arise in connection with linear elliptic boundary value problems…
We show that the multivariate generating function of appropriately normalized moments of a measure with homogeneous polynomial density supported on a compact polytope P in R^d is a rational function. Its denominator is the product of linear…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
We introduce the notion of Q-filtrable varieties: projective varieties with a torus action and a finite number of fixed points, such that the cells of the associated Bialynicki-Birula decomposition are all rationally smooth. Our main…
Can the Minkowski sum of two compact convex bodies be made smoother by rotating one of them? We construct two infinitely differentiable strictly convex plane bodies such that after any generic rotation (in the Baire category sense) of one…
We study the iterations of the procedure of taking the contact simplex. We define the concept of the root of the simplex, which is a homothety image of contact simplex with a special coefficient greater than 1. The article shows that once…
The Dushnik-Miller dimension of a poset $\le$ is the minimal number $d$ of linear extensions $\le_1, \ldots , \le_d$ of $\le$ such that $\le$ is the intersection of $\le_1, \ldots , \le_d$. Supremum sections are simplicial complexes…
Finite smooth digraphs, that is, finite directed graphs without sources and sinks, can be partially ordered via pp-constructability. We give a complete description of this poset and, in particular, we prove that it is a distributive…
We establish some existence and regularity results to the Dirichlet problem, for a class of quasilinear elliptic equations involving a partial differential operator, depending on the gradient of the solution. Our results are formulated in…