Lipschitz saturation of toric singularities is characterized by a semigroup with a finite algorithm using Newton polyhedra and lattice conditions, differing from presaturation in dimensions greater than two.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.
citing papers explorer
-
Lipschitz saturation of toric singularities in any dimension
Lipschitz saturation of toric singularities is characterized by a semigroup with a finite algorithm using Newton polyhedra and lattice conditions, differing from presaturation in dimensions greater than two.
-
Semidefinite programming bounds on fractional cut-cover and maximum 2-SAT for highly regular graphs
SDP techniques bound fractional cut-cover and MAX 2-SAT on association scheme graphs and distance-regular graphs, extending Goemans-Williamson equality cases and computing gauge duals.