Berkovich spaces, Problem List 6
Let (k, | · |) be a non-Archimedean complete algebraically closed field.
1. Show that the set {P a
iT
i| sup |a
i|r
i< ∞} is a k-subalgebra of k JT K.
2. Show that there is an isomorphism (
∞X
i=0
Pełen tekst
i=0
Powiązane dokumenty
Find, if exist, central algorithm and optimal linear algorithm for the problems of:..
[r]
The error probability 1/3 in an rptas can be cut down to any given δ > 0 by the following method: Run the algorithm many times (say m, where m is odd), and take the median of
In particular, we show (Theorem 3.7) that a point of a hyperelliptic curve (of odd degree) is 2-divisible in Pic X (hence is a unique wild point of some self-equivalence) if and only
As the lubrication force is inversely proportional to the small separation distance, it diverges as the spheres approach one another at a fixed relative velocity...
[r]
[r]
[r]
Construction of optimal spanning trees - Kruskal Algorithm (with proof of correctness).. For each task maximally 12 points can
[r]
The first result implies that there is a model of set theory in which all normal locally compact metacompact spaces are paracompact, yet there is a normal locally compact
4.5.. Denote this difference by R.. In a typical problem of combinatorial num- ber theory, the extremal sets are either very regular, or random sets. Our case is different. If A is
Following the spectacular result of Drury (“the union of two Sidon sets is a Sidon set”), a lot of improvements were achieved in the 70’s about such sets Λ.. Rider, in
Since every C 00 set of reals has strong measure zero, Borel’s conjecture implies that every C 00 metric space is
Key words and phrases: σ-ideal, Marczewski’s ideal, nowhere Ramsey sets, Mycielski’s ideal; Sacks forcing, Miller forcing, Laver forcing, Matet forcing, Silver forcing, Mathias
We present the full proofs of Theorems 4.1 and 4.2 for two reasons: firstly, since given functions are constant on the boundary and their complex Monge-Amp`ere measure is also
After a shop opens at 09:00 the number of customers arriving in any interval of duration t minutes follows a Poisson distribution with mean..
We have already seen how we can use the position vector r for a general point on the line, and then use the condition to write an equation for λ.. See Worked
[r]
Show that any maximal ideal of A is
The following table shows the probability distribution of a discrete random variable X where x =
[r]
Show that two dierent ane parametrizations are connected with a linear transformation.... Rostworowski