On the connection between weak and strong convergencies in Cm

In this work wome connections are pursued between weak and strong convergence in the spaces C^m (m-times continuously differentiable functions on Rⁿ). Let f_n, f?C^{m + 1}, where n = 1, 2,…, and m is a nonnegative integer. Suppose that the sequence {f_n} converges to f relative to the weak topology of C^{m + 1}. It is shown that this implies the convergence of {f_n} to f with respect to the strong topology of C^m. Several corollaries to this theorem are established; among them is a sufficient condition for uniform convergence. A stronger result is shown to exist when the sequence constitutes an output sequence of a linear weakly continuous operator.     

The crossing number of C3 × Cn

The crossing number of the Cartesian product C₃ × C_n of a 3-cycle and an n-cycle is shown to be n.     

Distance to Ck hypersurfaces

It is shown by elementary means that a C^k hypersurface M of positive reach in $\text{R}$^{n + 1} has the property that the signed distance function to it is C^k, k ? 1. This extends and complements work of Federer, Gilbarg and Trudinger, and Serrin.     

Partial difference equations in m1⩾m2⩾⋯⩾mn⩾0 and their applications to combinatorics

Various discrete functions encountered in Combinatorics are solutions of Partial Difference Equations in the subset of Nⁿ given by m₁?m₂???m_n?0. Given a partial difference equation, it is described how to pass from the standard “easy” solution of an equation in Nⁿ to a solution of the same equation subject to certain “Dirichlet” or “Neumann” boundary conditions in the domain m₁?m₂???m_n?0 and related domains. Applications include a rather quick derivation of MacMahon's generating function for plane partitions, a generalization and q-analog of the Ballot problem, and a joint analog of the Ballot problem and Simon Newcomb's problem.     

Multiplicativity of lp norms for matrices. II

For 1 ? p ? ∞, let

$\text{|A|}{}_{\mathrm{p}}\text{=}\text{Σ}\text{i=1}\text{m}\text{Σ}\text{j=1}\text{n}\text{, |α}{}_{\mathrm{ij}}\text{|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}$

, be the l_p norm of an m × n complex A = (α_ij) ?C_{m × n}. The main purpose of this paper is to find, for any p, q ? 1, the best (smallest) possible constants τ(m, k, n, p, q) and σ(m, k, n, p, q) for which inequalities of the form

$\text{|AB|}{}_{\mathrm{p}}\text{? τ(m, k, n, p, q) |A|}{}_{\mathrm{p}}\text{|B|}{}_{\mathrm{q}}\text{, |AB|}{}_{\mathrm{p}}\text{? σ (m, k, n, p, q)|A|}{}_{\mathrm{q}}\text{|B|}{}_{\mathrm{p}}$

hold for all A?C_{m × k}, B?C_{k × n}. This leads to upper bounds for inner products on C^k and for ordinary l_p operator norms on C_{m × n}.     

Explicit characterizations of orthogonality in lS(C)

In a previous paper, the author used a notion of orthogonality introduced in another article to establish characterizations for orthogonality in the spaces l_S^p(C), 1?p<∞, thus obtaining generalizations of the usual characterization of orthogonality in the Hilbert spaces l_S²(C), via inner products. In this paper we make explicit these characterizations for some of the spaces l_S^p(C). We finish by presenting some remarks and open problems.     

C-spaces and matrix of infinite-dimensionality

We investigate classes (m,n)-C which are intermediate between the class S-wid of weakly infinite-dimensional spaces in the sense of Smirnov and the class S-∞-C of finite C-spaces in the sense of Borst. We find relationships between classes (m₁,n₁)-C and (m₂,n₂)-C. It allows us to construct a matrix of infinite-dimensionality.     

On the spacings between C-nomial coefficients

Let (Cn)_n?0 be the Lucas sequence Cn+2=aCn+1+bCn for all n?0, where C₀=0 and C₁=1. For 1?k?m−1 let

     

On countable bounded tightness for spaces Cp(X)

It is well known that the space C_p([0,1]) has countable tightness but it is not Fréchet-Urysohn. Let X be a Cech-complete topological space. We prove that the space C_p(X) of continuous real-valued functions on X endowed with the pointwise topology is Fréchet-Urysohn if and only if C_p(X) has countable bounded tightness, i.e., for every subset A of C_p(X) and every x in the closure of A in C_p(X) there exists a countable and bounding subset of A whose closure contains x. We study also the problem when the weak topology of a locally convex space has countable bounded tightness. Additional results in this direction are provided.     

The decomposition of Cr(K) into the direct sum of subalgebras

Let A and B be closed subalgebras of C_r(X) whose direct sum is C_r(X). Some consequences of this relation are explored in this paper. For example if 1 ?A (as may be assumed) it is shown that the norm of the projection onto A is an odd integer and there is a retraction of X onto the set of common zeros of elements of B.     

Karlsson-Minton type hypergeometric functions on the root system Cn

We prove a reduction formula for Karlsson-Minton type hypergeometric series on the root system C_n and derive some consequences of this identity. In particular, when combined with a similar reduction formula for A_n, it implies a C_n Watson transformation due to Milne and Lilly.     

A note on simple eigenvalues of matrix polynomials in queueing models with Erlang distributions

In this note, we study anE _k /E _m /1 queueing model where interarrival and service times are Erlang distributions with parametersk andm respectively. We prove that the roots of the characteristic polynomial associated with Erlang distributions are simple if the arrival and service rates are real. Based on this result, a general solution space of vectors for stationary probabilities is easily constructed.     

Perfect codes in the graphs Ok

In this paper we consider the existence of perfect codes in the infinite class of distance-transitive graphs O_k. Perfect 1-codes correspond to certain Steiner systems and necessary conditions for the existence of such a code are satisfied if k + 1 is prime. We give some nonexistence results for perfect 2-, 3-, and 4-codes and for perfect e-codes in general, including a lower bound for k in terms of e.     

Assessing process capability based on the lower confidence bound of Cpk for asymmetric tolerances

It has been proved that process capability indices provide very efficient measures of the capability of processes from many different perspectives. At the present time, the C_pk index is used more than any other index for measuring process capability. However, most existing research works for capability testing have focused on processes with symmetric tolerances, but not for asymmetric tolerances. A lower confidence bound estimates the minimum process capability, conveying critical information regarding product quality, which is essential to quality assurance. The sample size determination, which provides the sample sizes necessary to achieve a desired lower confidence bound, is directly related to the cost of the data collection plan. This paper provides explicit formulas with efficient algorithms to obtain the lower confidence bounds and sample sizes required for specified precision of the estimation on C_pk for processes with asymmetric tolerances. A Matlab computer program using a binary search method is developed. For the practitioners to use in their in-plant applications, we tabulate lower confidence bounds for some commonly used capability requirement and the sampling accuracy of C_pk for sample sizes determination. A realistic example of forging process is presented to illustrate the applicability of the proposed method.     

Toeplitz algebras, subnormal tuples and rigidity on reproducing C[z1,…,zd]-modules

This paper mainly considers Toeplitz algebras, subnormal tuples and rigidity concerning reproducing C[z₁,…,z_d]-modules. By making use of Arveson's boundary representation theory, we find there is more rigidity in several variables than there is in single variable. We specialize our attention to reproducing C[z₁,…,z_d]-modules with -invariant kernels by examining the spectrum and the essential spectrum of the d-tuple {M_z1,…,M_zd}, and deducing an exact sequence of C∗-algebras associated with Toeplitz algebra. Finally, we deal with Toeplitz algebras defined on Arveson submodules and rigidity of Arveson submodules.     

Decomposition of k1n into circuits of odd length

In this paper we prove that the complete symmetric directed graph with n vertices K¹_n can be decomposed into directed circuits of length k, where k is an odd integer, if n ≡ 0 or 1 (mod k) and n ? k.     

The visually distinct configurations of k sets

Two sets of sets, C₀ and C₁, are said to be visually equivalent if there is a 1-1 mapping m from C₀ onto C₁ such that for every S, T?C₀, S ∩ T=0 if and only if m(S)∩ m(T)=0 and S?T if and only if m(S)?m(T). We find estimates for V(k), the number of equivalence classes of this relation on sets of k sets, for finite and infinite k. Our main results are that for finite k, $\text{1}\text{2}\text{k}{}^2\text{-k log k <log V (k)<ak}{}^2\text{+βk+log k}$, where α and β are approximately 0.7255 and 2.5323 respectively, and there is a set N of cardinality $\text{1}\text{2}\text{(k}{}^2\text{+k)}$ such that there are V(k) visually distinct sets of k subsets of N.     

Dimension of the crown Skn

In 1941, Dushnik and Miller introduced the concept of the dimension of a poset (X, P) as the minimum number of linear extensions of P whose intersection is exactly P. Although Dilworth has given a formula for the dimension of distributive lattices, the general problem of determining the dimension of a poset is quite difficult. An equally difficult problem is to classify those posets which are dimension irreducible, i.e., those posets for which the removal of any point lowers the dimension. In this paper, we construct for each n≥3, k≥0, a poset, called a crown and denoted S^k_n, for which the dimension is given by the formula $\text{2?(n+k)}\text{(k+2)}$. Furthermore, for each t≥3, we show that there are infinitely many crowns which are irreducible and have dimension t. We then demonstrate a method of combining a collection of irreducible crowns to form an irreducible poset whose dimension is the sum of the crowns in the collection. Finally, we construct some infinite crowns possessing combinatorial properties similar to finite crowns.     

Rationality theorems for Hecke operators on GLn

We define n families of Hecke operators for GL_n whose generating series are rational functions of the form q_k(u)⁻¹ where q_k is a polynomial of degree , and whose form is that of the kth exterior product. This work can be viewed as a refinement of work of Andrianov (Math. USSR Sb. 12(3) (1970)), in which he defined Hecke operators the sum of whose generating series was a rational function with nontrivial numerator and whose denominator was essentially .By a careful analysis of the Satake map which defines an isomorphism between a local Hecke algebra and a ring of symmetric polynomials, we define n families of (polynomial) Hecke operators and characterize their generating series as rational functions. We then give an explicit means by which to locally invert the Satake isomorphism, and show how to translate these polynomial operators back to the classical double coset setting. The classical Hecke operators have generating series of exactly the same form as their polynomial counterparts, and hence are of number-theoretic interest. We give explicit examples for GL₃ and GL₄.