Growing perfect cubes

An (n,a,b)-perfect double cube is a b×b×b sized n-ary periodic array containing all possible a×a×a sized n-ary array exactly once as subarray. A growing cube is an array whose c_j×c_j×c_j sized prefix is an (n_j,a,c_j)-perfect double cube for , where and n₁<n₂<?. We construct the smallest possible perfect double cube (a 256×256×256 sized 8-ary array) and growing cubes for any a.     

Expected length of the longest common subsequence for large alphabets

We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield that E[L]/n converges to a constant γ_k. We prove a conjecture of Sankoff and Mainville from the early 1980s claiming that as k→∞.     

Nontrivial lower bounds for the least common multiple of some finite sequences of integers

We present here a method which allows to derive a nontrivial lower bounds for the least common multiple of some finite sequences of integers. We obtain efficient lower bounds (which in a way are optimal) for the arithmetic progressions and lower bounds less efficient (but nontrivial) for quadratic sequences whose general term has the form un=an(n+t)+b with (a,t,b)∈Z³, a?5, t?0, gcd(a,b)=1. From this, we deduce for instance the lower bound: lcm{¹²+1,²²+1,…,n²+1}?0,32n(1,442) (for all n?1). In the last part of this article, we study the integer lcm(n,n+1,…,n+k) (k∈N, n∈N^∗). We show that it has a divisor dn,k simple in its dependence on n and k, and a multiple mn,k also simple in its dependence on n. In addition, we prove that both equalities: lcm(n,n+1,…,n+k)=dn,k and lcm(n,n+1,…,n+k)=mn,k hold for an infinitely many pairs (n,k).     

On the Posets ( \user1Wk2 , < ){\left( {{\user1{\mathcal{W}}}^{k}_{2} , < } \right)} and their Connections with Some Homogeneous Inequalities of Degree 2

A class of ranked posets {(D _h ^k , ≪)} has been recently defined in order to analyse, from a combinatorial viewpoint, particular systems of real homogeneous inequalities between monomials. In the present paper we focus on the posets D ₂ ^k , which are related to systems of the form {x _a x _b * _abcd x _c x _d : 0 ≤ a, b, c, d ≤ k, * _abcd ∈ {<, >}, 0 < x ₀ < x ₁ < ...< x _k}. As a consequence of the general theory, the logical dependency among inequalities is adequately captured by the so-defined posets . These structures, whose elements are all the D ₂ ^k 's incomparable pairs, are thoroughly surveyed in the following pages. In particular, their order ideals – crucially significant in connection with logical consequence – are characterised in a rather simple way. In the second part of the paper, a class of antichains is shown to enjoy some arithmetical properties which make it an efficient tool for detecting incompatible systems, as well as for posing some compatibility questions in a purely combinatorial fashion.     

Subnormality of Bergman-like weighted shifts

For a,b,c,d?0 with ad−bc>0, we consider the unilateral weighted shift S(a,b,c,d) with weights . Using Schur product techniques, we prove that S(a,b,c,d) is always subnormal; more generally, we establish that for every p?1, all p-subshifts of S(a,b,c,d) are subnormal. As a consequence, we show that all Bergman-like weighted shifts are subnormal.     

Any Diophantine quintuple contains a regular Diophantine quadruple

A set {a₁,…,am} of m distinct positive integers is called a Diophantine m-tuple if aiaj+1 is a perfect square for all i, j with 1?i<j?m. It is conjectured that if {a,b,c,d} is a Diophantine quadruple with a<b<c<d, then d=d₊, where d₊=a+b+c+2abc+2rst and , , . In this paper, we show that if {a,b,c,d,e} is a Diophantine quintuple with a<b<c<d<e, then d=d₊.     

Additive results for the generalized Drazin inverse in a Banach algebra

In this paper we investigate additive properties of the generalized Drazin inverse in a Banach algebra. We find some new conditions under which the generalized Drazin inverse of the sum a + b could be explicitly expressed in terms of a, a^d, b, b^d. Also, some recent results of Castro and Koliha [New additive results for the g-Drazin inverse, Proc. Roy. Soc. Edinburgh Sect. A 134 (2004) 1085-1097] are extended.     

An all-substrings common subsequence algorithm

Given two strings A and B of lengths n_a and n_b, n_a?n_b, respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B^′ of B, the length of the longest string that is a subsequence of both A and B^′. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n_an_b) time and O(n_a+n_b) space. After this preparation, it is possible to build a matrix of size that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem.     

A concentration bound for the longest increasing subsequence of a randomly chosen involution

In this short note we prove a concentration result for the length of the longest increasing subsequence (LIS) of a randomly and uniformly chosen involution of {1,…,s}.     

Lower bounds for numbers of ABC-hits

By an ABC-hit, we mean a triple (a,b,c) of relatively prime positive integers such that a+b=c and rad(abc)<c. Denote by N(X) the number of ABC-hits (a,b,c) with c?X. In this paper we discuss lower bounds for N(X). In particular we prove that for every ?>0 and X large enough N(X)?exp((logX)^1/2−?).     

Left division in the free left distributive algebra on one generator

Let A be the free algebra on one generator satisfying the left distributive law a(bc)=(ab)(ac). Using a division algorithm for elements of an extension P of A, we prove some facts about left division in A, one consequence of which is a conjecture of J. Moody: If a,b,c,d∈A,ab=cd,a and b have no common left divisors, and c and d have no common left divisors, then a=c and b=d.     

Further results on iterative methods for computing generalized inverses

In this paper, we reconsider the iterative method X_k=X_k−1+βY(I−AX_k−1), k=1,2,…,β∈C?{0} for computing the generalized inverse over Banach spaces or the generalized Drazin inverse a^d of a Banach algebra element a, reveal the intrinsic relationship between the convergence of such iterations and the existence of or a^d, and present the error bounds of the iterative methods for approximating or a^d. Moreover, we deduce some necessary and sufficient conditions for iterative convergence to or a^d.     

THE EDGE-CHROHATIC NUMBER OF A CIRCULANT

ABSTRACT

The circulant graph C_p > a₁,…, a_k < with 0 > a₁ >…> a_k >(pt1)/2 has p vertices labeled 0,1,…,p-1 and x and y are adjacent if and only if x—y = ± a_i (mod p) for some i. We prove the following regarding the chromatic index of a circulant: if d = gcd (a₁,…, a_k, p), then x' (C_p > a_l,…,a_k) = Δ(C p > a₁,…,a_k) if and only if p/d is even.     

On the number of solutions to systems of Pell equations

We prove that, for positive integers a, b, c and d with c≠d, a>1, b>1, the number of simultaneous solutions in positive integers to ax²−cz²=1, by²−dz²=1 is at most two. This result is the best possible one. We prove a similar result for the system of equations x²−ay²=1, z²−bx²=1.     

Koszul property of a class of graded algebras with nonpure resolutions

Given any integers a, b, c, and d with a > 1, c ≥ 0, b ≥ a + c, and d ≥ b + c, the notion of (a, b, c, d)-Koszul algebra is introduced, which is another class of standard graded algebras with “nonpure” resolutions, and includes many Artin-Schelter regular algebras of low global dimension as specific examples. Some basic properties of (a, b, c, d)-Koszul algebras/modules are given, and several criteria for a standard graded algebra to be (a, b, c, d)-Koszul are provided.     

On almost prime k-tuples

Let k?2 and ai,bi(1?i?k) be integers such that ai>0 and _∏1?i<j?k(aibj−ajbi)≠0. Let Ω(m) denote the total number of prime factors of m. Suppose has no fixed prime divisors. Results of the form where rk is asymptotic to klogk have been obtained by using sieve methods, in particular weighted sieves. In this paper, we use another kind of weighted sieve due to Selberg to obtain improved admissible values for rk.     

Representations by quaternary quadratic forms whose coefficients are 1, 4, 9 and 36

Explicit formulae are determined for the number of representations of a positive integer by the quadratic forms ax²+by²+cz²+dt² with a,b,c,d∈{1,4,9,36}, gcd(a,b,c,d)=1 and a?b?c?d.     

Two-point Taylor expansions in the asymptotic approximation of double integrals. Application to the second and fourth Appell functions

The main difficulty in Laplace's method of asymptotic expansions of double integrals is originated by a change of variables. We consider a double integral representation of the second Appell function F₂(a,b,b^′,c,c^′;x,y) and illustrate, over this example, a variant of Laplace's method which avoids that change of variables and simplifies the computations. Essentially, the method only requires a Taylor expansion of the integrand at the critical point of the phase function. We obtain in this way an asymptotic expansion of F₂(a,b,b^′,c,c^′;x,y) for large b, b^′, c and c^′. We also consider a double integral representation of the fourth Appell function F₄(a,b,c,d;x,y). We show, in this example, that this variant of Laplace's method is uniform when two or more critical points coalesce or a critical point approaches the boundary of the integration domain. We obtain in this way an asymptotic approximation of F₄(a,b,c,d;x,y) for large values of a,b,c and d. In this second example, the method requires a Taylor expansion of the integrand at two points simultaneously. For this purpose, we also investigate in this paper Taylor expansions of two-variable analytic functions with respect to two points, giving Cauchy-type formulas for the coefficients of the expansion and details about the regions of convergence.     

Distribution of the full rank in residue classes for odd moduli

The distribution of values of the full ranks of marked Durfee symbols is examined in prime and nonprime arithmetic progressions. The relative populations of different residues for the same modulus are determined: the primary result is that k-marked Durfee symbols of n equally populate the residue classes a and bmod2k+1 if gcd(a,2k+1)=gcd(b,2k+1). These are used to construct a few congruences. The general procedure is illustrated with a particular theorem on 4-marked symbols for multiples of 3.     

Bounds of the hyper-chaotic Lorenz–Stenflo system

To estimate the ultimate bound and positively invariant set for a dynamical system is an important but quite challenging task in general. This paper attempts to investigate the ultimate bounds and positively invariant sets of the hyper-chaotic Lorenz–Stenflo (L–S) system, which is based on the optimization method and the comparison principle. A family of ellipsoidal bounds for all the positive parameters values a, b, c, dand a cylindrical bound for a > 0, b > 1, c > 0, d > 0 are derived. Numerical results show the effectiveness and advantage of our methods.