Construction of Octonionic Polynomials

In a previous paper “[On Octonionic Polynomials”, Advances in Applied Clifford Algebras, 17 (2), (2007), 245–258] we discussed generalizations of results on quaternionic polynomials to the octonionic polynomials. In this paper, we continue this generalization searching for methods to construct octonionic polynomials with a prescribed set of zeros.     

The Yamabe problem on quaternionic contact manifolds

By constructing normal coordinates on a quaternionic contact manifold M, we can osculate the quaternionic contact structure at each point by the standard quaternionic contact structure on the quaternionic Heisenberg group. By using this property, we can do harmonic analysis on general quaternionic contact manifolds, and solve the quaternionic contact Yamabe problem on M if its Yamabe invariant satisfies λ(M) < λ(ℍ ⁿ ). Mathematics Subject Classification (2000) 53C17, 53D10, 35J70     

Representation fields for quaternionic skew-hermitian forms

Classes of indefinite quadratic forms in a genus are in correspondence with the Galois group of an abelian extension called the spinor class field (Estes and Hsia, Japanese J. Math. 16, 341–350 (1990)). Hsia has proved (Hsia et al., J. Reine Angew. Math. 494, 129–140 (1998)) the existence of a representation field F with the property that a lattice in the genus represents a fixed given lattice if and only if the corresponding element of the Galois group is trivial on F. This far, the corresponding result for skew-hermitian forms was known only in some special cases, e.g., when the ideal (2) is square free over the base field. In this work we prove the existence of representation fields for quaternionic skew-hermitian forms in complete generality.     

On the Quaternionic B 2-Slant Helices in the Euclidean Space E 4

In this paper we give a new definition of harmonic curvature functions in terms of B ₂ and we define a new kind of slant helix which we call quaternionic B ₂–slant helix in 4–dimensional Euclidean space E ⁴ by using the new harmonic curvature functions. Also we define a vector field D which we call Darboux quaternion of the real quaternionic B ₂–slant helix in 4–dimensional Euclidean space E ⁴ and we give a new characterization such as: "a: I ì \mathbb R ? E⁴{``\alpha : I \subset {\mathbb R} \rightarrow E^4} is a quaternionic B ₂–slant helix ${\Leftrightarrow H^\prime_2 -KH_{1} = 0"}${\Leftrightarrow H^\prime_2 -KH_{1} = 0"} where H ₂, H ₁ are harmonic curvature functions and K is the principal curvature function of the curve α.     

A new class of lattice paths and partitions with <Emphasis Type="Italic">n</Emphasis> copies of <Emphasis Type="Italic">n</Emphasis>

Agarwal and Bressoud (Pacific J. Math. 136(2) (1989) 209–228) defined a class of weighted lattice paths and interpreted several q-series combinatorially. Using the same class of lattice paths, Agarwal (Utilitas Math. 53 (1998) 71–80; ARS Combinatoria 76 (2005) 151–160) provided combinatorial interpretations for several more q-series. In this paper, a new class of weighted lattice paths, which we call associated lattice paths is introduced. It is shown that these new lattice paths can also be used for giving combinatorial meaning to certain q-series. However, the main advantage of our associated lattice paths is that they provide a graphical representation for partitions with n + t copies of n introduced and studied by Agarwal (Partitions with n copies of n, Lecture Notes in Math., No. 1234 (Berlin/New York: Springer-Verlag) (1985) 1–4) and Agarwal and Andrews (J. Combin. Theory A45(1) (1987) 40–49).     

The Existence of Positive Almost Periodic Type Solutions for Some Nonlinear Delay Integral Equations

This paper presents the conditions of existence of positive almost periodic type solutions for some nonlinear delay integral equations, by using a fixed point theorem in the mixed monotone operators （Ma, Y.： On a class of mixed monotone operators and a kind of two-point bounded value problem. Indian J. Math., 41（2）, 211-220 （1999]]. Some known results are operators.     

Weyl connections and the local sphere theorem for quaternionic contact structures

We apply the theory of Weyl structures for parabolic geometries developed by Čap and Slovák (Math Scand 93(1):53–90, 2003) to compute, for a quaternionic contact (qc) structure, the Weyl connection associated to a choice of scale, i.e. to a choice of Carnot–Carathéodory metric in the conformal class. The result of this computation has applications to the study of the conformal Fefferman space of a qc manifold, cf. (Geom Appl 28(4):376–394, 2010). In addition to this application, we are also able to easily compute a tensorial formula for the qc analog of the Weyl curvature tensor in conformal geometry and the Chern–Moser tensor in CR geometry. This tensor was first discovered via different methods by Ivanov and Vasillev (J Math Pures Appl 93:277–307, 2010), and we also get an independent proof of their Local Sphere Theorem. However, as a result of our derivation of this tensor, its fundamental properties—conformal covariance, and that its vanishing is a sharp obstruction to local flatness of the qc structure—follow as easy corollaries from the general parabolic theory.     

The Structure of Hereditary Properties and Colourings of Random Graphs

in the probability space ? Second, does there exist a constant such that the -chromatic number of the random graph is almost surely ? The second question was posed by Scheinerman (SIAM J. Discrete Math. 5 (1992) 74–80). The two questions are closely related and, in the case p=1/2, have already been answered. Pr?mel and Steger (Contemporary Mathematics 147, Amer. Math. Soc., Providence, 1993, pp. 167-178), Alekseev (Discrete Math. Appl. 3 (1993) 191-199) and the authors ( Algorithms and Combinatorics 14 Springer-Verlag (1997) 70–78) provided an approximation which was used by the authors (Random Structures and Algorithms 6 (1995) 353–356) to answer the -chromatic question for p=1/2. However, the approximating properties that work well for p=1/2 fail completely for . In this paper we describe a class of properties that do approximate in , in the following sense: for any desired accuracy of approximation, there is a property in our class that approximates to this level of accuracy. As may be expected, our class includes the simple properties used in the case p=1/2. The main difficulty in answering the second of our two questions, that concerning the -chromatic number of , is that the number of small -graphs in has, in general, large variance. The variance is smaller if we replace by a simple approximation, but it is still not small enough. We overcome this by considering instead a very rigid non-hereditary subproperty of the approximating property; the variance of the number of small -graphs is small enough for our purpose, and the structure of is sufficiently restricted to enable us to show this by a fine analysis. Received April 20, 1999     

Dynamic allocation indices for restless projects and queueing admission control: a polyhedral approach

 This paper develops a polyhedral approach to the design, analysis, and computation of dynamic allocation indices for scheduling binary-action (engage/rest) Markovian stochastic projects which can change state when rested (restless bandits (RBs)), based on partial conservation laws (PCLs). This extends previous work by the author [J. Ni?o-Mora (2001): Restless bandits, partial conservation laws and indexability. Adv. Appl. Probab. 33, 76–98], where PCLs were shown to imply the optimality of index policies with a postulated structure in stochastic scheduling problems, under admissible linear objectives, and they were deployed to obtain simple sufficient conditions for the existence of Whittle's (1988) RB index (indexability), along with an adaptive-greedy index algorithm. The new contributions include: (i) we develop the polyhedral foundation of the PCL framework, based on the structural and algorithmic properties of a new polytope associated with an accessible set system -extended polymatroid}); (ii) we present new dynamic allocation indices for RBs, motivated by an admission control model, which extend Whittle's and have a significantly increased scope; (iii) we deploy PCLs to obtain both sufficient conditions for the existence of the new indices (PCL-indexability), and a new adaptive-greedy index algorithm; (iv) we interpret PCL-indexability as a form of the classic economics law of diminishing marginal returns, and characterize the index as an optimal marginal cost rate; we further solve a related optimal constrained control problem; (v) we carry out a PCL-indexability analysis of the motivating admission control model, under time-discounted and long-run average criteria; this gives, under mild conditions, a new index characterization of optimal threshold policies; and (vi) we apply the latter to present new heuristic index policies for two hard queueing control problems: admission control and routing to parallel queues; and scheduling a multiclass make-to-stock queue with lost sales, both under state-dependent holding cost rates and birth-death dynamics. Received: April 2000 / Accepted: October 2002 Published online: December 9, 2002 RID="★" ID="★" Work partly supported by the Spanish Ministry of Science and Technology (grant BEC2000-1027), NATO (Collaborative Linkage Grant PST.CLG.976568), and the Joint Spanish-US (Fulbright) Commission for Scientific and Technical Exchange (project 2000-20132) Key words. Markov decision process – restless bandits – polyhedral combinatorics – extended polymatroid – adaptive-greedy algorithm – dynamic allocation index – stochastic scheduling – threshold policy – index policy – Gittins index – Klimov index – Whittle index – control of queues – admission control – routing – make-to-stock – multiclass queue – finite buffers – conservation laws – achievable performance Mathematics Subject Classification (1991): (AMS 2000 Subject Classification): 90B36, 90B22, 90C40, 90C57, 90C08     

Existence of <Emphasis Type="Italic">g</Emphasis><Superscript>1</Superscript><Subscript><Emphasis Type="Italic">g</Emphasis>–2</Subscript>’s on a double covering of a hyperelliptic curve

Abstract Let X be a non–hyperelliptic curve of genus g which is a double covering of a hyperelliptic curve C of genus h. In this paper, we prove that, if h≥ 3 and g≥ 4h+5, then X admits a complete, base point free g¹_g–2. Moreover, if h=3, this result holds under the mild condition g≥ 4h+3=15. Keywords: Double covering of hyperelliptic curves, Pencil of degree g–2 Mathematics Subject Classification (2000:) 14H30, 14H45     

The geometry of compact homogeneous spaces with two isotropy summands

We give a complete list of all homogeneous spaces M = G/H where G is a simple compact Lie group, H a connected, closed subgroup, and G/H is simply connected, for which the isotropy representation of H on T _p M decomposes into exactly two irreducible summands. For each homogeneous space, we determine whether it admits a G-invariant Einstein metric. When there is an intermediate subgroup H <  K <  G, we classify all the G-invariant Einstein metrics. This is an extension of the classification of isotropy irreducible spaces, given independently by Manturov (Dokl. Akad. Nauk SSSR 141, (1961), 792–795 1034–1037, Tr. Semin. Vector Tensor Anal. 13, (1966), 68–145) and J Wolf (Acta Math. 120, (1968), 59–148 152, (1984) 141–142).      

Representing a Functional Curve by Curves with Fewer Peaks

In this paper, we study the problems of (approximately) representing a functional curve in 2-D by a set of curves with fewer peaks. Representing a function (or its curve) by certain classes of structurally simpler functions (or their curves) is a basic mathematical problem. Problems of this kind also find applications in applied areas such as intensity-modulated radiation therapy (IMRT). Let f\bf f be an input piecewise linear functional curve of size n. We consider several variations of the problems. (1) Uphill–downhill pair representation (UDPR): Find two nonnegative piecewise linear curves, one nondecreasing (uphill) and one nonincreasing (downhill), such that their sum exactly or approximately represents f\bf f. (2) Unimodal representation (UR): Find a set of unimodal (single-peak) curves such that their sum exactly or approximately represents f\bf f. (3) Fewer-peak representation (FPR): Find a piecewise linear curve with at most k peaks that exactly or approximately represents f\bf f. Furthermore, for each problem, we consider two versions. For the UDPR problem, we study its feasibility version: Given ε>0, determine whether there is a feasible UDPR solution for f\bf f with an approximation error ε; its min-ε version: Compute the minimum approximation error ε ^∗ such that there is a feasible UDPR solution for f\bf f with error ε ^∗. For the UR problem, we study its min-k version: Given ε>0, find a feasible solution with the minimum number k ^∗ of unimodal curves for f\bf f with an error ε; its min-ε version: given k>0, compute the minimum error ε ^∗ such that there is a feasible solution with at most k unimodal curves for f\bf f with error ε ^∗. For the FPR problem, we study its min-k version: Given ε>0, find one feasible curve with the minimum number k ^∗ of peaks for f\bf f with an error ε; its min-ε version: given k≥0, compute the minimum error ε ^∗ such that there is a feasible curve with at most k peaks for f\bf f with error ε ^∗. Little work has been done previously on solving these functional curve representation problems. We solve all the problems (except the UR min-ε version) in optimal O(n) time, and the UR min-ε version in O(n+mlog m) time, where m<n is the number of peaks of f\bf f. Our algorithms are based on new geometric observations and interesting techniques.     

Univalence Criteria Starting from the Method of Loewner Chains

The paper continues the work of Royster (Duke Math J 19:447–457, 1952), Mocanu [Mathematica (Cluj) 22(1):77–83, 1980; Mathematica (Cluj) 29:49–55, 1987], Cristea [Mathematica (Cluj) 36(2):137–144, 1994; Complex Var 42:333–345, 2000; Mathematica (Cluj) 43(1):23–34, 2001; Mathematica (Cluj), 2010, to appear; Teoria Topologica a Functiilor Analitice, Editura Universitatii Bucuresti, Romania, 1999] of extending univalence criteria for complex mappings to C ¹ mappings. We improve now the method of Loewner chains which is usually used in complex univalence theory for proving univalence criteria or for proving quasiconformal extensions of holomorphic mappings f : B → C ⁿ to C ⁿ . The results are surprisingly strong. We show that the usual results from the theory, like Becker’s univalence criteria remain true for C ¹ mappings and since we use a stronger form of Loewner’s theory, we obtain results which are stronger even for holomorphic mappings f : B → C ⁿ . In our main result (Theorem 4.1) we end the researches dedicated to quasiconformal extensions of K-quasiregular and holomorphic mappings f : B → C ⁿ to C ⁿ . We show that a C ¹ quasiconformal map f : B → C ⁿ can be extended to a quasiconformal map F : C ⁿ → C ⁿ , without any metric condition imposed to the map f.     

Minimal codewords in Reed–Muller codes

Minimal codewords were introduced by Massey (Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp 276–279, 1993) for cryptographical purposes. They are used in particular secret sharing schemes, to model the access structures. We study minimal codewords of weight smaller than 3 · 2 ^m−r in binary Reed–Muller codes RM(r, m) and translate our problem into a geometrical one, using a classification result of Kasami and Tokura (IEEE Trans Inf Theory 16:752–759, 1970) and Kasami et al. (Inf Control 30(4):380–395, 1976) on Boolean functions. In this geometrical setting, we calculate numbers of non-minimal codewords. So we obtain the number of minimal codewords in the cases where we have information about the weight distribution of the code RM(r, m). The presented results improve previous results obtained theoretically by Borissov et al. (Discrete Appl Math 128(1), 65–74, 2003), and computer aided results of Borissov and Manev (Serdica Math J 30(2-3), 303–324, 2004). This paper is in fact an extended abstract. Full proofs can be found on the arXiv.     

On the intersection of two subgeometries of PG(n, q)

The study of the intersection of two Baer subgeometries of PG(n, q), q a square, started in Bose et al. (Utilitas Math 17, 65–77, 1980); Bruen (Arch Math 39(3), 285–288, (1982). Later, in Svéd (Baer subspaces in the n-dimensional projective space. Springer-Verlag) and Jagos et al. (Acta Sci Math 69(1–2), 419–429, 2003), the structure of the intersection of two Baer subgeometries of PG(n, q) has been completely determined. In this paper, generalizing the previous results, we determine all possible intersection configurations of any two subgeometries of PG(n, q).      

New Identities for Hall-Littlewood Polynomials and Applications

Starting from Macdonald's summation formula of Hall-Littlewood polynomials over bounded partitions and its even partition analogue, Stembridge (Trans. Amer. Math. Soc., 319(2), (1990) 469–498) derived sixteen multiple q-identities of Rogers–Ramanujan type. Inspired by our recent results on Schur functions (Adv. Appl. Math., 27, (2001) 493–509) and based on computer experiments we obtain two further such summation formulae of Hall-Littlewood polynomials over bounded partitions and derive six new multiple q-identities of Rogers–Ramanujan type. 2000 Mathematics Subject Classification: Primary–05A19; Secondary–05A17, 05A30     

Convergence theorems for semigroup-type families of non-self mappings

Motivated by a paper Chidume and Zegeye [Strong convergence theorems for common fixed points of uniformly L-Lipschitzian pseudocontractive semi-groups, Applicable Analysis, 86 (2007), 353–366], we prove several strong convergence theorems for a family (not necessarily a semigroup) ℱ = {T(t): t ∈ G} of nonexpansive or pseudocontractive non-self mappings in a reflexive strictly convex Banach space with a uniformly Gateaux differentiable norm, where G is an unbounded subset of ℝ⁺. Our results extend and improve the corresponding ones byMatsushita and Takahashi [Strong convergence theorems for nonexpansive nonself-mappings without boundary conditions,Nonlinear Analysis, 68 (2008), 412–419],Morales and Jung [Convergence of paths for pseudo-contractive mappings in Banach spaces, Proceedings of American Mathematical Society, 128 (2000), 3411–3419], Song [Iterative approximation to common fixed points of a countable family of nonexpansive mappings, Applicable Analysis, 86 (2007), 1329–1337], Song and Xu [Strong convergence theorems for nonexpansive semigroup in Banach spaces, Journal of Mathematical Analysis and Applications, 338 (2008), 152–161], Wong, Sahu, and Yao [Solving variational inequalities involving nonexpansive type mappings, Nonlinear Analysis, (2007) doi:10.1016/j.na. 2007.11.025] in the context of a non-semigroup family of non-self mappings.      

On the robustness of balanced fractional 2m factorial designs of resolution 2l+1 in the presence of outliers

Summary By use of the algebraic structure, we obtain a simplified expression for the outlier-insensitivity factor for balanced fractional 2^m factorial (2^m-BFF) designs of resolution 2l+1 derived from simple arrays (S-arrays), whose measure has been introduced by Ghosh and Kipnegeno (1985,J. Statist. Plann. Inference,11, 119–129). It is defined by use of the measure suggested by Box and Draper (1975,Biometrika, 62 (2), 347–352). As examples, we study the sensitivity ofA-optimal 2^m-BFF designs of resolution VII (i.e.,l=3) given by Shirakura (1976,Ann. Statist.,4, 515–531; 1977,Hiroshima Math. J.,7, 217–285). We observe that these designs are robust in the sense that they have low sensitivities. Research supported in part by Grant 59530012 (C) and 60530014 (C), Japan.     

Marino—Prodi perturbation type results and Morse indices of minimax critical points for a class of functionals in Banach spaces

In this work, we study a class of Euler functionals defined in Banach spaces, associated with quasilinear elliptic problems involving p-Laplace operator (p > 2). First we obtain perturbation results in the spirit of the remarkable paper by Marino and Prodi (Boll. U.M.I. (4) 11(Suppl. fasc. 3): 1–32, 1975), using the new definition of nondegeneracy given in (Ann. Inst. H. Poincaré: Analyse Non Linéaire. 2:271–292, 2003). We also extend Morse index estimates for minimax critical points, introduced by Lazer and Solimini (Nonlinear Anal. T.M.A. 12:761–775, 1988) in the Hilbert case, to our Banach setting. Mathematics Subject Classification (1991) 58E05, 35B20, 35J60, 35J70