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

The postage stamp problem and arithmetic in base <Emphasis Type="Italic">r</Emphasis>

Let h, k be fixed positive integers, and let A be any set of positive integers. Let hA ≔ {a ₁ + a ₂ + ... + a _r : a _i ∈ A, r ⩽ h} denote the set of all integers representable as a sum of no more than h elements of A, and let n(h, A) denote the largest integer n such that {1, 2,...,n} ⊆ hA. Let n(h, k) := : n(h, A), where the maximum is taken over all sets A with k elements. We determine n(h, A) when the elements of A are in geometric progression. In particular, this results in the evaluation of n(h, 2) and yields surprisingly sharp lower bounds for n(h, k), particularly for k = 3.     

Arithmetic structure in sparse difference sets

Using a slight modification of an argument of Croot, Ruzsa and Schoen we establish a quantitative result on the existence of a dilated copy of any given configuration of integer points in sparse difference sets. More precisely, given any configuration {v₁,…,v?} of vectors in Zd, we show that if A⊂d[1,N] with |A|/Nd?CN−1/?, then there necessarily exists r≠0 such that {rv₁,…,rv?}⊆A−A.     

Sets whose sumset avoids a thin sequence

Let {a₁,a₂,a₃,…} be an unbounded sequence of positive integers with an+1/an approaching α as n→∞, and let β>max(α,2). We show that for all sufficiently large x?0, if A⊂[0,x] is a set of nonnegative integers containing 0 and satisfying

     

On a generalization of a theorem of Erdős and Fuchs

Let A={a₁,a₂,…}(a₁<a₂<) be an infinite sequence of nonnegative integers, let k≥2 be a fixed integer and denote by r_k(A,n) the number of solutions of a_i1+a_i2++a_ik≤n. Montgomery and Vaughan proved that r₂(A,n)=cn+o(n^1/4) cannot hold for any constant c>0. In this paper, we extend this result to k>2.     

Progression-free sets in finite abelian groups

Let G be a finite abelian group. Write and denote by rk(2G) the rank of the group 2G.Extending a result of Meshulam, we prove the following. Suppose that A⊆G is free of “true” arithmetic progressions; that is, a₁+a₃=2a₂ with a₁,a₂,a₃∈A implies that a₁=a₃. Then |A|<2|G|/rk(2G). When G is of odd order this reduces to the original result of Meshulam.As a corollary, we generalize a result of Alon and show that if an integer k?2 and a real ε>0 are fixed, |2G| is large enough, and a subset A⊆G satisfies |A|?(1/k+ε)|G|, then there exists A₀⊆A such that 1?|A₀|?k and the elements of A₀ add up to zero. When G is of odd order or cyclic this reduces to the original result of Alon.     

Splitting multidimensional necklaces

The well-known “splitting necklace theorem” of Alon [N. Alon, Splitting necklaces, Adv. Math. 63 (1987) 247-253] says that each necklace with k⋅ai beads of color i=1,…,n, can be fairly divided between k thieves by at most n(k−1) cuts. Alon deduced this result from the fact that such a division is possible also in the case of a continuous necklace [0,1] where beads of given color are interpreted as measurable sets Ai⊂[0,1] (or more generally as continuous measures μi). We demonstrate that Alon's result is a special case of a multidimensional consensus division theorem about n continuous probability measures μ₁,…,μn on a d-cube d[0,1]. The dissection is performed by m₁+?+md=n(k−1) hyperplanes parallel to the sides of d[0,1] dividing the cube into m₁⋅?⋅md elementary cuboids (parallelepipeds) where the integers mi are prescribed in advance.     

Edge-connectivity and edge-disjoint spanning trees

Given a graph G, for an integer c∈{2,…,|V(G)|}, define λ_c(G)=min{|X|:X⊆E(G),ω(G−X)≥c}. For a graph G and for an integer c=1,2,…,|V(G)|−1, define,

     

On the saturation sequence of the rational normal curve

Let denote the rational normal curve of order d. Its homogeneous defining ideal admits an SL₂-stable filtration J₂⊆J₄⊆…⊆I_C by sub-ideals such that the saturation of each J_2q equals I_C. Hence, one can associate to d a sequence of integers (α₁,α₂,…) which encodes the degrees in which the successive inclusions in this filtration become trivial. In this paper we establish several lower and upper bounds on the α_q, using inter alia the methods of classical invariant theory.     

Davenport constant with weights and some related questions, II

Let G be a finite abelian group of order n and let A⊆Z be non-empty. Generalizing a well-known constant, we define the Davenport constant of G with weight A, denoted by DA(G), to be the least natural number k such that for any sequence (x₁,…,xk) with xi∈G, there exists a non-empty subsequence (xj₁,…,xjl) and a₁,…,al∈A such that . Similarly, for any such set A, EA(G) is defined to be the least t∈N such that for all sequences (x₁,…,xt) with xi∈G, there exist indices j₁,…,jn∈N,1?j₁<?<jn?t, and ?₁,…,?n∈A with . In the present paper, we establish a relation between the constants DA(G) and EA(G) under certain conditions. Our definitions are compatible with the previous generalizations for the particular group G=Z/nZ and the relation we establish had been conjectured in that particular case.     

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 spectra of some trees and bounds for the largest eigenvalue of any tree

Let T be an unweighted tree of k levels such that in each level the vertices have equal degree. Let n_k−j+1 and d_k−j+1 be the number of vertices and the degree of them in the level j. We find the eigenvalues of the adjacency matrix and Laplacian matrix of T for the case of two vertices in level 1 (n_k = 2), including results concerning to their multiplicity. They are the eigenvalues of leading principal submatrices of nonnegative symmetric tridiagonal matrices of order k × k. The codiagonal entries for these matrices are , 2 ? j ? k, while the diagonal entries are 0, …, 0, ±1, in the case of the adjacency matrix, and d₁, d₂, …, d_k−1, d_k ± 1, in the case of the Laplacian matrix. Finally, we use these results to find improved upper bounds for the largest eigenvalue of the adjacency matrix and of the Laplacian matrix of any given tree.     

Schur-class multipliers on the Arveson space: De Branges-Rovnyak reproducing kernel spaces and commutative transfer-function realizations

An interesting and recently much studied generalization of the classical Schur class is the class of contractive operator-valued multipliers S(λ) for the reproducing kernel Hilbert space H(kd) on the unit ball Bd⊂Cd, where kd is the positive kernel kd(λ,ζ)=1/(1−〈λ,ζ〉) on Bd. The reproducing kernel space H(KS) associated with the positive kernel KS(λ,ζ)=(I−S(λ)S^∗(ζ))⋅kd(λ,ζ) is a natural multivariable generalization of the classical de Branges-Rovnyak canonical model space. A special feature appearing in the multivariable case is that the space H(KS) in general may not be invariant under the adjoints of the multiplication operators on H(kd). We show that invariance of H(KS) under for each j=1,…,d is equivalent to the existence of a realization for S(λ) of the form S(λ)=D+C⁻¹(I−λ₁A₁−?−λdAd)(λ₁B₁+?+λdBd) such that connecting operator has adjoint U^∗ which is isometric on a certain natural subspace (U is “weakly coisometric”) and has the additional property that the state operators A₁,…,Ad pairwise commute; in this case one can take the state space to be the functional-model space H(KS) and the state operators A₁,…,Ad to be given by (a de Branges-Rovnyak functional-model realization). We show that this special situation always occurs for the case of inner functions S (where the associated multiplication operator MS is a partial isometry), and that inner multipliers are characterized by the existence of such a realization such that the state operators A₁,…,Ad satisfy an additional stability property.     

Generalized radix representations and dynamical systems. IV

For r = (r₁,…, r_d) ∈ ?^d the mapping τ_r:?^d →?^d given byτ_r(a₁,…,a_d) = (a₂, …, a_d,−⌊r₁a₁+…+ r_da_d⌋)where ⌊·⌋ denotes the floor function, is called a shift radix system if for each a ∈ ?^d there exists an integer k > 0 with τ_r^k(a) = 0. As shown in Part I of this series of papers, shift radix systems are intimately related to certain well-known notions of number systems like β-expansibns and canonical number systems. After characterization results on shift radix systems in Part II of this series of papers and the thorough investigation of the relations between shift radix systems and canonical number systems in Part III, the present part is devoted to further structural relationships between shift radix systems and β-expansions. In particular we establish the distribution of Pisot polynomials with and without the finiteness property (F).     

An Analogue of Hajós' Theorem for the Circular Chromatic Number (II)

This paper designs a set of graph operations, and proves that for 2k/d<3, starting from K_k/_d, by repeatedly applying these operations, one can construct all graphs G with _c(G)k/d. Together with the result proved in [20], where a set of graph operations were designed to construct graphs G with _c(G)k/d for k/d3, we have a complete analogue of Hajós' Theorem for the circular chromatic number. This research was partially supported by the National Science Council under grant NSC 89-2115-M-110-003     

Realization of prescribed patterns in the competition model

We demonstrate that for any prescribed set of finitely many disjoint closed subdomains D₁,…,D_m of a given spatial domain Ω in R^N, if d₁,d₂,a₁,a₂,c,d,e are positive continuous functions on Ω and b(x) is identically zero on D?D₁∪?∪D_m and positive in the rest of Ω, then for suitable choices of the parameters λ, μ and all small ε>0, the competition model

     

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.