Related papers: Clean tangled clutters, simplices, and projective …
Let $\mathcal{C}$ be a clutter with a perfect matching $e_1,...,e_g$ of K\"onig type and let $\Delta_\mathcal{C}$ be the Stanley-Reisner complex of the edge ideal of $\mathcal{C}$. If all c-minors of $\mathcal{C}$ have a free vertex and…
In this brief note, we prove a min-min equality for a clean tangled clutter, that the rainbow covering number is equal to the connectivity of its setcore.
We consider the following conjecture proposed by Cornu\'ejols, Guenin and Margot: every ideal minimally non-packing clutter has a transversal of size 2. For a clutter C, the tilde clutter is the set of hyperedges of C which intersect any…
Each (equigenerated) squarefree monomial ideal in the polynomial ring $S=\mathbb{K}[x_1, \ldots, x_n]$ represents a family of subsets of $[n]$, called a (uniform) clutter. In this paper, we introduce a class of uniform clutters, called…
Given an ideal $\mathcal{I}$ on $\omega$ and a sequence $x$ in a topological vector space, we let the $\mathcal{I}$-core of $x$ be the least closed convex set containing $\{x_n: n \notin I\}$ for all $I \in \mathcal{I}$. We show two…
A clutter consists of a finite set and a collection of pairwise incomparable subsets. Clutters are natural generalisations of matroids, and they have similar operations of deletion and contraction. We introduce a notion of connectivity for…
A centrally symmetric convex body is a convex compact set with non-empty interior that is symmetric about the origin. Of particular interest are those that are both smooth and strictly convex -- known here as regular symmetric bodies --…
Take a prime power $q$, an integer $n\geq 2$, and a coordinate subspace $S\subseteq GF(q)^n$ over the Galois field $GF(q)$. One can associate with $S$ an $n$-partite $n$-uniform clutter $\mathcal{C}$, where every part has size $q$ and there…
If C is a clutter with n vertices and q edges whose clutter matrix has column vectors V={v1,...,vq}, we call C an Ehrhart clutter if {(v1,1),...,(vq,1)} is a Hilbert basis. Letting A(P) be the Ehrhart ring of P=conv(V), we are able to show…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
The interior hull of a lattice polygon is the convex closure of the lattice points in the interior of the polygon. In this paper we give a concrete description of the interior hull of a clean lattice parallelogram. A clean parallelogram in…
The geometrical features of the (non-convex) loss landscape of neural network models are crucial in ensuring successful optimization and, most importantly, the capability to generalize well. While minimizers' flatness consistently…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
Suppose that the set ${\mathcal{T}}= \{T_1, T_2,...,T_q \} $ of real $n\times n$ matrices has joint spectral radius less than $1$. Then for any digit set $ D= \{d_1, \cdots, d_q\} \subset {\Bbb R}^n$, there exists a unique nonempty compact…
Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…
A clean lattice tetrahedron is a non-degenerate tetrahedron with the property that the only lattice points on its boundary are its vertices. We present some new proofs of old results and some new results on clean lattice tetrahedra, with an…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
Symbolic and graphical tools, such as Mathematica, enable precise visualization and analysis of void spaces in sphere packings. In the cubic close packing (CCP, or face-centred cubic packing; FCC) arrangement these voids can be partitioned…
A packing of translates of a convex body in the $d$-dimensional Euclidean space $\mathbb{E}^d$ is said to be totally separable if any two packing elements can be separated by a hyperplane of $\mathbb{E}^{d}$ disjoint from the interior of…
In their paper about a dual of MacMahon's classical theorem on plane partitions, Ciucu and Krattenthaler proved a closed form product formula for the tiling number of a hexagon with a "shamrock", a union of four adjacent triangles, removed…