On the logical independence of the identities defining the stochastic independence of random events

For an arbitrary subselection of the identities defining the stochastic independence (of several events), there exist random events, with prescribed probabilities, satisfying only the identities from the subselection. A similar statement holds if the events are required to be exchangeable.     

Generalized degree conditions for graphs with bounded independence number

We consider a generalized degree condition based on the cardinality of the neighborhood union of arbitrary sets of r vertices. We show that a Dirac-type bound on this degree in conjunction with a bound on the independence number of a graph is sufficient to imply certain hamiltonian properties in graphs. For K_1,m-free grphs we obtain generalizations of known results. In particular we show: Theorem. Let r ≥ 1 and m ≥ 3 be integers. Then for each nonnegative function f(r, m) there exists a constant C = C(r, m, f(r, m)) such that if G is a graph of order n (n ≥ r, n > m) with δ_r(G) ≥ (n/3) + C and β (G) ≥ f(r, m), then (a) G is traceable if δ(G) ≥ r and G is connected; (b) G is hamiltonian if δ(G) ≥ r + 1 and G is 2-connected; (c) G is hamiltonian-connected if δ(G) ≥ r + 2 and G is 3-connected. © 1995 John Wiley & Sons, Inc.     

Equivalent conditions for noncentral generalized Laplacianness and independence of matrix quadratic forms

Let Y be an n×p multivariate normal random matrix with general covariance Σ_Y and W be a symmetric matrix. In the present article, the property that a matrix quadratic form Y^′WY is distributed as a difference of two independent (noncentral) Wishart random matrices is called the (noncentral) generalized Laplacianness (GL). Then a set of algebraic results are obtained which will give the necessary and sufficient conditions for the (noncentral) GL of a matrix quadratic form. Further, two extensions of Cochran’s theorem concerning the (noncentral) GL and independence of a family of matrix quadratic forms are developed.     

Commutative ideal theory without finiteness conditions: Completely irreducible ideals

An ideal of a ring is completely irreducible if it is not the intersection of any set of proper overideals. We investigate the structure of completely irrreducible ideals in a commutative ring without finiteness conditions. It is known that every ideal of a ring is an intersection of completely irreducible ideals. We characterize in several ways those ideals that admit a representation as an irredundant intersection of completely irreducible ideals, and we study the question of uniqueness of such representations. We characterize those commutative rings in which every ideal is an irredundant intersection of completely irreducible ideals.

     

Multivariate nonparametric tests for independence

Multivariate generalizations of Bhuchongkul's bivariate rank statistics [Ann. Math. Statist.35 (1964)] have been introduced and studied in this paper for the purpose of testing mulitvariate independence. It is shown that the test statistics can be expressed as rank statistics which are easy to compute, have asymptotic normal distributions, and can detect mutual dependence in alternatives which are pairwise independent. The tests are compared to the Puri-Sen-Gokhale [[8]] tests and a normal theory test [ [1]] using Pitman efficiency.     

A relative bound for independence

We prove an upper bound for the independence number of a graph in terms of the largest Laplacian eigenvalue, and of a certain induced subgraph. Our bound is a refinement of a well-known Hoffman-type bound.     

非奇H-矩阵的实用性新判定

给出了非奇H矩阵几个新的实用性判据,改进了近期的一些结果,并给出相应数值例子来说明结果的有效性.     

The potential of greed for independence

The well‐known lower bound on the independence number of a graph due to Caro (Technical Report, Tel‐Aviv University, 1979) and Wei (Technical Memorandum, TM 81 ‐ 11217 ‐ 9, Bell Laboratories, 1981) can be established as a performance guarantee of two natural and simple greedy algorithms or of a simple randomized algorithm. We study possible generalizations and improvements of these approaches using vertex weights and discuss conditions on so‐called potential functions p_G: V(G)→?₀ defined on the vertex set of a graph G for which suitably modified versions of the greedy algorithms applied to G yield independent sets I with . We provide examples of such potentials, which lead to bounds improving the bound due to Caro and Wei. Furthermore, suitably adapting the randomized algorithm we give a short proof of Thiele's lower bound on the independence number of a hypergraph (T. Thiele, J Graph Theory 30 (1999), 213–221).     

New optimality conditions for nonsmooth control problems

This work considers nonsmooth optimal control problems and provides two new sufficient conditions of optimality. The first condition involves the Lagrange multipliers while the second does not. We show that under the first new condition all processes satisfying the Pontryagin Maximum Principle (called MP-processes) are optimal. Conversely, we prove that optimal control problems in which every MP-process is optimal necessarily obey our first optimality condition. The second condition is more natural, but it is only applicable to normal problems and the converse holds just for smooth problems. Nevertheless, it is proved that for the class of normal smooth optimal control problems the two conditions are equivalent. Some examples illustrating the features of these sufficient concepts are presented.     

The fine triangle intersections for maximum kite packings

In this paper, the fine triangle intersection problem for a pair of maximum kite packings is investigated. Let Fin(v) = {(s,t) : a pair of maximum kite packings of order v intersecting in s blocks and s+t triangles}. Let Adm(v) = {(s, t) : s + t ≤ bv , s,t are non-negative integers}, where b v = v(v 1)/8 . It is established that Fin(v) = Adm(v)\{(bv-1, 0), (bv-1,1)} for any integer v ≡ 0, 1 (mod 8) and v ≥ 8; Fin(v) = Adm(v) for any integer v ≡ 2, 3, 4, 5, 6, 7 (mod 8) and v ≥ 4.     

New conditions for non-stagnation of minimal residual methods

In the solution of large linear systems, a condition guaranteeing that a minimal residual Krylov subspace method makes some progress, i.e., that it does not stagnate, is that the symmetric part of the coefficient matrix be positive definite. This condition results in a well-established worst-case bound for the convergence rate of the iterative method, due to Elman. This bound has been extensively used, e.g., when the linear system comes from discretized partial differential equations, to show that the convergence of GMRES is independent of the underlying mesh size. In this paper we introduce more general non-stagnation conditions, which do not require the symmetric part of the coefficient matrix to be positive definite, and that guarantee, for example, the non-stagnation of restarted GMRES for certain values of the restarting parameter. Work on this paper was supported in part by the U.S. Department of Energy under grant DE-FG02-05ER25672.     

一个新的与Hadamard不等式相关的映射

对于一个最近发表的凸函数的Hadamard不等式的推广形式的不等式,本文引进了—个与这个不等式相关的的映射,从而给出了该不等式连续的加细.同时提及了它的某些应用.     

Locally optimal rank tests for independence

The problem of testing the hypothesis of independence against multiparametrical set of alternatives is considered. Rank tests, having some locally maximin property are studied and a certain characterization of these tests is given. Finite sample and asymptotic test statistics in a restricted class of tests are derived.     

New algebraic conditions for controllability of neutral differential equations

The present paper is concerned with the study of the controllability of linear autonomous neutral functional differential equations in the state spaceR ⁿ×L ²([–h, 0],R ⁿ).Controllability conditions are based on an abstract evolution equation representation of the system. Useful algebraic criteria are derived. Starting from the abstract functional analytic framework, the analysis is carried down to the matrix theory level, through the crucial intermediate role of the theory of entire functions.     

New sufficient convergence conditions for the secant method

We provide new sufficient conditions for the convergence of the secant method to a locally unique solution of a nonlinear equation in a Banach space. Our new idea uses Lipschitz-type and center-Lipschitz-type instead of just Lipschitz-type conditions on the divided difference of the operator involved. It turns out that this way our error bounds are more precise than the earlier ones and under our convergence hypotheses we can cover cases where the earlier conditions are violated.     

New sufficient conditions for bipancyclicity of balanced bipartite digraphs

The main results provide sufficient conditions for balanced bipartite digraphs to be bipancyclic. These are analogues to well-known results on pancyclic digraphs.