Quotient normed cones

Given a normed cone (X, p) and a subconeY, we construct and study the quotient normed cone (X/Y,p) generated byY. In particular we characterize the bicompleteness of (X/Y, ‖·‖ ^p ,p) in terms of the bicompleteness of (X, p), and prove that the dual quotient cone ((X/Y)^*, || · ‖·‖^p,p) can be identified as a distinguished subcone of the dual cone (X ^*, || · ||_{p, u}). Furthermore, some parts of the theory are presented in the general setting of the spaceCL(X, Y) of all continuous linear mappings from a normed cone (X, p) to a normed cone (Y, q), extending several well-known results related to open continuous linear mappings between normed linear spaces.     

On the distribution of the number of customers in the symmetric M/G/1 queue

We consider an M/G/1 queue with symmetric service discipline. The class of symmetric service disciplines contains, in particular, the preemptive last-come-first-served discipline and the processor-sharing discipline. It has been conjectured in Kella et al. [1] that the marginal distribution of the queue length at any time is identical for all symmetric disciplines if the queue starts empty. In this paper we show that this conjecture is true if service requirements have an Erlang distribution. We also show by a counterexample, involving the hyperexponential distribution, that the conjecture is generally not true. AMS Subject Classifications Primary—60K25; Secondary—90B22     

An iteration method for the symmetric solutions and the optimal approximation solution of the matrix equation AXB=C

An iteration method is constructed to solve the linear matrix equation AXB=C over symmetric X. By this iteration method, the solvability of the equation AXB=C over symmetric X can be determined automatically, when the equation AXB=C is consistent over symmetric X, its solution can be obtained within finite iteration steps, and its least-norm symmetric solution can be obtained by choosing a special kind of initial iteration matrix, furthermore, its optimal approximation solution to a given matrix can be derived by finding the least-norm symmetric solution of a new matrix equation . Finally, numerical examples are given for finding the symmetric solution and the optimal approximation symmetric solution of the matrix equation AXB=C.     

Toric Rigid Spaces

This paper gives a method to construct rigid spaces, which is similar to the method used to construct toric schemes.     

On the asymptotic number of inequivalent binary self-dual codes

Let Ψn be the number of inequivalent self-dual codes in . We prove that , where . Let Δn be the number of inequivalent doubly even self-dual codes in . We also prove that .     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Generalized characters of the symmetric group

Normalized irreducible characters of the symmetric group S(n) can be understood as zonal spherical functions of the Gelfand pair (S(n)×S(n),diagS(n)). They form an orthogonal basis in the space of the functions on the group S(n) invariant with respect to conjugations by S(n). In this paper we consider a different Gelfand pair connected with the symmetric group, that is an “unbalanced” Gelfand pair (S(n)×S(n−1),diagS(n−1)). Zonal spherical functions of this Gelfand pair form an orthogonal basis in a larger space of functions on S(n), namely in the space of functions invariant with respect to conjugations by S(n−1). We refer to these zonal spherical functions as normalized generalized characters of S(n). The main discovery of the present paper is that these generalized characters can be computed on the same level as the irreducible characters of the symmetric group. The paper gives a Murnaghan-Nakayama type rule, a Frobenius type formula, and an analogue of the determinantal formula for the generalized characters of S(n).     

On certain spaces of lattice diagram determinants

The aim of this work is to study some lattice diagram determinants Δ_L(X,Y) as defined in (Adv. Math. 142 (1999) 244) and to extend results of Aval et al. (J. Combin. Theory Ser. A, to appear). We recall that M_L denotes the space of all partial derivatives of Δ_L. In this paper, we want to study the space M_i,j^k(X,Y) which is defined as the sum of M_L spaces where the lattice diagrams L are obtained by removing k cells from a given partition, these cells being in the “shadow” of a given cell (i,j) in a fixed Ferrers diagram. We obtain an upper bound for the dimension of the resulting space M_i,j^k(X,Y), that we conjecture to be optimal. This dimension is a multiple of n! and thus we obtain a generalization of the n! conjecture. Moreover, these upper bounds associated to nice properties of some special symmetric differential operators (the “shift” operators) allow us to construct explicit bases in the case of one set of variables, i.e. for the subspace M_i,j^k(X) consisting of elements of 0 Y-degree.     

Benson真有效意义下集值优化的广义最优性条件

本文引入了关于集值映射的α-阶Clarke切导数、α-阶邻接切导数及α-阶 伴随切导数的概念,借此建立了约束向量集值优化Benson真有效解导数型的Kuhn- Tucker条件.     

Existence of Positive Solutions for Singular Second-order<Emphasis Type="Italic">m</Emphasis>-Point Boundary Value Problems

Abstract   The singular second-order m-point boundary value problem