Unary operations with long pre-periods

It is well known that the congruence lattice ConA of an algebra A is uniquely determined by the unary polynomial operations of A (see e.g. [K. Denecke, S.L. Wismath, Universal Algebra and Applications in Theoretical Computer Science, Chapman & Hall, CRC Press, Boca Raton, London, New York, Washington DC, 2002 [2]]). Let A be a finite algebra with |A|=n. If Imf=A or |Imf|=1 for every unary polynomial operation f of A, then A is called a permutation algebra. Permutation algebras play an important role in tame congruence theory [D. Hobby, R. McKenzie, The structure of finite algebras, Contemporary Mathematics, vol. 76, Providence, Rhode Island, 1988 [3]]. If f:A→A is not a permutation then A⊃Imf and there is a least natural number λ(f) with Imf^λ(f)=Imf^λ(f)+1. We consider unary operations with λ(f)=n-1 for n?2 and λ(f)=n-2 for n?3 and look for equivalence relations on A which are invariant with respect to such unary operations. As application we show that every finite group which has a unary polynomial operation with one of these properties is simple or has only normal subgroups of index 2.     

On the Construction of Permutation Arrays via Mappings from Binary Vectors to Permutations

An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y {0,1}ⁿ, d_H (f(x), f(y)) ≥ d_H (x, y) + d, if d_H (x, y) ≤ (n + k) − d and d_H (f(x), f(y)) = n + k, if d_H (x, y) > (n + k) − d. In this paper, we construct an (n,3,2)-mapping for any positive integer n ≥ 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P(n, r) denote the maximum size of an (n, r)-permutation array and A(n, r) denote the same setting for binary codes. Applying (n,3,2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359–365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054–1059; Huang et al. (submitted)]. More precisely, we obtain that, for n ≥ 8, P(n, r) ≥ A(n − 2, r − 3) > A(n − 1,r − 2) = A(n, r − 1) when n is even and P(n, r) ≥ A(n − 2, r − 3) = A(n − 1, r − 2) > A(n, r − 1) when n is odd. This improves the best bound A(n − 1,r − 2) so far [Huang et al. (submitted)] for n ≥ 8. The work was supported in part by the National Science Council of Taiwan under contract NSC-93-2213-E-009-117     

On the monotonicity properties of additive representation functions, II

For a set A of positive integers and any positive integer n, let R₁(A,n), R₂(A,n) and R₃(A,n) denote the number of solutions of a+a^′=n with the additional restriction a,a^′∈A; a,a^′∈A,a<a^′ and a,a^′∈A,a≤a^′ respectively. In this paper, we specially focus on the monotonicity of R₃(A,n). Moreover, we show that there does not exist any set A⊂N such that R₂(A,n) or R₃(A,n) is eventually strictly increasing.     

Small quasimultiple affine and projective planes: Some improved bounds

We improve the known bounds on r(n): = min {λ| an (n², n, λ)-RBIBD exists} in the case where n + 1 is a prime power. In such a case r(n) is proved to be at most n + 1. If, in addition, n − 1 is the product of twin prime powers, then r(n) ${\ \le \ }{n \over 2}$. We also improve the known bounds on p(n): = min{λ| an (n² + n + 1, n + 1, λ)-BIBD exists} in the case where n² + n + 1 is a prime power. In such a case p(n) is bounded at worst by but better bounds could be obtained exploiting the multiplicative structure of GF(n² + n + 1). Finally, we present an unpublished construction by M. Greig giving a quasidouble affine plane of order n for every positive integer n such that n − 1 and n + 1 are prime powers. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 337–345, 1998     

Pairwise “Orthogonal generalized room squares” and equidistant permutation arrays

A generalized Room square S(r, λ; v) is an r × r array such that every cell in the array contains a subset of a v-set V. This subset could of course be the empty set. The array has the property that every element of V is contained precisely once in every row and column and that any two distinct elements of V are contained in precisely λ common cells. In this paper we define pairwise orthogonal generalized Room squares and give a construction for these using finite projective geometries. This is another generalization of the concept of pairwise orthogonal latin squares. We use these orthogonal arrays to construct permutations having a constant Hamming distance.     

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.     

Reduced Weyl asymptotics for pseudodifferential operators on bounded domains I. The finite group case

Let G⊂O(n) be a compact group of isometries acting on n-dimensional Euclidean space Rn, and X a bounded domain in Rn which is transformed into itself under the action of G. Consider a symmetric, classical pseudodifferential operator A₀ in L²(Rn) with G-invariant Weyl symbol, and assume that it is semi-bounded from below. We show that the spectrum of the Friedrichs extension A of the operator is discrete, and derive asymptotics for the number Nχ(λ) of eigenvalues of A less or equal λ and with eigenfunctions in the χ-isotypic component of L²(X) as λ→∞, giving also an estimate for the remainder term in case that G is a finite group. In particular, we show that the multiplicity of each unitary irreducible representation in L²(X) is asymptotically proportional to its dimension.     

Reduced Weyl asymptotics for pseudodifferential operators on bounded domains II. The compact group case

Let G⊂O(n) be a compact group of isometries acting on n-dimensional Euclidean space Rn, and X a bounded domain in Rn which is transformed into itself under the action of G. Consider a symmetric, classical pseudodifferential operator A₀ in L²(Rn) that commutes with the regular representation of G, and assume that it is elliptic on X. We show that the spectrum of the Friedrichs extension A of the operator is discrete, and using the method of the stationary phase, we derive asymptotics for the number Nχ(λ) of eigenvalues of A equal or less than λ and with eigenfunctions in the χ-isotypic component of L²(X) as λ→∞, giving also an estimate for the remainder term for singular group actions. Since the considered critical set is a singular variety, we recur to partial desingularization in order to apply the stationary phase theorem.     

Strong commutativity preserving maps on Lie ideals

Let A be a prime ring and let R be a noncentral Lie ideal of A. An additive map f:R→A is called strong commutativity preserving (SCP) on R if [f(x),f(y)]=[x,y] for all x,y∈R. In this paper we show that if f is SCP on R, then there exist λ∈C, λ²=1 and an additive map μ:R→Z(A) such that f(x)=λx+μ(x) for all x∈R where C is the extended centroid of A, unless charA=2 and A satisfies the standard identity of degree 4.     

Row-ordering schemes for sparse givens transformations. I. bipartite graph model

Let A be an m-by-n matrix, m?n, and let P_r and P_c be permutation matrices of order m and n respectively. Suppose P_rAP_c is reduced to upper trapezoidal form $\text{(}\text{R}\text{O}\text{)}$ using Givens rotations, where R is n by n and upper triangular. The sparsity structure of R depends only on P_c. For a fixed P_c, the number of arithmetic operations required to compute R depends on P_r. In this paper, we consider row-ordering strategies which are appropriate when P_c is obtained from nested-dissection orderings of A^TA. Recently, it was shown that so-called “width-2” nested-dissection orderings of A^TA could be used to simultaneously obtain good row and column orderings for A. In this series of papers, we show that the conventional (width-1) nested-dissection orderings can also be used to induce good row orderings. In this first paper, we analyze the application of Givens rotations to a sparse matrix A using a bipartite-graph model.     

A common property of R(E, F) and B(ℝ n , ℝ m ) and a new method for seeking a path to connect two operators

Given two Banach spaces E, F, let B(E, F) be the set of all bounded linear operators from E into F, and R(E, F) the set of all operators in B(E, F) with finite rank. It is well-known that B(? ⁿ ) is a Banach space as well as an algebra, while B(? ⁿ , ? ^m ) for m ≠ n, is a Banach space but not an algebra; meanwhile, it is clear that R(E, F) is neither a Banach space nor an algebra. However, in this paper, it is proved that all of them have a common property in geometry and topology, i.e., they are all a union of mutual disjoint path-connected and smooth submanifolds (or hypersurfaces). Let Σ _r be the set of all operators of finite rank r in B(E, F) (or B(? ⁿ , ? ^m )). In fact, we have that 1) suppose Σ _r ∈ B(? ⁿ , ? ^m ), and then Σ _r is a smooth and path-connected submanifold of B(? ⁿ , ? ^m ) and dimΣ _r = (n + m)r ? r ², for each r ∈ [0, min{n,m}; if m ≠ n, the same conclusion for Σ _r and its dimension is valid for each r ∈ [0, min{n, m}]; 2) suppose Σ _r ∈ B(E, F), and dimF = ∞, and then Σ _r is a smooth and path-connected submanifold of B(E, F) with the tangent space T _A Σ _r = {B ∈ B(E, F): BN(A) ? R(A)} at each A ∈ Σ _r for 0 ? r ? ∞. The routine methods for seeking a path to connect two operators can hardly apply here. A new method and some fundamental theorems are introduced in this paper, which is development of elementary transformation of matrices in B(? ⁿ ), and more adapted and simple than the elementary transformation method. In addition to tensor analysis and application of Thom’s famous result for transversility, these will benefit the study of infinite geometry.     

Ruzsa’s constant on additive functions

A function f : N → R is called additive if f(mn)= f(m)+f(n)for all m, n with(m, n)= 1. Let μ(x)= max n≤x(f(n)f(n + 1))and ν(x)= max n≤x(f(n + 1)f(n)). In 1979, Ruzsa proved that there exists a constant c such that for any additive function f , μ(x)≤ cν(x 2 )+ c f , where c f is a constant depending only on f . Denote by R af the least such constant c. We call R af Ruzsa's constant on additive functions. In this paper, we prove that R af ≤ 20.     

Multiobjective programming and penalty functions

This paper generalizes the penalty function method of Zang-will for scalar problems to vector problems. The vector penalty function takes the form $$g(x,\lambda ) = f(x) + \lambda ^{ - 1} P(x)e,$$ wheree ?R ^m, with each component equal to unity;f:R ⁿ →R ^m, represents them objective functions {f ⁱ} defined onX \( \subseteq \) R ⁿ; λ ∈R ¹, λ>0;P:R ⁿ →R ¹ X \( \subseteq \) Z \( \subseteq \) R ⁿ,P(x)≦0, ∨x ∈R ⁿ,P(x) = 0 ?x ∈X. The paper studies properties of {E (Z, λ _r )} for a sequence of positive {λ _r } converging to 0 in relationship toE(X), whereE(Z, λ _r ) is the efficient set ofZ with respect tog(·, λ_r) andE(X) is the efficient set ofX with respect tof. It is seen that some of Zangwill's results do not hold for the vector problem. In addition, some new results are given.     

On the maximum number of permutations with given maximal or minimal distance

Let us denote by R(k, ? λ)[R(k, ? λ)] the maximal number $\text{M}$ such that there exist $\text{M}$ different permutations of the set {1,…, k} such that any two of them have at least λ (at most λ, respectively) common positions. We prove the inequalities R(k, ? λ) ? kR(k ? 1, ? λ ? 1), R(k, ? λ) ? R(k, ? λ ? 1) ? k!, R(k, ? λ) ? kR(k ? 1, ? λ ? 1). We show: R(k, ? k ? 2) = 2, R(k, ? 1) = (k ? 1)!, R(p^m, ? 2) = (p^m ? 2)!, R(p^m + 1, ? 3) = (p^m ? 2)!, $\text{R(k, ? k ? 3) =}\text{k!}\text{2}$, R(k, ? 0) = k, R(p^m, ? 1) = p^m(p^m ? 1), R(p^m + 1, ? 2) = (p^m + 1)p^m(p^m ? 1). The exact value of R(k, ? λ) is determined whenever k ? k₀(k ? λ); we conjecture that R(k, ? λ) = (k ? λ)! for k ? k₀(λ). Bounds for the general case are given and are used to determine that the minimum of |R(k, ? λ) ? R(k, ? λ)| is attained for $\text{λ = (}\text{k}\text{2}\text{) + O(}\text{k}\text{log}\text{k}\text{)}$.     

Complete hypersurfaces with constant scalar curvature in spheres

To a given immersion ${i:M^n\to \mathbb S^{n+1}}$ with constant scalar curvature R, we associate the supremum of the squared norm of the second fundamental form sup |A|². We prove the existence of a constant C _n (R) depending on R and n so that R ≥ 1 and sup |A|² = C _n (R) imply that the hypersurface is a H(r)-torus ${\mathbb S^1(\sqrt{1-r^2})\times\mathbb S^{n-1} (r)}$ . For R > (n ? 2)/n we use rotation hypersurfaces to show that for each value C > C _n (R) there is a complete hypersurface in ${\mathbb S^{n+1}}$ with constant scalar curvature R and sup |A|² = C, answering questions raised by Q. M. Cheng.     

Fourier transforms of smooth functions on certain nilpotent Lie groups

The authors consider irreducible representations $\text{π ?}\text{N}\text{?}$ of a nilpotent Lie group and define a Fourier transform for Schwartz class (and other) functions φ on N by forming the kernels K_φ(x, y) of the trace class operations π_φ = ∝_Nφ(n)π_ndn, regarding the π as modeled in L²(R^k) for all π in general position. For a special class of groups they show that the models, and parameters λ labeling the representations in general position, can be chosen so the joint behavior of the kernels K_φ(x, y, λ) can be interpreted in a useful way. The variables (x, y, λ) run through a Zariski open set in Rⁿ, n = dim N. The authors show there is a polynomial map u = A(x, y, λ) that is a birational isomorphism A: Rⁿ → Rⁿ with the following properties. The Fourier transforms F₁φ = K_φ(x, y, λ) all factor through A to give “rationalized” Fourier transforms Fφ(u) such that Fφ ° A = F₁φ. On the rationalized parameter space a function f(u) is of the form F_φ = f ? f is Schwartz class on Rⁿ. If polynomial operators T?P(N) are transferred to operators $\text{T}\text{?}$ on Rⁿ such that $\text{F(Tφ) =}\text{T}\text{?}\text{(Fφ), P(N)}$ is transformed isomorphically to P(Rⁿ).     

On convexity properties of the spectral radius of nonnegative matrices

Elementary matrix-theoretic proofs are given for the following well-known results: r(D) = max{Re λ : λ an eigenvalue of A + D} and s(D) = lnρ(e^DA) are convex. Here D is diagonal, A a nonnegative n × n matrix, and ρ the spectral radius.     

Sur les entiers dont la somme des chiffres est moyenne

The goal of this paper is to study sets of integers with an average sum of digits. More precisely, let g be a fixed integer, s(n) be the sum of the digits of n in basis g. Let f:N→N such that, in any interval [g^ν,g^ν+1[, f(n) is constant and near from (g-1)ν/2. We give an asymptotic for the number of integers n<x such that s(n)=f(n) and we prove that for every irrational α the sequence (αn) is equidistributed mod 1, for n satisfying s(n)=f(n).     

RELATIONS AMONG SOME PARAMETERS OF HYPERGRAPHS

The relations among the dominating number, independence number and covering number of hypergraphs are investigated. Main results are as follows：Dv（H）≤min{α≤（H）, p（H）, p（H）, T（H）}; De（H）≤min{v（H）, T（H）, p（H）}; DT（H） ≤αT（H）; S（H）≤ Dv （H） ＋ α（H）≤n; 2≤ Dv （H） ＋ T（H） ≤n; 2 〈 Dv （H） ＋ v（H）≤n/2 ＋ [n/r]; Dv （H） ＋ p（H） 〈_n;2≤De（H） ＋ Dv（H）≤n/2 ＋ [n/r];α（H） ＋ De（H）≤n;2 ≤ De（H） ＋ v（H）≤2[n/r]; 2 De（H） ＋ p（H）≤n-r ＋ 2.