Inverse spectral problems for Dirac operator with eigenvalue dependent boundary and jump conditions

We deal with the Dirac operator with eigenvalue dependent boundary and jump conditions. Properties of eigenvalues, eigenfunctions and the resolvent operator are studied. Moreover, uniqueness theorems of the inverse problem according to the Weyl functions and the spectral data (the sets of eigenvalues and norming constants; two different eigenvalues sets) are proved.     

Multiplier theorems

We state and prove a multiplier theorem for a central element A of ZG, the group ring over Z of a group G. This generalizes most previously known multiplier theorems for difference sets and divisible difference sets. We also provide applications to show that our theorem provides new multipliers and establish the nonexistence of a family of divisible difference sets which correspond to elliptic semiplanes admitting a regular collineation group. © 1995 John Wiley & Sons, Inc.     

Separation theorems and minimax theorems for fuzzy sets

In this paper, we prove some theorems on fuzzy sets. We first show that, in order to demonstrate that the equality of shadows ofA andB implies the equality ofA andB, it is necessary to assume thatA andB are closed and thatS _H (A)=S _H (B) for any closed hyperplane hyperplaneH. We also obtain a separation theorem for two convex fuzzy sets in a Hilbert space. Finally, we investigate results relating to minimax theorems for fuzzy sets. We obtain a necessary and sufficient condition for compactness.The authors wish to express their sincere thanks to Professor Hisaharu Umegaki for his invaluable suggestions and advice.     

ASYMPTOTIC PROPERTIES OF ELEMENTS IN GROUP RINGS OF FINITE GROUPS

A relation between algebraic degrees of eigenvalues of an element in the group ring Z G of a finite group G and their multiplicities is obtained. This result can be regarded as a theorem on asymptotic behavior of parameters in group rings of finite groups which is a parallel result of several well known theorems concerning the relationships of parameters in finite groups.     

Countable Random Sets: Uniqueness in Law and Constructiveness

The first part of this article deals with theorems on uniqueness in law for σ-finite and constructive countable random sets, which in contrast to the usual assumptions may have points of accumulation. We discuss and compare two approaches on uniqueness theorems: first, the study of generators for σ-fields used in this context and, secondly, the analysis of hitting functions. The last section of this paper deals with the notion of constructiveness. We prove a measurable selection theorem and a decomposition theorem for constructive countable random sets, and study constructive countable random sets with independent increments.     

Comparison theorems for symplectic systems of difference equations

In the present paper, we prove comparison theorems for symplectic systems of difference equations, which generalize difference analogs of canonical systems of differential equations. We obtain general relations between the number of focal points of conjoined bases of two symplectic systems with matrices W _i and $ \hat W_i $ \hat W_i as well as their corollaries, which generalize well-known comparison theorems for Hamiltonian difference systems. We consider applications of comparison theorems to spectral theory and in the theory of transformations. We obtain a formula for the number of eigenvalues λ of a symplectic boundary value problem on the interval (λ ₁, λ ₂]. For an arbitrary symplectic transformation, we prove a relationship between the numbers of focal points of the conjoined bases of the original and transformed systems. In the case of a constant transformation, we prove a theorem that generalizes the well-known reciprocity principle for discrete Hamiltonian systems.     

On the eigenvalues of quaternion matrices

This article is a continuation of the article [F. Zhang, Ger?gorin type theorems for quaternionic matrices, Linear Algebra Appl. 424 (2007), pp. 139–153] on the study of the eigenvalues of quaternion matrices. Profound differences in the eigenvalue problems for complex and quaternion matrices are discussed. We show that Brauer's theorem for the inclusion of the eigenvalues of complex matrices cannot be extended to the right eigenvalues of quaternion matrices. We also provide necessary and sufficient conditions for a complex square matrix to have infinitely many left eigenvalues, and analyse the roots of the characteristic polynomials for 2?×?2 matrices. We establish a characterisation for the set of left eigenvalues to intersect or be part of the boundary of the quaternion balls of Ger?gorin.     

Fast enclosure for all eigenvalues in generalized eigenvalue problems

A fast method for enclosing all eigenvalues in generalized eigenvalue problems Ax=λBx is proposed. Firstly a theorem for enclosing all eigenvalues, which is applicable even if A is not Hermitian and/or B is not Hermitian positive definite, is presented. Next a theorem for accelerating the enclosure is presented. The proposed method is established based on these theorems. Numerical examples show the performance and property of the proposed method. As an application of the proposed method, an efficient method for enclosing all eigenvalues in polynomial eigenvalue problems is also sketched.     

A theorem of the closed graph type

The author proves a theorem about systems of sets which generalizes the closed graph theorem. To illustrate its application proofs, are given of several generalizations of the closed graph theorem, of selection theorems, a transitivity theorem for C^...-algebras and factorization theorems in Banach algebras.     

Canonizing partition theorems: Diversification, products, and iterated versions

We present an abstract framework for canonizing partition theorems. The concept of attribute functions and of diversification allows us to establish a canonizing product theorem, generalizing previous results of [19.], 71–83] for the situation of Ramsey's theorem. As applications we mention a canonizing product theorem for arithmetic progressions and for finite geometric arguesian lattices. We show that finite sets and finite vector spaces have the diversification property. Along these lines, iterated versions of the [6.], 249–255] and its q-analogue for finite vector spaces [[24.], 219–239] are derived.     

The sigma-core of a cooperative game

This paper is concerned with the existence of (σ-additive) measures in the core of a cooperative game. The main theorem shows, for a capacityu on the Borel sets of a metric space, that to each additive set function, majorized byu and agreeing withu on a system of closed sets, there exists a measure having these same properties. This theorem is applied, in combination with known core theorems, to the case of a cooperative game defined on the Borel sets of a metric space and whose conjugate is a capacity.     

Location for the right eigenvalues of quaternion matrices

This paper aims to discuss the location for right eigenvalues of quaternion matrices. We will present some different Gerschgorin type theorems for right eigenvalues of quaternion matrices, based on the Gerschgorin type theorem for right eigenvalues of quaternion matrices (Zhang in Linear Algebra Appl. 424:139?C153, 2007), which are used to locate the right eigenvalues of quaternion matrices. We shall conclude this paper with some easily computed regions which are guaranteed to include the right eigenvalues of quaternion matrices in 4D spaces.     

Some limit theorems for the eigenvalues of a sample covariance matrix

Limit theorems are given for the eigenvalues of a sample covariance matrix when the dimension of the matrix as well as the sample size tend to infinity. The limit of the cumulative distribution function of the eigenvalues is determined by use of a method of moments. The proof is mainly combinatorial. By a variant of the method of moments it is shown that the sum of the eigenvalues, raised to k-th power, k = 1, 2,…, m is asymptotically normal. A limit theorem for the log sum of the eigenvalues is completed with estimates of expected value and variance and with bounds of Berry-Esseen type.     

On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

A high dimensional Open Coloring Axiom

We prove a partition theorem for analytic sets, namely, if X is an analytic set in a Polish space and [X]ⁿ = K₀ ∪ K₁ with K₀ open in the relative topology, and the partition satisfies a finitary condition, then either there is a perfect K₀‐homogeneous subset or X is a countable union of K₁‐homogeneous subsets. We also prove a partition theorem for analytic sets in the three‐dimensional case. Finally, we give some applications of the theorems. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Algorithms for Computing Generalized U(<Emphasis Type="Italic">N</Emphasis>) Racah Coefficients

Algorithms are developed for computing generalized Racah coefficients for the U(N) groups. The irreducible representations (irreps) of the U(N) groups, as well as their tensor products, are realized as polynomials in complex variables. When tensor product irrep labels as well as a given irrep label are specified, maps are constructed from the irrep space to the tensor product space. The number of linearly independent maps gives the multiplicity. The main theorem of this paper shows that the eigenvalues of generalized Casimir operators are always sufficient to break the multiplicity. Using this theorem algorithms are given for computing the overlap between different sets of eigenvalues of commuting generalized Casimir operators, which are the generalized Racah coefficients. It is also shown that these coefficients are basis independent. Mathematics Subject Classifications (2000) 22E70, 81R05, 81R40.     

Another Three Part Sperner Theorem

We show that a result of Katona can be made into a three part Sperner theorem which is independent of the best previously known such theorem, in that neither hypothesis implies the other. These three part theorems are stated in terms of a three dimensional rectangular integer lattice L, and give sufficient conditions for F ? L, containing no two points on a line, to be no larger in size than the set of points of middle rank in L. The theorems apply to the more general problem in which L is the product of three symmetric chain orders and F ? L contains no two points equal in two components and ordered in the third.     

A Note on Shiffman's Theorems

Shiffman proved his famous first theorem, that if A R³ is a compact minimal annulus bounded by two convex Jordan curves in parallel (say horizontal) planes, then A is foliated by strictly convex horizontal Jordan curves. In this article we use Perron's method to construct minimal annuli which have a planar end and are bounded by two convex Jordan curves in horizontal planes, but the horizontal level sets of the surfaces are not all convex Jordan curves or straight lines. These surfaces show that unlike his second and third theorems, Shiffman's first theorem is not generalizable without further qualification.     

Classical and approximate sampling theorems; studies in the and the uniform norm

The approximate sampling theorem with its associated aliasing error is due to J.L. Brown (1957). This theorem includes the classical Whittaker–Kotel’nikov–Shannon theorem as a special case. The converse is established in the present paper, that is, the classical sampling theorem for , 1p<∞, w>0, implies the approximate sampling theorem. Consequently, both sampling theorems are fully equivalent in the uniform norm.Turning now to -space, it is shown that the classical sampling theorem for , 1<p<∞ (here p=1 must be excluded), implies the -approximate sampling theorem with convergence in the -norm, provided that f is locally Riemann integrable and belongs to a certain class Λ^p. Basic in the proof is an intricate result on the representation of the integral as the limit of an infinite Riemann sum of |f|^p for a general family of partitions of ; it is related to results of O. Shisha et al. (1973–1978) on simply integrable functions and functions of bounded coarse variation on . These theorems give the missing link between two groups of major equivalent theorems; this will lead to the solution of a conjecture raised a dozen years ago.     

Fuzzy n-cell numbers and the differential of fuzzy n-cell number value mappings

In this paper, we give the definition of a special kind of n-dimension fuzzy numbers, fuzzy n-cell numbers, discuss their operations and representation theorems, define a complete metric on the fuzzy n-cell number space and prove that the metric is equivalent to the supremum metric derived by the Hausdorff metric between the level sets of the n-dimension fuzzy numbers, and obtain an embedding theorem of the fuzzy n-cell number space (isometrically embeds it into a concrete Banach space). We also consider the differential of the fuzzy mappings from an interval into the fuzzy n-cell number space by using the embedding theorem.