Papers › Extended Set Difference : Inverse Operation of Minkowski Summation
Extended Set Difference : Inverse Operation of Minkowski Summation
Arie Beresteanu, Behrooz Moosavi Ramezanzadeh
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper introduces the extended set difference, a generalization of the Hukuhara and generalized Hukuhara differences, defined for compact convex sets in ℝᵈ. The proposed difference guarantees existence for any pair of such sets, offering a broader framework for set arithmetic. The difference may not be necessarily unique, but we offer a bound on the variety of solutions. The definition of the extended set difference is formulated through an optimization problem, which provides a constructive approach to its computation. The paper explores the properties of this new difference, including its stability under orthogonal transformations and its robustness to perturbations of the input sets. We propose a method to compute this difference through a formulated linear optimization problem.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections