A realization theorem in the context of the Schur-Szegő composition

Every real polynomial of degree n in one variable with root ?1 can be represented as the Schur-Szeg? composition of n ? 1 polynomials of the form (x + 1) ^n?1(x + a _i ), where the numbers a _i are uniquely determined up to permutation. Some a _i are real, and the others form complex conjugate pairs. In this note, we show that for each pair (ρ, r), where 0 ? ρ, r ? [n/2], there exists a polynomial with exactly ρ pairs of complex conjugate roots and exactly r complex conjugate pairs in the corresponding set of numbers a _i .     

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.

     

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.     

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.     

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.     

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

Dn,r is not potentially nilpotent for n ⩾ 4r − 2

An n × n sign pattern A is said to be potentially nilpotent if there exists a nilpotent real matrix B with the same sign pattern as A. Let D_n,r be an n × n sign pattern with 2 ≤ r ≤ n such that the superdiagonal and the (n, n) entries are positive, the (i, 1) (i = 1,..., r) and (i, i ? r + 1) (i = r + 1,..., n) entries are negative, and zeros elsewhere. We prove that for r ≥ 3 and n ≥ 4r ? 2, the sign pattern D_n,r is not potentially nilpotent, and so not spectrally arbitrary.     

An optimal Berry-Esseen type inequality for expectations of smooth functions

We provide an optimal Berry-Esseen type inequality for Zolotarev’s ideal ζ₃-metric measuring the difference between expectations of sufficiently smooth functions, like |·|³, of a sum of independent random variables X ₁,..., X _n with finite third-order moments and a sum of independent symmetric two-point random variables, isoscedastic to the X _i . In the homoscedastic case of equal variances, and in particular, in case of identically distributed X ₁,..., X _n the approximating law is a standardized symmetric binomial one. As a corollary, we improve an already optimal estimate of the accuracy of the normal approximation due to Tyurin (2009).     

A New Method for Bounding the Distance Between Sums of Independent Integer-Valued Random Variables

Let X ₁, X ₂,..., X _n and Y ₁, Y ₂,..., Y _n be two sequences of independent random variables which take values in ? and have finite second moments. Using a new probabilistic method, upper bounds for the Kolmogorov and total variation distances between the distributions of the sums \(\sum_{i=1}^{n}X_{i}\) and \(\sum_{i=1}^{n}Y_{i}\) are proposed. These bounds adopt a simple closed form when the distributions of the coordinates are compared with respect to the convex order. Moreover, they include a factor which depends on the smoothness of the distribution of the sum of the X _i ’s or Y _i ’s, in that way leading to sharp approximation error estimates, under appropriate conditions for the distribution parameters. Finally, specific examples, concerning approximation bounds for various discrete distributions, are presented for illustration.     

The Number of <Emphasis Type="Italic">k</Emphasis>-Sumsets in an Abelian Group

Let G be an abelian group of order n. The sum of subsets A₁,...,A_k of G is defined as the collection of all sums of k elements from A₁,...,A_k; i.e., A₁ + A₂ + · · · + A_k = {a₁ + · · · + a_k | a₁ ∈ A₁,..., a_k ∈ A_k}. A subset representable as the sum of k subsets of G is a k-sumset. We consider the problem of the number of k-sumsets in an abelian group G. It is obvious that each subset A in G is a k-sumset since A is representable as A = A₁ + · · · + A_k, where A₁ = A and A₂ = · · · = A_k = {0}. Thus, the number of k-sumsets is equal to the number of all subsets of G. But, if we introduce a constraint on the size of the summands A₁,...,A_k then the number of k-sumsets becomes substantially smaller. A lower and upper asymptotic bounds of the number of k-sumsets in abelian groups are obtained provided that there exists a summand A_i such that |A_i| = n log^qn and |A₁ +· · ·+ A_i-1 + A_i+1 + · · ·+A_k| = n log^qn, where q = -1/8 and i ∈ {1,..., k}.     

A Minimax Approach to Errors-in-Variables Linear Models

The paper considers a simple Errors-in-Variables (EiV) model Y_i = a + bX_i + εξ_i; Z_i= X_i + σζ_i, where ξ_i, ζ_i are i.i.d. standard Gaussian random variables, X_i ∈ ? are unknown non-random regressors, and ε, σ are known noise levels. The goal is to estimates unknown parameters a, b ∈ ? based on the observations {Y_i, Z_i, i = 1, …, n}. It is well known [3] that the maximum likelihood estimates of these parameters have unbounded moments. In order to construct estimates with good statistical properties, we study EiV model in the large noise regime assuming that n → ∞, but \({\epsilon ^2} = \sqrt n \epsilon _ \circ ^2,{\sigma ^2} = \sqrt n \sigma _ \circ ^2\) with some \(\epsilon_\circ^2, \sigma_\circ^2>0\). Under these assumptions, a minimax approach to estimating a, b is developed. It is shown that minimax estimates are solutions to a convex optimization problem and a fast algorithm for solving it is proposed.     

Division Algebras with Left Algebraic Commutators

Let D be a division algebra with center F and K a (not necessarily central) subfield of D. An element a ∈ D is called left algebraic (resp. right algebraic) over K, if there exists a non-zero left polynomial a ₀ + a ₁ x + ? + a _n x ⁿ (resp. right polynomial a ₀ + x a ₁ + ? + x ⁿ a _n ) over K such that a ₀ + a ₁ a + ? + a _n a ⁿ = 0 (resp. a ₀ + a a ₁ + ? + a ⁿ a _n ). Bell et al. proved that every division algebra whose elements are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. In this paper we generalize this result and prove that every division algebra whose all multiplicative commutators are left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite provided that the center of division algebra is infinite. Also, we show that every division algebra whose multiplicative group of commutators is left (right) algebraic of bounded degree over a (not necessarily central) subfield must be centrally finite. Among other results we present similar result regarding additive commutators under certain conditions.     

Precise large deviations for sums of random vectors with dependent components of consistently varying tails

Let {X _i = (X _1,i ,...,X _m,i )^?, i ≥ 1} be a sequence of independent and identically distributed nonnegative m-dimensional random vectors. The univariate marginal distributions of these vectors have consistently varying tails and finite means. Here, the components of X ₁ are allowed to be generally dependent. Moreover, let N(·) be a nonnegative integer-valued process, independent of the sequence {X _i , i ≥ 1}. Under several mild assumptions, precise large deviations for S _n = Σ _i=1 ⁿ X _i and S _N(t) = Σ _i=1 ^N(t) X _i are investigated. Meanwhile, some simulation examples are also given to illustrate the results.     

Depth and Stanley depth of the facet ideals of some classes of simplicial complexes

Let Δ _n,d (resp. Δ′ _n,d ) be the simplicial complex and the facet ideal I _n,d = (x ₁... x _d, x d?k+1... x _2d?k ,..., x _n?d+1... x _n ) (resp. J _n,d = (x ₁... x _d , x _d?k+1... x _2d?k ,..., x n?2d+2k+1... x _n?d+2k , x n?d+k+1... x n x ₁... x _k)). When d ≥ 2k + 1, we give the exact formulas to compute the depth and Stanley depth of quotient rings S/J _n,d and S/I _n,d ^t for all t ≥ 1. When d = 2k, we compute the depth and Stanley depth of quotient rings S/Jn,d and S/I _n,d , and give lower bounds for the depth and Stanley depth of quotient rings S/I _n,d ^t for all t ≥ 1.     

On Lipschitz extension from finite subsets

We prove that for every n ∈ ? there exists a metric space (X, d _X), an n-point subset S ? X, a Banach space (Z, \({\left\| \right\|_Z}\)) and a 1-Lipschitz function f: S → Z such that the Lipschitz constant of every function F: X → Z that extends f is at least a constant multiple of \(\sqrt {\log n} \). This improves a bound of Johnson and Lindenstrauss [JL84]. We also obtain the following quantitative counterpart to a classical extension theorem of Minty [Min70]. For every α ∈ (1/2, 1] and n ∈ ? there exists a metric space (X, d _X), an n-point subset S ? X and a function f: S → ?₂ that is α-Hölder with constant 1, yet the α-Hölder constant of any F: X → ?₂ that extends f satisfies \({\left\| F \right\|_{Lip\left( \alpha \right)}} > {\left( {\log n} \right)^{\frac{{2\alpha - 1}}{{4\alpha }}}} + {\left( {\frac{{\log n}}{{\log \log n}}} \right)^{{\alpha ^2} - \frac{1}{2}}}\). We formulate a conjecture whose positive solution would strengthen Ball’s nonlinear Maurey extension theorem [Bal92], serving as a far-reaching nonlinear version of a theorem of König, Retherford and Tomczak-Jaegermann [KRTJ80]. We explain how this conjecture would imply as special cases answers to longstanding open questions of Johnson and Lindenstrauss [JL84] and Kalton [Kal04].     

On necessary and sufficient conditions for the self-normalized central limit theorem

Let X₁, X₂, … be a sequence of independent random variables and S_n = Σ _i=1 ⁿ X_i and V _n ² = Σ _i=1 ⁿ X _i ² . When the elements of the sequence are i.i.d., it is known that the self-normalized sum S_n=V_n converges to a standard normal distribution if and only if max_1?i?n|X_i|/V_n→0 in probability and the mean of X₁ is zero. In this paper, sufficient conditions for the self-normalized central limit theorem are obtained for general independent random variables. It is also shown that if max_1?i?n|X_i|/V_n→0 in probability, then these sufficient conditions are necessary.     

Extrapolation in Grand Lebesgue Spaces with <Emphasis Type="Italic">A</Emphasis>∞ Weights

Results on extrapolation withA∞ weights in grand Lebesgue spaces are obtained. Generally, these spaces are defined with respect to the productmeasure μ₁ ×· · ·×μ_n onX₁ ×· · ·×X_n, where (X_i, d_i, μ_i), i = 1,..., n, are spaces of homogeneous type. As applications of the obtained results, new one-weight estimates with A_∞ weights for operators of harmonic analysis are derived.     

Small prime solutions to cubic equations

Let a_1,..., a_9 be nonzero integers not of the same sign, and let b be an integer. Suppose that a_1,..., a_9 are pairwise coprime and a_1 + + a_9 ≡ b(mod 2). We apply the p-adic method of Davenport to find an explicit P = P(a_1,..., a_9, n) such that the cubic equation a_1p_1~3+ + a9p_9~3= b is solvable with p_j 《 P for all 1 ≤ j ≤ 9. It is proved that one can take P = max{|a_1|,..., |a_9|}~c+ |b|~(1/3) with c = 2. This improves upon the earlier result with c = 14 due to Liu(2013).     

On Some Functional Equations and Representations of Topological Semigroups

Let a representation T of a semigroup G on a linear space X be given. We call x ∈ X a finite vector if its orbit T(G) is contained in a finite-dimensional subspace. In this paper, some statements about finite vectors are applied to the following problem. For a given positive integer n > 1, describe all continuous functions f : G → ? such that the function (x₁,..., x _n ) ? f(x₁ + ? + x _n ) can be polynomially expressed via functions of sums of fewer variables.     

Generalized varieties of sums of powers

Let X ? P^N be an irreducible, non-degenerate variety. The generalized variety of sums of powers V S P_H^X(h) of X is the closure in the Hilbert scheme Hilb_h (X) of the locus parametrizing collections of points {x₁,..., x_h} such that the (h -1)-plane >x₁,..., x_h> passes through a fixed general point p ∈ P^N. When X = V_dⁿ is a Veronese variety we recover the classical variety of sums of powers V S P(F, h) parametrizing additive decompositions of a homogeneous polynomial as powers of linear forms. In this paper we study the birational behavior of V S P_H^X(h). In particular, we show how some birational properties, such as rationality, unirationalityand rational connectedness, of V S P_H^X(h) are inherited from the birational geometry of variety X itself.