On the Numerical Range of Operator Polynomials

An upper bound for the number of components of the numerical range of matrix polynomials is established. We also establish a necessary condition and a sufficient condition for the connectedness of the numerical range of a quadratic selfadjoint matrix polynomial. The boundary of the numerical range of linear matrix polynomials is also considered.     

Connexité des sous-niveaux des fonctionnelles intégrales

Let (T, ℐ, μ) be a σ-finite atomless measure space,p∈[1,∞),E a real Banach space andf a measurable function:E xT→ℝ. We denote byF the functionalF: and byDom(F) its domain, it is the set {uεL ^p(T,E):ū(t)=f(u),t)εL ¹(T)}, and we prove that the sublevelsS(λ)={u:F(u)≤λ} are all connected in the subspaceDom(F) of the Banach spaceL ^p(T, E).     

A Connectedness Theorem for Products of Weighted Projective Spaces

We prove a connectedness result for products of weighted projective spaces.     

Minimal arithmetic thickness connecting discrete planes

While connected arithmetic discrete lines are entirely characterized, only partial results exist for the more general case of arithmetic discrete hyperplanes. In the present paper, we focus on the three-dimensional case, that is on arithmetic discrete planes. Thanks to arithmetic reductions on a vector , we provide algorithms either to determine whether a given arithmetic discrete plane with as normal vector is connected, or to compute the minimal thickness for which an arithmetic discrete plane with normal vector is connected.     

关于超有效点的注记

本文首先给出了赋范空间中Ｂｏｒｗｅｉｎ超有效点定义的二个与范数无关的等价形式,从而得出推广超有效点到局部凸空间的二个途径,并通过例子说明其中之一是不恰当的．我们还给出了超有效点集连通的二个结果．最后,我们指出文［１］引入的严有效点就是Ｈｅｎｉｇ有效点,其主要定理（［１］定理７）是［２］中定理３．３的特例     

The evolution of the min-min random graph process

We study the following min-min random graph process G=(G₀,G₁,…): the initial state G₀ is an empty graph on n vertices (n even). Further, G_M+1 is obtained from G_M by choosing a pair {v,w} of distinct vertices of minimum degree uniformly at random among all such pairs in G_M and adding the edge {v,w}. The process may produce multiple edges. We show that G_M is asymptotically almost surely disconnected if M≤n, and that for M=(1+t)n, constant, the probability that G_M is connected increases from 0 to 1. Furthermore, we investigate the number X of vertices outside the giant component of G_M for M=(1+t)n. For constant we derive the precise limiting distribution of X. In addition, for n⁻¹ln⁴n≤t=o(1) we show that tX converges to a gamma distribution.     

Disconnected Ordered Sets are Max-Reconstructible

Every finite disconnected set P is determined (up to automorphism) by the family {P − {a}:a ∈ Max _P }.     

拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性(英文)

本文研究局部凸的拓扑向量空间中锥拟凸多目标规划锥有效解集的连通性问题.证明了定义在紧凸集上目标映射为一对一的锥拟凸多目标规划的锥有效解集是连通的.在证明中,广义鞍点定理起着关键的作用.     

Parameter space for families of parabolic-like mappings

In this paper we study families of degree 2 parabolic-like mappings _(fλ)λ∈Λ${(f_{\lambda })}_{\lambda \in \Lambda }$ (as defined in [4]). We prove that the hybrid conjugacies between a nice analytic family of degree 2 parabolic-like mappings and members of the family _Per1(1)${\mathit{Per}}_1(1)$ induce a continuous map χ:Λ→C$\chi :\Lambda \to \mathbb{C}$, which under suitable conditions restricts to a ramified covering from the connectedness locus of _(fλ)λ∈Λ${(f_{\lambda })}_{\lambda \in \Lambda }$ to the connectedness locus _M1?{1}$M_1?\{1\}$ of _Per1(1)${\mathit{Per}}_1(1)$. As an application, we prove that the connectedness locus of the family _Ca(z)=z+az²+z³$C_a(z)=z+a{z}^2+z^3$, a∈C$a\in \mathbb{C}$ presents baby _M1$M_1$.