A Survey of Counterexamples to Hilbert's Fourteenth Problem

We survey counterexamples to Hilbert’s Fourteenth Problem, beginning with those of Nagata in the late 1950s, and including recent counterexamples in low dimension constructed with locally nilpotent derivations. Historical framework and pertinent references are provided. We also include 8 important open questions.

On the nullstellensätze for stein spaces and C-analytic sets.

In this work we prove the real Nullstellensatz for the ring O(X) of analytic functions on a C-analytic set X ⊂ Rn in terms of the saturation of Łojasiewicz’s radical in O(X): The ideal I(Ƶ(a)) of the zero-set Ƶ(a) of an ideal a of O(X) coincides with the saturation (Formula presented) of Łojasiewicz’s radical (Formula presented). If Ƶ(a) has ‘good properties’ concerning Hilbert’s 17th Problem, then I(Ƶ(a)) = (Formula presented) where (Formula presented) stands for the real radical of a. The same holds if we replace (Formula presented) with the real-analytic radical (Formula presented) of a, which is a natural generalization of the real radical ideal in the C-analytic setting. We revisit the classical results concerning (Hilbert’s) Nullstellensatz in the framework of (complex) Stein spaces. Let a be a saturated ideal of O(Rn) and YRn the germ of the support of the coherent sheaf that extends aORn to a suitable complex open neighborhood of Rn. We study the relationship between a normal primary decomposition of a and the decomposition of YRn as the union of its irreducible components. If a:= p is prime, then I(Ƶ(p)) = p if and only if the (complex) dimension of YRn coincides with the (real) dimension of Ƶ(p).

A Note on Elementary Derivations

2000 Mathematics Subject Classification: Primary: 14R10. Secondary: 14R20, 13N15.

An Efficient and Verifiable Solution to the Millionaire Problem

A new solution to the millionaire problem is designed on the base of two new techniques: zero test and batch equation. Zero test is a technique used to test whether one or more ciphertext contains a zero without revealing other information. Batch equation is a technique used to test equality of multiple integers. Combination of these two techniques produces the only known solution to the millionaire problem that is correct, private, publicly verifiable and efficient at the same time.