Dense minimal asymptotic bases of order two

We call a set A of positive integers an asymptotic basis of order h if every sufficiently large integer n can be written as a sum of h elements of A. If no proper subset of A is an asymptotic basis of order h, then A is a minimal asymptotic basis of that order. Erd?s and Nathanson showed that for every h?2 there exists a minimal asymptotic basis A of order h with d(A)=1/h, where d(A) denotes the density of A. Erd?s and Nathanson asked whether it is possible to strengthen their result by deciding on the existence of a minimal asymptotic bases of order h?2 such that A(k)=k/h+O(1). Moreover, they asked if there exists a minimal asymptotic basis with lim sup(ai+1−ai)=3. In this paper we answer these questions in the affirmative by constructing a minimal asymptotic basis A of order 2 fulfilling a very restrictive condition

     

Minimal asymptotic bases for the natural numbers

The sequence A of nonnegative integers is an asymptotic basis of order h if every sufficiently large integer can be written as the sum of h elements of A. Let $\text{M}{}_{\mathrm{h}}{}^{\mathrm{A}}$ denote the set of elements that have more than one representation as a sum of h elements of A. It is proved that there exists an asymptotic basis A such that $\text{M}{}_{\mathrm{h}}{}^{\mathrm{A}}\text{(x) = O(x}{}^{\mathrm{<mtext>1?1</mtext><mtext>h+?</mtext>}}\text{)}$ for every ? > 0. An asymptotic basis A of order h is minimal if no proper subset of A is an asymptotic basis of order h. It is proved that there does not exist a sequence A that is simultaneously a minimal basis of orders 2, 3, and 4. Several open problems concerning minimal bases are also discussed.     

Minimal bases and maximal nonbases in additive number theory

An asymptotic basis $\text{A}$ of order h is minimal if no proper subset of $\text{A}$ is an asymptotic basis of order h. Examples are constructed of minimal asymptotic bases, and also of an asymptotic basis of order two no subset of which is minimal.If $\text{B}$ is a set of nonnegative integers which is not a basis (resp. asymptotic basis) of order h, but such that every proper superset of $\text{B}$ is a basis (resp. asymptotic basis) of order h, then $\text{B}$ is a maximal nonbasis (resp. maximal asymptotic nonbasis) of order h. Examples of such sets are constructed, and it is proved that every set not a basis of order h is a subset of a maximal nonbasis of order h.     

The Basis Number of Some Special Non-Planar Graphs

The basis number of a graph G was defined by Schmeichel to be the least integer h such that G has an h-fold basis for its cycle space. He proved that for m, n 5, the basis number b(K _m,n ) of the complete bipartite graph K _m,n is equal to 4 except for K _6,10, K _5,n and K _6,n with n = 5, 6, 7, 8. We determine the basis number of some particular non-planar graphs such as K _5,n and K _6,n , n = 5, 6, 7, 8, and r-cages for r = 5, 6, 7, 8, and the Robertson graph.     

On Sidon sets which are asymptotic bases

Let h ≧ 2 be an integer. We say that a set $ \mathcal{A} $ of positive integers is an asymptotic basis of order h if every large enough positive integer can be represented as the sum of h terms from $ \mathcal{A} $ . A set of positive integers $ \mathcal{A} $ is called a Sidon set if all the sums a + b with $ a \in \mathcal{A},b \in \mathcal{A},a \leqq b $ , are distinct. In this paper we prove the existence of Sidon sets which are asymptotic bases of order 5 by using probabilistic methods.     

Cofinite subsets of asymptotic bases for the positive integers

Let A be an infinite set of integers containing at most finitely many negative terms. Let hA denote the set of all integers n such that n is a sum of h elements of A. Let F be a finite subset of A.Theorem. If hA contains an infinite arithmetic progression with difference d, and if $\text{gcd}\text{{a?a′¦a,a′∈AF} = d}$, then there exists q such that q(A\F) contains an infinite arithmetic progression. In particular, if A is an asymptotic basis, then A\F is an asymptotic basis if and only if gcd{a?a′|a,a′∈A\F} = 1.Theorem. If A is an asymptotic basis of order h, and if F?A, card(F) = k, and A\F is an asymptotic basis, then the exact order of A\F is O(h^k+1).     

关于4阶极小渐近基的一个结果

设h≥2,若h阶渐近基A的任一真子集均不是h阶渐近基,则称集合A是自然数集N的h阶极小渐近基.为进一步刻画渐近基与极小渐近基之间的关系,本文综合运用自然数的b进制表示理论及分类讨论的方法,证明了存在一个集合是4阶渐近基且其任何子集均不是4阶极小渐近基.     

On Codimension Growth of Finitely Generated Associative Algebras

LetAbe a PI-algebra over a fieldF. We study the asymptotic behavior of the sequence of codimensionsc_n(A) ofA. We show that ifAis finitely generated overFthenInv(A)=lim_n→∞ always exists and is an integer. We also obtain the following characterization of simple algebras:Ais finite dimensional central simple overFif and only ifInv(A)=dim=A.     

Semiclassical Spectral Asymptotics on Foliated Manifolds

We consider a (hypo)elliptic pseudodifferential operator A_h on a closed foliated manifold (M,ℱ), depending on a parameterh > 0, of the form A_h = A+h^mB, where A is a formally self–adjoint tangentially elliptic operator of orderμ > 0 with the nonnegative principal symbol and B is a formally self–adjoint classical pseudodi.erential operator of orderm > 0 on M with the holonomy invariant transversal principal symbol such that its principal symbol is positive, if μ < m, and its transversal principal symbol is positive, if μ ≥ m. We prove an asymptotic formula for the eigenvalue distribution function N_h(λ) of the operator A_h when h tends to 0 and λ is constant.     

An analytic approximation to the cardinal functions of Gaussian radial basis functions on an infinite lattice

Gaussian radial basis functions (RBFs) have been very useful in computer graphics and for numerical solutions of partial differential equations where these RBFs are defined, on a grid with uniform spacing h, as translates of the “master” function (x;α,h)≡exp(-[α²/h²]x²) where α is a user-choosable constant. Unfortunately, computing the coefficients of (x-jh;α,h) requires solving a linear system with a dense matrix. It would be much more efficient to rearrange the basis functions into the equivalent “Lagrangian” or “cardinal” basis because the interpolation matrix in the new basis is the identity matrix; the cardinal basis C_j(x;α,h) is defined by the set of linear combinations of the Gaussians such that C_j(kh)=1 when k=j and C_j(kh)=0 for all integers . We show that the cardinal functions for the uniform grid are C_j(x;h,α)=C(x/h-j;α) where C(X;α)≈(α²/π)sin(πX)/sinh(α²X). The relative error is only about 4exp(-2π²/α²) as demonstrated by the explicit second order approximation. It has long been known that the error in a series of Gaussian RBFs does not converge to zero for fixed α as h→0, but only to an “error saturation” proportional to exp(-π²/α²). Because the error in our approximation to the master cardinal function C(X;α) is the square of the error saturation, there is no penalty for using our new approximations to obtain matrix-free interpolating RBF approximations to an arbitrary function f(x). The master cardinal function on a uniform grid in d dimensions is just the direct product of the one-dimensional cardinal functions. Thus in two dimensions . We show that the matrix-free interpolation can be extended to non-uniform grids by a smooth change of coordinates.     

An Upper Bound on the Basis Number of the Powers of the Complete Graphs

The basis number of a graph G is defined by Schmeichel to be the least integer h such that G has an h-fold basis for its cycle space. MacLane showed that a graph is planar if and only if its basis number is . Schmeichel proved that the basis number of the complete graph K _n is at most 3>. We generalize the result of Schmeichel by showing that the basis number of the d-th power of K _n is at most 2d+1.     

Bounds on the k-th generalized base of a primitive sign pattern matrix

You et al. [L. You, J. Shao, and H. Shan, Bounds on the bases of irreducible generalized sign pattern matrices, Lin. Alg. Appl. 427 (2007), pp. 285–300] extended the concept of the base of a powerful sign pattern matrix to the nonpowerful, irreducible sign pattern matrices. The key to their generalization was to view the relationship A ^l =A ^l?+?p as an equality of generalized sign patterns rather than of sign patterns. You, Shao and Shan showed that for primitive generalized sign patterns, the base is the smallest positive integer k such that all entries of A ^k are ambiguous. In this paper we study the k-th generalized base for nonpowerful primitive sign pattern matrices. For a primitive, nonpowerful sign pattern A, this is the smallest positive integer h such that A^k has h rows consisting entirely of ambiguous entries. Extending the work of You, Shao and Shan, we obtain sharp upper bounds on the k-th generalized base, together with a complete characterization of the equality cases for those bounds. We also show that there exist gaps in the k-th generalized base set of the classes of such matrices.     

On the Automorphism Group of a Semifield of Order 54

The purpose of this article is to determine Aut(A) where A is a semifield of order 5⁴ admitting an automorphism group E ? Z ₂ × Z ₂ acting freely on A.     

Asymptotic optimality of the generalized bayes estimator in multiparameter cases

The higher order asymptotic efficiency of the generalized Bayes estimator is discussed in multiparameter cases. For all symmetric loss functions, the generalized Bayes estimator is second order asymptotically efficient in the classA ₂ of the all second order asymptotically median unbiased (AMU) estimators and third order asymptotically efficient in the restricted classD of estimators.     

Curves on a Kummer Surface in ℙ3, I

In this paper the asymptotic behaviour of the solutions of x' = A(t)x + h(t,x) under the assumptions of instability is studied, A(t) and h(t,x) being a square matrix and a vector function, respectively. The conditions for the existence of bounded solutions or solutions tending to the origin as t → ∞ are obtained. The method: the system is recasted to an equation with complex conjugate coordinates and this equation is studied by means of a suitable Lyapunov function and by virtue of the Wazevski topological method. Applications to a nonlinear differential equation of the second order are given.     

On k‐ary spanning trees of tournaments

It is well known that every tournament contains a Hamiltonian path, which can be restated as that every tournament contains a unary spanning tree. The purpose of this article is to study the general problem of whether a tournament contains a k‐ary spanning tree. In particular, we prove that, for any fixed positive integer k, there exists a minimum number h(k) such that every tournament of order at least h(k) contains a k‐ary spanning tree. The existence of a Hamiltonian path for any tournament is the same as h(1) = 1. We then show that h(2) = 4 and h(3) = 8. The values of h(k) remain unknown for k ≥ 4. © 1999 John & Sons, Inc. J Graph Theory 30: 167–176, 1999     

Extended integer rank reduction formulas and Smith normal form

We present an integer rank reduction formula for transforming the rows and columns of an integer matrix A. By repeatedly applying the formula to reduce rank, an extended integer rank reducing process is derived. The process provides a general finite iterative approach for constructing factorizations of A and A ^T under a common framework of a general decomposition V ^T AP?=?Ω. Then, we develop the integer Wedderburn rank reduction formula and its integer biconjugation process. Both the integer biconjugation process associated with the Wedderburn rank reduction process and the scaled extended integer Abaffy–Broyden–Spedicato (ABS) class of algorithms are shown to be in the integer rank reducing process. We also show that the integer biconjugation process can be derived from the scaled integer ABS class of algorithms applied to A or A ^T . Finally, we show that the integer biconjuagation process is a special case of our proposed ABS class of algorithms for computing the Smith normal form.     

Equivalence of Hadamard matrices

Supposem is a square-free odd integer, andA andB are any two Hadamard matrices of order 4m. We will show thatA andB are equivalent over the integers (that is,B can be obtained fromA using elementary row and column operations which involve only integers).     

On Nuclei and Duals of Semifields of Order q 4, q is a Power of 2

The aim of this article is to investigate the nuclei of a semifield A of order q ⁴, q is a power of 2, admitting a four-group E of automorphisms isomorphic to Z ₂ × Z ₂ acting freely on A and having GF(q ²) in its left nucleus. We also study the dual semifield A* of A and show that A and A* are isomorphic.     

Extremal Bases for the Adjoint Representations of the Simple Lie Algebras

We construct n distinct weight bases, which we call extremal bases, for the adjoint representation of each simple Lie algebra 𝔤 of rank n: One construction for each simple root. We explicitly describe actions of the Chevalley generators on the basis elements. We show that these extremal bases are distinguished by their “supporting graphs” in three ways. (In general, the supporting graph of a weight basis for a representation of a semisimple Lie algebra is a directed graph with colored edges that describe the supports of the actions of the Chevalley generators on the elements of the basis.) We show that each extremal basis constructed is essentially the only basis with its supporting graph (i.e., each extremal basis is solitary), and that each supporting graph is a modular lattice. Each extremal basis is shown to be edge-minimizing: Its supporting graph has the minimum number of edges. The extremal bases are shown to be the only edge-minimizing as well as the only modular lattice weight bases (up to scalar multiples) for the adjoint representation of 𝔤. The supporting graph for an extremal basis is shown to be a distributive lattice if and only if the associated simple root corresponds to an end node for a “branchless” simple Lie algebra, i.e., type A, B, C, F, or G. For each extremal basis, basis elements for the Cartan subalgebra are explicitly expressed in terms of the h _i Chevalley generators.