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.     

Subsequence numbers and logarithmic concavity

Let S be a finite sequence of length r whose terms come from the finite alphabet a. The subsequence number of S (i = 0…r) is the number of distinct t-long subsequences of S. We prove (1) for r and a fixed, the S simultaneously attain their maximum possible values if and only if S is a repeated permutation of a (meaning no letters appears twice in S without all of the other letters of a intervening): (2) the numbers S…S……S, are logarithmically concave: and (3) over any central interval S…S……S…(iSr ? i). S, is least (through perhaps not uniquely). In addition, we show that for the generalized binomial coefficients c(i.j.n) defined by (1+x+…+ x^m?1)¹ = Σc(i.j.n)x¹, the sequence c(i ? 1.1.n), c(i?2.2n)… is strongly logarithmically concave, thus extending a result of S.M. Tanny and M. Zuker. Logarithmic concavity is treated in the context of triangular arrays of numbers.     

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.     

Pelikán's conjecture and cyclotomic cosets

The following conjecture was recently made by J. Pelikán. Let a₀ ,…, a_n be an (n + 1)-tuple of 0's and 1's; let A_k = ?_i=0^n?ka_ia_i+k for k = 0,…, n. Then if n ? 4 some A_k is even.This paper shows that Pelikán's conjecture is false for infinitely many values of n. On the other hand it is also shown that the conjecture is true for most values of n, and a characterization is given of those values of n for which it fails.     

Fast canonization of circular strings

A circular string A = (a₁,…,a_n) is a string that has n equivalent linear representations A_i = a_i,…,a_n,a₁,…,a_i?1 for i = 1,…,n. The a_i's are assumed to be well ordered. We say that A_i < A_j if the word a_i…a_na₁…a_i?1 precedes the word a_j…a_na₁…a_j?1 in the lexicographic order, A_i ? A_j if either A_i < A_j or A_i = A_j. A_i0 is a minimal representation of A if A_i0 ? A_i for all 1 ≤ i ≤ n. The index i₀ is called a minimal starting point (m.s.p.). In this paper we discuss the problem of finding m.s.p. of a given circular string. Our algorithm finds, in fact, all the m.s.p.'s of a given circular string A of length n by using at most $\text{n + ?}\text{d}\text{2}\text{?}$ comparisons. The number d denotes the difference between two successive m.s.p.'s (see Lemma 1.1) and is equal to n if A has a unique m.s.p. Our algorithm improves the result of 3n comparisons given by K. S. Booth. Only constant auxiliary storage is used.     

Intersection patterns of convex sets

LetK ₁,…K_n be convex sets inR ^d. For 0≦i denote byf _ithe number of subsetsS of {1,2,…,n} of cardinalityi+1 that satisfy ∩{K _i∶i∈S}≠Ø. We prove:Theorem.If f _d+r=0 for somer r>=0, then {fx161-1} This inequality was conjectured by Katchalski and Perles. Equality holds, e.g., ifK ₁=…=K_r=R^d andK _r+1,…,K_n aren?r hyperplanes in general position inR ^d. The proof uses multilinear techniques (exterior algebra). Applications to convexity and to extremal set theory are given.     

Langford sequences: perfect and hooked

A sequence {d, d+1,…, d+m?1} of m consecutive positive integers is said to be perfect if the integers {1, 2,…, 2m} can be arranged in disjoint pairs {(a_i, b_i): 1?i?m} so that {b_i?a_i: 1?i?m}={d,d+1,…,d+m?1}. A sequence is hooked if the set {1, 2,…, 2m?1 2m+1} can be arranged in pairs to satisfy the same condition. Well known necessary conditions for perfect sequences are herein shown to be sufficient. Similar necessary and sufficient conditions for hooked sequences are given.     

Enumeration of rises and falls by position

Let π=(π₁, π₂,…,π_n) denote a permutation of Z_n = {1, 2,…, n}. The pair (π_i, π_i+1) is a rise if π_i<π_i+1 or a fall if π_i>π_i+1. Also a conventional rise is counted at the beginning of π and a conventional fall at the end. Let k be a fixed integer ≥ 1. The rise π_i,π_i+1 is said to be in a in a j (mod k) position if i ≡ j (mod k); similarly for a fall. The conventional rise at the beginning is in a 0 (mod k) position, while the conventional fall at the end is in an n (mod k) position. Let $\text{P}{}_{\mathrm{n}}\text{≡P}{}_{\mathrm{n}}\text{(r}{}_0\text{,…,r}{}_{\mathrm{k}}\text{?1,?}{}_0\text{,…,?;}{}_{\mathrm{k}}\text{?1)}$ denote the number of permutations having r_i rises i (mod k) positions and ?;_i falls in i (mod k) positions. A generating function for P_n is obtained. In particular, for k = 2 the generating function is quite explicit and also, for certain special cases when k = 4.     

Asymptotic independence of distributions of normalized order statistics of the underlying probability measure

Let n denote the sample size, and let r_i ∈ {1,…,n} fulfill the conditions r_i ? r_i?1 ≥ 5 for i = 1,…,k. It is proved that the joint normalized distribution of the order statistics Z_ri:n, i = 1,…,k, is independent of the underlying probability measure up to a remainder term of order $\text{O((}\text{k}\text{n}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$. A counterexample shows that, as far as central order statistics are concerned, this remainder term is not of the order $\text{O((}\text{k}\text{n}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ if r_i ? r_i?1 = 1 for i = 2,…,k.     

Enumeration of pairs of permutations

Let π = (a₁, a₂, …, a_n), ? = (b₁, b₂, …, b_n) be two permutations of $\text{Z}{}_{\mathrm{n}}\text{= {1, 2, …, n}}$. A rise of π is pair a_i, a_i+1 with a_i < a_i+1; a fall is a pair a_i, a_i+1 with a_i > a_i+1. Thus, for i = 1, 2, …, n ? 1, the two pairs a_i, a_i+1; b_i, b_i+1 are either both rises, both falls, the first a rise and the second a fall or the first a fall and the second a rise. These possibilities are denoted by RR, FF, RF, FR. The paper is concerned with the enumeration of pairs π, p with a given number of RR, FF, RF, FR. In particular if ω_n denotes the number of pairs with RR forbidden, it is proved that $\text{∑}{}^{\mathrm{\infty }}{}_0\text{ω}{}_{\mathrm{n}}\text{z}{}^{\mathrm{n}}\text{n!n!}\text{=}\text{1}\text{?(z)}$, $\text{?(z) = ∑}{}^{\mathrm{\infty }}{}_0\text{(-1)}{}^{\mathrm{n}}\text{z}{}^{\mathrm{n}}\text{n!n!}$. More precisely if ω(n, k) denotes the number of pairs π, p with exactly k occurences of RR(or FF, RF, FR) then $\text{1 + ∑}{}^{\mathrm{\infty }}{}_{\mathrm{n=1}}\text{z}{}^{\mathrm{n}}\text{n!n!}$$\text{∑}{}^{\mathrm{n?1}}{}_{\mathrm{k=0}}\text{ω(n, k)x}{}^{\mathrm{k}}\text{=}\text{(1 ? x)}\text{(?(z(1 ? x)) ? x)}$.     

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.     

On Generalizations of Prime Ideals (II)

Let R be a commutative ring with identity. We say that a proper ideal P of R is (n ? 1, n)-weakly prime (n ≥ 2) if 0 ≠ a ₁…a _n  ∈ P implies a ₁…a _i?1 a _i+1…a _n  ∈ P for some i ∈ {1,…, n}, where a ₁,…, a _n  ∈ R. In this article, we study (n ? 1, n)-weakly prime ideals. A number of results concerning (n ? 1, n)-weakly prime ideals and examples of (n ? 1, n)-weakly prime ideals are given. Rings with the property that for a positive integer n such that 2 ≤ n ≤ 5, every proper ideal is (n ? 1, n)-weakly prime are characterized. Moreover, it is shown that in some rings, nonzero (n ? 1, n)-weakly prime ideals and (n ? 1, n)-prime ideals coincide.     

Real Zeros of Algebraic Polynomials with Dependent Random Coefficients

The expected number of real zeros of polynomials a ₀ + a ₁ x + a ₂ x ² +…+a _n?1 x ^n?1 with random coefficients is well studied. For n large and for the normal zero mean independent coefficients, irrespective of the distribution of coefficients, this expected number is known to be asymptotic to (2/π)log n. For the dependent cases studied so far it is shown that this asymptotic value remains O(log n). In this article, we show that when cov(a _i , a _j ) = 1 ? |i ? j|/n, for i = 0,…, n ? 1 and j = 0,…, n ? 1, the above expected number of real zeros reduces significantly to O(log n)^1/2.     

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).     

Enumeration of rectangular arrays of zeros and ones

For r=1,2 the rectangular arrays of zeros and ones with r rows and n columns, with m_i zeros and r_i changes in the ith row, and with s_i vertical changes between the ith and (i+1)st rows, i=1,…,r-1, are enumerated. The number of arrays of zeros and ones with 3 rows and n columns, with r_i changes in the ith row, i=1,2,3, and with s_i vertical changes between the ith and (i+1)st rows, i=1,2, is also determined.     

An explicit expression for the cost of a class of Huffman trees

Let T_n denote a binary tree with n terminal nodes V={υ₁,…,υ_n} and let l_i denote the path length from the root to υ_i. Consider a set of nonnegative numbers W={w₁,…,w_n} and for a permutation π of {1,…,n} to {1,…,n}, associate the weight w_i to the node υ_π(i). The cost of T_n is defined as C(T_n∣W)=Min_π∑ⁿ_i=1w_il_π(i).A Huffman tree H_n is a binary tree which minimizes C(T_n∣W) over all possible T_n. In this note, we give an explicit expression for C(H_n∣W) when W assumes the form: w_i=k for i=1,…,n?m; w_i=x for i=n?m+1,…,n. This simplifies and generalizes earlier results in the literature.     

On the number of complementary trees in a graph

Consider a graph with no loops or multiple arcs with n+1 nodes and 2n arcs labeled a_l,…,a_n,a′_l,…,a′_n, where n ≥ 5. A spanning tree of such a graph is called complementary if it contains exactly one arc of each pair {a_i,a′_i}. The purpose of this paper is to develop a procedure for finding complementary trees in a graph, given one such tree. Using the procedure repeatedly we give a constructive proof that every graph of the above form which has one complementary tree has at least six such trees.     

A recurrence formula for leaping convergents of non-regular continued fractions

Given a continued fraction [a₀;a₁,a₂,…], p_n/q_n=[a₀;a₁,…,a_n] is called the n-th convergent for n=0,1,2,…. Leaping convergents are those of every r-th convergent p_rn+i/q_rn+i (n=0,1,2,…) for fixed integers r and i with r?2 and i=0,1,…,r-1. This leaping step r can be chosen as the length of period in the continued fraction. Elsner studied the leaping convergents p_3n+1/q_3n+1 for the continued fraction of and obtained some arithmetic properties. Komatsu studied those p_3n/q_3n for (s?2). He has also extended such results for some more general continued fractions. Such concepts have been generalized in the case of regular continued fractions. In this paper leaping convergents in the non-regular continued fractions are considered so that a more general three term relation is satisfied. Moreover, the leaping step r need not necessarily to equal the length of period. As one of applications a new recurrence formula for leaping convergents of Apery’s continued fraction of ζ(3) is shown.     

On separable Lindenstrauss spaces

Isometric embeddings from l_∞ⁿin l_∞^{n + 1} can be described by a_i,n, i ? n, with $\text{∑}{}_{\mathrm{i\; =\; 1}}{}^{\mathrm{n}}\text{¦ a}{}_{\mathrm{i,n}}\text{¦ ? 1}$, such that e_i,n = e_{i,n + 1} + a_i,ne_{n + 1,n + 1}; i = 1,…, n; holds, where e_i,nand e_{i,n + 1} are the elements of the canonical unit vector bases of l_∞ⁿand l_∞^{n + 1}, respectively (negative signs may occur). We study the connections between a triangular substochastic matrix A, whose nth column consists of the elements a_i,n, i = 1,…, n, and the Banach space a_i,n, E_n ? E_{n + 1}, E_n ? l_∞ⁿ, where A determines the embeddings of the E_n. The class of these Banach spaces is the class of all separable Lindenstrauss spaces. Sufficient and necessary conditions are stated for a matrix A to represent c₀and c. Furthermore, we characterize the class of all extreme triangular substochastic matrices which represents C(K), where K is the Cantor set. We investigate how the special biface structure of the dual unit ball of X is reflected in the elements of a matrix A representing the separable Lindenstrauss space X. This is applicable to Gurarij spaces; we give a new proof for the maximality property of Gurarij spaces and show that they are isomorphic to A(S) where S is a Choquet simplex with dense extreme points.