Multiplicative representations of integers

Lehh ≧ 2, and let ?=(B ₁, …,B _h ), whereB ₁ ? N={1, 2, 3, …} fori=1, …,h. Denote by g_?(n) the number of representations ofn in the formn=b ₁ …b _h , whereb _i ∈B _i . If v (n) > 0 for alln >n ₀, then ? is anasymptotic multiplicative system of order h. The setB is anasymptotic multiplicative basis of order h ifn=b ₁ …b _n is solvable withb _i ∈B for alln >n ₀. Denote byg(n) the number of such representations ofn. LetM(h) be the set of all pairs (s, t), wheres=lim g_? (n) andt=lim g_? (n) for some multiplicative system ? of orderh. It is proved that {fx129-1} In particular, it follows thats ≧ 2 impliest=∞. A corollary is a theorem of Erdös that ifB is a multiplicative basis of orderh ≧ 2, then lim g_? g(n)=∞. Similar results are obtained for asymptotic union bases of finite subsets of N and for asymptotic least common multiple bases of integers.     

Construction of a Jacobi matrix from spectral data

A proof is given for the existence and uniqueness of a correspondence between two pairs of sequences {a},{b} and {ω},{μ}, satisfying b_i>0 for i=1,…,n?1 and ω₁<μ₁<?<μ_n?1<ω_n, under which the symmetric Jacobi matrices J(n,a,b) and J(n?1,a,b) have eigenvalues {ω} and {μ} respectively. Here J(m,a,b) is symmetric and tridiagonal with diagonal elements a_i (i=1,…,m) and off diagonal elements b_i (i=1,…,m?1). A new concise proof is given for the known uniqueness result. The existence result is new.     

On 2min-sets and 2minmax-sets with respect to certain cycles

Let [n] = {1, 2, …, n}. Suppose we have k linear orderings on [n], say <1, <2, …, <k. Let M ? [n]. Then M has a minimum for each linear ordering <i. So M has at most k minima. A set M ? [n] is called a 2min-set if it has at most two different minima in the linear orderings <1, <2, …, <k. Similarly, a set N ? [n] can have at most k minima and k maxima for any k linear orderings. A set N ? [n] is called a 2minmax-set if there exist a, b ∈ N such that all the elements in N | {a, b} lie in between a and b for every linear ordering <i. In this paper, we shall determine the sizes of 2min-sets and 2minmax-sets for certain k linear orderings.     

A method of constructing Krall's polynomials

We propose a method of constructing orthogonal polynomials P_n(x) (Krall's polynomials) that are eigenfunctions of higher-order differential operators. Using this method we show that recurrence coefficients of Krall's polynomials P_n(x) are rational functions of n. Let P_n^(a,b;M)(x) be polynomials obtained from the Jacobi polynomials P_n^(a,b)(x) by the following procedure. We add an arbitrary concentrated mass M at the endpoint of the orthogonality interval with respect to the weight function of the ordinary Jacobi polynomials. We find necessary conditions for the parameters a,b in order for the polynomials P_n^(a,b;M)(x) to obey a higher-order differential equation. The main result of the paper is the following. Let a be a positive integer and b⩾−1/2 an arbitrary real parameter. Then the polynomials P_n^(a,b;M)(x) are Krall's polynomials satisfying a differential equation of order 2a+4.     

A companion matrix analogue for orthogonal polynomials

Given a set of orthogonal polynomials {P_i(x)}, it is shown that associated with a polynomial a(x)=∑a_ip_i(x) there is a matrix A which possesses several of the properties of the usual companion form matrix C. An alternative and possibly preferable form A' is also suggested. A similarity transformation between A [orA'] and C is given. If b(x) is another polynomial then the matrix b(A) [or b(A')] has properties like those of b(C), relating to the greatest common divisor of a(x) and b(x).     

Linear maps on matrices: the invariance of symmetric polynomials

Let L be a linear map on the space M_n of all n by n complex matrices. Let h(x₁,…,x_n) be a symmetric polynomial. If X is a matrix in M_n with eigenvalues λ₁,…,λ_n, denote h(λ₁,…,λ_n) by h(X). For a large class of polynomials h, we determine the structure of the linear maps L for which h(X)=h(L(X)), for all X in M_n.     

Interpolation by Integer-Valued Polynomials

LetRbe a Krull ring with quotient fieldKanda₁,…,a_ninR. If and only if thea_iare pairwise incongruent mod every height 1 prime ideal of infinite index inRdoes there exist for all valuesb₁,…,b_ninRan interpolating integer-valued polynomial, i.e., anf ∈ K[x] withf(a_i) = b_iandf(R) ⊆ R.IfSis an infinite subring of a discrete valuation ringR_vwith quotient fieldKanda₁,…,a_ninSare pairwise incongruent mod allM^k_v ∩ Sof infinite index inS, we also determine the minimald(depending on the distribution of thea_iamong residue classes of the idealsM^k_v ∩ S) such that for allb₁,…,b_n ∈ R_vthere exists a polynomialf ∈ K[x] of degree at mostdwithf(a_i) = b_iandf(S) ⊆ R_v.     

Every set is “symmetric” for some function

Let 〈h _n 〉 denote a sequence of positive real numbers. We show that for every set A ? ? there exists a function f: ? → ω such that A = {x ∈ ?: (∈〈h _n 〉)[h _n ↘ 0 & (? _n ∈ ?)(f(x ? h _n ) = f(x + h _n ) = f(x))]}. This solves a problem of K. Ciesielski, K. Muthuvel and A. Nowik.     

A subdeterminant inequality for normal matrices

Let A be an n × n normal matrix over $\text{C}$, and Q_m, _n be the set of strictly increasing integer sequences of length m chosen from 1,…,n. For α, β ? Q_m, _n denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k ? {0, 1,…, m} we write |α∩β| = k if there exists a rearrangement of 1,…, m, say i₁,…, i_k, i_k+1,…, i_m, such that α(i_j) = β(i_j), i = 1,…, k, and {α(i_k+1),…, α(i_m) } ∩ {β(i_k+1),…, β(i_m) } = ?. A new bound for |detA[α|β ]| is obtained in terms of the eigenvalues of A when 2m = n and |α∩β| = 0.Let $\text{U}$_n be the group of n × n unitary matrices. Define the nonnegative number

where | α ∩ β| = k. It is proved that

Let A be semidefinite hermitian. We conjecture that ρ₀(A) ? ρ₁(A) ? ··· ? ρ_m(A). These inequalities have been tested by machine calculations.     

Selection principle for pointwise bounded sequences of functions

For a number ? > 0 and a real function f on an interval [a, b], denote by N(?, f, [a, b]) the least upper bound of the set of indices n for which there is a family of disjoint intervals [a _i , b _i ], i = 1, …, n, on [a, b] such that |f(a _i ) ? f(b _i )| > ? for any i = 1, …, n (sup Ø = 0). The following theorem is proved: if {f _j } is a pointwise bounded sequence of real functions on the interval [a, b] such that n(?) ≡ lim sup _j→∞ N(?, f _j , [a, b]) < ∞ for any ? > 0, then the sequence {f _j } contains a subsequence which converges, everywhere on [a, b], to some function f such that N(?, f, [a, b]) ≤ n(?) for any ? > 0. It is proved that the main condition in this theorem related to the upper limit is necessary for any uniformly convergent sequence {f _j } and is “almost” necessary for any everywhere convergent sequence of measurable functions, and many pointwise selection principles generalizing Helly’s classical theorem are consequences of our theorem. Examples are presented which illustrate the sharpness of the theorem.     

On diagonal products of doubly stochastic matrices

The following result is proved: If A and B are distinct n × n doubly stochastic matrices, then there exists a permutation σ of {1, 2,…, n} such that ∏_ia_iσ(i) > ∏_ib_iσ(i).     

A criterion for generating full matrix algebras

Let M_n(F) be the algebra of n×n matrices over a field F, and let A∈M_n(F) have characteristic polynomial c(x)=p₁(x)p₂(x)?p_r(x) where p₁(x),…,p_r(x) are distinct and irreducible in F[x]. Let X be a subalgebra of M_n(F) containing A. Under a mild hypothesis on the p_i(x), we find a necessary and sufficient condition for X to be M_n(F).     

On the number of linear forms in logarithms

Let n be a positive integer. In this paper we estimate the size of the set of linear forms b₁loga₁+b₂loga₂+?+bnlogan, where |bi|?Bi and 1?ai?Ai are integers, as Ai,Bi→∞.     

On a characterization of irreducibility of a non-negative matrix

Let A denote an n×n matrix with all its elements real and non-negative, and let r_i be the sum of the elements in the ith row of A, i=1,…,n. Let B=A?D(r₁,…,r_n), where D(r₁,…,r_n) is the diagonal matrix with r_i at the position (i,i). Then it is proved that A is irreducible if and only if rank B=n?1 and the null space of B^T contains a vector d whose entries are all non-null.     

Linear transformations on matrices: the invariance of generalized permutation matrices—III

Let F be a field, F1 be its multiplicative group, and $\text{H}$ = {H:H is a subgroup of F1 and there do not exist a, b?F1 such that Ha+b?H}. Let D_n be the dihedral group of degree n, H be a nontrivial group in $\text{H}$, and τ_n(H) = {α = (α₁, α₂,…, α_n):α_i?H}. For σ?D_n and α?τ_n(H), let P(σ, α) be the matrix whose (i,j) entry is α_iδ_iσ(j) (i.e., a generalized permutation matrix), and

$\text{P(D}{}_{\mathrm{n}}\text{, H) = {P(σ, α):σ?D}{}_{\mathrm{n}}\text{, α?τ}{}_{\mathrm{n}}\text{(H)}}$

. Let M_n(F) be the vector space of all n×n matrices over F and $\text{T}$P(D_n, H) = {T:T is a linear transformation on M_n (F) to itself and T(P(D_n, H)) = P(D_n, H)}. In this paper we classify all T in $\text{T}$P(D_n, H) and determine the structure of the group $\text{T}$P(D_n, H) (Theorems 1 to 4). An expository version of the main results is given in Sec. 1, and an example is given at the end of the paper.     

Adjacency preserving functions on symmetric elements and linear preservers of non-zero decomposable symmetric tensors

Let A be a non-empty set and m be a positive integer. Let ≡ be the equivalence relation defined on A ^m such that (x ₁, …, x _m ) ≡ (y ₁, …, y _m ) if there exists a permutation σ on {1, …, m} such that y _σ(i) = x _i for all i. Let A ^(m) denote the set of all equivalence classes determined by ≡. Two elements X and Y in A ^(m) are said to be adjacent if (x ₁, …, x _m?1, a) ∈ X and (x ₁, …, x _m?1, b) ∈ Y for some x ₁, …, x _m?1 ∈ A and some distinct elements a, b ∈ A. We study the structure of functions from A ^(m) to B ⁽ⁿ⁾ that send adjacent elements to adjacent elements when A has at least n + 2 elements and its application to linear preservers of non-zero decomposable symmetric tensors.     

Extension de quelques theoremes sur les densites de series d'elements de n a des series de sous-ensembles finis de n

For a sequence A = {A_k} of finite subsets of N we introduce: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{n}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$, where A(m) is the number of subsets A_k ? {1, 2, …, m}.The collection of all subsets of {1, …, n} together with the operation $\text{a ∪ b, (a ∩ b), (a 1 b = a ∪ b ? a ∩ b)}$ constitutes a finite semi-group N^∪ (semi-group N^∩) (group $\text{N}{}^1$). For N^∪, N^∩ we prove analogues of the Erdös-Landau theorem: δ(A+B) ? δ(A)(1+(2λ)^?1(1?δ(A>))), where B is a base of N of the average order λ. We prove for $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ analogues of Schnirelmann's theorem (that δ(A) + δ(B) > 1 implies δ(A + B) = 1) and the inequalities λ ? 2h, where h is the order of the base.We introduce the concept of divisibility of subsets: a|b if b is a continuation of a. We prove an analog of the Davenport-Erdös theorem: if d(A) > 0, then there exists an infinite sequence {A_kr}, where A_kr | A_kr+1 for r = 1, 2, …. In Section 6 we consider for $\text{N∪, N∩, N1}$ analogues of Rohrbach inequality: $\text{2n}\text{? g(n) ? 2}\text{n}$, where g(n) = min k over the subsets {a₁ < … < a_k} ? {0, 1, 2, …, n}, such that every m? {0, 1, 2, …, n} can be expressed as m = a_i + a_j.Pour une série A = {A_k} de sous-ensembles finis de N on introduit les densités: $\text{δ(A) =}\text{inf}{}_{\mathrm{m?n}}\text{A(m)}\text{2}{}^{\mathrm{m}}$, $\text{d(A) =}\text{lim inf}{}_{\mathrm{n\to \infty }}\text{A(n)}\text{2}{}^{\mathrm{n}}$ où A(m) est le nombre d'ensembles A_k ? {1, 2, …, m}. L'ensemble de toutes les parties de {1, 2, …, n} devient, pour les opérations $\text{a ∪ b, a ∩ b, a 1 b = a ∪ b ? a ∩ b}$, un semi-groupe fini N^∪, N^∩ ou un groupe N¹ respectivement. Pour N^∪, N^∩ on démontre l'analogue du théorème de Erdös-Landau: δ(A + B) ? δ(A)(1 + (2λ)^?1(1?δ(A))), où B est une base de N d'ordre moyen λ. On démontre pour $\text{N}{}^{\mathrm{\cup }}\text{, N}{}^{\mathrm{\cap }}\text{, N}{}^1$ l'analogue du théorème de Schnirelmann (si δ(A) + δ(B) > 1, alors δ(A + B) = 1) et les inégalités λ ? 2h, où h est l'ordre de base. On introduit le rapport de divisibilité des enembles: a|b, si b est une continuation de a. On démontre l'analogue du théorème de Davenport-Erdös: si d(A) > 0, alors il existe une sous-série infinie {A_kr}, où A_kr|A_kr+1, pour r = 1, 2, … . Dans le Paragraphe 6 on envisage pour N^∪, $\text{N}{}^{\mathrm{\cap }}\text{, N}{}^1$ les analogues de l'inégalité de Rohrbach: $\text{2n}\text{? g(n) ? 2}\text{n}$, où g(n) = min k pour les ensembles {a₁ < … < a_k} ? {0, 1, 2, …, n} tels que pour tout m? {0, 1, 2, …, n} on a m = a_i + a_j.     

On Some Optimal Constructions of Chess Tournament Combinations

An optimal solution for the following “chess tournament” problem is given. Let n, r be positive integers such that r<n. Put N=2n, R=2r+1. Let X_N,R be the set of all ordered pairs (T, A) of matrices of degree N such that T=(t_ij) is symmetric, A=(a_ij) is skew-symmetric, t_ij ∈,{0, 1, 2,…, R), a_ij ∈{0,1,–1}. Moreover, suppose t_ii=a_ii=0 (1?i?N). t_ij = t_ik>0 implies j=k, t_ij=0 is equivalent to a_ij=0, and |a_i1|+|a_i2|+…+|a_iN|=R (1?i?N). Let p(T, A) be the number of i such that 1?i?N and a_i1 + a_i2 + … + a_iN >0. The main result of this note is to show that max p(T, A) for (T, A)∈X_{N, R} is equal to [n(2r+1)/(r+1)], and a pair (T₀, A₀) satisfying p(T₀, A₀)=[n(2r+1)/(r+1)] is also given.     

Integral Domains with Highly Nonunique Factorization

For a positive integer n, an atomic integral domain R is defined to be completely non- n- factorial if for any n atoms a₁…, a_n, the product a₁ … a _n has as highly nonunique a factorization into atoms as possible in that given any n ? 1 atoms b₁,…, b_{nt - 1}, b₁ … b _n? 1¦a₁ … a _n. We show that R is completely non-n-factorial for some n ≥ 2 if and only if (R, M) is a quasilocal domain with [M: M] a DVR having M as its maximal ideal.