Related papers: The Aggregation Closure is Polyhedral for Packing …
A hinged dissection of a set of polygons S is a collection of polygonal pieces hinged together at vertices that can be folded into any member of S. We present a hinged dissection of all edge-to-edge gluings of n congruent copies of a…
Absolute integral closures of general commutative unital rings are explored. All rings admit absolute integral closures, but in general they are not unique. Among the reduced rings with finitely many minimal prime ideals, finite products of…
The octagon abstract domain is a widely used numeric abstract domain expressing relational information between variables whilst being both computationally efficient and simple to implement. Each element of the domain is a system of…
If q : P -> M is a principal K-bundle over the compact manifold M, then any invariant symmetric V-valued bilinear form on the Lie algebra k of K defines a Lie algebra extension of the gauge algebra by a space of bundle-valued 1-forms modulo…
Generalised contact structures are studied from the point of view of reduced generalised complex structures, naturally incorporating non-coorientable structures as non-trivial fibering. The infinitesimal symmetries are described in detail,…
We introduce, by adopting the point of view and the tools offered by the theory of operads, a generalization on a nonnegative integer parameter $\gamma$ of diassociative algebras of Loday, called $\gamma$-pluriassociative algebras. By…
Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
We study clustering on graphs with multiple edge types. Our main motivation is that similarities between objects can be measured in many different metrics. For instance similarity between two papers can be based on common authors, where…
Dualising the construction of a polyhedral product, we introduce the notion of a polyhedral coproduct as a certain homotopy limit over the face poset of a simplicial complex. We begin a study of the basic properties of polyhedral…
An algebraic variety X is embedded to the order k via a line bundle L if the global sections of L generate all (simultaneous) jets of order k on X or if they separate all zero-dimensional subschemes of length at most k+1. Even though we…
Given a planar digraph $G$ and a positive even integer $k$, an embedding of $G$ in the plane is k-modal, if every vertex of $G$ is incident to at most $k$ pairs of consecutive edges with opposite orientations, i.e., the incoming and the…
We relate polyhedral products of topological spaces to graph products of groups. The loop homology algebras of polyhedral products are identified with the universal enveloping algebras of the Lie algebras associated with central series of…
This paper studies generalized semi-infinite programs (GSIPs) defined with polyhedral parameter sets. Assume these GSIPs are given by polynomials. We propose a new approach to solve them as a disjunctive program. This approach is based on…
Compacting orthogonal drawings is a challenging task. Usually algorithms try to compute drawings with small area or edge length while preserving the underlying orthogonal shape. We present a one-dimensional compaction algorithm that alters…
In this short note, we prove several new congruences for the overcubic partition triples function, using both elementary techniques and the theory of modular forms. These extend the recent list of such congruences given by Nayaka,…
We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software…
In this paper, we define and prove basic properties of complement polyhedral product spaces, dual complexes and polyhedral product complexes. Then we compute the universal algebra of polyhedral product complexes under certain split…
Extensions of real numbers in more than two dimensions, in particular quaternions and octonions are finding applications in physics due to the fact that they naturally capture certain symmetries of physical systems. Here it is shown that…
Scaling clustering algorithms to massive data sets is a challenging task. Recently, several successful approaches based on data summarization methods, such as coresets and sketches, were proposed. While these techniques provide provably…