Group of units of group algebras

By a right (left resp.) S_2n-polynomial we mean a multilinear polynomial f(X₁,…, X_t) over the ring of integers with noncommuting in-determinates X_isuch that for any prime ring R if f( X₁,…, X _t) is a PI of some nonzero right (left resp.) ideal of R, then R satisfies S_2nthe standard identity of degree 2n. In this paper we prove the theorem:Let R be a prime ring, d a nonzero derivation of R, L a noncommutative Lie ideal of R and f(X₁,…, X_t) a right or left S_2n-polynomial. Suppose that f(d( u₁)ⁿ¹,…,d(u_t)^nt)=0 for all u_iu,_i[d] L, where n₁,…,n_tare fixed positive integers. Then R satisfies S_2n+2. Also, the one-sided version of the theorem is given.     

Enumeration of arrays of a given size

Enumeration of arrays whose row and column sums are specified have been studied by a number of people. It has been determined that the function that enumerates square arrays of dimension n, whose rows and columns sum to a fixed non-negative integer r, is a polynomial in r of degree (n ? 1)².In this paper we consider rectangular arrays whose rows sum to a fixed non-negative integer r and whose columns sum to a fixed non-negative integer s, determined by ns = mr. in particular, we show that the functions which enumerate 2 × n and 3 × n arrays with fixed row sums $\text{nr}\text{(2, n)}$ and $\text{nr}\text{(3, n)}$, where the symbol (a, b) denotes the greatest common divisor of a and b, and fixed column sums, are polynomials in r of degrees (n ? 1) and 2(n ? 1) respectively. We have found simple formulas to evaluate these polynomials for negative values, - r, and we show that for certain small negative integers our polynomials will always be zero. We also considered the generating functions of these polynomials and show that they are rational functions of degrees less than zero, whose denominators are of the forms (1 ? y)ⁿ and (1 ? y)²ⁿ?1 respectively and whose numerators are polynomials in y whose coefficients satisfy certain properties. In the last section we list the actual polynomials and generating functions in the 2 × n and 3 × n cases for small specific values of n.     

Asymptotic enumeration of dense 0-1 matrices with specified line sums

Let s=(s₁,s₂,…,sm) and t=(t₁,t₂,…,tn) be vectors of non-negative integers with . Let B(s,t) be the number of m×n matrices over {0,1} with jth row sum equal to sj for 1?j?m and kth column sum equal to tk for 1?k?n. Equivalently, B(s,t) is the number of bipartite graphs with m vertices in one part with degrees given by s, and n vertices in the other part with degrees given by t. Most research on the asymptotics of B(s,t) has focused on the sparse case, where the best result is that of Greenhill, McKay and Wang (2006). In the case of dense matrices, the only precise result is for the case of equal row sums and equal column sums (Canfield and McKay, 2005). This paper extends the analytic methods used by the latter paper to the case where the row and column sums can vary within certain limits. Interestingly, the result can be expressed by the same formula which holds in the sparse case.     

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.     

A diophantine problem concerning cubes

This paper deals with the problem of finding n integers such that their pairwise sums are cubes. We obtain eight integers, expressed in parametric terms, such that all the six pairwise sums of four of these integers are cubes, 9 of the 10 pairwise sums of five of these integers are cubes, 12 pairwise sums of six of these integers are cubes, 15 pairwise sums of seven of these integers are cubes and 18 pairwise sums of all the eight integers are cubes. This leads to infinitely many examples of four positive integers such that all of their six pairwise sums are cubes. Further, for any arbitrary positive integer n, we obtain a set of 2(n+1) integers, in parametric terms, such that 5n+1 of the pairwise sums of these integers are cubes. With a choice of parameters, we can obtain examples with 5n+2 of the pairwise sums being cubes.     

The exact order of\sum\nolimits_{k = 1}^{\text{n}} {|{\text{x - x}}_{\text{k}} } |^8 |{\text{l}}_{\text{k}} ({\text{x)|}}^{\text{t}}

In this paper we give the exact order of \(\sum\nolimits_{k = 1}^{\text{n}} {|{\text{x - x}}_{\text{k}} } |^5 .\) for any fixed nonnegative integers s and t, which is n^?s, n^?s lnn and n^1?t for s≤t?2, s=t?1 and s≥t, respectively.     

On additive partitions of integers

Given a linear recurrence integer sequence U = {u_n}, u_n+2 = u_n+1 + u_r, n ? 1, u₁ = 1, u₂> u₁, we prove that the set of positive integers can be partitioned uniquely into two disjoint subsets such that the sum of any two distinct members from any one set can never be in U. We give a graph theoretic interpretation of this result, study related problems and discuss possible generalizations.     

A note on the oscillatory property for nonlinear difference equations and differential equations

Criteria are given to determine the oscillatory property of solutions of the nonlinear difference equation: Δ^du_n + ∑_{i = 1}^mp_inf_i(u_n, Δu_n,…,Δ^{d ? 1}u_n) = 0, n = 0, 1, 2,…, where d is an arbitrary integer, generalizing results that have been obtained by B. Szmanda (J. Math. Anal. Appl.79 (1981), 90–95) for d = 2. Analogous results are given for the differential equation: u^(d) + ∑_{i = 1}^mp_i(t)f_i(u, u′,…, u^{(d ? 1)}) = 0, t ? t₀, which coincide with the criteria given by 2., 3., 599–602) and 4., 5., 6., 715–719) for the case m = 1.     

More on the Erdös-Ko-Rado theorem for integer sequences

For positive integers n, k₁, k₂,…, k_n, t the probem: how many integer sequences (x₁, x₂,…, x_n) does it take such that 0 ? x_i ? k_i for 1 ? i ? n and any two sequences agree in at least t positions is investigated. Moreover all maximal systems of sequences are described. Results of Livingston and Frankl and Füredi are generalized also.     

A fundamental inequality for the sum of sets of m-tuples

For n a positive integer and A₁, A₂, …, A_k sets of nonnegative integers, sufficient conditions are found which imply that the sum of the cardinalities of the sets $\text{{1, 2, …, n} ? A}{}_{\mathrm{i}}\text{(i = 1, 2, …, k)}$ does not exceed the cardinality of the intersection of {1, 2, …, n} and the number theoretic sum of the k sets. Some of the results are generalized to sets of m-tuples of nonnegative integers.     

Optimal labelling of a product of two paths

If G is a graph with p vertices and at least one edge, we set φ (G) = m n max |f(u) ? f(v)|, where the maximum is taken over all edges uv and the minimum over all one-to-one mappings f : V(G) → {1, 2, …, p}: V(G) denotes the set of vertices of G.P_n will denote a path of length n whose vertices are integers 1, 2, …, n with i adjacent to j if and only if |i ? j| = 1. P_m × P_n will denote a graph whose vertices are elements of {1, 2, …, m} × {1, 2, …, n} and in which (i, j), (r, s) are adjacent whenever either i = r and |j ? s| = 1 or j = s and |i ? r| = 1.Theorem.If max(m, n) ? 2, thenφ(P_m × P_n) = min(m, n).     

Regularity of subelliptic Monge-Ampère equations

In dimension n?3, for k≈|x|^2m that can be written as a sum of squares of smooth functions, we prove that a C² convex solution u to a subelliptic Monge-Ampère equation detD²u=k(x,u,Du) is itself smooth if the elementary (n−1)st symmetric curvature kn−1 of u is positive (the case m?2 uses an additional nondegeneracy condition on the sum of squares). Our proof uses the partial Legendre transform, Calabi's identity for ∑uijσij where σ is the square of the third order derivatives of u, the Campanato method Xu and Zuily use to obtain regularity for systems of sums of squares of Hörmander vector fields, and our earlier work using Guan's subelliptic methods.     

Properties of (0, 1)-matrices with no triangles

We study (0, 1)-matrices which contain no triangles (submatrices of order 3 with row and column sums 2) previously studied by Ryser. Let the row intersection of row i and row j of some matrix, when regarded as a vector, have a 1 in a given column if both row i and row j do and a zero otherwise. For matrices with no triangles, columns sums ?2, we find that the number of linearly independent row intersections is equal to the number of distinct columns. We then study the extremal (0, 1)-matrices with no triangles, column sums ?2, distinct columns, i.e., those of size mx(^m₂). The number of columns of column sum l is m ? l + 1 and they form a (l ? 1)-tree. The ((^m₂)) columns have a unique SDR of pairs of rows with 1's. Also, these matrices have a fascinating inductive buildup. We finish with an algorithm for constructing these matrices.     

Anti‐magic graphs via the Combinatorial NullStellenSatz

An antimagic labeling of a graph with m edges and n vertices is a bijection from the set of edges to the integers 1,…,m such that all n vertex sums are pairwise distinct, where a vertex sum is the sum of labels of all edges incident with that vertex. A graph is called antimagic if it has an antimagic labeling. In [ 10 ], Ringel conjectured that every simple connected graph, other than K₂, is antimagic. We prove several special cases and variants of this conjecture. Our main tool is the Combinatorial NullStellenSatz (cf. [ 1 ]). © 2005 Wiley Periodicals, Inc. J Graph Theory     

A construction for equidistant permutation arrays of index one

An equidistant permutation array (EPA) which we denote by A(r, λ; ν) is a ν × r array such that every row is a permutation of the integers 1, 2,…, r and such that every pair of distinct rows has precisely λ columns in common. R(r, λ) is the maximum ν such that there exists an A(r, λ; ν). In this paper we show that R(n² + n + 2, 1) ? 2n² + n where n is a prime power.     

On the classification of conditionally integrable evolution systems in (1 + 1) dimensions

We generalize earlier results of Fokas and Liu and find all locally analytic (1 + 1)-dimensional evolution equations of order n that admit an N-shock-type solution with N ≤ n + 1. For this, we develop a refinement of the technique from our earlier work, where we completely characterized all (1+1)-dimensional evolution systems u _t = F (x, t, u, ?u/?x,..., ?ⁿ u/? x ⁿ) that are conditionally invariant under a given generalized (Lie-Bäcklund) vector field Q(x, t, u, ?u/?x,..., ?^k u/?x ^k)?/?u under the assumption that the system of ODEs Q = 0 is totally nondegenerate. Every such conditionally invariant evolution system admits a reduction to a system of ODEs in t, thus being a nonlinear counterpart to quasi-exactly solvable models in quantum mechanics.     

An Application of Network Flows to Rearrangement of Series

For each permutation f of the set of positive integers, alltriples s, t, u are determined such that t and u are the lowerand upper limits of the sequence of partial sums of the ‘f-rearrangement’a_f(n) of some real series a_n with sum s.     

On the density of odd integers of the form (p − 1)2−n and related questions

It is shown that odd integers k such that k · 2ⁿ + 1 is prime for some positive integer n have a positive lower density. More generally, for any primes p₁, …, p_r, the integers k such that k is relatively prime to each of p₁,…, p_r, and such that k · p₁^n₁p₂^n₂ … p_r^n_r + 1 is prime for some n₁,…, n_r, also have a positive lower density.     

A generalization of the Kruskal-Katona theorem

Let k_n ? k_n?1 ? … ? k₁ be positive integers and let ($\text{i}\text{j}$) denote the coefficient of xⁱ in $\text{Π}\text{r=1}\text{j}\text{(1 + x + x}{}^2\text{+ … + x}{}^{\mathrm{kr}}\text{)}$. For given integers l, m, where 1 ? l ? k_n + k_n?1 + … + k₁ and $\text{1 ? m ? (}\text{n}\text{n}\text{)}$, it is shown that there exist unique integers m(l), m(l ? 1),…, m(t), satisfying certain conditions, for which $\text{m = (}\text{m(l)}\text{l}\text{+ (}\text{m(l?1)}\text{l?1}\text{) + … + (}\text{m(t)}\text{t}\text{)}$. Moreover, any m l-subsets of a multiset with k_i elements of type i, i = 1, 2,…, n, will contain at least $\text{(}\text{m(l)}\text{l?1}\text{) + (}\text{m(l?1)}\text{l?2}\text{) + … + (}\text{m(t)}\text{t?1}$ different (l ? 1)-subsets. This result has been anticipated by Greene and Kleitman, but the formulation there is not completely correct. If k₁ = 1, the numbers ($\text{j}\text{i}$) are binomial coefficients and the result is the Kruskal-Katona theorem.     

A hybrid mean value involving two-term exponential sums and polynomial character sums

Let q ? 3 be a positive integer. For any integers m and n, the two-term exponential sum C(m, n, k; q) is defined by \(C(m,n,k;q) = \sum\limits_{a = 1}^q {e((ma^k + na)/q)} \) , where \(e(y) = e^{2\pi iy} \) . In this paper, we use the properties of Gauss sums and the estimate for Dirichlet character of polynomials to study the mean value problem involving two-term exponential sums and Dirichlet character of polynomials, and give an interesting asymptotic formula for it.