Related papers: Characterization of the Split Closure via Geometri…
We present a new formula for the coaction of a large class of integrals. When applied to one-loop (cut) Feynman integrals, it can be given a diagrammatic representation purely in terms of pinches and cuts of the edges of the graph. The…
We determine the information-theoretic cutoff value on separation of cluster centers for exact recovery of cluster labels in a $K$-component Gaussian mixture model with equal cluster sizes. Moreover, we show that a semidefinite programming…
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free…
In [SIAM J. Optim., 2022], the authors introduced a new linear programming (LP) relaxation for K-means clustering. In this paper, we further investigate both theoretical and computational properties of this relaxation. As evident from our…
In this paper, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give the integer hull of the…
Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…
We study the uniqueness of minimal liftings of cut-generating functions obtained from maximal lattice-free polyhedra. We prove a basic invariance property of unique minimal liftings for general maximal lattice-free polyhedra. This…
Using a generalized cut vertex expansion we introduce the concept of an extended fracture function for the description of semi-inclusive deep inelastic processes in the target fragmentation region. Extended fracture functions are shown to…
We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…
We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and Camp\^{e}lo. In contrast to existing cut-generating…
We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Koenemann et al. [Math. Programming, 2009]. Specifically, we are interested in proving upper bounds on the…
Let $A$ be a $k$-algebra where $k$ is an algebraically closed field and $G$ be a finite abelian group for which the characteristic of $k$ does not divide $|G|$. If $G$ acts on $A$ by $k$-algebra automorphisms then the action induces a…
We study cut algebras which are toric rings associated to graphs. The key idea is to consider suitable retracts to understand algebraic properties and invariants of such algebras like being a complete intersection, having a linear…
We consider mixed integer linear sets defined by two equations involving two integer variables and any number of non-negative continuous variables. The non-trivial valid inequalities of such sets can be classified into split, type 1, type…
We present a novel relaxation framework for general mixed-integer nonlinear programming (MINLP) grounded in computational geometry. Our approach constructs polyhedral relaxations by convexifying finite sets of strategically chosen points,…
We study the parameterized complexity of Split Contraction and Threshold Contraction. In these problems we are given a graph G and an integer k and asked whether G can be modified into a split graph or a threshold graph, respectively, by…
We report a computational study of cutting plane algorithms for multi-stage stochastic mixed-integer programming models with the following cuts: (i) Benders', (ii) Integer L-shaped, and (iii) Lagrangian cuts. We first show that Integer…
We provide isomorphism results for Hopf algebras that are obtained as graded twistings of function algebras on finite groups by cocentral actions of cyclic groups. More generally , we also consider the isomorphism problem for…
Scattering amplitudes at loop level can be reduced to a basis of linearly independent Feynman integrals. The integral coefficients are extracted from generalized unitarity cuts which define algebraic varieties. The topology of an algebraic…
This paper introduces a concrete relation between genus zero closed Gromov-Witten invariants of Calabi-Yau threefolds and genus zero open Gromov-Witten invariants of a Lagrangian $A$-brane in the same threefold. Symplectic cutting is a…