Exceptional cases of Terai’s conjecture on Diophantine equations

Let a, b, c be relatively prime positive integers such that a ^p  + b ^q  = c ^r for fixed integers p, q, r ≥ 2. Terai conjectured that the equation a ^x  + b ^y  = c ^z in positive integers has only the solution (x, y, z) = (p, q, r) except for specific cases. In this paper, we consider the case q = r = 2 and give some results related to exceptional cases.     

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−?).     

An optimal double inequality between geometric and identric means

We find the greatest value p and least value q in (0,1/2) such that the double inequality G(pa+(1−p)b,pb+(1−p)a)<I(a,b)<G(qa+(1−q)b,qb+(1−q)a) holds for all a,b>0 with a≠b. Here, G(a,b), and I(a,b) denote the geometric, and identric means of two positive numbers a and b, respectively.     

Heilbronn's conjecture on Waring's number (mod p)

Let p be a prime k|p−1, t=(p−1)/k and γ(k,p) be the minimal value of s such that every number is a sum of s kth powers . We prove Heilbronn's conjecture that γ(k,p)?k1/2 for t>2. More generally we show that for any positive integer q, γ(k,p)?C(q)k1/q for ?(t)?q. A comparable lower bound is also given. We also establish exact values for γ(k,p) when ?(t)=2. For instance, when t=3, γ(k,p)=a+b−1 where a>b>0 are the unique integers with a²+b²+ab=p, and when t=4, γ(k,p)=a−1 where a>b>0 are the unique integers with a²+b²=p.     

Remark on the completeness of an exponential type sequence

B. J. Birch [1] proved that all sufficiently large integers can be expressed as a sum of pairwise distinct terms of the form p ^a q ^b , where p, q are given coprime integers greater than 1. Subsequently, Davenport pointed out that the exponent b can be bounded in terms of p and q. N. Hegyvári [3] gave an effective version of this bound. In this paper, we improve this bound by reducing one step.     

Labeling bipartite permutation graphs with a condition at distance two

An L(p,q)-labeling of a graph G is an assignment f from vertices of G to the set of non-negative integers {0,1,…,λ} such that |f(u)−f(v)|≥p if u and v are adjacent, and |f(u)−f(v)|≥q if u and v are at distance 2 apart. The minimum value of λ for which G has L(p,q)-labeling is denoted by λ_p,q(G). The L(p,q)-labeling problem is related to the channel assignment problem for wireless networks.In this paper, we present a polynomial time algorithm for computing L(p,q)-labeling of a bipartite permutation graph G such that the largest label is at most (2p−1)+q(bc(G)−2), where bc(G) is the biclique number of G. Since λ_p,q(G)≥p+q(bc(G)−2) for any bipartite graph G, the upper bound is at most p−1 far from optimal.     

Universally bad integers and the 2-adics

In his 1964 paper, de Bruijn (Math. Comp. 18 (1964) 537) called a pair (a,b) of positive odd integers good, if , where is the set of nonnegative integers whose 4-adic expansion has only 0's and 1's, otherwise he called the pair (a,b) bad. Using the 2-adic integers we obtain a characterization of all bad pairs. A positive odd integer u is universally bad if (ua,b) is bad for all pairs of positive odd integers a and b. De Bruijn showed that all positive integers of the form u=2^k+1 are universally bad. We apply our characterization of bad pairs to give another proof of this result of de Bruijn, and to show that all integers of the form u=φ_p^k(4) are universally bad, where p is prime and φ_n(x) is the nth cyclotomic polynomial. We consider a new class of integers we call de Bruijn universally bad integers and obtain a characterization of such positive integers. We apply this characterization to show that the universally bad integers u=φ_p^k(4) are in fact de Bruijn universally bad for all primes p>2. Furthermore, we show that the universally bad integers φ_2^k(4), and more generally, those of the form 4^k+1, are not de Bruijn universally bad.     

Brick partitions of graphs

For each rational number q=b/c where b≥c are positive integers, we define a q-brick of G to be a maximal subgraph H of G such that cH has b edge-disjoint spanning trees, and a q-superbrick of G to be a maximal subgraph H of G such that cH−e has b edge-disjoint spanning trees for all edges e of cH, where cH denotes the graph obtained from H by replacing each edge by c parallel edges. We show that the vertex sets of the q-bricks of G partition the vertex set of G, and that the vertex sets of the q-superbricks of G form a refinement of this partition. The special cases when q=1 are the partitions given by the connected components and the 2-edge-connected components of G, respectively. We obtain structural results on these partitions and describe their relationship to the principal partitions of a matroid.     

Bounding the Derived Length for a Given Set of Character Degrees

Let G be a finite solvable group with {1, a, b, c, ab, ac} as the character degree set, where a ,b, and c are pairwise coprime integers greater than 1. We show that the derived length of G is at most 4. This verifies that the Taketa inequality, dl(G) ≤ |cd(G)|, is valid for solvable groups with {1, a, b, c, ab, ac} as the character degree set. Also, as a corollary, we conclude that if a, b, c, and d are pairwise coprime integers greater than 1 and G is a solvable group such that cd(G) = {1, a, b, c, d, ac, ad, bc, bd}, then dl(G) ≤ 5. Finally, we construct a family of solvable groups whose derived lengths are 4 and character degree sets are in the form {1, p, b, pb, q ^p , pq ^p }, where p is a prime, q is a prime power of an odd prime, and b > 1 is integer such that p, q, and b are pairwise coprime. Hence, the bound 4 is the best bound for the derived length of solvable groups whose character degree set is in the form {1, a, b, c, ab, ac} for some pairwise coprime integers a, b, and c.     

Rationale approximation mit Hilfe pythagoräischer Zahlen

The wealth of Pythagorean number triples is demonstrated afresh by showing that for every rational number $\text{p}\text{q}$, p, q ∈ $\text{N}$ there exist infinitely many Pythagorean number triples (a, b, c) which satisfy

$\text{|}\text{a}\text{b}\text{?}\text{p}\text{q}\text{| ?}\text{1}\text{b}$

where a is odd, b is even and a² + b² = c². The special cases where p = 1 or where q = 1 are considered first as they illustrate the method and yield additional results. Rational approximations are also possible by means of the quotients $\text{c}\text{b}$, provided p > q. The results generalize Pythagorean number triples (a, b, c) where a and b differ by a constant investigated by S. Pignataro.     

A multiplicative inequality for vertex Folkman numbers

Let G be a graph and a₁,…,a_r be positive integers. The symbol G→(a₁,…,a_r) denotes that in every r-coloring of the vertex set V(G) there exists a monochromatic a_i-clique of color i for some i∈{1,…,r}. The vertex Folkman numbers F(a₁,…,a_r;q)=min{|V(G)|:G→(a₁,…,a_r) and K_q?G} are considered. Let a_i, b_i, c_i, i∈{1,…,r}, s, t be positive integers and c_i=a_ib_i, 1?a_i?s,1?b_i?t. Then we prove that

F(c₁,c₂,…,c_r;st+1)?F(a₁,a₂,…,a_r;s+1)F(b₁,b₂,…,b_r;t+1).     

Ramanujan-type congruences for certain generating functions

For nonnegative integers a, b, the function d _a,b (n) is defined in terms of the q-series $\sum_{n=0}^\infty d_{a,b}(n)q^n=\prod_{n=1}^\infty{(1-q^{ an})^b}/{(1-q^n)}$ . We establish some Ramanujan-type congruences for d _a,b (n) by the theory of modular forms with complex multiplication. As consequences, we generalize the famous Ramanujan congruences for the partition function p(n) modulo 5, 7, and 11.     

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.     

On the mean square of the error term for the asymmetric two-dimensional divisor problem (I)

Suppose a and b are two fixed positive integers such that (a, b) = 1. In this paper we shall establish an asymptotic formula for the mean square of the error term Δ _a,b (x) of the general two-dimensional divisor problem.     

Existence and uniqueness of positive solutions to the boundary blow-up problem for an elliptic system

An elliptic system is considered in a smooth bounded domain, subject to Dirichlet boundary conditions of three different types. Based on the construction of certain upper and sub-solutions, we obtain some conditions on the parameters ai,bi,ci (i=1,2) and the exponents m,n,p,q to ensure the existence of positive solutions. Furthermore, uniqueness and boundary behavior of positive solutions is also discussed.     

The optimal generalized logarithmic mean bounds for Seiffert's mean

For p ∈ R, the generalized logarithmic mean L_p(a,b) and Seiffert's mean T(a,b) of two positive real numbers a and b are defined in (1.1) and (1.2) below respectively. In this paper, we find the greatest p and least q such that the double-inequality L_p(a,b) < T(a,b) < L_q(a,b) holds for all a,b > 0 and a ≠ b.     

Optimal Lehmer Mean Bounds for the Toader Mean

We find the greatest value p and least value q such that the double inequality L _p (a, b)?<?T(a, b)?<?L _q (a, b) holds for all a, b?>?0 with a?≠ b, and give a new upper bound for the complete elliptic integral of the second kind. Here ${T(a,b)=\frac{2}{\pi}\int\nolimits_{0}^{{\pi}/{2}}\sqrt{a^2{\cos^2{\theta}}+b^2{\sin^2{\theta}}}d\theta}$ and L _p (a, b)?=?(a ^p+1?+?b ^p+1)/(a ^p ?+?b ^p ) denote the Toader and p-th Lehmer means of two positive numbers a and b, respectively.     

Geometry of continued fractions associated with Frobenius numbers

The article describes the interrelations between the minimal integer number N(a,b,c) which belongs to the additive semigroup of integers generated by a, b, c together with all greater integers, on the one hand, and the geometrical theory of continued fractions describing the convex hulls of sets of integer points in simplicial cones, on the other hand. It also provides some hints on the extension of N to non-integral arguments.     

On finite simple images of triangle groups

For a simple algebraic group G in characteristic p, a triple (a, b, c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a, b, c sum to 2 dim G. In this paper we complete the proof of a conjecture of the third author, that for a rigid triple (a, b, c) for G with p > 0, the triangle group T_a,b,c has only finitely many simple images of the form G(p^r). We also obtain further results on the more general form of the conjecture, where the images G(p^r) can be arbitrary quasisimple groups of type G.     

Two-parameter families of quantum symmetry groups

We introduce and study natural two-parameter families of quantum groups motivated on one hand by the liberations of classical orthogonal groups and on the other by quantum isometry groups of the duals of the free groups. Specifically, for each pair (p,q) of non-negative integers we define and investigate quantum groups O⁺(p,q), B⁺(p,q), S⁺(p,q) and H⁺(p,q) corresponding to, respectively, orthogonal groups, bistochastic groups, symmetric groups and hyperoctahedral groups. In the first three cases the new quantum groups turn out to be related to the (dual free products of ) free quantum groups studied earlier. For H⁺(p,q) the situation is different and we show that , where the latter can be viewed as a liberation of the classical isometry group of the p-dimensional torus.