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.

     

Distribution of the spectrum of a singular positive Sturm–Liouville operator perturbed by the Dirac delta function

We consider the Sturm–Liouville operator generated in the space L ²[0,+∞) by the expression l _a,b:= ?d ²/dx ² +x+aδ(x?b) and the boundary condition y(0) = 0. We prove that the eigenvalues λ _n of this operator satisfy the inequalities λ₁ ⁰ < λ₁ < λ₂ ⁰ and λ_n ⁰ ≤ λ_n < λ_n+1 ⁰, n = 2, 3,..., where {?λ_n ⁰} is the sequence of zeros of the Airy function Ai (λ). We find the asymptotics of λ_n as n → +∞ depending on the parameters a and b.     

Graphs with small diameter determined by their <Emphasis Type="Italic">D</Emphasis>-spectra

Let G be a connected graph with vertex set V(G) = {v₁, v₂,..., v _n }. The distance matrix D(G) = (d _ij )_n×n is the matrix indexed by the vertices of G, where d _ij denotes the distance between the vertices v _i and v _j . Suppose that λ₁(D) ≥ λ₂(D) ≥... ≥ λ _n (D) are the distance spectrum of G. The graph G is said to be determined by its D-spectrum if with respect to the distance matrix D(G), any graph having the same spectrum as G is isomorphic to G. We give the distance characteristic polynomial of some graphs with small diameter, and also prove that these graphs are determined by their D-spectra.     

Nonlinear trigonometric approximations of multivariate function classes

Order-sharp estimates are established for the best N-term approximations of functions from Nikol’skii–Besov type classes B_pq^sm(T^k) with respect to the multiple trigonometric system T^(k) in the metric of L_r(T^k) for a number of relations between the parameters s, p, q, r, and m (s = (s₁,..., s_n) ∈ R₊ⁿ, 1 ≤ p, q, r ≤ ∞, m = (m₁,..., m_n) ∈ Nⁿ, k = m₁ +... + m_n). Constructive methods of nonlinear trigonometric approximation—variants of the so-called greedy algorithms—are used in the proofs of upper estimates.     

Modern thermodynamics as a branch of mathematics (mathematical physics)

In the paper, it is proved that, if f(x₁,..., x_n)g(y₁,..., y_m) is a multilinear central polynomial for a verbally prime T-ideal Γ over a field of arbitrary characteristic, then both polynomials f(x₁,..., x_n) and g(y₁,..., y_m) are central for Γ.     

Distance domination of generalized de Bruijn and Kautz digraphs

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G _B (n, d) and generalized Kautz digraphs G _K (n, d) are good candidates for interconnection networks. Denote Δ _k := (∑ _j=0 ^k d ^j )^?1. F. Tian and J. Xu showed that ?nΔ _k ? γ _k (G _B (n, d)) ≤?n/d ^k? and ?nΔ _k ? ≤ γ _k (G _K (n, d)) ≤ ?n/d ^k ?. In this paper, we prove that every generalized de Bruijn digraph G _B (n, d) has the distance k-domination number ?nΔ _k ? or ?nΔ _k ?+1, and the distance k-domination number of every generalized Kautz digraph G _K (n, d) bounded above by ?n/(d ^k?1+d ^k )?. Additionally, we present various sufficient conditions for γ _k (G _B (n, d)) = ?nΔ _k ? and γ _k (G _K (n, d)) = ?nΔ _k ?.     

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 .     

Kostka functions associated to complex reflection groups and a conjecture of Finkelberg-Ionov

Kostka functions K_(λ,μ)~±(t), indexed by r-partitions λ and μ of n, are a generalization of Kostka polynomials K_(λ,μ)(t) indexed by partitions λ,μ of n. It is known that Kostka polynomials have an interpretation in terms of Lusztig's partition function. Finkelberg and Ionov(2016) defined alternate functions K_(λ,μ)(t) by using an analogue of Lusztig's partition function, and showed that K_(λ,μ)(t) ∈Z≥0[t] for generic μ by making use of a coherent realization. They conjectured that K_(λ,μ)(t) coincide with K_(λ,μ)~-(t). In this paper, we show that their conjecture holds. We also discuss the multi-variable version, namely, r-variable Kostka functions K_(λ,μ)~±(t_1,…,t_r).     

Results of Diophantine approximation by unlike powers of primes

Let k be an integer with k ≥ 6: Suppose that λ₁, λ₂,..., λ₅ be nonzero real numbers not all of the same sign, satisfying that λ₁/λ₂ is irrational, and suppose that η is a real number. In this paper, for any ε > 0; we consider the inequality |λ₁p₁ + λ₂p ₂ ² + λ₃p ₃ ³ + λ₄p ₄ ⁴ + λ₅p ₅ ^k + η | < (max p_j)^-σ(k)+ε has infinitely many solutions in prime variables p₁, p₂,...,p₅, where σ(k) depends on k. Our result gives an improvement of the recent result. Furthermore, using the similar method in this paper, we can refine some results on Diophantine approximation by unlike powers of primes, and get the related problem.     

Traces of Higher Negative Orders for a String with a Singular Weight

We study the linear operator pencil A(λ) = L?λV, λ ∈ ?, where L is the Sturm–Liouville operator with potential q(x) and V is the operator of multiplication by the weight ρ(x). The potential and the weight are assumed to belong to the space W ₂ ^?1 [0, π]. For the pencil A(λ), we seek formulas for the traces of higher negative orders, i.e., for the sums \(\sum\nolimits_{n = 1}^\infty {\lambda _n^{ - p}} \), p ≥ 2, where λ_n, n ∈ ?, is the sequence of eigenvalues of the pencil numbered in nondescending order of absolute values. Trace formulas in terms of the weight ρ(x) and the integral kernel of the operator L^?1 are obtained, and the relationship between these formulas and the classical results about traces of integral operators is described. The theoretical results are illustrated by examples.     

Super (<Emphasis Type="Italic">a</Emphasis>, <Emphasis Type="Italic">d</Emphasis>)-edge-antimagic total labelings of complete bipartite graphs

An (a, d)-edge-antimagic total labeling of a graph G is a bijection f from V(G) ∪ E(G) onto {1, 2,…,|V(G)| + |E(G)|} with the property that the edge-weight set {f(x) + f(xy) + f(y) | xy ∈ E(G)} is equal to {a, a + d, a + 2d,...,a + (|E(G)| ? 1)d} for two integers a > 0 and d ? 0. An (a, d)-edge-antimagic total labeling is called super if the smallest possible labels appear on the vertices. In this paper, we completely settle the problem of the super (a, d)-edge-antimagic total labeling of the complete bipartite graph K_m,n and obtain the following results: the graph K_m,n has a super (a, d)-edge-antimagic total labeling if and only if either (i) m = 1, n = 1, and d ? 0, or (ii) m = 1, n ? 2 (or n = 1 and m ? 2), and d ∈ {0, 1, 2}, or (iii) m = 1, n = 2 (or n = 1 and m = 2), and d = 3, or (iv) m, n ? 2, and d = 1.     

Multivariate discriminant and iterated resultant

In this paper,we study the relationship between iterated resultant and multivariate discriminant.We show that,for generic form f(x_n) with even degree d,if the polynomial is squarefreed after each iteration,the multivariate discriminant △(f) is a factor of the squarefreed iterated resultant.In fact,we find a factor Hp(f,[x_1,...,x_n]) of the squarefreed iterated resultant,and prove that the multivariate discriminant △(f) is a factor of Hp(f,[x_1,...,x_n]).Moreover,we conjecture that Hp(f,[x_1,...,x_n]) = △(f) holds for generic form/,and show that it is true for generic trivariate form f(x,y,z).     

On Extraction of Smooth Solutions of a Class of Almost Hypoelliptic Equations with Constant Power

A linear differential operator P(x, D) = P(x₁,... x _n , D₁,..., D _n ) = ∑_αγ_α(x)D^α with coefficients γ_α(x) defined in E ⁿ is called formally almost hypoelliptic in E ⁿ if all the derivatives D^ν_ξP(x, ξ) can be estimated by P(x, ξ), and the operator P(x, D) has uniformly constant power in Eⁿ. In the present paper, we prove that if P(x, D) is a formally almost hypoelliptic operator, then all solutions of equation P(x, D)u = 0, which together with some of their derivatives are square integrable with a specified exponential weight, are infinitely differentiable functions.     

On almost good triples of vertices in edge regular graphs

Consider a connected edge regular graph Γ with parameters (v, k, λ) and put b ₁ = k?λ?1. A triple (u, w, z) of vertices is called (almost) good whenever d(u, w) = d(u, z) = 2 and µ(u, w)+µ(u, z) ≤ 2k ? 4b ₁ + 3 (and µ(u, w) + µ(u, z) = 2k ? 4b ₁ + 4). If k = 3b ₁ + γ with γ ≥ ?2, a triple (u, w, z) is almost good, and Δ = [u] ∩ [w] ∩ [z] then: either |Δ| ≤ 2; or Δ is a 3-clique and Γ is a Clebsch graph; or Δ is a 3-clique, k = 16, b ₁ = 6, and v = 31; or Δ is a 4-clique and Γ is a Schläfli graph.     

Neighbor Connectivity of Two Kinds of Cayley Graphs

In this paper, we determine the neighbor connectivity κNB of two kinds of Cayley graphs: alternating group networks AN _n and star graphs S _n ; and give the exact values of edge neighbor connectivity λ_NB of ANn and Cayley graphs generated by transposition trees Γ _n . Those are κ_NB(AN _n ) = n^?1, λ_NB(AN _n ) = n^?2 and κ_NB(S _n ) = λ_NB(Γ _n ) = n^?1.     

Centralizers of generalized skew derivations on multilinear polynomials

Let R be a prime ring of characteristic different from 2, let Q be the right Martindale quotient ring of R, and let C be the extended centroid of R. Suppose that G is a nonzero generalized skew derivation of R and f(x ₁,..., x _n ) is a noncentral multilinear polynomial over C with n noncommuting variables. Let f(R) = {f(r ₁,..., r _n ): r _i ∈ R} be the set of all evaluations of f(x ₁,..., x _n ) in R, while A = {[G (f(r ₁,..., r _n )), f(r ₁,..., r _n )]: r _i ∈ R}, and let C _R (A) be the centralizer of A in R; i.e., C _R (A) = {a ∈ R: [a, x] = 0, ? _x ∈ A }. We prove that if A ≠ (0), then C _R (A) = Z(R).     

Generic hypersurface singularities

The problem considered here can be viewed as the analogue in higher dimensions of the one variable polynomial interpolation of Lagrange and Newton. Let x₁,...,x_r be closed points in general position in projective spacePn, then the linear subspaceV ofH⁰ (?ⁿ,O(d)) (the space of homogeneous polynomials of degreed on ?ⁿ) formed by those polynomials which are singular at eachx_i, is given by r(n + 1) linear equations in the coefficients, expressing the fact that the polynomial vanishes with its first derivatives at x₁,...,x_r. As such, the “expected” value for the dimension ofV is max(0,h⁰(O(d))?r(n+1)). We prove thatV has the “expected” dimension for d≥5 (theorem A). This theorem was first proven in [A] using a very complicated induction with many initial cases. Here we give a greatly simplified proof using techniques developed by the authors while treating the corresponding problem in lower degrees.     

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.     

Lower bounds for polynomials of many variables

A polynomial P(ξ) = P(ξ₁,..., ξ _n ) is said to be almost hypoelliptic if all its derivatives D ^ν P(ξ) can be estimated from above by P(ξ) (see [16]). By a theorem of Seidenberg-Tarski it follows that for each polynomial P(ξ) satisfying the condition P(ξ) > 0 for all ξ ∈ R ⁿ , there exist numbers σ > 0 and T ∈ R¹ such that P(ξ) ≥ σ(1 + |ξ|) ^T for all ξ ∈ R ⁿ . The greatest of numbers T satisfying this condition, denoted by ST(P), is called Seidenberg-Tarski number of polynomial P. It is known that if, in addition, P ∈ I _n , that is, |P(ξ)| → ∞ as |ξ| → ∞, then T = T(P) > 0. In this paper, for a class of almost hypoelliptic polynomials of n (≥ 2) variables we find a sufficient condition for ST(P) ≥ 1. Moreover, in the case n = 2, we prove that ST(P) ≥ 1 for any almost hypoelliptic polynomial P ∈ I₂.     

The space clcv(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>) with the Hausdorff-Bebutov metric and differential inclusions

The paper is devoted to studying the space of nonempty closed convex (but not necessarily compact) sets in ? ⁿ , a dynamical system of translations, and existence theorems for differential inclusions. We make this space complete by equipping it with the Hausdorff-Bebutov metric. The investigation of these issues is important for certain problems of optimal control of asymptotic characteristics of a control system. For example, the problem \(\dot x = A(t,u)x\), (u, x) ∈ ? ^m+n , λ _n (u(·))→ min, where λ _n (u(·)) is the largest Lyapunov exponent of the system {ie121-2} = A(t, u)x, leads to a differential inclusion with a noncompact right-hand side.