A Tauberian theorem related to Weyl's criterion

Let {x_n} be a sequence of real numbers and let a(n) be a sequence of positive real numbers, with A(N) = Σ_n=1^Na(n). Tsuji has defined a notion of a(n)-uniform distribution mod 1 which is related to the problem of determining those real numbers t₀ for which A(N)^?1 Σ_n=1^Na(n)e^?it₀x_n → 0 as N → ∞. In case f(s) = Σ_n=1^∞a(n)e^?sx_n, s = σ + it, is analytic in the right half-plane 0 < σ, and satisfies a certain smoothness condition as σ → 0 +, we show that f(σ)^?1f(σ + it₀) → 0 as σ → 0 + if and only if A(N)^?1 Σ_n=1^Na(n)e^?it₀x_n → 0 as N → ∞.     

On additive representation function of general sequences

Let 0 ≦ a ₁ < a ₂ < ? be an infinite sequence of integers and let r ₁(A, n) = |(i;j): a _i + a _j = n, i ≦ j|. We show that if d > 0 is an integer, then there does not exist n ₀ such that d ≦ r ₁ (A, n) ≦ d + [√2d + ½] for n > n ₀.     

More coverings by rook domains

The set V_kⁿ of all n-tuples (x₁, x₂,…, x_n) with x_i?, $\text{Z}$_k is considered. The problem treated in this paper is determining σ(n, k), the minimum size of a set W ? V_kⁿ such that for each x in V_kⁿ, there is an element in W that differs from x in at most one coordinate. By using a new constructive method, it is shown that σ(n, p) ? (p ? t + 1)p^n?r, where p is a prime and $\text{n = 1 +}\text{t(p}{}^{\mathrm{r?1}}\text{? 1)}\text{(p ? 1)}$ for some integers t and r. The same method also gives σ(7, 3) ? 216. Another construction gives the inequality σ(n, kt) ? σ(n, k)t^n?1 which implies that σ(q + 1, qt) = q^q?1t^q when q is a prime power. By proving another inequality σ(np + 1, p) ? σ(n, p)p^n(p?1), σ(10, 3) ? 5 · 3⁶ and σ(16, 5) ? 13 · 5¹² are obtained.     

An Extension of a Theorem of Yao and Yao

In this paper we study N _d (k), the smallest positive integer such that any nice measure μ in $\mathbb{R}^{d}$ can be partitioned into N _d (k) convex parts of equal measure so that every hyperplane avoids at least k of them. A theorem of Yao and Yao states that N _d (1)≤2 ^d . Among other results, we obtain the bounds N _d (2)≤3?2 ^d?1 and N _d (1)≥C?2 ^d/2 for some constant C. We then apply these results to a problem on the separation of points and hyperplanes.     

The weight distribution of irreducible cyclic codes with block lengths n1((q1−1)N)

We study the weight distribution of irreducible cyclic (n, k) codeswith block lengths n = n₁((q¹ ? 1)/N), where N|q ? 1, gcd(n₁,N) = 1, and gcd(l,N) = 1. We present the weight enumerator polynomial, A(z), when k = n₁l, k = (n₁ ? 1)l, and k = 2l. We also show how to find A(z) in general by studying the generator matrix of an (n₁, m) linear code, $\text{V}{}^1{}_{\mathrm{d}}$ over GF(q^d) where d = gcd (ord_n1(q), l). Specifically we study A(z) when $\text{V}{}^1{}_{\mathrm{d}}$ is a maximum distance separable code, a maximal shiftregister code, and a semiprimitive code. We tabulate some numbers A_μ which completely determine the weight distributionof any irreducible cyclic (n₁(2¹ ? 1), k) code over GF(2) for all n₁ ? 17.     

Valeurs aux entiers négatifs des séries de Dirichlet associées a un polynôme,I

In this paper, we are studying Dirichlet series Z(P,ξ,s) = Σ_n?$\text{N}$^1rP(n)^?s ξⁿ, where P ∈ $\text{R}$₊ [X₁,…,X_r] and ξⁿ = ξ₁ⁿ¹ … ξ_r^nr, with ξ_i ∈ $\text{C}$, such that |ξ_i| = 1 and ξ_i ≠ 1, 1 ≦ i ≦ r. We show that Z(P, ξ,·) can be continued holomorphically to the whole complex plane, and that the values Z(P, ξ, ?k) for all non negative integers, belong to the field generated over $\text{Q}$ by the ξ_i and the coefficients of P. If, there exists a number field K, containing the ξ_i, 1 ≦ i ≦ r, and the coefficients of P, then we study the denominators of Z(P, ξ, ?k) and we define a $\text{B}$-adic function Z$\text{B}$(P, ξ,·) which is equal, on class of negative integers, to Z(P, ξ, ?k).     

Zero density of L-functions related to Maass forms

Let f(z) be a Hecke-Maass cusp form for SL ₂(?), and let L(s, f) be the corresponding automorphic L-function associated to f. For sufficiently large T, let N(σ, T) be the number of zeros ρ = β +iγ of L(s, f) with |γ| ? T, β ? σ, the zeros being counted according to multiplicity. In this paper, we get that for 3/4 ? σ ? 1 ? ?, there exists a constant C = C(?) such that N(σ,T) ? T ^2(1?σ)/σ(logT) ^C , which improves the previous results.     

Exponential families of mixed Poisson distributions

If I=(I₁,…,I_d) is a random variable on [0,∞)^d with distribution μ(dλ₁,…,dλ_d), the mixed Poisson distribution MP(μ) on N^d is the distribution of (N₁(I₁),…,N_d(I_d)) where N₁,…,N_d are ordinary independent Poisson processes which are also independent of I. The paper proves that if F is a natural exponential family on [0,∞)^d then MP(F) is also a natural exponential family if and only if a generating probability of F is the distribution of v₀+v₁Y₁+?+v_qY_q for some q?d, for some vectors v₀,…,v_q of [0,∞)^d with disjoint supports and for independent standard real gamma random variables Y₁,…,Y_q.     

Blowup stability of solutions of the nonlinear heat equation with a large life span

We study the Cauchy problem for the nonlinear heat equation u_t-?u=|u|^p-1u in R^N. The initial data is of the form u₀=λ?, where ?∈C₀(R^N) is fixed and λ>0. We first take 1<p<p_f, where p_f is the Fujita critical exponent, and ?∈C₀(R^N)∩L¹(R^N) with nonzero mean. We show that u(t) blows up for λ small, extending the H. Fujita blowup result for sign-changing solutions. Next, we consider 1<p<p_s, where p_s is the Sobolev critical exponent, and ?(x) decaying as |x|^-σ at infinity, where p<1+2/σ. We also prove that u(t) blows up when λ is small, extending a result of T. Lee and W. Ni. For both cases, the solution enjoys some stable blowup properties. For example, there is single point blowup even if ? is not radial.     

Dynamic point location in arrangements of hyperplanes

We present algorithms for maintaining data structures supporting fast (polylogarithmic) point-location and ray-shooting queries in arrangements of hyperplanes. This data structure allows for deletion and insertion of hyperplanes. Our algorithms use random bits in the construction of the data structure but do not make any assumptions about the update sequence or the hyperplanes in the input. The query bound for our data structure isÕ(polylog(n)), wheren is the number of hyperplanes at any given time, and theÕ notation indicates that the bound holds with high probability, where the probability is solely with respect to randomization in the data structure. By high probability we mean that the probability of error is inversely proportional to a large degree polynomial inn. The space requirement isÕ(n ^d). The cost of update isÕ(n ^d?1 logn. The expected cost of update isO(n ^d?1); the expectation is again solely with respect to randomization in the data structure. Our algorithm is extremely simple. We also give a related algorithm with optimalÕ(logn) query time, expectedO(n ^d) space requirement, and amortizedO(n ^d?1) expected cost of update. Moreover, our approach has a versatile quality which is likely to have further applications to other dynamic algorithms. Ford=2, 3 we also show how to obtain polylogarithmic update time in the CRCW PRAM model so that the processor-time product matches (within a polylogarithmic factor) the sequential update time.     

The number of large prime divisors of consecutive integers

Let ?(N) > 0 be a function of positive integers N and such that ?(N) → 0 and N^?(N) → ∞ as N → + ∞. Let Nν_N(n:…) be the number of positive integers n ≤ N for which the property stated in the dotted space holds. Finally, let g(n; N, ?, z) be the number of those prime divisors p of n which satisfy N^Z?(N) ? p ? N^?(N), 0 < z < 1 In the present note we show that for each k = 0, ±1, ±2,…, as N → ∞, limv_N(n : g(n; N, ?, z) ? g(n + 1; N, ?z) = k) exists and we determine its actual value. The case k = 0 induced the present investigation. Our solution for this value shows that the natural density of those integers n for which n and n + 1 have the same number of prime divisors in the range (1) exists and it is positive.     

LIFTING DIFFERENTIABLE CURVES FROM ORBIT SPACES

Let ρ: G → O(V) be a real finite dimensional orthogonal representation of a compact Lie group, let σ = (σ ₁, ?, σn): V → ? ⁿ , where σ ₁, ?, σn n form a minimal system of homogeneous generators of the G-invariant polynomials on V, and set d = max_i deg σ _i . We prove that for each C ^d?1,1-curve c in σ(V) ?? ⁿ there exits a locally Lipschitz lift over σ, i.e., a locally Lipschitz curve \( \overline{c} \) in V so that c = σ ° \( \overline{c} \), and we obtain explicit bounds for the Lipschitz constant of \( \overline{c} \) in terms of c. Moreover, we show that each C ^d -curve in σ(V) admits a C ¹-lift. For finite groups G we deduce a multivariable version and some further results.     

The codimension of degenerate pencils

Let d_n[d_n(r)] denote the codimension of the set of pairs of n×n Hermitian [really symmetric] matrices (A, B) for which det(λI?A?xB)=p(λ,x) is a reducible polynomial. We prove that d_n(r)?n?1, d_n?_n?1 (n odd), d_n?n (n even). We conjecture that the equality holds in all three inequalities. We prove this conjecture for n=2,3.     

Partitions of natural numbers with the same representation functions

For a set A of nonnegative integers the representation functions R₂(A,n), R₃(A,n) are defined as the number of solutions of the equation n=a+a^′,a,a^′∈A with a<a^′, a?a^′, respectively. Let D(0)=0 and let D(a) denote the number of ones in the binary representation of a. Let A₀ be the set of all nonnegative integers a with even D(a) and A₁ be the set of all nonnegative integers a with odd D(a). In this paper we show that (a) if R₂(A,n)=R₂(N?A,n) for all n?2N−1, then R₂(A,n)=R₂(N?A,n)?1 for all n?12N²−10N−2 except for A=A₀ or A=A₁; (b) if R₃(A,n)=R₃(N?A,n) for all n?2N−1, then R₃(A,n)=R₃(N?A,n)?1 for all n?12N²+2N. Several problems are posed in this paper.     

On graphs with equal edge connectivity and minimum degree

The note contains some conditions on a graph implying that the edge connectivity is equal to the minimum degree. One of these conditions is that if d₁?d₂???d_n is the degree sequence then ∑^l_l?1(d₁+d_n?1)>In?1 for $\text{1 ? l? min {}\text{n}\text{2?1}\text{, d}{}_{\mathrm{n}}\text{}}$.     

Rings and semigroups with permutable zero products

We consider rings R, not necessarily with 1, for which there is a nontrivial permutation σ on n letters such that x₁?x_n=0 implies x_σ(1)?x_σ(n)=0 for all x₁,…,x_n∈R. We prove that this condition alone implies very strong permutability conditions for zero products with sufficiently many factors. To this end we study the infinite sequences of permutation groups P_n(R) consisting of those permutations σ on n letters for which the condition above is satisfied in R. We give the full characterization of such sequences both for rings and for semigroups with 0. This enables us to generalize some recent results by Cohn on reversible rings and by Lambek, Anderson and Camillo on rings and semigroups whose zero products commute. In particular, we prove that rings with permutable zero products satisfy the Köthe conjecture.     

Inequalities and identities for generalized matrix functions

Let χ be a character on the symmetric group S_n, and let A = (a_ij) be an n-by-n matrix. The function d_χ(A) = Σ_σ?Snχ(σ)Πⁿ_{t = 1}a_tσ(t) is called a generalized matrix function. If χ is an irreducible character, then d_χ is called an immanent. For example, if χ is the alternating character, then d_χ is the determinant, and if χ ≡ 1, then d_χ is called the permanent (denoted per). Suppose that A is positive semidefinite Hermitian. We prove that the inequality $\text{(1/χ(}\text{id}\text{))d}{}_{\mathrm{\chi }}\text{(A) ?}\text{per}\text{A}$ holds for a variety of characters χ including the irreducible ones corresponding to the partitions (n ? 1,1) and (n ? 2,1,1) of n. The main technique used to prove these inequalities is to express the immanents as sums of products of principal subpermanents. These expressions for the immanents come from analogous expressions for Schur polynomials by means of a correspondence of D.E. Littlewood.     

Permutation-operator inequalities on certain symmetry classes of tensors

If A∈T(m, N), the real-valued N-linear functions on E_m, and σ∈S_N, the symmetric group on {…,N}, then we define the permutation operator P_σ: T(m, N) → T(m, N) such that P_σ(A)(x₁,x₂,…,x_N = A(x_σ(1),x_σ(2),…, x_σ(N)). Suppose Σ^q_i=1n_i = N, where the n_i are positive integers. In this paper we present a condition on σ that is sufficient to guarantee that 〈P_σ(A₁?A₂???A_q),A₁?A₂?? ? A_q〉 ? 0 for A_i∈S(m, n_i), where S(m, n_i) denotes the subspace of T(m, n_i) consisting of all the fully symmetric members of T(m, n_i). Also we present a broad generalization of the Neuberger identity which is sometimes useful in answering questions of the type described below. Suppose G and H are subgroups of S_N. We let T_G(m, N) denote all A∈T(m, N) such that P_σ(A) = A for all σ∈G. We define the symmetrizer $\text{S}$_G: T(m, N)→T_G(m,N) such that $\text{S}{}_{\mathrm{G}}\text{(A) = 1/|G|Σ}{}_{\mathrm{\sigma \in G}}\text{P}{}_{\mathrm{\sigma }}\text{(A)}$. Suppose H is a subgroup of G and A∈T_H(m, N). Clearly $\text{6}\text{S}{}_{\mathrm{<mtext>G</mtext>}}\text{6(A) 6? 6A6.}$ We are interested in the reverse type of comparison. In particular, if D is a suitably chosen subset of T_H(m,N), then can we explicitly present a constant C>0 such that $\text{6}\text{S}{}_{\mathrm{G}}\text{(A)6?C6A6}$ for all A∈D?     

A new class of multiset Wilf equivalent pairs

We say the pair of patterns (σ,τ) is multiset Wilf equivalent if, for any multiset M, the number of permutations of M that avoid σ is equal to the number of permutations of M that avoid τ. In this paper, we find a large new class of multiset Wilf equivalent pairs, namely, the pair (σ_n-2(n-1)n, σ_n-2n(n-1)), for n?3 and σ_n-2 a permutation of {1^x₁,2^x₂,…,(n-2)^x_n-2}. It is the most general multiset Wilf equivalence result to date.     

A Note on the Embedding of Subspaces of Lp into ℓNr, 0 < r < 1, r ≦ p < 2

In this paper we extend a result by Bourgain-Lindenstrauss-Milman (see [1]). We prove: Let 0 < ? < 1/2, 0< r < 1, r< p < 2. There exists a constant C = C(r,p,?) such that if X is any n-dimensional subspace of L_p(0, l), then there exists Y ? ?^N_r with d(X, Y) ≦ 1 + ?, whenever N > Cn. As an application, we obtain the following partial result: Let 0 < r < 1. There exist constants C = C(r) and C' = C' (r) such that if X is any n-dimensional subspace of L_r(0,1), then there exists Y ? ^N_r with d(X, Y) ≦ C (logn)^l/^r, whenever N ≧ C'n.