Related papers: The Aggregation Closure is Polyhedral for Packing …
Projection algorithms are well known for their simplicity and flexibility in solving feasibility problems. They are particularly important in practice due to minimal requirements for software implementation and maintenance. In this work, we…
We relate the analytic spread of a module expressed as the direct sum of two submodules with the analytic spread of its components. We also study a class of submodules whose integral closure can be obtained by means of a simple computer…
Given a small polygon S, a big simple polygon B and a positive integer k, it is shown to be NP-hard to determine whether k copies of the small polygon (allowing translation and rotation) can be placed in the big polygon without overlap.…
\emph{Reductions} combine collections of input values with an associative (and usually also commutative) operator to produce either a single, or a collection of outputs. They are ubiquitous in computing, especially with big data and deep…
We study the representability of sets that admit extended formulations using mixed-integer bilevel programs. We show that feasible regions modeled by continuous bilevel constraints (with no integer variables), complementarity constraints,…
An associative algebra with a generalized derivation is called an AsGDer triple. We introduce the operad that encodes AsGDer triples, and prove it is a Koszul operad. Using its Koszul dual cooperad, we introduce the homotopy version of…
We present an algorithm that enumerates and classifies all edge-to-edge gluings of unit squares that correspond to convex polyhedra. We show that the number of such gluings of $n$ squares is polynomial in $n$, and the algorithm runs in time…
We design new tools to study variants of Total Dual Integrality. As an application, we obtain a geometric characterization of Total Dual Integrality for the case where the associated polyhedron is non-degenerate. We also give sufficient…
In this work, we show the geometric properties of a family of polyhedra obtained by folding a regular tetrahedron along regular triangular grids. Each polyhedron is identified by a pair of nonnegative integers. The polyhedron can be cut…
New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…
We consider the problem of finding embeddings of arc-like continua in the plane for which each point in a given subset is accessible. We establish that, under certain conditions on an inverse system of arcs, there exists a plane embedding…
We suggest a definition of cluster polylogarithms on an arbitrary cluster variety and classify them in type $A$. We find functional equations for multiple polylogarithms which generalize equations discovered by Abel, Kummer, and Goncharov…
In this paper, we define and prove basic properties of complement polyhedral product spaces, dual complexes and polyhedral join complexes. Then we compute the universal algebra of polyhedral join complexes under certain split conditions and…
Knowing the symmetries of a polyhedron can be very useful for the analysis of its structure as well as for practical polyhedral computations. In this note, we study symmetry groups preserving the linear, projective and combinatorial…
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set of vector values. The extended formulation is constructed by…
We describe the additive subgroups of fields which are closed with respect to taking inverses. In particular, in characteristic different from two any such subgroup is either a subfield or the kernel of the trace map of a quadratic…
We develop general foundations of topological algebra over a linearly topologized ring k in a format applicable to both formal schemes and analytic adic spaces. We are especially interested in determining exact closed tensor categories of…
Recently Schrijver's open problem, whether the Chv\'atal--Gomory closure of an irrational polytope is polyhedral was answered independently in the affirmative by Dadush, Dey, and Vielma (even for arbitrarily compact convex set) as well as…
The problem of packing boxes into a large box is often a part of a larger problem. For example in furniture supply chain applications, one needs to decide what trucks to use to transport furniture between production sites and distribution…
This paper proposes a Mixed-Integer Linear Programming approach for the Soft Graph Clustering Problem. This is the first method that simultaneously allocates membership proportion for vertices that lie in multiple clusters, and that…