Existence d'orbites périodiques complètement elliptiques des Hamiltoniens convexes présentant certaines symétries

Using certain quadratic forms associated to symplectic endomorphisms which we compare with the Clarke-Ekeland dual action functional, we prove: THEOREM. — Let H be a C²-Hamiltonian defined on R²ⁿ, strictly convex, proper and invariant under a certain symplectic rational positive and non-degenerate rotation (this is defined in the introduction); then, every hypersurface of H contains a completely elliptic periodic orbit. This generalizes the result of G. Dell'Antonio, B. D'Onofrio and I. Ekeland contained in [1].     

On extensions of the core and the anticore of transferable utility games

We consider several related set extensions of the core and the anticore of games with transferable utility. An efficient allocation is undominated if it cannot be improved, in a specific way, by sidepayments changing the allocation or the game. The set of all such allocations is called the undominated set, and we show that it consists of finitely many polytopes with a core-like structure. One of these polytopes is the $L_1$ -center, consisting of all efficient allocations that minimize the sum of the absolute values of the excesses. The excess Pareto optimal set contains the allocations that are Pareto optimal in the set obtained by ordering the sums of the absolute values of the excesses of coalitions and the absolute values of the excesses of their complements. The $L_1$ -center is contained in the excess Pareto optimal set, which in turn is contained in the undominated set. For three-person games all these sets coincide. These three sets also coincide with the core for balanced games and with the anticore for antibalanced games. We study properties of these sets and provide characterizations in terms of balanced collections of coalitions. We also propose a single-valued selection from the excess Pareto optimal set, the min-prenucleolus, which is defined as the prenucleolus of the minimum of a game and its dual.     

Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions

A function f(x) defined on $\text{X}$ = $\text{X}$₁ × $\text{X}$₂ × … × $\text{X}$_n where each $\text{X}$_i is totally ordered satisfying f(x ∨ y) f(x ∧ y) ≥ f(x) f(y), where the lattice operations ∨ and ∧ refer to the usual ordering on $\text{X}$, is said to be multivariate totally positive of order 2 (MTP₂). A random vector Z = (Z₁, Z₂,…, Z_n) of n-real components is MTP₂ if its density is MTP₂. Classes of examples include independent random variables, absolute value multinormal whose covariance matrix Σ satisfies ?DΣ^?1D with nonnegative off-diagonal elements for some diagonal matrix D, characteristic roots of random Wishart matrices, multivariate logistic, gamma and F distributions, and others. Composition and marginal operations preserve the MTP₂ properties. The MTP₂ property facilitate the characterization of bounds for confidence sets, the calculation of coverage probabilities, securing estimates of multivariate ranking, in establishing a hierarchy of correlation inequalities, and in studying monotone Markov processes. Extensions on the theory of MTP₂ kernels are presented and amplified by a wide variety of applications.     

Proper T-ideals of poisson algebras with extreme properties

Let {γn(V)}_n≥1 be the sequence of proper codimensions of some variety V of Poisson algebras over a field of characteristic zero. A class of minimal varieties of Poisson algebras of polynomial growth of the sequence {γn(V)}_n≥1 is presented, i.e., the sequence {γn(V)}_n≥1 of any such variety V grows as a polynomial of some degree k, but the sequence {γn(W)}_n≥1 of any proper subvariety W in V grows as a polynomial of degree strictly less than k.     

2-Coherent and 2-convex conditional lower previsions

In this paper we explore relaxations of (Williams) coherent and convex conditional previsions that form the families of n-coherent and n-convex conditional previsions, at the varying of n. We investigate which such previsions are the most general one may reasonably consider, suggesting (centered) 2-convex or, if positive homogeneity and conjugacy is needed, 2-coherent lower previsions. Basic properties of these previsions are studied. In particular, we prove that they satisfy the Generalised Bayes Rule and always have a 2-convex or, respectively, 2-coherent natural extension. The role of these extensions is analogous to that of the natural extension for coherent lower previsions. On the contrary, n-convex and n-coherent previsions with $n\ge 3$ either are convex or coherent themselves or have no extension of the same type on large enough sets. Among the uncertainty concepts that can be modelled by 2-convexity, we discuss generalisations of capacities and niveloids to a conditional framework and show that the well-known risk measure Value-at-Risk only guarantees to be centered 2-convex. In the final part, we determine the rationality requirements of 2-convexity and 2-coherence from a desirability perspective, emphasising how they weaken those of (Williams) coherence.     

The concept lattice functors

This paper is concerned with the relationship between contexts, closure spaces, and complete lattices. It is shown that, for a unital quantale L, both formal concept lattices and property oriented concept lattices are functorial from the category L-Ctx of L-contexts and infomorphisms to the category L-Sup of complete L-lattices and suprema-preserving maps. Moreover, the formal concept lattice functor can be written as the composition of a right adjoint functor from L-Ctx to the category L-Cls of L-closure spaces and continuous functions and a left adjoint functor from L-Cls to L-Sup.     

The limits of determinacy in second order arithmetic: consistency and complexity strength

We prove that determinacy for all Boolean combinations of \({F_{\sigma \delta }}\) (Π ₃ ⁰ ) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Π _n ¹ -comprehension containing X. We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the difference hierarchy on \({F_{\sigma \delta }}\) (Π ₃ ⁰ ) sets in terms of both reverse mathematics, complexity and consistency strength. We show that, for n ≥ 1, determinacy for sets at the nth level in this difference hierarchy lies strictly between (in the reverse mathematical sense of logical implication) the existence of β-models of Π _n+2 ¹ -comprehension containing any given set X, and the existence of β-models of Δ _n+2 ¹ -comprehension containing any given set X. Thus the nth of these determinacy axioms lies strictly between Π _n+2 ¹ -comprehension and Δ _n+2 ¹ -comprehension in terms of consistency strength. The major new technical result on which these proof theoretic ones are based is a complexity theoretic one. The nth determinacy axiom implies closure under the operation taking a set X to the least Σ _n+1 admissible containing X (for n = 1; this is due to Welch [9]).     

On limit distributions of first crossing points of Gaussian sequences

Let {X_k, k?Z} be a stationary Gaussian sequence with EX₁ – 0, EX²_k = 1 and EX₀X_k = r_k. Define τ_x = inf{k: X_k >– βk} the first crossing point of the Gaussian sequence with the function – βt (β > 0). We consider limit distributions of τ_x as β→0, depending on the correlation function r_k. We generalize the results for crossing points τ_x = inf{k: X_k >β?(k)} with ?(– t)?t^γL(t) for t→∞, where γ > 0 and L(t) varies slowly.     

Δ2 degrees without Σ1 induction

In this paper, we study the structure of Turing degrees below 0′ in the theory that is a fragment of Peano arithmetic without Σ₁ induction, with special focus on proper d-r.e. degrees and non-r.e. degrees. We prove:

1. P ^? + BΣ₁ + Exp ? There is a proper d-r.e. degree.
2. P ^? +BΣ₁+ Exp ? IΣ₁ ? There is a proper d-r.e. degree below 0′.
3. P ^? + BΣ₁ + Exp ? There is a non-r.e. degree below 0′.

     

Roundoff-error analysis of a new class of conjugate-gradient algorithms

We perform the rounding-error analysis of the conjugate-gradient algorithms for the solution of a large system of linear equations Ax=b where Ais an hermitian and positive definite matrix. We propose a new class of conjugate-gradient algorithms and prove that in the spectral norm the relative error of the computed sequence {x_k} (in floating-point arithmetic) depends at worst on ζк^{$\text{3}\text{2}$}, where ζ is the relative computer precision and к is the condition number of A. We show that the residual vectors r_k=Ax_k-b are at worst of order ζк?vA?v ?vx_k?v. We p oint out that with iterative refinement these algorithms are numerically stable. If ζк ² is at most of order unity, then they are also well behaved.     

A Bahadur efficiency comparison between one and two sample rank statistics and their sequential rank statistic analogues

One and two sample rank statistics are shown in general to be more efficient in the Bahadur sense than their sequential rank statistic analogues as defined by Mason (1981, Ann. Statist.9 424–436) and Lombard (1981, South African Statist. J.15 129–152), even though the two families of statistics (those based on full ranks and those based on sequential ranks) have the same Pitman efficiency against local alternatives. In the process, general results on large deviation probabilities and laws of large numbers for statistics based on sequential ranks are obtained.     

A remark on the transformation formula of theta functions associated to positive definite quadratic forms

Let L be a positive Z-lattice with level N = cd, (c, d) = 1. Then the Fourier expansion at cusp $\text{1}\text{d}$ of the theta function associated to L is a theta function associated to L₁, where a lattice L₁ is defined by Z_pL₁ = Z_pL for $\text{p?c}$, Z_pL₁ = the dual of Z_pL for p | c.     

Distribution exacte du score local,cas markovien

Given a sequence $\text{X}\text{=(X}{}_{\mathrm{k}}\text{)}{}_{\mathrm{k?1}}$ of random variables taking values in {?v,…,0,…,+u}, let's define the local score of the sequence by H_n=max_1?i?j?n(∑_k=i^jX_k). The local score is used to analyze biological sequences pointing out regions of the sequences with interesting biological properties. In order to separate randomly events from really interesting segments, we establish here the distribution of the local score of H_n when the sequence $\text{X}$ is a Markov chain of order 1. To cite this article: S. Mercier, C. Hassenforder, C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

The probability of correcting errors by an antinoise coding method when the number of errors belongs to a random set

We consider n messages of N blocks each, where each block is encoded by some antinoise coding method. The method can correct no more than one error. We assume that the number of errors in the ith message belongs to some finite random subset of nonnegative integer numbers. Let A stand for the event that all errors are corrected; we study the probability P(A) and calculate it in terms of conditional probabilities. We prove that under certain moment conditions probabilities P(A) converge almost sure as n and N tend to infinity so that the value n/N has a finite limit. We calculate this limit explicitly.     

Computational Complexity over thep-adic Numbers

A model of computation over thep-adic numbers, for odd primesp, is defined following the approach of Blum, Shub, and Smale. This model employs branching on the property of being a square inQ_pand unit height. The feasibility of systems of quadratic polynomials is shown to be NP-complete in this model. A polynomial time algorithm is given for feasibility of a single quadratic polynomial overQ_p.     

Mathematical justification of a nonlinear integro-differential equation for the propagation of spherical flamesJustification mathématique d'une équation intégro-différentielle non linéaire pour un modèle de flamme sphérique

This Note is devoted to the justification of an asymptotic model for quasisteady three-dimensional spherical flames proposed by G. Joulin [7]. The paper [7] derives, by means of a three-scale matched asymptotic expansion, starting from the classical thermo-diffusive model with high activation energies, an integro-differential equation for the flame radius. In the derivation, it is essential for the Lewis number – i.e., the ratio between thermal and molecular diffusion – to be strictly less than unity. In this Note, we give the main ideas of a rigorous proof of the validity of this model, under the additional restriction that the Lewis number is close to 1. To cite this article: C. Lederman et al., C. R. Acad. Sci. Paris, Ser. I 334 (2002) 569–574.     

Some lower bounds for the spectral radius of matrices using traces

Let A be an n×n matrix with eigenvalues λ₁,λ₂,…,λ_n, and let m be an integer satisfying rank(A)?m?n. If A is real, the best possible lower bound for its spectral radius in terms of m, trA and trA² is obtained. If A is any complex matrix, two lower bounds for are compared, and furthermore a new lower bound for the spectral radius is given only in terms of trA,trA²,‖A‖,‖A^∗A-AA^∗‖,n and m.     

Ternary forms as invariants of Markoff forms and other SL2 (Z)-bundles

Consider the free group Γ = {A,B} generated by matrices A, B in SL₂(Z). We can construct a ternary form Φ(x,y,z) whose GL₃(Z) equivalence class is invariant, as it depends on Γ and not the choice of generators. If Γ is the commutator of SL₂(Z), then the generating matrices have fixed points corresponding to different fields and inequivalent Markoff forms, but they are all biuniquely determined by Φ = -z²+ y(2x+y+z) to within equivalence. When referred to transformations A, B of the upper half plane, this phenomenon is interpreted in terms of inequivalent homotopy elements which are primitive for the perforated torus.     

Finite embedding theorems for partial pairwise balanced designs

The pair (P, p) is a (partial) (n, b)-PBD if (P, p) isa (partial) pairwise balanced design with the property that |P| = n and each block in p has exactly b elements. The following theorems are proved.Theorem. If (P, p) is an (n, b)-PBD and n > b ? 4, then (P, p) has an isomorphic disjoint mate. (Theorem 2.3)Theorem. Suppose k and b are positive integers and b ? 5. There is a constant C(k, b) such that if (P, p) is an (n, b)-PBD and n > C(k, b), then there exist k mutually disjoint isomorphic mates of (P, p). (Theorem 2.2)Theorem. Suppose k and b are positive integers, k ? 2 and b ? 5. If (P, p₁, (P, p₂),…, (P, p_k) is a collection of partial (|P|, b)-PBD's, there exist k (n, b)-PBD's (X, x₁), (X, x₂), …, (X, x_k) such that (P, p₁) is embedded in (X, x₁) and for i ≠ j, p₁ ∩ p₁ = x₁ ∩ x₁. Additionally the existence of certain collections valuable in embedding is explored. (Theorem 4.10)