Coprimitive sets and inextendable codes

Complete (n,r)-arcs in PG(k−1,q) and projective (n,k,n−r) _q -codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable length admit only projective extensions. Thus, we are able to prove the maximality of many known linear codes. At the same time our results sharply limit the possibilities for constructing long non-linear codes. We also show that certain short linear codes are maximal. The methods here may be just as interesting as the results. They are based on the Bruen–Silverman model of linear codes (see Alderson TL (2002) PhD. Thesis, University of Western Ontario; Alderson TL (to appear) J Combin Theory Ser A; Bruen AA, Silverman R (1988) Geom Dedicata 28(1): 31–43; Silverman R (1960) Can J Math 12: 158–176) as well as the theory of Rédei blocking sets first introduced in Bruen AA, Levinger B (1973) Can J Math 25: 1060–1065.      

Determining <Emphasis Type="Italic">p</Emphasis>-values for systems cointegration tests with a prior adjustment for deterministic terms

Following Doornik (J Econ Surv 12:573–593, 1998) I present a procedure to approximate the asymptotic distributions of systems cointegration tests with a prior adjustment for deterministic terms suggested by Lütkepohl (Econometrica 72:647–662, 2004), Saikkonen and Lütkepohl (Econometric Theory 16:373–406, 2000a, J Business Econ Stat 18:451–464, 2000b, Time Series Anal 21:435–456, 2000c) and Saikkonen and Luukkonen (J Econ 81:93–126, 1997). These tests rely upon different assumptions as to the inclusion of deterministic components such as a constant, a linear trend or a level shift. The asymptotic distributions, which are functions of Brownian motions, are approximated by Gamma distributions. Only estimates of the mean and variance of the asymptotic test distributions are needed to fit the Gamma distributions. Such estimates are obtained from response surfaces. The required coefficients to compute the asymptotic moments are presented in this paper. Via the fitted Gamma distributions one can, then, easily derive p-values or arbitrary percentiles.     

Regular Score Tests of Independence in Multivariate Extreme Values

The score tests of independence in multivariate extreme values derived by Tawn (Tawn, J.A., “Bivariate extreme value theory: models and estimation,” Biometrika 75, 397–415, 1988) and Ledford and Tawn (Ledford, A.W. and Tawn, J.A., “Statistics for near independence in multivariate extreme values,” Biometrika 83, 169–187, 1996) have non-regular properties that arise due to violations of the usual regularity conditions of maximum likelihood. Two distinct types of regularity violation are encountered in each of their likelihood frameworks: independence within the underlying model corresponding to a boundary point of the parameter space and the score function having an infinite second moment. For applications, the second form of regularity violation has the more important consequences, as it results in score statistics with non-standard normalisation and poor rates of convergence. The corresponding tests are difficult to use in practical situations because their asymptotic properties are unrepresentative of their behaviour for the sample sizes typical of applications, and extensive simulations may be needed in order to evaluate adequately their null distribution. Overcoming this difficulty is the primary focus of this paper. We propose a modification to the likelihood based approaches used by Tawn (Tawn, J.A., “Bivariate extreme value theory: models and estimation,” Biometrika 75, 397–415, 1988) and Ledford and Tawn (Ledford, A.W. and Tawn, J.A., “Statistics for near independence in multivariate extreme values,” Biometrika 83, 169–187, 1996) that provides asymptotically normal score tests of independence with regular normalisation and rapid convergence. The resulting tests are straightforward to implement and are beneficial in practical situations with realistic amounts of data. AMS 2000 Subject Classification Primary—60G70 Secondary—62H15     

A formula for deficiency (L-andR-tests)

In this paper an analogue of the formulas [D. M. Chibisov,Teor. Veroyatn. Primen.,30, 269–288 (1985);Izv. Akad. Nauk UzSSR,6, 23–30 (1982)] for the difference between the power of a given asymptotically efficient test and that of the most powerful test is justified for one-sample L-and R-tests, i.e., tests based on linear combinations of order statistics and linear rank statistics. This formula directly yields the Hodges-Lehmann deficiency of corresponding tests. A general theorem is stated which is applied to L-and R-tests. The explicit expressions given by this formula for L- and R-tests are also presented. The expression related to R-tests agrees with the one obtained in [W. Albers, P. J. Bickel, and W. R. Van Zwet,Ann. Statist.,4, 108–156 (1976);6, 1170–1171 (1978)]. We present here a nontechnical (heuristic) proof of these results. Supported by the Russian Foundation for Fundamental Research (grant No. 93-011-1446). Proceedings of the XVI Seminar on Stability Problems for Stochastic Models, Part II, Eger, Hungary, 1994.     

Classification of (0,2)-geometries embedded in AG (3,q)

In De Clerck and Delanote (Des. Codes Cryptogr, 32: 103–110, 2004) it is shown that if a (0,α)-geometry with α ≥  3 is fully embedded in AG (n,q) then it is a linear representation. In De Feyter (J. Combin Theory Ser A, 109(1): 1–23, 2005; Discrete math, 292: 45–54, 2005) the (0,2)-geometries fully embedded in AG(3,q) are classified apart from two open cases. In this paper, we solve these two open cases. This classification for AG(3,q) is used in De Feyter (Adv Geom, 5: 279–292, 2005) to classify the (0,2)-geometries fully embedded in AG(n,q).      

A study of redundancy of some variables in covariate discriminant analysis

The redundancy of some variables in discriminant analysis and its tests were developed by Rao (1946,Sankhyā,7, 407–414; 1948,Biometrika,35, 58–79, 1970,Essays in Probability and Statistics, (eds. R. C. Boseet al.), 587–602, Univ. of North Carolina Press, Chapel Hill), and were further studied by McKay (1977,J. Roy. Statist. Soc. Ser. B,39, 371–380) and Fujikoshi (1982,Ann. Inst. Statist. Math.,34, 523–530). These are now extended to the most general situation which includes redundancy in covariate as well as main variables in discrimination between two or more groups. The likelihood ratio test is derived in a closed form. An alternative test is also suggested.     

A note on slant submanifolds of nearly trans-Sasakian manifolds

The geometry of slant submanifolds of a nearly trans-Sasakian manifold is studied when the tensor field Q is parallel. It is proved that Q is not parallel on the submanifold unless it is anti-invariant and thus the result of [CABRERIZO, J. L.—CARRIAZO, A.—FERNANDEZ, L. M.—FERNANDEZ, M.: Slant submanifolds in Sasakian manifolds, Glasg. Math. J. 42 (2000), 125–138] and [GUPTA, R. S.—KHURSHEED HAIDER, S. M.—SHARFUDIN, A.: Slant submanifolds of a trans-Sasakian manifold, Bull. Math. Soc. Sci. Math. Roumanie (N.S.) 47 (2004), 45–57] are generalized.     

CLT for linear random fields with stationary martingale-difference innovation

In [V. Paulauskas, On Beveridge–Nelson decomposition and limit theorems for linear random fields, J. Multivariate Anal., 101:621–639, 2010], limit theorems for linear random fields generated by independent identically distributed innovations were proved. In this paper, we present the central limit theorem for linear random fields with martingale-differences innovations satisfying the central limit theorem from [J. Dedecker, A central limit theorem for stationary random fields, Probab. Theory Relat. Fields, 110(3):397–426, 1998] and arranged in lexicographical order.     

One-regular Normal Cayley Graphs on Dihedral Groups of Valency 4 or 6 with Cyclic Vertex Stabilizer

A graph G is one-regular if its automorphism group Aut（G） acts transitively and semiregularly on the arc set. A Cayley graph Cay（Г, S） is normal if Г is a normal subgroup of the full automorphism group of Cay（Г, S）. Xu, M. Y., Xu, J. （Southeast Asian Bulletin of Math., 25, 355-363 （2001）） classified one-regular Cayley graphs of valency at most 4 on finite abelian groups. Marusic, D., Pisanski, T. （Croat. Chemica Acta, 73, 969-981 （2000）） classified cubic one-regular Cayley graphs on a dihedral group, and all of such graphs turn out to be normal. In this paper, we classify the 4-valent one-regular normal Cayley graphs G on a dihedral group whose vertex stabilizers in Aut（G） are cyclic. A classification of the same kind of graphs of valency 6 is also discussed.     

Some estimates of the normal approximation for independent non-identically distributed random variables

In this paper, we generalize some results of [V. Bentkus, A new method for approximation in probability and operator theories, Lith. Math. J., 43(4):367–388, 2003] for independent identically distributed summands to to the case of independent non-identically distributed real summands. We derive the Edgeworth expansion with the first term only. Proofs are given following [V. Bentkus, A new method for approximation in probability and operator theories, Lith. Math. J., 43(4):367–388, 2003].     

Order-Compactifications of Totally Ordered Spaces: Revisited

Order-compactifications of totally ordered spaces were described by Blatter (J Approx Theory 13:56–65, 1975) and by Kent and Richmond (J Math Math Sci 11(4):683–694, 1988). Their results generalize a similar characterization of order-compactifications of linearly ordered spaces, obtained independently by Fedorčuk (Soviet Math Dokl 7:1011–1014, 1966; Sib Math J 10:124–132, 1969) and Kaufman (Colloq Math 17:35–39, 1967). In this note we give a simple characterization of the topology of a totally ordered space, as well as give a new simplified proof of the main results of Blatter (J Approx Theory 13:56–65, 1975) and Kent and Richmond (J Math Math Sci 11(4):683–694, 1988). Our main tool will be an order-topological modification of the Dedekind-MacNeille completion. In addition, for a zero-dimensional totally ordered space X, we determine which order-compactifications of X are Priestley order-compactifications.     

A remark on degree sequences of multigraphs

A sequence {d ₁, d ₂, . . . , d _n } of nonnegative integers is graphic (multigraphic) if there exists a simple graph (multigraph) with vertices v ₁, v ₂, . . . , v _n such that the degree d(v _i ) of the vertex v _i equals d _i for each i = 1, 2, . . . , n. The (multi) graphic degree sequence problem is: Given a sequence of nonnegative integers, determine whether it is (multi)graphic or not. In this paper we characterize sequences that are multigraphic in a similar way, Havel (Časopis Pěst Mat 80:477–480, 1955) and Hakimi (J Soc Indust Appl Math 10:496–506, 1962) characterized graphic sequences. Results of Hakimi (J Soc Indust Appl Math 10:496–506, 1962) and Butler, Boesch and Harary (IEEE Trans Circuits Syst CAS-23(12):778–782, 1976) follow.     

Likelihood ratio tests for comparingk populations —The two-parameter nonregular models

Summary The null and nonnull distributions of the likelihood ratio statistics for testing the homogeneity ofk given populations, each associated with a nonregular density depending on two truncation parameters, are investigated. This generalizes to the two-parameter case the work of Hogg (1956,Ann. Math. Statist.,27, 529–532), Barr (1966,J. Amer. Statist. Assoc.,61, 856–864) and Khatri and Jaiswal (1969,Aust. J. Statist.,11, 79–84; 1969, 1971,Ann. Inst. Statist. Math.,21, 127–136;23, 199–210).     

Transitive groups with irreducible representations of bounded degree

A well-known theorem of Jordan states that there exists a function J(d) of a positive integer d for which the following holds: if G is a finite group having a faithful linear representation over ℂ of degree d, then G has a normal Abelian subgroup A with [G:A]≤J(d). We show that if G is a transitive permutation group and d is the maximal degree of irreducible representations of G entering its permutation representation, then there exists a normal solvable subgroup A of G such that [G:A]≤J(d) ^log ₂ ^d. Bibliography: 7 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 223, 1995, pp. 108–119. Translated by S. A. Evdokimov.     

<Emphasis Type="Italic">π</Emphasis>-formulas implied by Dougall’s summation theorem for <Subscript>5</Subscript><Emphasis Type="Italic">F</Emphasis><Subscript>4</Subscript>-series

The general summation theorem for well-poised ₅ F ₄-series discovered by Dougall (Proc. Edinb. Math. Soc. 25:114–132, 1907) is shown to imply several infinite series of Ramanujan-type for 1/π and 1/π ², including those due to Bauer (J. Reine Angew. Math. 56:101–121, 1859) and Glaisher (Q. J. Math. 37:173–198, 1905) as well as some recent ones by Levrie (Ramanujan J. 22:221–230, 2010).     

Semidefinite bounds for the stability number of a graph via sums of squares of polynomials

Lovász and Schrijver (SIAM J. Optim. 1:166–190, 1991) have constructed semidefinite relaxations for the stable set polytope of a graph G = (V,E) by a sequence of lift-and-project operations; their procedure finds the stable set polytope in at most α(G) steps, where α(G) is the stability number of G. Two other hierarchies of semidefinite bounds for the stability number have been proposed by Lasserre (SIAM J. Optim. 11:796–817, 2001; Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, pp 293–303, 2001) and by de Klerk and Pasechnik (SIAM J. Optim. 12:875–892), which are based on relaxing nonnegativity of a polynomial by requiring the existence of a sum of squares decomposition. The hierarchy of Lasserre is known to converge in α(G) steps as it refines the hierarchy of Lovász and Schrijver, and de Klerk and Pasechnik conjecture that their hierarchy also finds the stability number after α(G) steps. We prove this conjecture for graphs with stability number at most 8 and we show that the hierarchy of Lasserre refines the hierarchy of de Klerk and Pasechnik.      

On a class of secant-like methods for solving nonlinear equations

We provide a semilocal convergence analysis for a certain class of secant-like methods considered also in Argyros (J Math Anal Appl 298:374–397, 2004, 2007), Potra (Libertas Mathematica 5:71–84, 1985), in order to approximate a locally unique solution of an equation in a Banach space. Using a combination of Lipschitz and center-Lipschitz conditions for the computation of the upper bounds on the inverses of the linear operators involved, instead of only Lipschitz conditions (Potra, Libertas Mathematica 5:71–84, 1985), we provide an analysis with the following advantages over the work in Potra (Libertas Mathematica 5:71–84, 1985) which improved the works in Bosarge and Falb (J Optim Theory Appl 4:156–166, 1969, Numer Math 14:264–286, 1970), Dennis (SIAM J Numer Anal 6(3):493–507, 1969, 1971), Kornstaedt (1975), Larsonen (Ann Acad Sci Fenn, A 450:1–10, 1969), Potra (L’Analyse Numérique et la Théorie de l’Approximation 8(2):203–214, 1979, Aplikace Mathematiky 26:111–120, 1981, 1982, Libertas Mathematica 5:71–84, 1985), Potra and Pták (Math Scand 46:236–250, 1980, Numer Func Anal Optim 2(1):107–120, 1980), Schmidt (Period Math Hung 9(3):241–247, 1978), Schmidt and Schwetlick (Computing 3:215–226, 1968), Traub (1964), Wolfe (Numer Math 31:153–174, 1978): larger convergence domain; weaker sufficient convergence conditions, finer error bounds on the distances involved, and a more precise information on the location of the solution. Numerical examples further validating the results are also provided.     

On testing extreme value conditions

Applications of univariate extreme value theory rely on certain as- sumptions. Recently, two methods for testing these extreme value conditions are derived by [Dietrich, D., de Haan, L., Hüsler, J., Extremes 5: 71–85, (2002)] and [Drees, H., de Haan, L., Li, D., J. Stat. Plan. Inference, 136: 3498–3538, (2006)]. In this paper we compare the two tests by simulations and investigate the effect of a possible weight function by choosing a parameter, the test error and the power of each test. The conclusions are useful for extreme value applications.