Diophantine inequality involving binary forms

Let d ? 3 be an integer, and set r = 2^d?1 + 1 for 3 ? d ? 4, \(\tfrac{{17}}{{32}} \cdot 2^d + 1\) for 5 ? d ? 6, r = d²+d+1 for 7 ? d ? 8, and r = d²+d+2 for d ? 9, respectively. Suppose that Φ _i (x, y) ∈ ?[x, y] (1 ? i ? r) are homogeneous and nondegenerate binary forms of degree d. Suppose further that λ₁, λ₂,..., λ _r are nonzero real numbers with λ₁/λ₂ irrational, and λ₁Φ₁(x₁, y₁) + λ₂Φ₂(x₂, y₂) + · · · + λ _r Φ _r (x _r , y _r ) is indefinite. Then for any given real η and σ with 0 < σ < 2^2?d, it is proved that the inequality

$$\left| {\sum\limits_{i = 1}^r {{\lambda _i}\Phi {}_i\left( {{x_i},{y_i}} \right) + \eta } } \right| < {\left( {\mathop {\max \left\{ {\left| {{x_i}} \right|,\left| {{y_i}} \right|} \right\}}\limits_{1 \leqslant i \leqslant r} } \right)^{ - \sigma }}$$

has infinitely many solutions in integers x₁, x₂,..., x _r , y₁, y₂,..., y _r . This result constitutes an improvement upon that of B. Q. Xue.

     

Finite groups with an irreducible character of large degree

Let G be a finite group and d the degree of a complex irreducible character of G, then write |G| = d(d + e) where e is a nonnegative integer. We prove that |G| ≤ e⁴?e³ whenever e > 1. This bound is best possible and improves on several earlier related results.     

On Substructure Densities of Hypergraphs

A real number α ∈ [0, 1) is a jump for an integer r ≥ 2 if there exists c > 0 such that for any ∈ > 0 and any integer m ≥ r, there exists an integer n ₀ such that any r-uniform graph with n > n ₀ vertices and density ≥ α + ∈ contains a subgraph with m vertices and density ≥ α + c. It follows from a fundamental theorem of Erdös and Stone that every α ∈ [0, 1) is a jump for r = 2. Erdös also showed that every number in [0, r!/r ^r ) is a jump for r ≥ 3 and asked whether every number in [0, 1) is a jump for r ≥ 3 as well. Frankl and Rödl gave a negative answer by showing a sequence of non-jumps for every r ≥ 3. Recently, more non-jumps were found for some r ≥ 3. But there are still a lot of unknowns on determining which numbers are jumps for r ≥ 3. The set of all previous known non-jumps for r = 3 has only an accumulation point at 1. In this paper, we give a sequence of non-jumps having an accumulation point other than 1 for every r ≥ 3. It generalizes the main result in the paper ‘A note on the jumping constant conjecture of Erdös’ by Frankl, Peng, Rödl and Talbot published in the Journal of Combinatorial Theory Ser. B. 97 (2007), 204–216.     

On an Extremal Problem for Poset Dimension

Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) = n ^1/2. We improve the best known upper bound and show f(n) = O (n ^2/3). For higher dimensions, we show \(f_{d}(n)=\O \left (n^{\frac {d}{d + 1}}\right )\), where f _d (n) is the largest integer such that every poset on n elements has a d-dimensional subposet on f _d (n) elements.     

Derivations cocentralizing multilinear polynomials on left ideals

Let R be a prime ring with extended centroid C, λ a nonzero left ideal of R and f (X ₁, . . . , X _t ) a nonzero multilinear polynomial over C. Suppose that d and δ are derivations of R such that

$d(f(x_{1},\ldots,x_{t}))f(x_{1},\ldots,x_{t})-f(x_{1},\ldots,x_{t})\delta(f(x_{1},\ldots,x_{t}))\in C$

for all \({x_1,\ldots,x_t\in\lambda}\). Then either d = 0 and λ δ(λ) = 0 or λ C = RCe for some idempotent e in the socle of RC and one of the following holds:

1. (1)
   f (X₁, . . . , X _t ) is central-valued on eRCe;
    
2. (2)
   λ(d + δ)(λ) = 0 and f (X₁, . . . , X _t )² is central-valued on eRCe;
    
3. (3)
   char R = 2 and eRCe satisfies st ₄(X ₁, X ₂, X ₃, X ₄), the standard polynomial identity of degree 4.
    

     

Principal Functions for Bi-free Central Limit Distributions

We find the principal function of the completely non-normal operator l(v₁) + l(v₁)* + i(r(v₂) + r(v₂)*) on a subspace of the full Fock space \({\mathcal{F}}({\mathcal{H}})\) which arises from a bi-free central limit distribution. As an application, we find the essential spectrum of this operator.     

Prime and composite integers close to powers of a number

We prove that, for any real numbers ξ ≠ 0 and ν, the sequence of integer parts [ξ2 ⁿ  + ν], n = 0, 1, 2, . . . , contains infinitely many composite numbers. Moreover, if the number ξ is irrational, then the above sequence contains infinitely many elements divisible by 2 or 3. The same holds for the sequence [ξ( ? 2) ⁿ  + ν _n ], n = 0, 1, 2, . . . , where ν ₀, ν ₁, ν ₂, . . . all lie in a half open real interval of length 1/3. For this, we show that if a sequence of integers x ₁, x ₂, x ₃, . . . satisfies the recurrence relation x _n+d  = cx _n  + F(x _n+1, . . . , x _n+d-1) for each n  ≥  1, where c ≠ 0 is an integer, \({F(z_1,\dots,z_{d-1}) \in \mathbb {Z}[z_1,\dots,z_{d-1}],}\) and lim _{n→ ∞}|x _n | = ∞, then the number |x _n | is composite for infinitely many positive integers n. The proofs involve techniques from number theory, linear algebra, combinatorics on words and some kind of symbolic computation modulo 3.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

A new characterization of RBMO(<Emphasis Type="Italic">μ</Emphasis>) by John-Strömberg sharp maximal functions

Let μ be a nonnegative Radon measure on ? ^d which only satisfies μ (B(x, r)) ? C ₀ r ⁿ for all x ∈ ? ^d , r > 0, with some fixed constants C ₀ > 0 and n ∈ (0, d]. In this paper, a new characterization for the space RBMO(μ) of Tolsa in terms of the John-Strömberg sharp maximal function is established.     

On the Ramsey number of the triangle and the cube

The Ramsey number r(K ₃,Q _n ) is the smallest integer N such that every red-blue colouring of the edges of the complete graph K _N contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erd?s conjectured that r(K ₃,Q _n )=2 ⁿ⁺¹?1 for every n∈?, but the first non-trivial upper bound was obtained only recently, by Conlon, Fox, Lee and Sudakov, who proved that r(K ₃,Q _n )?7000·2 ⁿ . Here we show that r(K ₃,Q _n )=(1+o(1))2 ⁿ⁺¹ as n→∞.     

On Tverberg partitions

A theorem of Tverberg from 1966 asserts that every set X ? ? ^d of n = T(d, r) = (d + 1)(r ? 1) + 1 points can be partitioned into r pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition induces an integer partition of n into r parts (that is, r integers a ₁,..., a _r satisfying n = a ₁ + ··· + a _r ), in which the parts a _i correspond to the number of points in every subset. In this paper, we prove that for any partition of n where the parts satisfy a _i ≤ d + 1 for all i = 1,..., r, there exists a set X ? ? of n points, such that every Tverberg partition of X induces the same partition on n, given by the parts a ₁,..., a _r .     

Some variations on Tverberg’s theorem

Define T(d, r) = (d + 1)(r - 1) + 1. A well known theorem of Tverberg states that if n ≥ T(d, r), then one can partition any set of n points in R^d into r pairwise disjoint subsets whose convex hulls have a common point. The numbers T(d, r) are known as Tverberg numbers. Reay added another parameter k (2 ≤ k ≤ r) and asked: what is the smallest number n, such that every set of n points in R^d admits an r-partition, in such a way that each k of the convex hulls of the r parts meet. Call this number T(d, r, k). Reay conjectured that T(d, r, k) = T(d, r) for all d, r and k. In this paper we prove Reay’s conjecture in the following cases: when k ≥ [d+3/2], and also when d < rk/r-k - 1. The conjecture also holds for the specific values d = 3, r = 4, k = 2 and d = 5, r = 3, k = 2.     

A discrete version of Koldobsky’s slicing inequality

Let #K be a number of integer lattice points contained in a set K. In this paper we prove that for each d ∈ N there exists a constant C(d) depending on d only, such that for any origin-symmetric convex body K ? R ^d containing d linearly independent lattice points

$$\# K \leqslant C\left( d \right)\max \left( {\# \left( {K \cap H} \right)} \right)vo{l_d}{\left( K \right)^{\frac{{d - m}}{d}}},$$

where the maximum is taken over all m-dimensional subspaces of R ^d . We also prove that C(d) can be chosen asymptotically of order O(1) ^d d ^d?m . In particular, we have order O(1) ^d for hyperplane slices. Additionally, we show that if K is an unconditional convex body then C(d) can be chosen asymptotically of order O(d) ^d?m .

     

On <Emphasis Type="Italic">r</Emphasis>-recognition by prime graph of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(3) where <Emphasis Type="Italic">p</Emphasis> is an odd prime

Let G be a finite group. The prime graph Γ(G) of G is defined as follows. The vertices of Γ(G) are the primes dividing the order of G and two distinct vertices p and p′ are joined by an edge if there is an element in G of order pp′. We denote by k(Γ(G)) the number of isomorphism classes of finite groups H satisfying Γ(G) = Γ(H). Given a natural number r, a finite group G is called r-recognizable by prime graph if k(Γ(G)) =  r. In Shen et al. (Sib. Math. J. 51(2):244–254, 2010), it is proved that if p is an odd prime, then B _p (3) is recognizable by element orders. In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(B _p (3)), where p > 3 is an odd prime, then \({G\cong B_p(3)}\) or C _p (3). Also if Γ(G) = Γ(B ₃(3)), then \({G\cong B_3(3), C_3(3), D_4(3)}\), or \({G/O_2(G)\cong {\rm Aut}(^2B_2(8))}\). As a corollary, the main result of the above paper is obtained.     

On finite alperin <Emphasis Type="Italic">p</Emphasis>-groups with homocyclic commutator subgroup

We study metabelian Alperin groups, i.e., metabelian groups in which every 2-generated subgroup has a cyclic commutator subgroup. It is known that, if the minimum number d(G) of generators of a finite Alperin p-group G is n ≥ 3, then d(G′) ≤ C _n ² for p≠ 3 and d(G′) ≤ C _n ² + C _n ³ for p = 3. The first section of the paper deals with finite Alperin p-groups G with p≠ 3 and d(G) = n ≥ 3 that have a homocyclic commutator subgroup of rank C _n ² . In addition, a corollary is deduced for infinite Alperin p-groups. In the second section, we prove that, if G is a finite Alperin 3-group with homocyclic commutator subgroup G- of rank C _n ² + C _n ³ , then G″ is an elementary abelian group.     

Critical exponent for a quasilinear parabolic equation with inhomogeneous density in a cone

In this paper, we study the initial-boundary value problem of porous medium equation ρ(x)u _t  = Δu ^m  + V(x)h(t)u ^p in a cone D = (0, ∞) × Ω, where \({V(x)\,{\sim}\, |x|^\sigma, h(t)\,{\sim}\, t^s}\). Let ω ₁ denote the smallest Dirichlet eigenvalue for the Laplace-Beltrami operator on Ω and let l denote the positive root of l ² + (n ? 2)l = ω ₁. We prove that if \({m < p \leq 1+(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}\), then the problem has no global nonnegative solutions for any nonnegative u ₀ unless u ₀ = 0; if \({p >1 +(m-1)(1+s)+\frac{2(s+1)+\sigma}{n+l}}\), then the problem has global solutions for some u ₀ ≥ 0.     

Augmentation quotients for burnside rings of generalized dihedral groups

Let H be a finite abelian group of odd order, D be its generalized dihedral group, i.e., the semidirect product of C₂ acting on H by inverting elements, where C₂ is the cyclic group of order two. Let Ω (D) be the Burnside ring of D, Δ(D) be the augmentation ideal of Ω (D). Denote by Δⁿ(D) and Q_n(D) the nth power of Δ(D) and the nth consecutive quotient group Δⁿ(D)/Δⁿ⁺¹(D), respectively. This paper provides an explicit Z-basis for Δⁿ(D) and determines the isomorphism class of Q_n(D) for each positive integer n.     

Cocentralizing and vanishing derivations on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2 and extended centroid C and let f(x1,..., x _n ) be a multilinear polynomial over C not central-valued on R, while δ is a nonzero derivation of R. Suppose that d and g are derivations of R such that

$\delta (d(f(r_1 , \ldots ,r_n ))f(r_1 , \ldots ,r_n ) - f(r_1 , \ldots ,r_n )g(f(r_1 , \ldots ,r_n ))) = 0$

for all r1,..., r _n ∈ R. Then d and g are both inner derivations on R and one of the following holds: (1) d = g = 0; (2) d = ?g and f(x ₁,..., x _n )² is central-valued on R.

     

Homogenization of hyperbolic equations

We consider a self-adjoint matrix elliptic operator A _{ε, ε} > 0, on L ₂(R ^d ;C ⁿ ) given by the differential expression b(D)*g(x/ε)b(D). The matrix-valued function g(x) is bounded, positive definite, and periodic with respect to some lattice; b(D) is an (m × n)-matrix first order differential operator such that m ≥ n and the symbol b(ξ) has maximal rank. We study the operator cosine cos(τA _ε ^1/2 ), where τ ∈ R. It is shown that, as ε → 0, the operator cos(τA _ε ^1/2 ) converges to cos(τ(A ⁰)^1/2) in the norm of operators acting from the Sobolev space H ^s (R ^d ;C ⁿ ) (with a suitable s) to L ₂(R ^d ;C ⁿ ). Here A ₀ is the effective operator with constant coefficients. Sharp-order error estimates are obtained. The question about the sharpness of the result with respect to the type of the operator norm is studied. Similar results are obtained for more general operators. The results are applied to study the behavior of the solution of the Cauchy problem for the hyperbolic equation ? _τ ² u _ε (x, τ) = ?A _ε u _ε (x, τ).     

<Emphasis Type="Italic">s</Emphasis>-Vertex Pancyclic Index

A graph G is vertex pancyclic if for each vertex \({v \in V(G)}\) , and for each integer k with 3 ≤ k ≤ |V(G)|, G has a k-cycle C _k such that \({v \in V(C_k)}\) . Let s ≥ 0 be an integer. If the removal of at most s vertices in G results in a vertex pancyclic graph, we say G is an s-vertex pancyclic graph. Let G be a simple connected graph that is not a path, cycle or K _1,3. Let l(G) = max{m : G has a divalent path of length m that is not both of length 2 and in a K ₃}, where a divalent path in G is a path whose interval vertices have degree two in G. The s-vertex pancyclic index of G, written vp _s (G), is the least nonnegative integer m such that L ^m (G) is s-vertex pancyclic. We show that for a given integer s ≥ 0,

$vp_s(G)\le \left\{\begin{array}{l@{\quad}l}\qquad\quad\quad\,\,\,\,\,\,\, l(G)+s+1: \quad {\rm if} \,\, 0 \le s \le 4 \\ l(G)+\lceil {\rm log}_2(s-2) \rceil+4: \quad {\rm if} \,\, s \ge 5 \end{array}\right.$

And we improve the bound for essentially 3-edge-connected graphs. The lower bound and whether the upper bound is sharp are also discussed.