Enumeration of power sums modulo a prime

We consider, for odd primes p, the function N(p, m, α) which equals the number of subsets S?{1,…,p ? 1} with the property that Σ_∞∈Sx^m ≡ α (mod p). We obtain a closed form expression for N(p, m, α). We give simple explicit formulas for N(p, 2, α) (which in some cases involve class numbers and fundamental units), and show that for a fixed m, the difference between N(p, m, α) and its average value p^?12^p?1 is of the order of $\text{exp}\text{(p}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ or less. Finally, we obtain the curious result that if p ? 1 does not divide m, then N(p, m, 0) > N(p, m, α) for all α ? 0 (mod p).     

A cyclic production problem: an application of max-algebra

Given are m identical machines, each of which performs the same N operations O_i, 1⩽ i ⩽ N, cyclically and indefinitely, i.e. a production run on a machine looksO₁, O₂,…,O_N, O₁, O₂,…,O_N, O₁…. There are n_i⩽m to to perform operation O_i. The tools are transported between the machines by means of an infinitely fast transport device.Given a particular transport policy we prove the existence of stationary cyclic behaviour, determine the corresponding cycle time, and investigate the long run behaviour of the system starting from a given initial state.     

Multilinear extensions of absolutely (p;q;r)-summing operators

In this paper we introduce and study a new class containing the class of absolutely summing multilinear mappings, which we call absolutely (p;q ₁,…,q _m ;r)-summing multilinear mappings. We investigate some interesting properties concerning the absolutely (p;q ₁,…,q _m ;r)-summing m-linear mappings defined on Banach spaces. In particular, we prove a kind of Pietsch’s Domination Theorem and a multilinear version of the Factorization Theorem.     

Nonparametric estimation of mixed partial derivatives of a multivariate density

On the basis of a random sample of size n on an m-dimensional random vector X, this note proposes a class of estimators f_n^(p) of f^(p), where f is a density of X w.r.t. a σ-finite measure dominated by the Lebesgue measure on R^m, p = (p₁,…,p_m), p_j ≥ 0, fixed integers, and for x = (x₁,…,x_m) in R^m, f^(p)(x) = ?^p₁+…+p_m f(x)/(?^p₁x₁ … ?^p_mx_m). Asymptotic unbiasedness as well as both almost sure and mean square consistencies of f_n^(p) are examined. Further, a necessary and sufficient condition for uniform asymptotic unbisedness or for uniform mean square consistency of f_n^(p) is given. Finally, applications of estimators of this note to certain statistical problems are pointed out.     

On a kind of generalized Lehmer problem

For 1 ? c ? p ? 1, let E ₁,E ₂, …,E _m be fixed numbers of the set {0, 1}, and let a ₁, a ₂, …, a _m (1 ? a _i ? p, i = 1, 2, …,m) be of opposite parity with E ₁,E ₂, …,E _m respectively such that a ₁ a ₂…a _m ≡ c (mod p). Let $$N(c,m,p) = {1 \over {{2^{m - 1}}}}\mathop {\sum\limits_{{a_1} = 1}^{p - 1} {\sum\limits_{{a_2} = 1}^{p - 1} \ldots } }\limits_{{a_1}{a_2} \ldots \equiv c{\rm{ (}}\bmod {\rm{ }}p)} \sum\limits_{{a_m} = 1}^{p - 1} {(1 - {{( - 1)}^{{a_1} + {E_1}}})(1 - {{( - 1)}^{{a_2} + {E_2}}}) \ldots } (1 - {( - 1)^{{a_m} + {E_m}}}).$$ We are interested in the mean value of the sums $$\sum\limits_{c = 1}^{p - 1} {{E^2}} (c,m,p),$$ where E(c, m, p) = N(c,m, p)?((p ? 1) ^m?1)/(2 ^m?1) for the odd prime p and any integers m ? 2. When m = 2, c = 1, it is the Lehmer problem. In this paper, we generalize the Lehmer problem and use analytic method to give an interesting asymptotic formula of the generalized Lehmer problem.     

On the power of Wilks' U-test for MANOVA

Let V₁,…, V_m, W₁,…, W_n be independent p × 1 random vectors having multivariate normal distributions with common nonsingular covariance matrix Σ and with EW_α = 0, α = 1,…, n. In this canonical form of the multivariate linear model, the problem is to test H: EV_αazμ_α = 0, α = 1,…, m vs K: not H. It is shown that when the rank of the noncentrality matrix (μ₁…μ_m) Σ^?1 (μ₁…μ_m) is one, the power of Wilks' U-test (the likelihood ratio test) strictly decreases with the dimension p and the hypothesis degrees of freedom m. This generalizes results known for the noncentral F-test in the univariate case.     

On the average number of records for sequences of not identically distributed random variables

The scheme of n series of independent random variables X ₁₁, X ₂₁, …, X _k1, X ₁₂, X ₂₂, …, X _k2, …, X _1n , X _2n , …, X _kn is considered. Each of these successive series X _1m , X _2m , …, X _km , m = 1, 2, …, n consists of k variables with continuous distribution functions F ₁, F ₂, …, F _k , which are the same for all series. Let N(nk) be the number of upper records of the given nk random variables, and EN(nk) be the corresponding expected value. For EN(nk) exact upper and lower estimates are obtained. Examples are given of the sets of distribution functions for which these estimates are attained.     

Partial integrability of Hamiltonian systems with homogeneous potential

In this paper we consider systems with n degrees of freedom given by the natural Hamiltonian function of the form $$ H = \frac{1} {2}p^T Mp + V(q), $$ where q = (q ₁, …, q _n ) ∈ ? ⁿ , p = (p ₁, …, p _n ) ∈ ? ⁿ , are the canonical coordinates and momenta, M is a symmetric non-singular matrix, and V (q) is a homogeneous function of degree k ∈ ?*. We assume that the system admits 1 ? m < n independent and commuting first integrals F ₁, … F _m . Our main results give easily computable and effective necessary conditions for the existence of one more additional first integral F _m+1 such that all integrals F ₁, … F _m+1 are independent and pairwise commute. These conditions are derived from an analysis of the differential Galois group of variational equations along a particular solution of the system. We apply our result analysing the partial integrability of a certain n body problem on a line and the planar three body problem.     

The Estermann cubic problem with almost equal summands

We prove an asymptotic formula for the number of representations of a sufficiently large natural number N as the sum of two primes p ₁ and p ₂ and the cube of a natural numbermsatisfying the conditions |p _i ? N/3| ≤ H, |m ³ ? N/3| ≤ H, H ≥ N ^5/6 ? ¹⁰.     

On distribution by rank of bases for vector spaces of matrices over a finite field

Let F^m×n_q denote the vector space of all m×n matrices over the finite field F_q of order q, and let $\text{B}\text{=(A}{}_1\text{,A}{}_2\text{,…,A}{}_{\mathrm{mn}}\text{)}$ denote an ordered basis for F^m×n_q. If the rank of A_i is r_i,i=1,2,…,mn, then $\text{B}$ is said to have rank (r₁,r₂,…,r_mn), and the number of ordered bases of F^mxn_q with rank (r₁,r₂,…,r_mn is denoted by N_q(r₁, r₂,…,r_mn). This paper determines formulas for the numbers N_q(r₁,r₂,…,r_mn) for the case m=n=2, q arbitrary, and while some of the techniques of the paper extend to arbitrary m and n, the general formulas for the numbers N_q(r₁,r₂,…,r_mn) seem quite complicated and remain unknown. An idea on a possible computer attack which may be feasible for low values of m and n is also discussed.     

Rings of integral quaternions

A quaternion order derived from an integral ternary quadratic form f = Σa_ijx_ix_j of discriminant d = 4 det (a_ij) is m-maximal if m is not divisible by any prime p such that p² | d, or p 6; d and c_p = 1. If R is m-maximal and m is a product p₁ … p_r of primes, then any primitive element α of R has unique right-divisor ideals of each norm p₁ … p_k (k = 1, …, r). This generalizes Lipschitz's ninety-year-old theorem. We characterize m-maximal orders, study their ideals, and show how the preceding result yields formulas for the number of representations of integers by certain quaternary quadratic forms.     

Modular retractions of numerical semigroups

Let S be a numerical semigroup, let m be a nonzero element of S, and let a be a nonnegative integer. We denote ${\rm R}(S,a,m) = \{ s-as \bmod m \mid s \in S \}$ (where asmodm is the remainder of the division of as by m). In this paper we characterize the pairs (a,m) such that ${\rm R}(S,a,m)$ is a numerical semigroup. In this way, if we have a pair (a,m) with such characteristics, then we can reduce the problem of computing the genus of S=〈n ₁,…,n _p 〉 to computing the genus of a “smaller” numerical semigroup 〈n ₁?an ₁modm,…,n _p ?an _p modm〉. This reduction is also useful for estimating other important invariants of S such as the Frobenius number and the type.     

Generalizations of a combinatorial lemma of Kelly

Two sets in R^m are said to be n-separated if, for every n distinct points p₁,…, p_n of one set, there is a point of the other in the relative interior of the convex cover of {p₁,…, p_n. We obtain some results concerning the dimension of the flat spanned by the union of n-separated sets and pose several further questions.     

Multiplicative infinite loop space theory

Let G be a finitely presented group given by its pre-abelian presentation <X1,…,Xm; Xe11ζ1,…,Xemmζ,ζm+1,…>, where ei≥0 for i = 1,…, m and ζj?G′ for j≥1. Let N be the subgroup of G generated by the normal subgroups [xeii, G] for i = 1,…, m. Then Dn+2(G)≡γn+2(G) (modNG′) for all n≥0, where G” is the second commutator subgroup of G,γn+2(G) is the (n+2)th term of the lower central series of G and Dn+2(G) = G∩(1+△n+2(G)) is the (n+2)th dimension subgroup of G.     

Collinear subsets of lattice point sequences—An analog of Szemerédi's theorem

Szemerédi's theorem states that given any positive number B and natural number k, there is a number n(k, B) such that if n ? n(k, B) and 0 < a₁ < … < a_n is a sequence of integers with a_n ? Bn, then some k of the a_i form an arithmetic progression. We prove that given any B and k, there is a number m(k, B) such that if m ? m(k, B) and u₀, u₁, …, u_m is a sequence of plane lattice points with ∑_i=1^m…u_i ? u_i?1… ? Bm, then some k of the u_i are collinear. Our result, while similar to Szemerédi's theorem, does not appear to imply it, nor does Szemerédi's theorem appear to imply our result.     

Finding the contour of a union of iso-oriented rectangies

Let R₁,…,R_m be rectangles on the plane with sides parallel to the coordinate axes. An algorithm is described for finding the contour of F = R₁ ∪ … ∪ R_m in $\text{O(m}\text{log}\text{m + p}\text{log}\text{(}\text{2m}{}^2\text{p}\text{))}$ time, where p is the number of edges in the contour. This is O(m²) in the general case, and O(m log m) when F is without holes (then p ≤ 8m ? 4); both of these performances are optimal.     

Inverted orders for monotone scoring rules

When each of n judges ranks a set A of m objects from best to worst, and s=(s₁,…,s_m) is a decreasing sequence of real numbers, the collective ranking determined by s orders the objects in A according to their total scores. The total score of x equals s_p times the number of judges who rank x in pth place, summed over p.For normalization purposes, let S_m denote the set of all decreasing s=(s₁,…,s_m) for which s_{m ? 1}=1 and s_m=0. Given any m ? 3, we show firstthat if s and s′ in S_m are not identical, then some profile of judges' rankings yields a linear collective order for s′ that is the reverse or dual of the linear collective order for s.We then consider reversals in collective rankings when one object is removed from A. Suppose s is in S_m and t is in S_{m ? 1}, with m ≥ 3. A simple constructive proof shows that there is a profile of judges' rankings on A which yields a collective linear order for s such that, when any pre-specified object in A is removed, t yields the reverse ranking on the remaining m ? 1 objects. More detailed results are derived for m=3, and shown to depend on the nature of s=(s₁, 1, 0). In particular, the sum-of-ranks procedure with s₁=2 permits fewer reversals than any other s₁>1.     

On the multiplicative structure of odd perfect numbers

Starting with Euler's theorem that any odd perfect number n has the form n = p^ep_i^2e_i … p_k^2e_k, where p, p₁,…,p_k are distinct odd primes and p ≡ e ≡ 1 (mod 4), we show that extensive subsets of these numbers (so described) can be eliminated from consideration. A typical result says: if p^e, p_i^2e_i,…,p_r^2e_r are all of the prime-power divisors of such an n with p ≡ p_i ≡ 1 (mod 4), then the ordered set {e₁,…,e_r} contains an even number or odd number of odd numbers according as e ≡ pore ≡ p (mod 8).     

A census of simple planar triangulations

Explicit expressions of φ_n,m for n ?1,2,…,5 and for all m ≥ 1 are given. A recurrence relation for φ_n,m is also obtained. The values of φ_n,m are tabulated for n = 1,…,5 and m = 0,1,…,10.     

Enumeration of finite topologies

Let T₀(n) be the number of marked topologies satisfying the separation axiom T₀ that can be imposed on a finite set of n elements. In this paper the formula $$T_0 \left( n \right) = \Sigma \frac{{n!}}{{p_1 !...p_m !}}V\left( {p_1 , ..., p_m } \right)$$ is obtained, where the summation extends over all ordered sets of natural numbers (p₁, ..., p_m) such that p₁+...+p_m=n, and V(p₁, ..., p_m) denotes the number of matrices σ=(σ_ij) of ordern with the following properties: 1) each of the entries σ_ij is either 0 or 1, and if σ_ij=1 andσ_ij=1, then σ_ij=1;2) if the matrix σ is partitioned into blocks of sizes p_ixp_j, then all blocks under the main diagonal are zero, all diagonal blocks are identity matrices, and in each column of any block situated above the main diagonal at least one entry is 1. Some properties of the values V(p₁, ..., p_m)are obtained; in particular, it is shown that all these values are odd. Formulas are obtained for V(P₁, ..., p_m) corresponding to the simplest sets (p₁, ..., P_m) needed to calculate T₀(n) for n?8 (without using a computer).