Related papers: The Aggregation Closure is Polyhedral for Packing …
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
Convex clustering is an attractive clustering algorithm with favorable properties such as efficiency and optimality owing to its convex formulation. It is thought to generalize both k-means clustering and agglomerative clustering. However,…
Closure operations such as tight and integral closure and test ideals have appeared frequently in the study of commutative algebra. This articles serves as a survey of the authors' prior results connecting closure operations, test ideals,…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
Let k be an algebraically closed field of characteristic p>0 and let G be a symplectic or general linear group over k. We consider induced modules for G under the assumption that p is bigger than the greatest hook length in the partitions…
Several constructive homological methods based on noncommutative Gr\"obner bases are known to compute free resolutions of associative algebras. In particular, these methods relate the Koszul property for an associative algebra to the…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
Clustering is a fundamental task in unsupervised learning. Previous research has focused on learning-augmented $k$-means in Euclidean metrics, limiting its applicability to complex data representations. In this paper, we generalize…
The Permutation Equivalence Problem (PEP) for linear codes is a fundamental problem in coding theory and cryptography. A recent reduction shows that PEP for Linear Complementary Dual (LCD) codes reduces to Graph Isomorphism (GI) via…
We consider a notion of relative homology (and cohomology) for surfaces with two types of boundaries. Using this tool, we study a generalization of Kitaev's code based on surfaces with mixed boundaries. This construction includes both…
The at-most-k constraint is ubiquitous in combinatorial problems, and numerous SAT encodings are available for the constraint. Prior experiments have shown the competitiveness of the sequential-counter encoding for k $>$ 1, and have…
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear programs or to leave degenerate vertices while running the…
In 2011, Dyer published a series of conjectures on the weak order of Coxeter groups. One of these conjectures stated that the inversion set of the join of two elements in a Coxeter group is equal to some "closure" of the union of their…
We introduce and study a $K$-theory of twisted bundles for associative algebras $A(\mathfrak g)$ of formal series with an infinite-Lie algebra coefficients over arbitrary compact topological spaces. Fibers of such bundles are given by…
Number Decision Diagrams (NDD) provide a natural finite symbolic representation for regular set of integer vectors encoded as strings of digit vectors (least or most significant digit first). The convex hull of the set of vectors…
We study the closure of the convex hull of a compact set in a complete CAT(0) space. First we give characterization results in terms of compact sets and the closure of their convex hulls for locally compact CAT(0) spaces that are either…
I characterize the combinatorially complete pargoids (partial applicative systems) by expandability with two constants that satisfy the well-known identities. An example shows that this class contains more than just the reducts of partial…
Multi-component aggregates are being intensively researched in various fields because of their highly tunable properties and wide applications. Due to the complex configurational space of these systems, research would greatly benefit from a…
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…