Calculation of the branch points of the eigenfunctions corresponding to wave spheroidal functions

A method for calculating eigenvalues λ_mn(c) corresponding to the wave spheroidal functions in the case of a complex parameter c is proposed, and a comprehensive numerical analysis is performed. It is shown that some points c _s are the branch points of the functions λ_mn(c) with different indexes n ₁ and n ₂ so that the value λ_{mn 1} (c _s ) is a double one: λ_{mn 1} (c _s ) = λ_{mn 2} (c _s ). The numerical analysis suggests that, for each fixed m, all the branches of the eigenvalues λ_mn(c) corresponding to the even spheroidal functions form a complete analytic function of the complex argument c. Similarly, all the branches of the eigenvalues λ_mn(c) corresponding to the odd spheroidal functions form a complete analytic function of c. To perform highly accurate calculations of the branch points c _s of the double eigenvalues λ_mn(c _s), the Padé approximants, the Hermite-Padé quadratic approximants, and the generalized Newton iterative method are used. A large number of branch points are calculated.     

On the eigenvalues of the fredholm operator

We prove that if ω(t, x, K ₂ ^(m) )?c(x)ω(t) for allxε[a, b] andx ε [0,b-a] wherec ∈L ¹(a, b) and ω is a modulus of continuity, then λ _n =O(n ^?m-1/2ω(1/n)) and this estimate is unimprovable.     

Compactified Jacobians and q,t-Catalan numbers, II

We continue the study of the rational-slope generalized q,t-Catalan numbers c _m,n (q,t). We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property c _m,n (q,1)=c _m,n (1,q) for m=kn±1. We give a bijective proof of the full symmetry c _m,n (q,t)=c _m,n (t,q) for min(m,n)≤3. As a corollary of these combinatorial constructions, we give a simple formula for the Poincaré polynomials of compactified Jacobians of plane curve singularities x ^kn±1=y ⁿ . We also give a geometric interpretation of a relation between rational-slope Catalan numbers and the theory of (m,n)-cores discovered by J. Anderson.     

Probabilities of dominant candidates based on first-place votes

Suppose each of an odd number n of voters has a strict preference order on the three ‘candidates’ in {1,2,3} and votes for his most preferred candidate on a plurality ballot. Assume that a voter who votes for i is equally likely to have ijk and ikj as his preference order when {i,j,k} = {1,2,3}.Fix an integer m between $\text{1}\text{2}$(n + 1) and n inclusive. Then, given that n_i of the n voters vote for i, let f_m(n₁,n₂,n₃) be the probability that one of the three candidates is preferred by m or more voters to each of the other two.This paper examines the behavior of f_m over the lattice points in L_n, the set of triples of non-negative integers that sum to n. It identifies the regions in L_n where f_m is 1 and where f_m is 0, then shows that f_m(a,b + 1, c)>f_m(a + 1,b,c) whenever a + b + c + 1 = n, a≤c≤b, a<c<m and c≤n ? m. These results are used to partially identify the points in L_n where f_m is minimized subject to f_m>0. It is shown that at least two of the n_i are equal at minimizing points.     

Ruzsa’s constant on additive functions

A function f : N → R is called additive if f(mn)= f(m)+f(n)for all m, n with(m, n)= 1. Let μ(x)= max n≤x(f(n)f(n + 1))and ν(x)= max n≤x(f(n + 1)f(n)). In 1979, Ruzsa proved that there exists a constant c such that for any additive function f , μ(x)≤ cν(x 2 )+ c f , where c f is a constant depending only on f . Denote by R af the least such constant c. We call R af Ruzsa's constant on additive functions. In this paper, we prove that R af ≤ 20.     

Affine and combinatorial binary m-spaces

Let V(n) denote the n-dimensional vector space over the 2-element field. Let a(m, r) (respectively, c(m, r)) denote the smallest positive integer such that if n ? a(m, r) (respectively, n ? c(m, r)), and V(n) is arbitrarily partitioned into r classes C_i, 1 ? i ? r, then some class C_i must contain an m-dimensional affine (respectively, combinatorial) subspace of V(n). Upper bounds for the functions a(m, r) and c(m, r) are investigated, as are upper bounds for the corresponding “density functions” $\text{a}\text{(m, ?)}$ and $\text{c}\text{(m, ?)}$.     

EXISTENCE AND NONEXISTENCE OF GLOBAL POSITIVE SOLUTIONS FOR DEGENERATE PARABOLIC EQUATIONS IN EXTERIOR DOMAINS

This article deals with the degenerate parabolic equations in exterior domains and with inhomogeneous Dirichlet boundary conditions. We obtain that pc = (σ+m)n/(n-σ-2) is its critical exponent provided max{-1, [(1-m)n-2]/(n+1)} σ n-2. This critical exponent is not the same as that for the corresponding equations with the boundary value 0, but is more closely tied to the critical exponent of the elliptic type degenerate equations. Furthermore, we demonstrate that if max{1, σ + m} p ≤ pc, then every positive solution of the equations blows up in finite time; whereas for ppc, the equations admit global positive solutions for some boundary values and initial data. Meantime, we also demonstrate that its positive solutions blow up in finite time provided n ≤σ+2.     

Growth Polynomials for Additive Quadruples and (h,k)-Tuples

Consider the interval of integers I _m,n = {m, m + 1, m + 2, . . . , m + n ? 1}. For fixed integers h, k, m, and c, let \({\Phi^{(c)}_{h,k,m}(n)}\) denote the number of solutions of the equation (a ₁ +  . . . +  a _h ) ? (a _h+1 +  . . . +  a _h+k ) =  c with \({a_i \in I_{m,n}}\) for all i =  1, . . . , h +  k. This is a polynomial in n for all sufficiently large n, and the growth polynomial is constructed explicitly.     

P 4k−1-factorization of bipartite multigraphs

Let λK _m,n be a bipartite multigraph with two partite sets having m and n vertices, respectively. A P _v-factorization of λK _m,n is a set of edge-disjoint P _v -factors of λK _m,n which partition the set of edges of λK _m,n. When v is an even number, Ushio, Wang and the second author of the paper gave a necessary and sufficient condition for the existence of a P _v -factorization of λK _m,n. When v is an odd number, we proposed a conjecture. However, up to now we only know that the conjecture is true for v = 3. In this paper we will show that the conjecture is true when v = 4k ? 1. That is, we shall prove that a necessary and sufficient condition for the existence of a P _4k?1-factorization of λK _m,n is (1) (2k ? 1)m ? 2kn, (2) (2k ? 1)n ? 2km, (3) m + n ≡ 0 (mod 4k ? 1), (4) λ(4k ? 1)mn/[2(2k ? 1)(m + n)] is an integer.     

Maximum two-dimensional （u × v, 4, 1, 3）-OOCs

Let Ф（u ×v, k, Aa, Ac） be the largest possible number of codewords among all two- dimensional （u ×v, k, λa, λc） optical orthogonal codes. A 2-D （u× v, k, λa, λ）-OOC with Ф（u× v, k, λa, λc） codewords is said to be maximum. In this paper, the number of codewords of a maximum 2-D （u × v, 4, 1, 3）-OOC has been determined.     

On estimating the hidden periodicities in linear time series models

In this paper the tollowing modelX(n)=sum from j=1 to p α_je~(inλj)+ξ_nis considered,where p,λ_1,λ_2,…,λ_p,are constants α=(α_1,α_2,…,α_p) is a random vector and {ξ_n;n=0,±1,±2,…} is a wide-sense stationary sequence with zero means.In [4],theorem about thestrong consistent estimates of λ_1,λ_2.…,λ_p and α are proved under the assumption that α is a constantvector and p and δ are known constants such that0<δ<(?){λ_i-λ_j}.The main purpose of the present paper is to prove theorems on the strong consistent estimates ofparameters p,λ_1,λ_2,…,λ_p and random vector α without knowing p and δ.Numerical examples arealso given to illustrate our method of estimation.     

Representations for eigenfunctions of expected value operators in the Wishart distribution

Recent articles by Kushner and Meisner (1980) and Kushner, Lebow and Meisner (1981) have posed the problem of characterising the ‘EP’ functions f(S) for which Ef(S) for which E(f(S)) = λ_nf(Σ) for some λ_n ? $\text{R}$, whenever the m × m matrix S has the Wishart distribution W(m, n, Σ). In this article we obtain integral representations for all nonnegative EP functions. It is also shown that any bounded EP function is harmonic, and that EP polynomials may be used to approximate the functions in certain L^p spaces.     

Anti-Hadamard matrices

An anti-Hadamard matrix may be loosely defined as a real (0, 1) matrix which is invertible, but only just. Let A be an invertible (0, 1) matrix with eigenvalues λ_i, singular values σ_i, and inverse B = (b_ij). We are interested in the four closely related problems of finding λ(n) = min_{A, i}|λ_i|, σ(n) = min_{A, i}σ_i, χ(n) = max_{A, i, j} |b_ij|, and μ(n) = max_AΣ_ijb²_ij. Then A is an anti-Hadamard matrix if it attains μ(n). We show that λ(n), σ(n) are between $\text{(2n)}{}^{\mathrm{?1}}\text{(}\text{n}\text{4}\text{)}{}^{\mathrm{<mtext>?n</mtext><mtext>2</mtext>}}$ and c√n (2.274)^?n, where c is a constant, $\text{c}\text{(2.274)}{}^{\mathrm{n}}\text{?χ(n)?2(}\text{n}\text{4}\text{)}{}^{\mathrm{<mtext>n</mtext><mtext>2</mtext>}}$, and $\text{c}\text{(5.172)}{}^{\mathrm{n}}\text{?μ(n)?4n}{}^2\text{(}\text{n}\text{4}\text{)}{}^{\mathrm{n}}$. We also consider these problems when A is restricted to be a Toeplitz, triangular, circulant, or (+1, ?1) matrix. Besides the obvious application—to finding the most ill-conditioned (0, 1) matrices—there are connections with weighing designs, number theory, and geometry.     

On simple modules of Hecke algebras of type Dn

This is a continuation of our previous work. We classify all the simple ?_q(D _n )-modules via an automorphismh defined on the set { λ | D^λ ≠ 0}. Whenf _n(q) ≠ 0, this yields a classification of all the simple ? ^q (D _n)- modules for arbitrary n. In general ( i. e., q arbitrary), if λ⁽¹⁾ = λ⁽²⁾,wegivea necessary and sufficient condition ( in terms of some polynomials ) to ensure that the irreducible ?_q,1(B _n )- module D^λ remains irreducible on restriction to ?_q(D _n ).     

3-(v, 4, 1) covering designs with chromatic numbers 2 and 3

A t-(v, k, λ) covering design is a pair (X, B) where X is a v-set and B is a collection of k-sets in X, called blocks, such that every t element subset of X is contained in at least λ blocks of B. The covering number, C_λ(t, k, v), is the minimum number of blocks a t-(v, k, λ) covering design may have. The chromatic number of (X, B) is the smallest m for which there exists a map φ: X → Z_m such that ∣φ((β)∣ ≥2 for all β ∈ B, where φ(β) = {φ(x): x ∈ β}. The system (X, B) is equitably m-chromatic if there is a proper coloring φ with minimal m for which the numbers ∣φ^?1(c)∣ c ∈ Z_m differ from each other by at most 1. In this article we show that minimum, (i.e., ∣B∣ = C λ (t, k, v)) equitably 3-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0 (mod 6), v ≥ 18 for v ≥ 1, 13 (mod 36), v ≡ 13 and for all numbers v = n, n + 1, where n ≡ 4, 8, 10 (mod 12), n ≥ 16; and n = 6.5^a 13^b 17^c ?4, a + b + c > 0, and n = 14, 62. We also show that minimum, equitably 2-chromatic 3-(v, 4, 1) covering designs exist for v ≡ 0, 5, 9 (mod 12), v ≥ 0, v = 2.5^a 13^b 17^c + 1, a + b + c > 0, and v = 23. © 1993 John Wiley & Sons, Inc.     

The ring of an outer von Neumann frame in modular lattices

We prove the following theorem. Let (a ₁, . . . , a _m , c ₁₂, . . . , c _1m ) be a spanning von Neumann m-frame of a modular lattice L, and let (u ₁, . . . , u _n , v ₁₂, . . . , v _1n ) be a spanning von Neumann n-frame of the interval [0, a ₁]. Assume that either m ≥ 4, or L is Arguesian and m ≥ 3. Let R* denote the coordinate ring of (a ₁, . . . , a _m , c ₁₂, . . . , c _1m ). If n ≥ 2, then there is a ring S* such that R* is isomorphic to the ring of all n × n matrices over S*. If n ≥ 4 or L is Arguesian and n ≥ 3, then we can choose S* as the coordinate ring of (u ₁, . . . , u _n , v ₁₂, . . . , v _1n ).     

On a Question of Glasby,Praeger, and Xia

A Jordan partition λ(m, n, p) = (λ₁, λ₂, … , λ _m ) is a partition of mn associated with the expression of a tensor V _m  ? V _n of indecomposable KG-modules into a sum of indecomposables, where K is a field of characteristic p and G a cyclic group of p-power order. It is standard if λ _i  = m + n ? 2i + 1 for all i. We answer a recent question of Glasby, Praeger, and Xia who asked for necessary and sufficient conditions for λ(m, n, p) to be standard.     

Ballots and rooks

The level code representation of the simplest ballot problem (weak lead lattice paths from (0, 0) to (n, n) is the set of sequences (b₁,…, b_n) defined by b₁ = 1, b_{i ?1} ≤ b_i ≤ i, 2 ≤ i ≤n. Each sequence is monotone non-decreasing, has a specification (c₁, c₂,…, c_n) with c_i the number of sequence elements equal to i (hence c₁ + c₂…+ c_n = n), and may be permuted in $\text{n!}\text{c}{}_1\text{!…c}{}_{\mathrm{n}}\text{!}$ ways. The set of permuted sequences, as noted in [4], is the set of parking functions, introduced by Konheim and Weiss in [1]. To count parking functions by number of fixed points, associate the rook polynomial for matching a deck of cards of specification (c₁,…,c_n), c_i cards marked i, with a deck of n distinct cards. The hit polynomial H_n(x) corresponding to the sum of such rook polynomials over all sequences (I am using the terminology of [2]) is the required enumerator and turns out to be simply

$\text{(n+1)}{}^2\text{H}{}_{\mathrm{n}}\text{(x)=(x+n)}{}^{\mathrm{n+1}}\text{?(x?1)}{}^{\mathrm{n+1}}$

.     

Rectangular arrays

In this paper we studied m×n arrays with row sums $\text{nr}\text{(n,m)}$ and column sums $\text{mr}\text{(n,m)}$ where (n,m) denotes the greatest common divisor of m and n. We were able to show that the function H_m,n(r), which enumerates m×n arrays with row sums and column sums $\text{nr}\text{(m,n)}$ and $\text{mr}\text{(n,m)}$ respectively, is a polynomial in r of degree (m?1)(n?1). We found simple formulas to evaluate these polynomials for negative values, ?r, and we show that certain small negative integers are roots of these polynomials. When we considered the generating function G_m,n(y) = Σ_r?0H_m,n(r)y^r, it was found to be rational of degree less than zero. The denominator of G_m,n(y) is of the form (1?y)^(m?1)(n?1)+3, and the coefficients of the numerator are non-negative integers which enjoy a certain symmetric relation.