Positive operators on the n-dimensional ice cream cone

Let $\text{K}{}_{\mathrm{n}}\text{= {x ? R}{}^{\mathrm{n}}\text{: (x}{}_1{}^2\text{+ · +x}{}^2{}_{\mathrm{n?1}}\text{)}\text{1}\text{2}\text{? x}{}_{\mathrm{n}}\text{}}$ be the n-dimensional ice cream cone, and let Γ(K_n) be the cone of all matrices in $\text{R}$ⁿⁿ mapping K_n into itself. We determine the structure of Γ(K_n), and in particular characterize the extreme matrices in Γ(K_n).     

The asymptotic equivalence of Bayes and maximum likelihood estimation

Let (X, $\text{A}$) be a measurable space, Θ ? $\text{R}$ an open interval and P_Ω ∥ $\text{A}$, Ω ? Θ, a family of probability measures fulfilling certain regularity conditions. Let $\text{Ω}{}_{\mathrm{n}}$ be the maximum likelihood estimate for the sample size n. Let λ be a prior distribution on Θ and let $\text{R}{}_{\mathrm{<mtext>n,</mtext><mtext>x</mtext>}}$ be the posterior distribution for the sample size n given $\text{x}\text{? X}{}^{\mathrm{n}}$. $\text{L:}\text{Θ}\text{× Θ →}\text{R}$ denotes a loss function fulfilling certain regularity conditions and T_n denotes the Bayes estimate relative to λ and L for the sample size n. It is proved that for every compact K ? Θ there exists c_K ≥ 0 such that

This theorem improves results of Bickel and Yahav [3], and Ibragimov and Has'minskii [4], as far as the speed of convergence is concerned.     

Relative locality of derivations

Let H and K be symmetric linear operators on a C¹-algebra $\text{U}$ with domains D(H) and D(K). H is defined to be strongly K-local if $\text{ω(K(A)}{}^1\text{K(A)) = 0}$ implies $\text{ω(H(A)}{}^1\text{H(A)) = 0}$ for A?D(H) ∩ D(K) and ω in the state space of $\text{U}$, and H is completely strongly K-local if $\text{Ω(K(A)}{}^1\text{K(A))=0}$ implies $\text{Ω(H(A)}{}^1\text{H(A))=0}$ for A ∈ D(H) ∩ D(K) and Ω in the state of $\text{U}$, and H is cpmpletely strongly K-local if $\text{H??}{}_{\mathrm{n}}$ is $\text{K??}{}_{\mathrm{n}}$-local on U?M_n for all n ? 1, where $\text{1}$_n is the identity on the n × n matrices M_n. If $\text{U}$ is abelian then strong locality and complete strong locality are equivalent. The main result states that if τ is a strongly continuous one-parameter group of ¹-automorphisms of $\text{U}$ with generator δ₀ and δ is a derivation which commutes with τ and is completely strongly δ₀-local then δ generates a group α of ¹-automorphisms of $\text{U}$. Various characterizations of α are given and the particular case of periodic τ is discussed.     

Some properties of irreducible coverings by cliques of complete multipartite graphs

In this paper some recursion formulas and asymptotic properties are derived for the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite (labeled) graphs K_p,q. The problem of determining numbers N(p, q) has been raised by I. Tomescu (dans “Logique, Automatique, Informatique,” pp. 269–423, Ed. Acad. R.S.R., Bucharest, 1971). A result concerning the asymptotic behavior of the number of irreducible coverings by cliques of q-partite complete graphs is obtained and it is proved that , $\text{lim}{}_{\mathrm{n\to \infty }}\text{(}\text{log}\text{M(n))}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{= 3}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}$, and $\text{lim}{}_{\mathrm{n\to \infty }}\text{C(n)}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}\text{(}\text{n}\text{ln}\text{n)}\text{=}\text{1}\text{e}$, where I(n) and M(n) are the maximal numbers of irreducible coverings, respectively, coverings by cliques of the vertices of an n-vertex graph, and C(n) is the maximal number of minimal colorings of an n-vertex graph. It is also shown that maximal number of irreducible coverings by n ? 2 cliques of the vertices of an n-vertex graph (n ≥ 4) is equal to 2^n?2 ? 2 and this number of coverings is attained only for K_2,n?2 and the value of $\text{lim}{}_{\mathrm{n\to \infty }}\text{I(n, n ? k)}{}^{\mathrm{<mtext>1</mtext><mtext>n</mtext>}}$ is obtained, where I(n, n ? k) denotes the maximal number of irreducible coverings of an n-vertex graph by n ? k cliques.     

Two-parameter Turan inequalities for ultraspherical and Laguerre polynomials

It is known that the classical orthogonal polynomials satisfy inequalities of the form U_n²(x) ? U_{n + 1}(x) U_{n ? 1}(x) > 0 when x lies in the spectral interval. These are called Turan inequalities. In this paper we will prove a generalized Turan inequality for ultraspherical and Laguerre polynomials. Specifically if P_n^λ(x) and L_n^α(x) are the ultraspherical and Laguerre polynomials and $\text{F}{}_{\mathrm{n}}{}^{\mathrm{\lambda }}\text{(x) =}\text{P}{}_{\mathrm{n}}{}^{\mathrm{\lambda }}\text{(x)}\text{P}{}_{\mathrm{n}}{}^{\mathrm{\lambda }}\text{(1)}\text{, G}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(x) =}\text{L}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(x)}\text{L}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(0)}\text{,}\text{then}\text{F}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(x) F}{}_{\mathrm{n}}{}^{\mathrm{\beta }}\text{(x) ? F}{}_{\mathrm{n\; +\; 1}}{}^{\mathrm{\alpha }}\text{(x) F}{}_{\mathrm{n\; ?\; 1}}{}^{\mathrm{\beta }}\text{(x) > 0, ? 1 < x < 1, ?}\text{1}\text{2}\text{< α ? β ? α + 1}\text{and}\text{G}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(x) G}{}_{\mathrm{n}}{}^{\mathrm{\beta }}\text{(x) ? G}{}_{\mathrm{n\; +\; 1}}{}^{\mathrm{\alpha }}\text{(x) G}{}_{\mathrm{n\; ?\; 1}}{}^{\mathrm{\beta }}\text{(x) > 0, x > 0, 0 < α ? β ? α + 1}$. We also prove the inequality $\text{(n + 1) F}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(x) F}{}_{\mathrm{n}}{}^{\mathrm{\beta }}\text{(x) ? nF}{}_{\mathrm{n\; +\; 1}}{}^{\mathrm{\alpha }}\text{(x) F}{}_{\mathrm{n\; ?\; 1}}{}^{\mathrm{\beta }}\text{(x) > A}{}_{\mathrm{n}}\text{[F}{}_{\mathrm{n}}{}^{\mathrm{\alpha }}\text{(x)]}{}^2\text{, ?1 < x < 1, ?}\text{1}\text{2}\text{< α ? β < α + 1,}\text{where}\text{A}{}_{\mathrm{n}}$ is a positive constant depending on α and β.     

Positive definite distributions on K\GK

Let G be a semisimple noncompact Lie group with finite center and let K be a maximal compact subgroup. Then W. H. Barker has shown that if T is a positive definite distribution on G, then T extends to Harish-Chandra's Schwartz space $\text{C}$¹(G). We show that the corresponding property is no longer true for the space of double cosets $\text{K}\text{G}\text{K}$. If G is of real-rank 1, we construct liner functionals $\text{T}{}_{\mathrm{p}}\text{? (C}{}_{\mathrm{c}}{}^{\mathrm{\infty }}\text{(K}\text{G}\text{K}\text{))′}$ for each p, 0 < p ? 2, such that $\text{T}{}_{\mathrm{p}}\text{(f 1 f}{}^1\text{) ? 0, ?f ? C}{}_{\mathrm{c}}{}^{\mathrm{\infty }}\text{(K}\text{G}\text{K}\text{)}$ but T_p does not extend to a continuous functional on $\text{C}{}^{\mathrm{p}}\text{(K}\text{G}\text{K}\text{)}$. In particular, if p ? 1, T_v does not extend to a continuous functional on $\text{C}{}^1\text{(K}\text{G}\text{K}\text{)}$. We use this to answer a question (in the negative) raised by Barker whether for a K-bi-invariant distribution T on G to be positive definite it is enough to verify that $\text{T(f 1 f}{}^1\text{) ? 0, ?f ? C}{}_{\mathrm{c}}{}^{\mathrm{\infty }}\text{(K}\text{G}\text{K}\text{)}$. The main tool used is a theorem of Trombi-Varadarajan.     

Über die nichtlineare diophantische Approximation von quadratischen,algebraischen Zahlen

In this paper I prove the following Theorem: Let α be a quadratic irrational number and let ? > 0, $\text{t =}\text{1}\text{1728}$. Then there exists an effectively computable, positive constant c depending on α and ? such that

$\text{6q}{}^2\text{α6 < c(}\text{log}\text{q)}{}^{\mathrm{t??}}\text{q}{}^{\mathrm{?2}}$

has no solutions in natural numbers q.     

Spheres tangent to all the faces of a simplex

There are at most 2ⁿ spheres tangent to all n + 1 faces of an n-simplex. It has been shown that the minimum number of such spheres is $\text{2}{}^{\mathrm{n}}\text{? c(n,}\text{1}\text{2}\text{(n + 1))}$ if n is odd and $\text{2}{}^{\mathrm{n}}\text{? c(n,}\text{1}\text{2}\text{(n + 1))}$ if n is even. The object of this note is to show that this result is a consequence of a theorem in graph theory.     

A generalization of sum composition: Self orthogonal Latin square design with sub self orthogonal Latin square designs

A generalization of the theory of sum composition of Latin square designs is given. Via this generalized theory it is shown that a self orthogonal Latin square design of order $\text{(3p}{}^{\mathrm{\alpha }}\text{? 1)}\text{2}$ with a subself orthogonal Latin square design of order $\text{(p}{}^{\mathrm{\alpha }}\text{? 1)}\text{2}$ can be constructed for any prime p > 2 and any positive integer α as long as p ≠ 3, 5, 7 and 13 if α = 1. Additional results concerning sets of orthogonal Latin square designs are also provided.     

Optimal crossing-free Hamiltonian circuit drawings of Kn

The number of crossing-free Hamiltonian circuits in planar drawings of K_n is studied. In particular, it is shown that for planar drawings of K_n, (1) there are drawings having as many as $\text{(}\text{3}\text{20}\text{)·10}{}^{\mathrm{<mtext>[</mtext><mtext>n</mtext><mtext>3</mtext><mtext>]</mtext>}}$ such circuits and (2) no drawing contains more than $\text{2·6}{}^{\mathrm{n?2}}\text{([}\text{n}\text{2}\text{])!}$     

On an extremal problem in number theory

We define h(n) to be the largest function of n such that from any set of n nonzero integers, one can always extract a subset of h(n) integers with the property that any two sums formed from its elements are equal only if they have equal number of summands. A result of Erdös implies that $\text{h(n) ? n}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}$, and it is the aim of the present paper to obtain the refinement $\text{h(n) ? n}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}\text{(}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>3</mtext>}}$.     

American Mathematical Society short course series: Fundamentals of applied combinatorics : August 12–13, 1977, University of Washington in Seattle,Seattle, Washington

A simple proof is given for the fact that the number of nonsingular similarity relations on {1, 2,… n}, for which the transitive closure of k blocks, equals $\text{(}{}^{\mathrm{2n?2k?1}}{}_{\mathrm{n?1}}\text{) ?(}{}^{\mathrm{2n?2k?1}}{}_{\mathrm{n}}\text{)}$1 ? k ? n > ?2. In particular, this implies a recent result of Shapiro about Catalan numbers and Fine's sequence.     

Some existence and nonexistence theorems for solutions of degenerate parabolic equations

The initial and boundary value problem for the degenerate parabolic equation v_t = Δ(?(v)) + F(v) in the cylinder $\text{Ω × ¦0, ∞), Ω ? R}{}^{\mathrm{n}}$ bounded, for a certain class of point functions ? satisfying ?′(v) ? 0 (e.g., $\text{?(v) = ¦v¦}{}^{\mathrm{m}}\text{sign}\text{v}$) is considered. In the case that F(v) sign $\text{v ? C(1 + ¦?(v)¦}{}^{\mathrm{\alpha }}\text{), α < 1}$, the equation has a global time solution. The same is true for α = 1 provided the measure of Ω is sufficiently small. In the case that $\text{F(v)}\text{?(v)}$ is nondecreasing a condition is given on the initial state v(x, 0) which implies that the solution must blow up in finite time. The existence of such initial states is discussed.     

Arithmetic in generalized Artin-Schreier extensions of k(x)

If k is a perfect field of characteristic p ≠ 0 and k(x) is the rational function field over k, it is possible to construct cyclic extensions K_n over k(x) such that [K : k(x)] = pⁿ using the concept of Witt vectors. This is accomplished in the following way; if [β₁, β₂,…, β_n] is a Witt vector over k(x) = K₀, then the Witt equation $\text{y}{}^{\mathrm{p}}\text{?}\text{y}\text{= β}$ generates a tower of extensions through $\text{K}{}_{\mathrm{i}}\text{= K}{}_{\mathrm{i?1}}\text{(}\text{y}{}_{\mathrm{i}}\text{)}$ where $\text{y}\text{= [}\text{y}{}_1\text{,}\text{y}{}_2\text{,…,}\text{y}{}_{\mathrm{n}}\text{]}$. In this paper, it is shown that there exists an alternate method of generating this tower which lends itself better for further constructions in K_n. This alternate generation has the form K_i = K_i?1(y_i); y_i^p ? y_i = B_i, where, as a divisor in K_i?1, B_i has the form . In this form q is prime to Πp_j^λ_j and each λ_j is positive and prime to p. As an application of this, the alternate generation is used to construct a lower-triangular form of the Hasse-Witt matrix of such a field K_n over an algebraically closed field of constants.     

Derivations of Witt vectors with application to K2 of truncated polynomial rings and Laurent series

The absolute Kähler module $\text{Ω}{}_{\mathrm{w}}{}_{\mathrm{n}}{}^{\mathrm{(k)}}$ of the truncated generalized Witt vectors of a field k of positive characteristic is zero if and only if k is perfect. This recovers known information on $\text{K}{}_2\text{(}\text{k[t]}\text{(t}{}^{\mathrm{n}}\text{)}\text{)}$ with which the structure of K₂(k((t))) can be studied.     

On the matrix ring over a finite field

Let F_n be the ring of n × n matrices over the finite field F; let o(F_n) be the number of elements in F_n, and s(F_n) be the number of singular matrices in F_n. We prove that $\text{o(F}{}_{\mathrm{n}}\text{)<s(F}{}_{\mathrm{n}}\text{)}{}^{\mathrm{<mtext>1+1</mtext><mtext>n(n-1)</mtext>}}$ if n ? 2, and if n = 2 and o(F) ? 3, then .     

Factorization of fredholm operators on analytic functions

Let Ω be a simply connected domain in the complex plane, and $\text{A(Ω}{}^{\mathrm{n}}\text{)}$, the space of functions which are defined and analytic on $\text{Ω}{}^{\mathrm{n}}$, if K is the operator on elements $\text{u(t, a}{}_1\text{, …, a}{}_{\mathrm{n}}\text{)}\text{of}\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ defined in terms of the kernels k_i(t, s, a₁, …, a_n) in $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$ by is the identity operator on $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$, then the operator I ? K may be factored in the form (I ? K)(M ? W) = (I ? ΠK)(M ? ΠW). Here, W is an operator on $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ defined in terms of a kernel w(t, s, a₁, …, a_n) in $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$ by Wu = ∝_an^tw(t, s, a₁, …, a_n) u(s, a₁, …, a_n) ds. ΠW is the operator; ΠWu = ∝_{an ? 1}w(t, s, a₁, …, a_n) u(s, a₁, …, a_n) ds. ΠK is the operator; ΠKu = ∑_{i = 1}^{n ? 1} ∝_ai^tk_i(t, s, a₁, …, a_n) ds + ∝_{an ? 1}^tk_n(t, s, a₁, …, a_n) u(s, a₁, …, a_n) ds. The operator M is of the form m(t, a₁, …, a_n)I, where $\text{m ? A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ and maps elements of $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ into itself by multiplication. The function m is uniquely derived from K in the following manner. The operator K defines an operator $\text{K}{}^1$ on functions u in $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$, by . A determinant $\text{δ(I ? K}{}^1\text{)}$ of the operator $\text{I ? K}{}^1$ is defined as an element $\text{m}{}^1\text{(t, a}{}_1\text{, …, a}{}_{\mathrm{n\; +\; 1}}\text{)}$ of $\text{A(Ω}{}^{\mathrm{n\; +\; 2}}\text{)}$. This is mapped into $\text{A(Ω}{}^{\mathrm{n\; +\; 1}}\text{)}$ by setting a_{n + 1} = t to give m(t, a₁, …, a_n). The operator I ? ΠK may be factored in similar fashion, giving rise to a chain factorization of I ? K. In some cases all the matrix kernels k_i defining K are separable in the sense that k_i(t, s, a₁, …, a_n) = P_i(t, a₁, …, a_n) Q_i(s, a₁, …, a_n), where P_i is a 1 × p_i matrix and Q_i is a p_i × 1 matrix, each with elements in $\text{A(Ω}{}_{\mathrm{n\; +\; 1}}\text{)}$, explicit formulas are given for the kernels of the factors W. The various results are stated in a form allowing immediate extension to the vector-matrix case.     

Weak-1 generators for a class of subalgebras of l1

Let α ? 0 and let $\text{D(}\text{α}\text{) = {f(z) = ∑}{}_0{}^{\mathrm{\infty }}\text{α}{}_{\mathrm{n}}\text{z}{}^{\mathrm{n}}\text{¦ ∑}{}_0{}^{\mathrm{\infty }}\text{(n + 1)}{}^{\mathrm{<mtext>\alpha </mtext>}}\text{¦ a}{}_{\mathrm{n}}\text{¦ < ∞}}$. Then D(α) is a subalgebra of l¹. We discuss the weak-1 generators of D(α). We use some of our techniques to prove that if ? is a weak-1 generator of H^∞ and ∥ ? ∥_∞ ? 1, then the composition operator C_? on the Dirichlet space has dense range.     

A theoretical analysis of backtracking in the graph coloring problem

The graph coloring problem is: Given a positive integer K and a graph G. Can the vertices of G be properly colored in K colors? The problem is NP-complete. The average behavior of the simplest backtrack algorithm for this problem is studied. Average run time over all graphs is known to be bounded. Average run time over all graphs with n vertices and q edges behaves like $\text{exp}\text{(}\text{Cn}{}^2\text{q}\text{)}$. It is shown that similar results hold for all higher moments of the run time distribution. For all graphs and for graphs where lim $\text{n}{}^2\text{q}$ exists, the run time has a limiting disibution as n → ∞.