Sharp higher-order Sobolev inequalities in the hyperbolic space {\mathbb{H}^n}

In this paper, we obtain the sharp k-th order Sobolev inequalities in the hyperbolic space ${\mathbb{H}^n}$ for all k = 1, 2, 3, . . . . This gives an answer to an open question raised by Aubin in [Aubin, Princeton University Press, Princeton (1982), pp. 176–177] for ${W^{k,2}(\mathbb{H}^n)}$ with k > 1. In addition, we prove that the associated Sobolev constants are optimal.     

Large sample theory for distributions on the hypersphere with rotational symmetries

Summary A distribution on the unit sphere inℝ ^q with a densityf(‖x _v ‖) is considered where is ans(<q) dimensional subspace andx _v is the part ofx in . For a large sample the estimation of , a test that and a test for rotational symmetry within is given. For several samples with possibly different subspaces but the samef, a test that is given. For all tests power functions for contiguous alternatives are given. For the special density proportional to expk‖x _v ‖ ², additional results are given. Research supported in part by a Contract with the Office of Naval Research N00014-81-K-0146 awarded to Princeton University, Princeton, New Jersey 08544.     

Abzählbarkeit und geblätterte Mannigfaltigkeiten

Ohne Zusammenfassung Reinhold Baer zum 60. Geburtstag Zusatz bei der Korrektur: Nachträglich bemerke ich, da\ C.Chevalley in seinem Buch Theory of Lie Groups (Princeton 1946) auf S. 94–98 die Frage der Abzählbarkeit in unserem Sinne bei analytischen Mannigfaltigkeiten mit analytischen Blätterungen behandelt hat.     

The bargaining set for sharing the power

The evaluation of the power of the parties of a Parliament is usually carried out following a static approach, counting their numbers of seats and possible ideological relations among them. In this paper we propose a dynamic model in which parties may blackmail each other in order to increase their power at the expense of others. This model may be solved in terms of the Bargaining Set (Aumann and Maschler in Advances in game theory. Princeton University Press, Princeton, 1964), a set valued solution, in contrast to the classical power indices that are point valued; so it may be used to check the robustness of a power division taking into account possible blackmailing activities. The paper is mainly based on the idea of proposing an existing instrument, the Bargaining Set, as power index to analyze this blackmailing situation. The computational complexity limits the possibility of applying it to real-world situations, but the possibility of making the computation easier is shown using some examples.     

On the Best Pinching Constant of Conformal Metrics on \mathbb {S}^{2} with One and Two Conical Singularities

We answer a long-standing open question asked by Thurston (The Geometry and Topology of Three-Manifolds. Princeton University Press, Princeton, 1978) concerning the best pinching constant for conformal metrics on $\mathbb {S}^{2}$ with one and two conical singularities of angles 2π(1+α ₁) and 2π(1+α ₁),2π(1+α ₂) in case α ₁∈(?1,0) and ?1<α ₁<α ₂<0, respectively. The case of one conical singularity is a corollary of a result in Chen and Lin (Commun. Anal. Geom. 6(1):1–19, 1998) concerning the curvature of conformal metrics on ?² with bounded Gaussian curvature 0<a≤K≤b<+∞. The case with two conical singularities is worked out by a generalization of that result.     

Maximization of revenue in fishery model with Cobb-Douglas type of production function

The paper considers the effects of congestion and gear saturation in the harvesting of fishery model given by logistic type of differential equation. It applies continuous dynamic control programming technique (Bellman in Dynamic programming, Princeton University Press, Princeton, 1957; Bertsekas, Dynamic programming—deterministic and stochastic model, Princeton Hall, Englewood Cliffs, 1987) to maximize the net revenue obtained by nonlinear production function of Cobb-Douglas type.     

Response to “Dispensable Statistics”

Abstract

Small Worlds: The Dynamics of Networks Between Order and Randomness by Duncan J. Watts, Princeton: Princeton University Press, 1999. Reviewed by Noshir Contractor     

A compactification of Igusa varieties

We investigate the notion of Igusa level structure for a one-dimensional Barsotti–Tate group over a scheme X of positive characteristic and compare it to Drinfeld’s notion of level structure. In particular, we show how the geometry of the Igusa covers of X is useful for studying the geometry of its Drinfeld covers (e.g. connected and smooth components, singularities). Our results apply in particular to the study of the Shimura varieties considered in Harris and Taylor (On the geometry and cohomology of some simple Shimura varieties. Princeton University Press, Princeton, 2001). In this context, they are higher dimensional analogues of the classical work of Igusa for modular curves and of the work of Carayol for Shimura curves. In the case when the Barsotti–Tate group has constant p-rank, this approach was carried-out by Harris and Taylor (On the geometry and cohomology of some simple Shimura varieties. Princeton University Press, Princeton, 2001).     

C^{1,\alpha }-regularity for surfaces with H\in L^p

In this paper, we prove several results on the geometry of surfaces immersed in \(\mathbb {R}^3\) with small or bounded \(L^2\) norm of \(|A|\) . For instance, we prove that if the \(L^2\) norm of \(|A|\) and the \(L^p\) norm of \(H\) , \(p>2\) , are sufficiently small, then such a surface is graphical away from its boundary. We also prove that given an embedded disk with bounded \(L^2\) norm of \(|A|\) , not necessarily small, then such a disk is graphical away from its boundary, provided that the \(L^p\) norm of \(H\) is sufficiently small, \(p>2\) . These results are related to previous work of Schoen–Simon (Surfaces with quasiconformal Gauss map. Princeton University Press, Princeton, vol 103, pp 127–146, 1983) and Colding–Minicozzi (Ann Math 160:69–92, 2004).     

BOOK REVIEW

Life Cycles: Reflections of an Evolutionary Biologist, John Tyler Bonner, Princeton University Press, 41 William Street, Princeton, New Jersey, 08540, 1993, 209 pp., or UK: Princeton University Press, Chichester, West Sussex, ISBN 0-691-03319-6     

Constructive lower bounds for off-diagonal Ramsey numbers

We describe an explicit construction whicy, for some fixed absolute positive constant ε, produces, for every integers>1 and all sufficiently largem, a graph on at least vertices containing neither a clique of sizes nor an independent set of sizem. Part of this work was done at the Institute for Advanced Study, Princeton, NJ 08540, USA. Research supported in part by a USA Israeli BSF grant, by a grant from the Israel Science Foundation and by the Hermann Minkowski Minerva Center for Geometry at Tel Aviv University. Research supported in part by a grant A1019901 of the Academy of Sciences of the Czech Republic and by a cooperative research grant INT-9600919/ME-103 from the NSF (USA) and the MŠMT (Czech Republic).     

The traveling salesman problem: a book review

We review the recent book authored by David L. Applegate, Robert E. Bixby, Vasěk Chvátal and William J. Cook, The traveling salesman problem: a computational study, Princeton Series in Applied Mathematics. Princeton University Press 2007, Hardback price $45.00 / ￡26.95, 606pp, ISBN 978-0-691-12993-8.      

The predicative Frege hierarchy

In this paper, we characterize the strength of the predicative Frege hierarchy, , introduced by John Burgess in his book [J. Burgess, Fixing frege, in: Princeton Monographs in Philosophy, Princeton University Press, Princeton, 2005]. We show that and are mutually interpretable. It follows that is mutually interpretable with Q. This fact was proved earlier by Mihai Ganea in [M. Ganea, Burgess’ PV is Robinson’s Q, The Journal of Symbolic Logic 72 (2) (2007) 619–624] using a different proof. Another consequence of the our main result is that is mutually interpretable with Kalmar Arithmetic (a.k.a. EA, EFA, , Q3). The fact that interprets EA was proved earlier by Burgess. We provide a different proof.Each of the theories is finitely axiomatizable. Our main result implies that the whole hierarchy taken together, , is not finitely axiomatizable. What is more: no theory that is mutually locally interpretable with is finitely axiomatizable.     

The distribution of symmetric matrix quotients

Phillips (J. Multivariate Anal. 16 (1985) 157) generalizes Cramer's (Mathematical Methods of Statistics, Princeton University Press, Princeton, NJ, 1946) inversion formula for the distribution of a quotient of two scalar random variables to the matrix quotient case. However, he gives the result for the asymmetric matrix quotient case. This note extends Phillips’ (1985) result to the symmetric matrix quotient case.     

On a complete decoding scheme for binary radical codes

This work was partially supported by the Fulbright commission, while the author was working at the Princeton University, Princeton NJ 08544, USA.     

Smoothness of Itô maps and diffusion processes on path spaces (I)

Let p∈[1,2) and α, ε>0 be such that α∈(p−1,1−ε). Let V, W be two Euclidean spaces. Let Ωp(V) be the space of continuous paths taking values in V and with finite p-variation. Let k∈N and be a Lip(k+α+ε) map in the sense of E.M. Stein [Stein E.M., Singular integrals and differentiability properties of functions, Princeton Mathematical Series, vol. 30, Princeton University Press, Princeton, NJ, 1970]. In this paper we prove that the Itô map, defined by I(x)=y, is a local map (in the sense of Fréchet) between Ωp(V) and Ωp(W), where y is the solution to the differential equation

     

The Shapley value for shortest path games: a non-graph-based approach

The shortest path games are considered in this paper. The transportation of a good in a network has costs and benefits. The problem is to divide the profit of the transportation among the players. Fragnelli et al. (Math Methods Oper Res 52: 251–264, 2000) introduce the class of shortest path games and show it coincides with the class of monotone games. They also give a characterization of the Shapley value on this class of games. In this paper we consider further five characterizations of the Shapley value (Hart and Mas-Colell’s in Econometrica 57:589–614, 1989; Shapley’s in Contributions to the theory of games II, annals of mathematics studies, vol 28. Princeton University Press, Princeton, pp 307–317, 1953; Young’s in Int J Game Theory 14:65–72, 1985, Chun’s in Games Econ Behav 45:119–130, 1989; van den Brink’s in Int J Game Theory 30:309–319, 2001 axiomatizations), and conclude that all the mentioned axiomatizations are valid for the shortest path games. Fragnelli et al. (Math Methods Oper Res 52:251–264, 2000)’s axioms are based on the graph behind the problem, in this paper we do not consider graph specific axioms, we take $TU$ axioms only, that is we consider all shortest path problems and we take the viewpoint of an abstract decision maker who focuses rather on the abstract problem than on the concrete situations.     

Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus

We investigate read-once branching programs for the following search problem: given a Boolean m × n matrix with m > n, nd either an all-zero row, or two 1s in some column. Our primary motivation is that this models regular resolution proofs of the pigeonhole principle , and that for m > n ² no lower bounds are known for the length of such proofs. We prove exponential lower bounds (for arbitrarily large m!) if we further restrict this model by requiring the branching program either to finish one row of queries before asking queries about another row (the row model) or put the dual column restriction (the column model).Then we investigate a special class of resolution proofs for that operate with positive clauses of rectangular shape; we call this fragment the rectangular calculus. We show that all known upper bounds on the size of resolution proofs of actually give rise to proofs in this calculus and, inspired by this fact, also give a remarkably simple rectangular reformulation of the Haken–Buss–Turán lower bound for the case m n ². Finally we show that the rectangular calculus is equivalent to the column model on the one hand, and to transversal calculus on the other hand, where the latter is a natural proof system for estimating from below the transversal size of set families. In particular, our exponential lower bound for the column model translates both to the rectangular and transversal calculi.* Part of the work was done while this author was visiting Special Year on Logic and Algorithms at DIMACS, Princeton. Also supported by Russian Basic Research Foundation grant 96-01-01222. Part of this work was done while on sabbatical leave at the Institute for Advanced Study and Princeton University, Princeton. This work was supported by USA-Israel BSF grant 92-00106 and by a Wolfson research award administered by the Israeli Academy of Sciences, as well as a Sloan Foundation grant. This work was supported in part by National Science Foundation and DARPA under grant CCR-9627819, and by USA-Israel BSF grant 92-00106.     

Complex interpolation ofH p spaces on product domains

Summary Let . We show that . Our approach is based in the theory of tent spaces and an extension of Wolff's theorem for quasi-Branach spacesWork partially supported by NSF grant MCS 88108814(A03), while both authors were at the Institute for Advanced Study, Princeton.