相关论文: Polyhedral representation conversion up to symmetr…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in…
We generalize the notion of Monk's schema in such a way to integrate finite dimensions. This allows us to lift a plathora of deep results proved for finite dimensions to the infinite dimensional case, like the solution to problem 2.12 in…
Multiple-integral representations of the (skew-)Macdonald symmetric functions are obtained. Some bosonization schemes for the integral representations are also constructed.
We show that every orthogonal polyhedron homeomorphic to a sphere can be unfolded without overlap while using only polynomially many (orthogonal) cuts. By contrast, the best previous such result used exponentially many cuts. More precisely,…
We fully generalize a previously-developed computational geometry tool [1] to perform large-scale simulations of arbitrary two-dimensional faceted surfaces $z = h(x,y)$. Our method uses a three-component facet/edge/junction storage model,…
We give a review of modern approaches to constructing formal solutions to integrable hierarchies of mathematical physics, whose coefficients are answers to various enumerative problems. The relationship between these approaches and…
Generalized permutahedra are the polytopes obtained from the permutahedron by changing the edge lengths while preserving the edge directions, possibly identifying vertices along the way. We introduce a "lifting" construction for these…
A polyhedral convex set optimization problem is given by a set-valued objective mapping from the $n$-dimensional to the $q$-dimensional Euclidean space whose graph is a convex polyhedron. This problem can be seen as the most elementary…
Equations arising in General Relativity are usually too complicated to be solved analytically and one has to rely on numerical methods to solve sets of coupled partial differential equations. Among the possible choices, this paper focuses…
In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…
We review and compare different computational variational methods applied to a system of fourth order equations that arises as a model of cylinder buckling. We describe both the discretization and implementation, in particular how to deal…
In this paper we consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore…
The aims of this article are two-fold. First, we give a geometric characterization of the optimal basic solutions of the general linear programming problem (no compactness assumptions) and provide a simple, self-contained proof of it…
Spectral decomposition of matrices is a recurring and important task in applied mathematics, physics and engineering. Many application problems require the consideration of matrices of size three with spectral decomposition over the real…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
Considering two-body integral equations we show how they can be dimensionally reduced by integrating exactly over the azimuthal angle of the intermediate momentum. Numerical solution of the resulting equation is feasible without employing a…
We present a method for computing all the symmetries of a rational ruled surface defined by a rational parametrization which works directly in parametric rational form, i.e. without computing or making use of the implicit equation of 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…
We find a system of two polynomial equations in two unknowns, whose solution allows to give an explicit expression of the conformal representation of a simply connected three sheeted compact Riemann surface onto the extended complex plane.…