两个Hermitian矩阵的Hadamard乘积的特征值估计

Schur定理规定了半正定矩阵的Hadamard乘积的所有特征值的整体界限,Eric Iksoon lm在同样的条件下确定了每个特征值的特殊的界限,本文给出了Hermitian矩阵的Hadamard乘积的每个特征值的估计,改进和推广了I.Schur和Eric Iksoon Im的相应结果。     

<Emphasis Type="BoldItalic">κ</Emphasis>-Complete Uniquely Complemented Lattices

We show that for any infinite cardinal κ, every complete lattice where each element has at most one complement can be regularly embedded into a uniquely complemented κ-complete lattice. This regular embedding preserves all joins and meets, in particular it preserves the bounds of the original lattice. As a corollary, we obtain that every lattice where each element has at most one complement can be embedded into a uniquely complemented κ-complete lattice via an embedding that preserves the bounds of the original lattice.     

Small Forbidden Configurations

In the present paper we continue the work begun by Sauer, Perles, Shelah and Anstee on forbidden configurations of 0–1 matrices. We give asymptotically exact bounds for all possible 2 × l forbidden submatrices and almost all 3 × l ones. These bounds are improvements of the general bounds, or else new constructions show that the general bound is best possible. It is interesting to note that up to the present state of our knowledge every forbidden configuration results in polynomial asymptotic.     

Art galleries with guards of uniform range of vision

We are given an art gallery represented by a simple polygon with n sides and an angle (0°,360°]. How many guards of range of vision are required to monitor every point of the polygon in the worst case? After recent results on upper bounds of this problem, we prove new lower bounds for all 0°<<180°. Several lower bounds meet the best known upper bounds, and we expect our lower bounds to be best possible.

Surprisingly, it turns out that n/3 180°-guards are always enough to monitor a polygon of n sides, but if we wish to use (180−)°-guards for any >0, then possibly 2n/3−1 guards are necessary.     

Copula-based grouped risk aggregation under mixed operation

This paper deals with the problem of risk measurement under mixed operation. For this purpose, we divide the basic risks into several groups based on the actual situation. First, we calculate the bounds for the subsum of every group of basic risks, then we obtain the bounds for the total sum of all the basic risks. For the dependency relationships between the basic risks in every group and all of the subsums, we give different copulas to describe them. The bounds for the aggregated risk under mixed operation and the algorithm for numerical simulation are given in this paper. In addition, the convergence of the algorithm is proved and some numerical simulations are presented.     

Symmetric Subsets and Colorings of Connected Compact Groups

We find upper and lower bounds for the Haar measure of a monochromatic symmetric subset, which can be found in every measurable r-coloring of a connected compact group.     

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.     

Lower Bounds and Nonuniform Time Discretization for Approximation of Stochastic Heat Equations

We study algorithms for approximation of the mild solution of stochastic heat equations on the spatial domain ]0, 1[^d. The error of an algorithm is defined in L₂-sense. We derive lower bounds for the error of every algorithm that uses a total of N evaluations of one-dimensional components of the driving Wiener process W. For equations with additive noise we derive matching upper bounds and we construct asymptotically optimal algorithms. The error bounds depend on N and d, and on the decay of eigenvalues of the covariance of W in the case of nuclear noise. In the latter case the use of nonuniform time discretizations is crucial.     

Tight upper bounds on the number of invariant components on translation surfaces

An abelian differential on a surface defines a flat metric and a vector field on the complement of a finite set of points. The vertical flow that can be defined on the surface has two kinds of invariant closed sets (i.e. invariant components) — periodic components and minimal components. We give upper bounds on the number of minimal components, on the number of periodic components and on the total number of invariant components in every stratum of abelian differentials. We also show that these bounds are tight in every stratum.     

Bounding Ramsey numbers through large deviation inequalities

We develop a new approach for proving lower bounds for various Ramsey numbers, based on using large deviation inequalities. This approach enables us to obtain the bounds for the off-diagonal Ramsey numbers R(K^r, K^k), r ≤ k, that match the best known bounds, obtained through the local lemma. We discuss also the bounds for a related Ramsey-type problem and show, for example, that there exists a K⁴-free graph G on n vertices in which every cn^3/5 log^1/2 n vertices span a copy of K³. © 1995 John Wiley & Sons, Inc.     

The converse of the Solid Torus Theorem

Given positive integers p and q, a (p,q)-solid torus is a manifold diffeomorphic to Dp+1×Sq while a (p,q)-torus in a closed manifold M is the image of a differentiably embedding Sp×Sq→M. We prove that if n=p+q+1 with p=q=1 or p≠q, then M is homeomorphic to Sn whenever every (p,q)-torus bounds a (p,q)-solid torus. We also prove for p=q that every closed n-manifold for which every (p,p)-torus bounds an irreducible manifold is irreducible. Consequently, every closed 3-manifold for which every torus bounds an irreducible manifold is irreducible.     

Interval static analysis of multi-cracked beams with uncertain size and position of cracks

This paper deals with beams under static loads, in presence of multiple cracks with uncertain parameters. The crack is modelled as a linearly-elastic rotational spring and, following a non-probabilistic approach, both stiffness and position of the spring are taken as uncertain-but-bounded parameters.A novel approach is proposed to compute the bounds of the response. The key idea is a preliminary monotonicity test, which evaluates sensitivity functions of the beam response with respect to the separate variation of every uncertain parameter within the pertinent interval. Next, two alternative procedures calculate lower and upper bounds of the response. If the response is monotonic with respect to all the uncertain parameters, the bounds are calculated by a straightforward sensitivity-based method making use of the sensitivity functions built in the monotonicity test. In contrast, if the response is not monotonic with respect to even one parameter only, the bounds are evaluated via a global optimization technique. The presented approach applies for every response function and the implementation takes advantage of closed analytical forms for all response variables and related sensitivity functions.Numerical results prove efficiency and robustness of the approach, which provides very accurate bounds even for large uncertainties, avoiding the computational effort required by the vertex method and Monte Carlo simulation.     

Irregular Gabor frames and their stability

In this paper we give sufficient conditions for irregular Gabor systems to be frames. We show that for a large class of window functions, every relatively uniformly discrete sequence in with sufficiently high density will generate a Gabor frame. Explicit frame bounds are given. We also study the stability of irregular Gabor frames and show that every Gabor frame with arbitrary time-frequency parameters is stable if the window function is nice enough. Explicit stability bounds are given.

     

The minimum size instance of a Pallet Loading Problem equivalence class

The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with edges parallel to the pallet’s edges, i.e., in an orthogonal packing. This paper defines the Minimum Size Instance (MSI) of an equivalence class of PLP, and shows that every class has one and only one MSI. We develop bounds on the dimensions of box and pallet for the MSI of any class. Applying our new bounds on MSI dimensions, we present an algorithm for MSI generation and use it to enumerate all 3,080,730 equivalence classes with an area ratio (pallet area divided by box area) smaller than 101 boxes. Previous work only provides bounds on the ratio of box dimensions and only considers a subset of all classes presented here.     

On maximal Spherical codes II

We consider spherical codes attaining the Levenshtein upper bounds on the cardinality of codes with prescribed maximal inner product. We prove that the even Levenshtein bounds can be attained only by codes which are tight spherical designs. For every fixed n ≥ 5, there exist only a finite number of codes attaining the odd bounds. We derive different expressions for the distance distribution of a maximal code. As a by-product, we obtain a result about its inner products. We describe the parameters of those codes meeting the third Levenshtein bound, which have a regular simplex as a derived code. Finally, we discuss a connection between the maximal codes attaining the third bound and strongly regular graphs. © 1999 John Wiley & Sons, Inc. J Combin Designs 7: 316–326, 1999     

Stability of Order Statistics under Dependence

We precisely evaluate the upper and lower deviations of the expectation of every order statistic from an i.i.d. sample under arbitrary violations of the independence assumption, measured in scale units generated by various central absolute moments of the parent distribution of a single observation. We also determine the distributions for which the bounds are attained. The proof is based on combining the Moriguti monotone approximation of functions with the Hölder inequality applied for proper integral representations of expected order statistics in the independent and dependent cases. The method allows us to derive analogous bounds for arbitrary linear combinations of order statistics.     

Finding lower bounds on the complexity of secret sharing schemes by linear programming

Optimizing the maximum, or average, length of the shares in relation to the length of the secret for every given access structure is a difficult and long-standing open problem in cryptology. Most of the known lower bounds on these parameters have been obtained by implicitly or explicitly using that every secret sharing scheme defines a polymatroid related to the access structure. The best bounds that can be obtained by this combinatorial method can be determined by using linear programming, and this can be effectively done for access structures on a small number of participants.By applying this linear programming approach, we improve some of the known lower bounds for the access structures on five participants and the graph access structures on six participants for which these parameters were still undetermined. Nevertheless, the lower bounds that are obtained by this combinatorial method are not tight in general. For some access structures, they can be improved by adding to the linear program non-Shannon information inequalities as new constraints. We obtain in this way new separation results for some graph access structures on eight participants and for some ports of non-representable matroids. Finally, we prove that, for two access structures on five participants, the combinatorial lower bound cannot be attained by any linear secret sharing scheme.     

Sharp upper bounds for the adjacency and the signless Laplacian spectral radius of graphs

Let G be a simple graph with n vertices and m edges. In this paper, we present some new upper bounds for the adjacency and the signless Laplacian spectral radius of graphs in which every pair of adjacent vertices has at least one common adjacent vertex. Our results improve some known upper bounds. The main tool we use here is the Lagrange identity.     

The range of the tangential Cauchy–Riemann system to a CR embedded manifold

We prove that every compact, pseudoconvex, orientable, CR manifold of , bounds a complex manifold in the C ^∞ sense. In particular, has closed range.     

Short cycles in mediate graphs

We determine bounds for the smallest f(n) such that every mediate graph with n vertices contains a (directed) cycle of length at most f(n).