<Emphasis Type="Italic">g</Emphasis>-metrizable spaces and the images of semi-metric spaces

In this paper, we prove that a space X is a g-metrizable space if and only if X is a weak-open, π and σ-image of a semi-metric space, if and only if X is a strong sequence-covering, quotient, π and mssc-image of a semi-metric space, where “semi-metric” can not be replaced by “metric”. This project was supported by NNSF of China (No. 10571151 and 10671173).     

Complete Upper Angle Around a Point on the Minkowski Plane

The dependence of the complete upper angle in the sense of A. D. Aleksandrov about a point on the Minkowski plane on the form of the “unit circle” (the centrally symmetric convex curve Φ determining the Minkowski metric ρ_Φ) is studied.The complete upper angle is computed in three cases: if Φ is a square, a “cut circle,” or a “rounded rhombus.” Bibliography: 6 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 299, 2003, pp. 42–53.     

Equivalence classes of functions between finite groups

Two types of equivalence relation are used to classify functions between finite groups into classes which preserve combinatorial and algebraic properties important for a wide range of applications. However, it is very difficult to tell when functions equivalent under the coarser (“graph”) equivalence are inequivalent under the finer (“bundle”) equivalence. Here we relate graphs to transversals and splitting relative difference sets (RDSs) and introduce an intermediate relation, canonical equivalence, to aid in distinguishing the classes. We identify very precisely the conditions under which a graph equivalence determines a bundle equivalence, using transversals and extensions. We derive a new and easily computed algebraic measure of nonlinearity for a function f, calculated from the image of its coboundary ∂f. This measure is preserved by bundle equivalence but not by the coarser equivalences. It takes its minimum value if f is a homomorphism, and takes its maximum value if the graph of f contains a splitting RDS.     

Ads Manifolds With Particles and Earthquakes on Singular Surfaces

We prove two related results. The first is an “earthquake theorem” for closed hyperbolic surfaces with cone singularities where the total angle is less than π: any two such metrics in are connected by a unique left earthquake. The second result is that the space of “globally hyperbolic” AdS manifolds with “particles” – cone singularities (of given angle) along time-like lines – is parametrized by the product of two copies of the Teichmüller space with some marked points (corresponding to the cone singularities). The two statements are proved together. F.B. was partially supported by the A.N.R. project GEODYCOS. J.-M.S. was partially supported by the A.N.R. programs RepSurf, 2006-09, ANR-06-BLAN-0311, GeomEinstein, 2006-09, 06-BLAN-0154, and FOG, 2007-10, ANR-07-BLAN-0251-01.     

One-dimensional global attractor for the damped and driven sine-Gordon equation

The damped and driven sine-Gordon equation with Neumann boundary conditions is studied. It is shown that it has a one-dimensional global attractor in a suitable functional space when the “damping” and the “diffusing” are not very small. Project supported by the National Natural Science Foundation of China.     

Remarks on a principle of localization

We prove that the Brauer class of a crossed product is a sum of symbols iff its “local” components are. Analogously we show that a solution of the “Goldie rank conjecture” would follow from the “local” statements; an extension of a result of Cliff-Sehgal is an easy corollary.     

Ols parameter estimation for a linear paired confluent model

We investigate OLS parameter estimation for a linear paired model in the case of a passive experiment with errors in both variables. The explicit form of the OLS estimates is obtained, their equivalence to maximum likelihood estimates is demonstrated in the presence of normal errors, and estimate consistency is proved. The OLS estimates are compared analytically and numerically with known parameter estimates of “direct,” “orthogonal,” and “diagonal” regression models.     

Cyclic orders: Equivalence and duality

Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomassé’s recent proof of Gallai’s conjecture. We explore this notion further: we prove that two cyclic orders are equivalent if and only if the winding number of every circuit is the same in the two. The proof is short and provides a good characterization and a polynomial algorithm for deciding whether two orders are equivalent. We then derive short proofs of Gallai’s conjecture and a theorem “polar to” the main result of Bessy and Thomassé, using the duality theorem of linear programming, total unimodularity, and the new result on the equivalence of cyclic orders.     

On duality gap in linear conic problems

In their paper “Duality of linear conic problems” Shapiro and Nemirovski considered two possible properties (A) and (B) for dual linear conic problems (P) and (D). The property (A) is “If either (P) or (D) is feasible, then there is no duality gap between (P) and (D)”, while property (B) is “If both (P) and (D) are feasible, then there is no duality gap between (P) and (D) and the optimal values val(P) and val(D) are finite”. They showed that (A) holds if and only if the cone K is polyhedral, and gave some partial results related to (B). Later Shapiro conjectured that (B) holds if and only if all the nontrivial faces of the cone K are polyhedral. In this note we mainly prove that both the “if” and “only if” parts of this conjecture are not true by providing examples of closed convex cone in \mathbbR⁴{\mathbb{R}^{4}} for which the corresponding implications are not valid. Moreover, we give alternative proofs for the results related to (B) established by Shapiro and Nemirovski.     

On regularity of finite reflection groups

We define a concept of “regularity” for finite unitary reflection groups, and show that an irreducible finite unitary reflection group of rank greater than 1 is regular if and only if it is a Coxeter group. Hence we get a characterization of Coxeter groups among all the irreducible finite reflection groups of rank greater than one. Received: 10 September 1999 / Revised version: 19 February 2000     

Orthogonal and bounded orthogonal spectral representations

The concept of an orthogonal spectral representation (OTSR) of a Hilbert spaceH relative to a spectral measureE(.) is introduced and it is shown that every Hilbert space admits an OTSR relative to a given spectral measure. Apart from the various results obtained about OTSRs, the principal result of Allan Brown (1974) is deduced as an easy consequence of this study. A new complete system of unitary invariants called the “equivalence of OTSRs”, is given for spectral measures. Two special types of OTSRs called “BOTSR” and “COBOTSR” are introduced and characterized respectively in terms of the “GCGS-property” and “CGS-property” of the associated spectral measure. Various complete systems of unitary invariants are given for spectral measures with the GCGS-property. Finally, the Wecken-Plesner-Rohlin theorem on hermitian operators with simple spectra is generalized to arbitrary spectral measures.     

Abelian equations and rank problems for planar webs

We find an invariant characterization of planar webs of maximum rank. For 4-webs, we prove that a planar 4-web is of maximum rank three if and only if it is linearizable and its curvature vanishes. This result leads to the direct web-theoretical proof of the Poincaré theorem: A planar 4-web of maximum rank is linearizable. We also find an invariant intrinsic characterization of planar 4-webs of rank two and one and prove that in general such webs are not linearizable. This solves the Blaschke problem “to find invariant conditions for a planar 4-web to be of rank 1 or 2 or 3.” Finally, we find invariant characterization of planar 5-webs of maximum rank and prove than in general such webs are not linearizable. The text was submitted by the authors in English.     

Soap films bounded by non-closed curves

This paper proves (i) every “geometrically knotted” non-closed curve bounds a soap-film, (ii) any non-closed curve bounding a soap-film must have total curvature greater than 2π, and (iii) for every k > 2π, there is a geometrically knotted non-closed curve with total curvature k.     

On classifying monotone complete algebras of operators

We give a classification of “small” monotone complete C ^*-algebras by order properties. We construct a corresponding semigroup. This classification filters out von Neumann algebras; they are mapped to the zero of the classifying semigroup. We show that there are 2 ^c distinct equivalence classes (where c is the cardinality of the continuum). This remains true when the classification is restricted to special classes of monotone complete C ^*-algebras e.g. factors, injective factors, injective operator systems and commutative algebras which are subalgebras of ℓ^∞. Some examples and applications are given.      

The Expected loss in the discretization of multistage stochastic programming problems—estimation and convergence rate

In the present paper, the approximate computation of a multistage stochastic programming problem (MSSPP) is studied. First, the MSSPP and its discretization are defined. Second, the expected loss caused by the usage of the “approximate” solution instead of the “exact” one is studied. Third, new results concerning approximate computation of expectations are presented. Finally, the main results of the paper—an upper bound of the expected loss and an estimate of the convergence rate of the expected loss—are stated.     

Existence of multipeak solutions for a semilinear Neumann problem via nonsmooth critical point theory

We study a perturbed semilinear problem with Neumann boundary condition where is a bounded smooth domain of , , , if or if and is the unit outward normal at the boundary of . We show that for any fixed positive integer K any “suitable” critical point of the function generates a family of multiple interior spike solutions, whose local maximum points tend to as tends to zero. Received March 7, 1999 / Accepted October 1, 1999 / Published online April 6, 2000     

Instances of the Conjecture of Chang

We consider various forms of the Conjecture of Chang. Part A constitutes an introduction. Donder and Koepke have shown that if ρ is a cardinal such that ρ ≧ ω₁, and (ρ⁺⁺,ρ⁺↠(ρ⁺, ρ), then 0⁺ exists. We obtain the same conclusion in Part B starting from some other forms of the transfer hypothesis. As typical corollaries, we get: Theorem A.Assume that there exists cardinals λ, κ, such that λ ≧ K ⁺ ≧ω₂ and (λ⁺, λ)↠(K ⁺,K. Then 0⁺ exists. Theorem B.Assume that there exists a singularcardinal κ such that(K ⁺,K↠(ω₁, ω₀. Then 0⁺ exists. Theorem C.Assume that (λ ⁺⁺, λ). Then 0⁺ exists (also ifK=ω ₀. Remark. Here, as in the paper of Donder and Koepke, “O⁺ exists” is a matter of saying that the hypothesis is strictly stronger than “L(μ) exists”. Of course, the same proof could give a few more sharps overL(μ), but the interest is in expecting more cardinals, coming from a larger core model. Theorem D.Assume that (λ ⁺⁺, λ)↠(K ⁺, K) and thatK≧ω ₁. Then 0⁺ exists. Remark 2. Theorem B is, as is well-known, false if the hypothesis “κ is singular” is removed, even if we assume thatK≧ω ₂, or that κ is inaccessible. We shall recall this in due place. Comments. Theorem B and Remark 2 suggest we seek the consistency of the hypothesis of the form:K ⁺, K↠(ω_n +1, ω_n), for κ singular andn≧0. 0266 0152 V 3 The consistency of several statements of this sort—a prototype of which is (N _ω+1,N _ω)↠(ω₁, ω₀) —have been established, starting with an hypothesis slightly stronger than: “there exists a huge cardinal”, but much weaker than: “there exists a 2-huge cardinal”. These results will be published in a joint paper by M. Magidor, S. Shelah, and the author of the present paper.     

On equilibrium in pure strategies in games with many players

We demonstrate that, if there are sufficiently many players, any Bayesian equilibrium of an incomplete information game can be “ε-purified” . That is, close to any Bayesian equilibrium there is an approximate Bayesian equilibrium in pure strategies. Our main contribution is obtaining this result for games with a countable set of pure strategies. In order to do so we derive a mathematical result, in the spirit of the Shapley–Folkman Theorem, permitting countable strategy sets. Our main assumption is a “large game property,” dictating that the actions of relatively small subsets of players cannot have large affects on the payoffs of other players. E. Cartwright and M. Wooders are indebted to Phillip Reny, Frank Page and two anonymous referees for helpful comments.     

The semantics of knowledge attributions

The basic idea of conversational contextualism is that knowledge attributions are context sensitive in that a given knowledge attribution may be true if made in one context but false if made in another, owing to differences in the attributors’ conversational contexts. Moreover, the context sensitivity involved is traced back to the context sensitivity of the word “know,” which, in turn, is commonly modelled on the case either of genuine indexicals such as “I” or “here” or of comparative adjectives such as “tall” or “rich.” But contextualism faces various problems. I argue that in order to solve these problems we need to look for another account of the context sensitivity involved in knowledge attributions and I sketch an alternative proposal.