Sufficiency and Duality in Multiobjective Variational Problems with Generalized Type I Functions

Recently Hachimi and Aghezzaf introduced the notion of (F,α,ρ,d)-type I functions, a new class of functions that unifies several concepts of generalized type I functions. Here, we extend the concepts of (F,α,ρ,d)-type I and generalized (F,α,ρ, d)-type I functions to the continuous case and we use these concepts to establish various sufficient optimality conditions and mixed duality results for multiobjective variational problems. Our results apparently generalize a fairly large number of sufficient optimality conditions and duality results previously obtained for multiobjective variational problems.     

On the determination and construction of optimal row-column designs having unequal row and column sizes

In this paper we consider experimental situations requiring usage of a row-column design where v treatments are to be applied to experimental units arranged in b ₁ rows and b ₂ columns where row i has size k _1i , i=1,..., b ₁ and column j has size k _2j , j=1,..., b ₂. Conditions analogous to those given in Kunert (1983, Ann. Statis., 11, 247–257) and Cheng (1978, Ann. Statist., 6, 1262–1272) are given which can often be used to establish the optimality of a given row-column design from the optimality of an associated block design. In addition, sufficient conditions are derived which guarantee the existence of an optimal row-column design which can be constructed by appropriately arranging treatments within blocks of an optimal block design.Visiting from the Indian Statistical Institute.     

On the usage of refined linear models for determiningN-way classification designs which are optimal for comparing test treatments with a standard treatment

Summary In this paper we consider experimental settings in whichv test treatments are to be compared to some control or standard treatment and where heterogeneity needs to be eliminated inn-directions. Using techniques similar to those used by Kunnert (1983,Ann. Statist.,11, 247–257) concerning the determination of optimal designs under a refined linear model, some methods are given for constructingn-way classification designs which areA- andMV-optimal for estimating elementary treatment differences involving the standard treatment fromm-way classification designs,m<n, which areA- andMV-optimal for estimating the same treatment differences. Examples are given for the casen=2 to show how the results obtained can be applied. This research was supported by NSF grant No. DMS-8401943.     

Idempotency of Extensions via the Bicompletion

Let Top ₀ be the category of topological T ₀-spaces, QU ₀ the category of quasi-uniform T ₀-spaces, T : QU ₀ → Top ₀ the usual forgetful functor and K : QU ₀ → QU ₀ the bicompletion reflector with unit k : 1 → K. Any T-section F : Top ₀ → QU ₀ is called K-true if KF = FTKF, and upper (lower) K-true if KF is finer (coarser) than FTKF. The literature considers important T-sections F that enjoy all three, or just one, or none of these properties. It is known that T(K,k)F is well-pointed if and only if F is upper K-true. We prove the surprising fact that T(K,k)F is the reflection to Fix(TkF) whenever it is idempotent. We also prove a new characterization of upper K-trueness. We construct examples to set apart some natural cases. In particular we present an upper K-true F for which T(K,k)F is not idempotent, and a K-true F for which the coarsest associated T-preserving coreflector in QU ₀ is not stable under K. We dedicate this paper to the memory of Sérgio de Ornelas Salbany (1941–2005).     

Nondifferentiable Minimax Fractional Programming Problems with (C, α, ρ, d)-Convexity

In this paper, we present necessary optimality conditions for nondifferentiable minimax fractional programming problems. A new concept of generalized convexity, called (C, α, ρ, d)-convexity, is introduced. We establish also sufficient optimality conditions for nondifferentiable minimax fractional programming problems from the viewpoint of the new generalized convexity. When the sufficient conditions are utilized, the corresponding duality theorems are derived for two types of dual programs. This research was partially supported by NSF and Air Force grants     

A New Construction of Central Relative (p a , p a , p a , 1)-Difference Sets

Semiregular relative difference sets (RDS) in a finite group E which avoid a central subgroup C are equivalent to orthogonal cocycles. For example, every abelian semiregular RDS must arise from a symmetric orthogonal cocycle, and vice versa. Here, we introduce a new construction for central (p ^a , p ^a , p ^a , 1)-RDS which derives from a novel type of orthogonal cocycle, an LP cocycle, defined in terms of a linearised permutation (LP) polynomial and multiplication in a finite presemifield. The construction yields many new non-abelian (p ^a , p ^a , p ^a , 1)-RDS. We show that the subset of the LP cocycles defined by the identity LP polynomial and multiplication in a commutative semifield determines the known abelian (p ^a , p ^a , p ^a , 1)-RDS, and give a second new construction using presemifields.We use this cohomological approach to identify equivalence classes of central (p ^a , p ^a , p ^a , 1)-RDS with elementary abelian C and E/C. We show that for p = 2, a 3 and p = 3, a 2, every central (p ^a , p ^a , p ^a , 1)-RDS is equivalent to one arising from an LP cocycle, and list them all by equivalence class. For p = 2, a = 4, we list the 32 distinct equivalence classes which arise from field multiplication. We prove that, for any p, there are at least a equivalence classes of central (p ^a , p ^a , p ^a , 1)-RDS, of which one is abelian and a – 1 are non-abelian.     

Degeneracy in linear complementarity problems: a survey

Given a square matrixM of ordern and a vectorq ⁿ , the linear complementarity problem is the problem of either finding aw ⁿ and az ⁿ such thatw–Mz=q,w0,z0 andw ^T z=0 or showing that no such (w, z) exists. This problem is denoted asLCP(q, M). We say that a solution (w, z) toLCP(q, M) is degenerate if the number of positive coordinates in (w, z) is less thann. As in linear programming, degeneracy may cause cycling in an adjacent vertex following methods like Lemke's algorithm. Moreover, ifLCP(0,M) has a nontrivial solution, a condition related to degeneracy, then unless certain other conditions are satisfied, the algorithm may not be able to decide about the solvability of the givenLCP(q, M). In this paper we review the literature on the implications of degeneracy to the linear complementarity theory.     

Rank estimates in a class of semiparametric two-sample models

We consider a two-sample semiparametric model involving a real parameter and a nuisance parameter F which is a distribution function. This model includes the proportional hazard, proportional odds, linear transformation and Harrington-Fleming models (1982, Biometrika, 69, 533–546). We propose two types of estimates based on ranks. The first is a rank approximation to Huber's M-estimates (1981, Robust Statistics, Wiley) and the second is a Hodges-Lehmann type rank inversion estimate (1963, Ann. Math. Statist., 34, 598–611). We obtain asymptotic normality and efficiency results. The estimates are consistent and asymptotically normal generally but fully efficient only for special cases.Research partially supported by National Science Foundation Grant DMS-86-02083 and National Institute of General Medical Sciences Grant SSS-Y1RO1GM35416-01     

One Setting for All: Metric, Topology, Uniformity, Approach Structure

For a complete lattice V which, as a category, is monoidal closed, and for a suitable Set-monad T we consider (T,V)-algebras and introduce (T,V)-proalgebras, in generalization of Lawvere's presentation of metric spaces and Barr's presentation of topological spaces. In this lax-algebraic setting, uniform spaces appear as proalgebras. Since the corresponding categories behave functorially both in T and in V, one establishes a network of functors at the general level which describe the basic connections between the structures mentioned by the title. Categories of (T,V)-algebras and of (T,V)-proalgebras turn out to be topological over Set.     

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy

This paper addresses Infinitesimal Perturbation Analysis (IPA) in the class of Make-to Stock (MTS) production-inventory systems with backorders under the continuous-review (R,r) policy, where R is the stock-up-to level and r is the reorder point. A system from this class is traditionally modeled as a discrete system with discrete demand arrivals at the inventory facility and discrete replenishment orders placed at the production facility. Here, however, we map an underlying discrete MTS system to a Stochastic Fluid Model (SFM) counterpart in which stochastic fluid-flow rate processes with piecewise constant sample paths replace the corresponding traditional discrete demand arrival and replenishment stochastic processes, under very mild regularity assumptions. The paper then analyzes the SFM counterpart and derives closed-form IPA derivative formulas of the time-averaged inventory level and time-averaged backorder level with respect to the policy parameters, R and r, and shows them to be unbiased. The obtained formulas are comprehensive in the sense that they are computed for any initial inventory state and any time horizon, and are simple and fast to compute. These properties hold the promise of utilizing IPA derivatives as an ingredient of offline design algorithms and online management and control algorithms of the class of systems under study.      

On Finite Groups with a Given Number of Centralizers

For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A₄, the alternating group on four letters. Also, we prove that, if G/Z(G) A₄, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A₄ and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07     

-Operator frames for a Banach space

In this paper, (p,Y)-Bessel operator sequences, operator frames and (p,Y)-Riesz bases for a Banach space X are introduced and discussed as generalizations of the usual concepts for a Hilbert space and of the g-frames. It is proved that the set of all (p,Y)-Bessel operator sequences for a Banach space X is a Banach space and isometrically isomorphic to the operator space B(X,ℓ^p(Y)). Some necessary and sufficient conditions for a sequence of operators to be a (p,Y)-Bessel operator sequence are given. Also, a characterization of an independent (p,Y)-operator frame for X is obtained. Lastly, it is shown that an independent (p,Y)-operator frame for X is just a (p,Y)-Riesz basis for X and has a unique dual (q,Y^*)-operator frame for X^*.     

<Emphasis Type="Italic">I</Emphasis>-projection onto isotonic cones and its applications to maximum likelihood estimation for log-linear models

A frequently occurring problem is to find a probability vector,p∈D, which minimizes theI-divergence between it and a given probability vector π. This is referred to as theI-projection of π ontoD. Darroch and Ratcliff (1972,Ann. Math. Statist.,43, 1470–1480) gave an algorithm whenD is defined by some linear equalities and in this paper, for simplicity of exposition, we propose an iterative procedure whenD is defined by some linear inequalities. We also discuss the relationship betweenI-projection and the maximum likelihood estimation for multinomial distribution. All of the results can be applied to isotonic cone.     

Elements of Small Orders in K2F Ⅱ

In "Elements of small orders in K2(F)" (Algebraic K-Theory, Lecture Notes in Math., 966, 1982, 1-6.), the author investigates elements of the form {a, Φn(a)} in the Milnor group K2F of a field F, where Φn(x) is the n-th cyclotomic polynomial. In this paper, these elements are generalized. Applying the explicit formulas of Rosset and Tate for the transfer homomorphism for K2, the author proves some new results on elements of small orders in K2F.     

The natural functions on the cotangent bundle of higher order vector tangent bundles over fibered manifolds

For natural numbers r,s,q,m,n with s≥r≤q we determine all natural functions g: T ^*(J ^(r,s,q)(Y, R ^1,1)₀)^*→R for any fibered manifold Y with m-dimensional base and n-dimensional fibers. For natural numbers r,s,m,n with s≥r we determine all natural functions g: T ^*(J ^(r,s) (Y, R)₀)^*→R for any Y as above.     

Modal operators on bounded commutative residuated <Emphasis Type="Italic">ℓ</Emphasis>-monoids

Bounded commutative residuated lattice ordered monoids (Rℓ-monoids) are a common generalization of, e.g., Heyting algebras and BL-algebras, i.e., algebras of intuitionistic logic and basic fuzzy logic, respectively. Modal operators (special cases of closure operators) on Heyting algebras were studied in [MacNAB, D. S.: Modal operators on Heyting algebras, Algebra Universalis 12 (1981), 5–29] and on MV-algebras in [HARLENDEROVá,M.—RACHŮNEK, J.: Modal operators on MV-algebras, Math. Bohem. 131 (2006), 39–48]. In the paper we generalize the notion of a modal operator for general bounded commutative Rℓ-monoids and investigate their properties also for certain derived algebras. The first author was supported by the Council of Czech Government, MSM 6198959214.     

Total Scalar Curvature and L 2 Harmonic 1-Forms on a Minimal Hypersurface in Euclidean Space

Let M ⁿ , n 3, be a complete oriented immersed minimal hypersurface in Euclidean space R ⁿ⁺¹. We show that if the total scalar curvature on M is less than the n/2 power of 1/C _s , where C _s is the Sobolev constant for M, then there are no L ² harmonic 1-forms on M. As corollaries, such a minimal hypersurface contains no nontrivial harmonic functions with finite Dirichlet integral and so it has only one end. This implies finally that M is a hyperplane.     

Projective functors and the restriction of a Verma module to a subalgebra of Levi type

We observe that the restriction of a Verma module over a semi-simple Lie algebra to a subalgebra of Levi type may be viewed as a projective functor. By simple arguments we prove that this restriction can be decomposed into a direct sum of standard indecomposables in the category O. For the restriction problem from sl(n+1) to gl(n) we describe the complete answer. We study the properties of the modules with Verma flag also and prove that any module with Verma flag is a submodule of some projective.     

Highly Nonlinear Resilient Functions Through Disjoint Codes in Projective Spaces

Functions which map n-bits to m-bits are important cryptographic sub-primitives in the design of additive stream ciphers. We construct highly nonlinear t-resilient such functions ((n, m, t) functions) by using a class of binary disjoint codes, a construction which was introduced in IEEE Trans. Inform. Theory, Vol. IT-49 (2) (2003). Our main contribution concerns the generation of suitable sets of such disjoint codes. We propose a deterministic method for finding disjoint codes of length ν m by considering the points of PG ). We then obtain some lower bounds on the number of disjoint codes, by fixing some parameters. Through these sets, we deduce in certain cases the existence of resilient functions with very high nonlinearity values. We show how, thanks to our method, the degree and the differential properties of (n, m, t) functions can be improved.Communicated by: J.D. Key     

On co-positive,semi-monotoneQ-matrices

In this paper we consider not necessarily symmetric co-positive as well as semi-monotoneQ-matrices and give a set of sufficient conditions for such matrices to beR ₀-matrices. We give several examples to show the sharpness of our results. Construction of these examples is based on the following elementary proposition: IfA is a square matrix of ordern whose first two rows are identical and bothA ₁₁ andA ₂₂ areQ-matrices whereA _ii stands for the principal submatrix ofA obtained by deleting rowi and columni fromA, thenA is aQ-matrix.Dedicated to our colleague and friend B. Ramachandran on his sixtieth birthday.Corresponding author.