A proof of Selberg's orthogonality for automorphic L-functions

Let π and π′ be automorphic irreducible cuspidal representations of GL_m(Q_A) and GL_m′(Q_A), respectively. Assume that π and π′ are unitary and at least one of them is self-contragredient. In this article we will give an unconditional proof of an orthogonality for π and π′, weighted by the von Mangoldt function Λ(n) and 1−n/x. We then remove the weighting factor 1−n/x and prove the Selberg orthogonality conjecture for automorphic L-functions L(s,π) and L(s,π′), unconditionally for m≤4 and m′≤4, and under the Hypothesis H of Rudnick and Sarnak [20] in other cases. This proof of Selberg's orthogonality removes such an assumption in the computation of superposition distribution of normalized nontrivial zeros of distinct automorphic L-functions by Liu and Ye [12].     

On Harary index of graphs

The Harary index is defined as the sum of reciprocals of distances between all pairs of vertices of a connected graph. For a connected graph G=(V,E) and two nonadjacent vertices v_i and v_j in V(G) of G, recall that G+v_iv_j is the supergraph formed from G by adding an edge between vertices v_i and v_j. Denote the Harary index of G and G+v_iv_j by H(G) and H(G+v_iv_j), respectively. We obtain lower and upper bounds on H(G+v_iv_j)−H(G), and characterize the equality cases in those bounds. Finally, in this paper, we present some lower and upper bounds on the Harary index of graphs with different parameters, such as clique number and chromatic number, and characterize the extremal graphs at which the lower or upper bounds on the Harary index are attained.     

Laurent–Padé Approximants to Four Kinds of Chebyshev Polynomial Expansions. Part I. Maehly Type Approximants

Laurent Padé–Chebyshev rational approximants, A _m (z,z ^–1)/B _n (z,z ^–1), whose Laurent series expansions match that of a given function f(z,z ^–1) up to as high a degree in z,z ^–1 as possible, were introduced for first kind Chebyshev polynomials by Clenshaw and Lord [2] and, using Laurent series, by Gragg and Johnson [4]. Further real and complex extensions, based mainly on trigonometric expansions, were discussed by Chisholm and Common [1]. All of these methods require knowledge of Chebyshev coefficients of f up to degree m+n. Earlier, Maehly [5] introduced Padé approximants of the same form, which matched expansions between f(z,z ^–1)B _n (z,z ^–1) and A _m (z,z ^–1). The derivation was relatively simple but required knowledge of Chebyshev coefficients of f up to degree m+2n. In the present paper, Padé–Chebyshev approximants are developed not only to first, but also to second, third and fourth kind Chebyshev polynomial series, based throughout on Laurent series representations of the Maehly type. The procedures for developing the Padé–Chebyshev coefficients are similar to that for a traditional Padé approximant based on power series [8] but with essential modifications. By equating series coefficients and combining equations appropriately, a linear system of equations is successfully developed into two sub-systems, one for determining the denominator coefficients only and one for explicitly defining the numerator coefficients in terms of the denominator coefficients. In all cases, a type (m,n) Padé–Chebyshev approximant, of degree m in the numerator and n in the denominator, is matched to the Chebyshev series up to terms of degree m+n, based on knowledge of the Chebyshev coefficients up to degree m+2n. Numerical tests are carried out on all four Padé–Chebyshev approximants, and results are outstanding, with some formidable improvements being achieved over partial sums of Laurent–Chebyshev series on a variety of functions. In part II of this paper [7] Padé–Chebyshev approximants of Clenshaw–Lord type will be developed for the four kinds of Chebyshev series and compared with those of the Maehly type.     

Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part II: Clenshaw-Lord type approximants

Laurent-Padé (Chebyshev) rational approximantsP _m (w, w ⁻¹)/Q _n (w, w ⁻¹) of Clenshaw-Lord type [2,1] are defined, such that the Laurent series ofP _m /Q _n matches that of a given functionf(w, w ⁻¹) up to terms of orderw ^±(m+n) , based only on knowledge of the Laurent series coefficients off up to terms inw ^±(m+n) . This contrasts with the Maehly-type approximants [4,5] defined and computed in part I of this paper [6], where the Laurent series ofP _m matches that ofQ _n f up to terms of orderw ^±(m+n ), but based on knowledge of the series coefficients off up to terms inw ^±(m+2n). The Clenshaw-Lord method is here extended to be applicable to Chebyshev polynomials of the 1st, 2nd, 3rd and 4th kinds and corresponding rational approximants and Laurent series, and efficient systems of linear equations for the determination of the Padé-Chebyshev coefficients are obtained in each case. Using the Laurent approach of Gragg and Johnson [4], approximations are obtainable for allm≥0,n≥0. Numerical results are obtained for all four kinds of Chebyshev polynomials and Padé-Chebyshev approximants. Remarkably similar results of formidable accuracy are obtained by both Maehly-type and Clenshaw-Lord type methods, thus validating the use of either.     

<Emphasis Type="Italic">G</Emphasis>-compactness and groups

Lascar described E _KP as a composition of E _L and the topological closure of E _L (Casanovas et al. in J Math Log 1(2):305–319). We generalize this result to some other pairs of equivalence relations. Motivated by an attempt to construct a new example of a non-G-compact theory, we consider the following example. Assume G is a group definable in a structure M. We define a structure M′ consisting of M and X as two sorts, where X is an affine copy of G and in M′ we have the structure of M and the action of G on X. We prove that the Lascar group of M′ is a semi-direct product of the Lascar group of M and G/G _L . We discuss the relationship between G-compactness of M and M′. This example may yield new examples of non-G-compact theories. The first author is supported by the Polish Goverment grant N N201 384134. The second author is supported by the Polish Goverment grant N201 032 32/2231.     

Exact Misclassification Probabilities for Plug-In Normal Quadratic Discriminant Functions: II. The Heterogeneous Case

We consider the problem of discriminating between two independent multivariate normal populations, N_p(μ₁, Σ₁) and N_p(μ₂, Σ₂), having distinct mean vectors μ₁ and μ₂ and distinct covariance matrices Σ₁ and Σ₂. The parameters μ₁, μ₂, Σ₁, and Σ₂ are unknown and are estimated by means of independent random training samples from each population. We derive a stochastic representation for the exact distribution of the “plug-in” quadratic discriminant function for classifying a new observation between the two populations. The stochastic representation involves only the classical standard normal, chi-square, and F distributions and is easily implemented for simulation purposes. Using Monte Carlo simulation of the stochastic representation we provide applications to the estimation of misclassification probabilities for the well-known iris data studied by Fisher (Ann. Eugen.7 (1936), 179–188); a data set on corporate financial ratios provided by Johnson and Wichern (Applied Multivariate Statistical Analysis, 4th ed., Prentice–Hall, Englewood Cliffs, NJ, 1998); and a data set analyzed by Reaven and Miller (Diabetologia16 (1979), 17–24) in a classification of diabetic status.     

Interval Valued Intuitionistic （S, T）-fuzzy Hv-submodules

On the basis of the concept of the interval valued intuitionistic fuzzy sets introduced by K. Atanassov, the notion of interval valued intuitionistic fuzzy Hv-submodules of an Hv-module with respect to a t-norm T and an s-norm S is given and the characteristic properties are described. The homomorphic image and the inverse image are investigated. In particular, the connections between interval valued intuitionistic （S, T）-fuzzy Hv-submodules and interval valued intuitionistic （S, T）-fuzzy submodules are discussed.     

Asymptotic distributions of non-central studentized statistics

Let X1,...,Xn be independent and identically distributed random variables and Wn = Wn(X1,...,Xn) be an estimator of parameter θ.Denote Tn =(Wn - θ0)/sn,where sn2 is a variance estimator of Wn.In this paper a general result on the limiting distributions of the non-central studen-tized statistic Tn is given.Especially,when s2n is the jacknife estimate of variance,it is shown that the limit could be normal,a weighted χ2 distribution,a stable distribution,or a mixture of normal and stable distribution.Applicati...     

Log-convexity and log-concavity of hypergeometric-like functions

We find sufficient conditions for log-convexity and log-concavity for the functions of the forms a?∑fkk(a)xk, a?∑fkΓ(a+k)xk and a?∑fkxk/k(a). The most useful examples of such functions are generalized hypergeometric functions. In particular, we generalize the Turán inequality for the confluent hypergeometric function recently proved by Barnard, Gordy and Richards and log-convexity results for the same function recently proved by Baricz. Besides, we establish a reverse inequality which complements naturally the inequality of Barnard, Gordy and Richards. Similar results are established for the Gauss and the generalized hypergeometric functions. A conjecture about monotonicity of a quotient of products of confluent hypergeometric functions is made.     

On the Maximum Number of Cliques in a Graph

A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m edges; (2) graphs with n vertices, m edges, and maximum degree Δ; (3) d-degenerate graphs with n vertices and m edges; (4) planar graphs with n vertices and m edges; and (5) graphs with n vertices and no K₅-minor or no K_3,3-minor. For example, the maximum number of cliques in a planar graph with n vertices is 8(n − 2). Research supported by a Marie Curie Fellowship of the European Community under contract 023865, and by the projects MCYT-FEDER BFM2003-00368 and Gen. Cat 2001SGR00224.     

When Some Complement of a Submodule Is a Summand

A module M is said to satisfy the C ₁₁ condition if every submodule of M has a (i.e., at least one) complement which is a direct summand. It is known that the C ₁ condition implies the C ₁₁ condition and that the class of C ₁₁-modules is closed under direct sums but not under direct summands. We show that if M = M ₁ ⊕ M ₂, where M has C ₁₁ and M ₁ is a fully invariant submodule of M, then both M ₁ and M ₂ are C ₁₁-modules. Moreover, the C ₁₁ condition is shown to be closed under formation of the ring of column finite matrices of size Γ, the ring of m-by-m upper triangular matrices and right essential overrings. For a module M, we also show that all essential extensions of M satisfying C ₁₁ are essential extensions of C ₁₁-modules constructed from M and certain subsets of idempotent elements of the ring of endomorphisms of the injective hull of M. Finally, we prove that if M is a C ₁₁-module, then so is its rational hull. Examples are provided to illustrate and delimit the theory.     

On 2-Detour Subgraphs of the Hypercube

A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y ∈ V(G), d _H (x, y) ≤ d _G (x, y) + 2. We prove a conjecture of Erdős, Hamburger, Pippert, and Weakley by showing that for some positive constant c and every n, each 2-detour subgraph of the n-dimensional hypercube Q _n has at least clog₂ n · 2 ⁿ edges. József Balogh: Research supported in part by NSF grants DMS-0302804, DMS-0603769 and DMS-0600303, UIUC Campus Reseach Board #06139 and #07048, and OTKA 049398. Alexandr Kostochka: Research supported in part by NSF grants DMS-0400498 and DMS-0650784, and grant 06-01-00694 of the Russian Foundation for Basic Research.     

On effectively computable realizations of choice functions: Dedicated to Professors Kenneth J. Arrow and Anil Nerode

Let X be a compact, convex subset of R_n, and let $\text{〈R(X),}\text{F}{}_{\mathrm{R}}\text{〉}$ be a recursive space of alternatives, where R(X) is the image of X in a recursive metric space, and $\text{F}{}_{\mathrm{R}}$ is the family of all recursive subsets of R(X). If $\text{C:}\text{F}{}_{\mathrm{R}}\text{→}\text{F}{}_{\mathrm{R}}$ is a non-trivial recursively representable choice function that is rational in the sense of Richter, we prove that C has no recursive realization within Church's Thesis. Our proof is not a diagonalization argument and uses no paradoxical statements from formal systems. Instead, the proof is a Kleene-Post reduction style argument and uses the Turing equivalence between mechanical devices of computation and the recursive functions of Gödel and Kleene.     

When is a Sum of Annihilator Ideals an Annihilator Ideal?

We call a ring R a right SA-ring if for any ideals I and J of R there is an ideal K of R such that r(I) + r(J) = r(K). This class of rings is exactly the class of rings for which the lattice of right annihilator ideals is a sublattice of the lattice of ideals. The class of right SA-rings includes all quasi-Baer (hence all Baer) rings and all right IN-rings (hence all right selfinjective rings). This class is closed under direct products, full and upper triangular matrix rings, certain polynomial rings, and two-sided rings of quotients. The right SA-ring property is a Morita invariant. For a semiprime ring R, it is shown that R is a right SA-ring if and only if R is a quasi-Baer ring if and only if r(I) + r(J) = r(I ∩ J) for all ideals I and J of R if and only if Spec(R) is extremally disconnected. Examples are provided to illustrate and delimit our results.     

On the γ n -complete hypergroups and K H hypergroups

The class of γn-complete hypergroups is introduced. Several properties and examples are found both of γn-complete hypergroups and of KH hypergroups.     

ω-非常凸空间与ω-非常光滑空间

本文研究了ω-非常凸空间和ω-非常光滑空间的问题.利用局部自反原理和切片证明了ω-非常凸空间和ω-非常光滑空间的对偶关系,讨论了ω-非常凸空间和ω-非常光滑空间与其它凸性和光滑性的关系,给出了ω-非常凸空间与ω-非常光滑空间的若干特征刻画,所得结果完善了关于Banach空间凸性与光滑性理论的研究.     

Pseudo-atoms, atoms and a Jordan type decomposition in effect algebras

The aim of this paper is to introduce and investigate the concept of pseudo-atoms of a real-valued function m defined on an effect algebra L; a few examples of pseudo-atoms and atoms are given in the context of null-additive, null-null-additive and pseudo-null-additive functions and also, some fundamental results for pseudo-atoms under the assumption of null-null-additivity are established. The notions of total variation |m|, positive variation m⁺ and negative variation m⁻ of a real-valued function m on L are studied elaborately and it is proved for a modular measure m (which is of bounded total variation) defined on a D-lattice L that, m is pseudo-atomic (or atomic) if and only if its total variation |m| is pseudo-atomic (or atomic). Finally, a Jordan type decomposition theorem for an extended real-valued function m of bounded total variation defined on an effect algebra L is proved and some properties on decomposed parts of m such as continuity from below, pseudo-atomicity (or atomicity) and being measure, are discussed. A characterization for the function m to be of bounded total variation is established here and used in proving above-mentioned Jordan type decomposition theorem.     

Ideal Structure of Leavitt Path Algebras with Coefficients in a Unital Commutative Ring

For a (countable) graph E and a unital commutative ring R, we analyze the ideal structure of the Leavitt path algebra L _R (E) introduced by Mark Tomforde. We first modify the definition of basic ideals and then develop the ideal characterization of Mark Tomforde. We also give necessary and sufficient conditions for the primeness and the primitivity of L _R (E), and we then determine prime graded basic ideals and left (or right) primitive graded ideals of L _R (E). In particular, when E satisfies Condition (K) and R is a field, they imply that the set of prime ideals and the set of primitive ideals of L _R (E) coincide.     

Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic

We investigate the definability in monadic ∑₁¹ and monadic Π₁¹ of the problems REG_k, of whether there is a regular subgraph of degree k in some given graph, and XREG_k, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REG_k^k and XREG_k^k, respectively, for k ≥ 2 (all our graphs are undirected). Our motivation partly stems from the fact (which we prove here) that REG_k^k and XREG_k^k are logspace equivalent to CONN and REACH, respectively, for k ≥ 3, where CONN is the problem of whether a given graph is connected and REACH is the problem of whether a given graph has a path joining two given vertices. We use monadic first - order reductions, monadic ∑₁¹ games and a recent technique due to Fagin, Stockmeyer and Vardi to almost completely classify whether these problems are definable in monadic ∑₁¹ and monadic Π₁¹, and we compare the definability of these problems (in monadic ∑₁¹ and monadic Π₁¹ with their computational complexity (which varies from solvable using logspace to NP - complete).     

An overshoot approach to recurrence and transience of Markov processes

We develop criteria for recurrence and transience of one-dimensional Markov processes which have jumps and oscillate between +∞ and −∞. The conditions are based on a Markov chain which only consists of jumps (overshoots) of the process into complementary parts of the state space.In particular, we show that a stable-like process with generator −(−Δ)^α(x)/2 such that α(x)=α for x<−R and α(x)=β for x>R for some R>0 and α,β∈(0,2) is transient if and only if α+β<2, otherwise it is recurrent.As a special case, this yields a new proof for the recurrence, point recurrence and transience of symmetric α-stable processes.