3 research outputs found
On the Complexity of Hilbert Refutations for Partition
Given a set of integers W, the Partition problem determines whether W can be
divided into two disjoint subsets with equal sums. We model the Partition
problem as a system of polynomial equations, and then investigate the
complexity of a Hilbert's Nullstellensatz refutation, or certificate, that a
given set of integers is not partitionable. We provide an explicit construction
of a minimum-degree certificate, and then demonstrate that the Partition
problem is equivalent to the determinant of a carefully constructed matrix
called the partition matrix. In particular, we show that the determinant of the
partition matrix is a polynomial that factors into an iteration over all
possible partitions of W.Comment: Final versio
ΠΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½Π°Ρ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΡ ΡΡΠ°Π³ΠΌΠ΅Π½ΡΠΎΠ² ΡΠ΅ΠΎΡΠΈΠΈ ΠΏΠΎΠ»Ρ ΠΊΠΎΠΌΠΏΠ»Π΅ΠΊΡΠ½ΡΡ ΡΠΈΡΠ΅Π»
Π ΡΡΠ°ΡΡΠ΅ ΠΎΠ±ΡΡΠΆΠ΄Π΅Π½Π° Π²ΡΡΠΈΡΠ»ΠΈΡΠ΅Π»ΡΠ½Π°Ρ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΡ ΡΠΎΡΠΌΡΠ» Π² ΠΏΡΠ΅Π΄Π²Π°ΡΡΠ½Π½ΠΎΠΉ ΡΠΎΡΠΌΠ΅ Ρ ΠΎΠ³ΡΠ°Π½ΠΈΡΠ΅Π½ΠΈΠ΅ΠΌ Π½Π° ΡΠΈΡΠ»ΠΎ ΠΏΠ΅ΡΠ΅ΠΌΠ΅Π½ ΠΊΠ²Π°Π½ΡΠΎΡΠΎΠ². Π ΡΠ°ΡΡΠ½ΠΎΡΡΠΈ, Π³ΠΎΠ²ΠΎΡΠΈΡΡΡ ΠΎ ΡΠ΅ΠΎΡΠΈΠΈ Π°Π»Π³Π΅Π±ΡΠ°ΠΈΡΠ΅ΡΠΊΠΈ Π·Π°ΠΌΠΊΠ½ΡΡΡΡ
ΠΏΠΎΠ»Π΅ΠΉ. ΠΠΎΠΊΠ°Π·Π°Π½ΠΎ, ΡΡΠΎ ΡΠ°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΠ΅ Π²Π΅ΡΡΠΈΠ½ ΠΌΠ½ΠΎΠ³ΠΎΠΌΠ΅ΡΠ½ΠΎΠ³ΠΎ ΠΊΡΠ±Π° Π½Π° Π³ΠΈΠΏΠ΅ΡΠΏΠ»ΠΎΡΠΊΠΎΡΡΠΈ ΡΠ²ΠΎΠ΄ΠΈΡΡΡ ΠΊ ΡΠ°ΡΠΏΠΎΠ·Π½Π°Π²Π°Π½ΠΈΡ ΠΎΡΠΎΠ±ΡΡ
ΡΠΎΡΠ΅ΠΊ Π½Π° Π³ΠΈΠΏΠ΅ΡΠΏΠΎΠ²Π΅ΡΡ
Π½ΠΎΡΡΠΈ, ΠΏΠΎΡΡΡΠΎΠ΅Π½Π½ΠΎΠΉ Π·Π° ΠΏΠΎΠ»ΠΈΠ½ΠΎΠΌΠΈΠ°Π»ΡΠ½ΠΎΠ΅ Π²ΡΠ΅ΠΌΡ. ΠΠΎΠ»Π΅Π΅ ΡΠΎΠ³ΠΎ, Π΄ΠΎΠΊΠ°Π·Π°Π½Ρ Π½Π΅ΠΊΠΎΡΠΎΡΡΠ΅ ΡΠΎΠΎΡΠ½ΠΎΡΠ΅Π½ΠΈΡ ΠΌΠ΅ΠΆΠ΄Ρ ΠΊΠ»Π°ΡΡΠ°ΠΌΠΈ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ. ΠΠ°Π½Ρ ΡΠ΅ΠΊΠΎΠΌΠ΅Π½Π΄Π°ΡΠΈΠΈ ΠΏΠΎ ΡΠ»ΡΡΡΠ΅Π½ΠΈΡ ΠΊΠΎΠ½ΡΠ΅ΠΏΡΠΈΠΈ ΡΠ»ΠΎΠΆΠ½ΠΎΡΡΠΈ, Π° ΡΠ°ΠΊΠΆΠ΅ ΡΠ²ΡΠ·ΠΈ Ρ ΡΠ΅ΠΎΡΠΈΠ΅ΠΉ ΠΌΠΎΠ΄Π΅Π»Π΅ΠΉ