Tournaments,transitivity and pairwise comparison matrices

When attempting to rank a number of items by pairwise comparisons, one is usually advised to guard against generating a preference structure that contains three-way intransitive relationships (three-way cycles; cyclic triads) such as A is preferred to B, B is preferred to C, and C is preferred to A. Some decision procedures, like the Analytic Hierarchy Process, do not rule out intransitivities, while others, like utility theory, have axioms that strictly forbid them. It is generally agreed that intransitivities can occur, especially when the number of items being compared under a multicriteria framework gets to be greater than five. It is also generally agreed that, if intransitivities are found, they should be analysed and changed, if deemed appropriate. That is, there is no inherent rule that says a set of comparisons should not contain any intransitivities, but they should be made explicit. In this paper, we show, using results from tournaments and graph theory, how one can readily determine the number of three-way cycles that exist within a pairwise comparison matrix, and, using standard linear programming procedures, how to find them.     

Most small $${\varvec{}}$$-grous have an automorhism of order 2

Let f(p, n) be the number of pairwise nonisomorphic p-groups of order \(p^n\), and let g(p, n) be the number of groups of order \(p^n\) whose automorphism group is a p-group. We prove that the limit, as p grows to infinity, of the ratio g(p, n) / f(p, n) equals 1/3 for \(n=6,7\).     

Penalized least squares estimation with weakly dependent data

In statistics and machine learning communities, the last fifteen years have witnessed a surge of high-dimensional models backed by penalized methods and other state-of-the-art variable selection techniques. The high-dimensional models we refer to differ from conventional models in that the number of all parameters p and number of significant parameters s are both allowed to grow with the sample size T. When the field-specific knowledge is preliminary and in view of recent and potential affluence of data from genetics, finance and on-line social networks, etc., such (s, T, p)-triply diverging models enjoy ultimate flexibility in terms of modeling, and they can be used as a data-guided first step of investigation. However, model selection consistency and other theoretical properties were addressed only for independent data, leaving time series largely uncovered. On a simple linear regression model endowed with a weakly dependent sequence, this paper applies a penalized least squares (PLS) approach. Under regularity conditions, we show sign consistency, derive finite sample bound with high probability for estimation error, and prove that PLS estimate is consistent in L ₂ norm with rate \(\sqrt {s\log s/T}\).     

A cohomological criterion for <Emphasis Type="Italic">p</Emphasis>-solvability

Let G be a finite group, let p be a prime, and let P be a Sylow p-subgroup of G. In this note we give a cohomological criterion for the p-solvability of G depending on the cohomology in degree 1 with coefficients in \(\mathbb F_p\) of both the normal subgroups of G and P. As a byproduct we bound the minimum possible number of factors of p-power order appearing in any normal series of G, in which each factor is either a p-group, a p’-group, or a non-p-solvable characteristically simple group, by the number of generators of P.     

Regular maps of graphs of order 4<Emphasis Type="Italic">p</Emphasis>

A 2-cell embedding f : X → S of a graph X into a closed orientable surface S can be described combinatorially by a pair M = (X;ρ ) called a map, where ρ is a product of disjoint cycle permutations each of which is the permutation of the arc set of X initiated at the same vertex following the orientation of S . It is well known that the automorphism group of M acts semi-regularly on the arc set of X and if the action is regular, then the map M and the embedding f are called regular. Let p and q be primes. Du et al. [J. Algebraic Combin., 19, 123-141 (2004)] classified the regular maps of graphs of order pq . In this paper all pairwise non-isomorphic regular maps of graphs of order 4 p are constructed explicitly and the genera of such regular maps are computed. As a result, there are twelve sporadic and six infinite families of regular maps of graphs of order 4 p ; two of the infinite families are regular maps with the complete bipartite graphs K2p,2p as underlying graphs and the other four infinite families are regular balanced Cayley maps on the groups Z4p , Z22 × Zp and D4p .     

On high-dimensional two sample mean testing statistics: a comparative study with a data adaptive choice of coefficient vector

The key issues involved in two sample tests in high dimensional problems arise due to large dimension of the mean vector for a relatively small sample size. Recently, Wang et al. (Stat Sin 23:667–690, 2013) proposed a jackknife empirical likelihood test that works under weak assumptions on the dimension of variables (p), and showed that the test statistic has a chi-square limit regardless of whether p is finite or diverges. The sufficient condition required for this statistic is still restrictive. In this paper we significantly relax the sufficient condition for the asymptotic chi-square limit with models allowing flexible dependence structures and derive simpler alternative statistics for testing the equality of two high dimensional means. The proposed statistics have a chi-squared distribution or the maximum of two independent chi-square statistics as their limiting distributions, and the asymptotic results hold for either finite or divergent p. We also propose a data-adaptive method to select the coefficient vector, and compare the various methods in simulation studies. The proposed choice of coefficient vector substantially increases power in the simulation.     

Asymptotics for the partial sum and its maximum of dependent random variables<Superscript>*</Superscript>

Let X ₁,…,X _n be pairwise asymptotically independent or pairwise upper extended negatively dependent real-valued random variables. Under the condition that the distribution of the maximum of X ₁,…,X _n belongs to some subclass of heavy-tailed distributions, we investigate the asymptotic behavior of the partial sum and its maximum generated by dependent X ₁,…,X _n . As an application, we consider a discrete-time risk model with insurance and financial risks and derive the asymptotics for the finite-time ruin probability.     

Borel equivalence relations between <Emphasis Type="Italic">ℓ</Emphasis><Subscript>1</Subscript> and <Emphasis Type="Italic">ℓ</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

In this paper, we show that, for each p 〉 1, there are continuum many Borel equivalence relations between Rω/l1 and Rω/p ordered by ≤B which are pairwise Borel incomparable.     

On <Emphasis Type="Italic">c</Emphasis><Superscript>#</Superscript>-normal subgroups infinite groups

A subgroup H of a finite group G is called a c^#-normal subgroup of G if there exists a normal subgroup K of G such that G = HK and H ∩ K is a CAP-subgroup of G: In this paper, we investigate the influence of fewer c^#-normal subgroups of Sylow p-subgroups on the p-supersolvability, p-nilpotency, and supersolvability of finite groups. We obtain some new sufficient and necessary conditions for a group to be p-supersolvable, p-nilpotent, and supersolvable. Our results improve and extend many known results.     

Algorithmic tests and randomness with respect to a class of measures

This paper offers some new results on randomness with respect to classes of measures, along with a didactic exposition of their context based on results that appeared elsewhere. We start with the reformulation of the Martin-Löf definition of randomness (with respect to computable measures) in terms of randomness deficiency functions. A formula that expresses the randomness deficiency in terms of prefix complexity is given (in two forms). Some approaches that go in another direction (from deficiency to complexity) are considered. The notion of Bernoulli randomness (independent coin tosses for an asymmetric coin with some probability p of head) is defined. It is shown that a sequence is Bernoulli if it is random with respect to some Bernoulli measure B _p . A notion of “uniform test” for Bernoulli sequences is introduced which allows a quantitative strengthening of this result. Uniform tests are then generalized to arbitrary measures. Bernoulli measures B _p have the important property that p can be recovered from each random sequence of B _p . The paper studies some important consequences of this orthogonality property (as well as most other questions mentioned above) also in the more general setting of constructive metric spaces.     

Integral averaging technique for oscillation of damped half-linear oscillators

This paper is concerned with the oscillatory behavior of the damped half-linear oscillator (a(t)?_p(x′))′ + b(t)?_p(x′) + c(t)?_p(x) = 0, where ?p(x) = |x|^p?1 sgn x for x ∈ ? and p > 1. A sufficient condition is established for oscillation of all nontrivial solutions of the damped half-linear oscillator under the integral averaging conditions. The main result can be given by using a generalized Young’s inequality and the Riccati type technique. Some examples are included to illustrate the result. Especially, an example which asserts that all nontrivial solutions are oscillatory if and only if p ≠ 2 is presented.     

Solvability of finite groups

H is called an ? _p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H _p ∈ Syl _p (B) and B is ? _p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? _p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?₅-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A₅.     

Small prime solutions to cubic equations

Let a_1,..., a_9 be nonzero integers not of the same sign, and let b be an integer. Suppose that a_1,..., a_9 are pairwise coprime and a_1 + + a_9 ≡ b(mod 2). We apply the p-adic method of Davenport to find an explicit P = P(a_1,..., a_9, n) such that the cubic equation a_1p_1~3+ + a9p_9~3= b is solvable with p_j 《 P for all 1 ≤ j ≤ 9. It is proved that one can take P = max{|a_1|,..., |a_9|}~c+ |b|~(1/3) with c = 2. This improves upon the earlier result with c = 14 due to Liu(2013).     

On Geary’s theorem for the field of <Emphasis Type="Italic">p</Emphasis>-adic numbers

Let ?_p, where p > 2, be a field of p-adic numbers. We consider two independent identically distributed random variables with values in ?_p and distribution μ with a continuous density. We prove that the sum and the squared difference of these random variables are independent if and only if μ is an idempotent distribution, i.e., a shift of the Haar distribution of a compact subgroup of the additive group of the field ?_p.     

The cubic Fermat equation and complex multiplication on the Deuring normal form

The arithmetic on elliptic curves in Deuring normal form is shown to be related to solutions of the Fermat equation 27X ³+27Y ³=X ³ Y ³. This arithmetic is used to give conditions for the existence of multipliers μ on supersingular elliptic curves in characteristic p for which μ ²=?3p. Together with an explicit factorization of a certain class equation, these conditions imply that the number of irreducible binomial quadratic factors (mod p) of the Legendre polynomial P _(p?e)/3(x) of degree (p?e)/3 is a simple linear function of the class number of the quadratic field \(\mathbb{Q}(\sqrt{-3p})\).     

Well-posedness of non-autonomous linear evolution equations for generators whose commutators are scalar

We prove the well-posedness of non-autonomous linear evolution equations for generators \({A(t): D(A(t)) \subset X \to X}\) whose pairwise commutators are complex scalars, and in addition, we establish an explicit representation formula for the evolution. We also prove well-posedness in the more general case where instead of the onefold commutators only the p-fold commutators of the operators A(t) are complex scalars. All these results are furnished with rather mild stability and regularity assumptions: Indeed, stability in X and strong continuity conditions are sufficient. Additionally, we improve a well-posedness result of Kato for group generators A(t) by showing that the original norm continuity condition can be relaxed to strong continuity. Applications include Segal field operators and Schrödinger operators for particles in external electric fields.     

Nonparametric mean estimation of percentage points and density function values

Let us consider a sample of sizen from a statistical population with probability density function f(x) and 100p per cent point θ_p. The functionf (x) is assumed to be of an analytic nature. This paper presents some methods for approximate nonparametric expected value estimation of θ_p and 1/f(θ _p ). These results are applicable for anyp value which is not too near 0 or 1 and alln values which are not too small. A nonparametric estimate whose expected value differs from θ _p by terms of ordern ^?7/1 can be obtained. For l/f(θ _p ), an estimate whose expected value is accurate to terms of ordern ^?3can be obtained. The estimates developed consist of linear functions of specified order statistics of the sample. The order statistics used are sample percentage points with percentage values which are near 100p. Letm be the number of order statistics appearing in an estimate (m is at most 7). Then the coefficients for the linear estimation function are obtained by solving a specified set of m linear equations inm unknowns. All the estimates presented are consistent.     

An implicit degree condition for relative length of long paths and cycles in graphs

For a graph G, we denote by p(G) and c(G) the number of vertices of a longest path and a longest cycle in G, respectively. For a vertex v in G, id(v) denotes the implicit degree of v. In this paper, we obtain that if G is a 2-connected graph on n vertices such that the implicit degree sum of any three independent vertices is at least n + 1, then either G contains a hamiltonian path, or c(G) ≥ p(G) ? 1.     

New class of hybrid BDF methods for the computation of numerical solutions of IVPs

A new class of hybrid BDF-like methods is presented for solving systems of ordinary differential equations (ODEs) by using the second derivative of the solution in the stage equation of class 2 + 1hybrid BDF-like methods to improve the order and stability regions of these methods. An off-step point, together with two step points, has been used in the first derivative of the solution, and the stability domains of the new methods have been obtained by showing that these methods are A-stable for order p, p =?3,4,5,6,7and A(α)-stable for order p, 8 ≤ p ≤?14. The numerical results are also given for four test problems by using variable and fixed step-size implementations.     

Semialgebraic sets and the Łojasiewicz-Siciak condition

The paper contains a full geometric characterization of compact semialgebraic sets in C satisfying the ?ojasiewicz-Siciak condition. The ?ojasiewicz-Siciak condition is a certain estimate for the Siciak extremal function. In a previous paper, we gave a sufficient criterion for a compact, connected, and semialgebraic set in C to satisfy this condition. In the present paper, we remove completely the connectedness assumption and prove that the aforementioned sufficient condition is also necessary. Moreover, we obtain some new results concerning the ?ojasiewicz-Siciak condition in C^N. For example, we prove that if K₁,...,K_p are compact, nonpluripolar, and pairwise disjoint subsets of C^N, each satisfying the ?ojasiewicz-Siciak condition, and K:= K₁?· · ·?K_p is polynomially convex, then K satisfies this condition as well.