A limit theorem for continuous selectors

Any (measurable) function K from Rⁿ to R defines an operator K acting on random variables X by K(X) = K(X₁,..., X_n), where the X_j are independent copies of X. The main result of this paper concerns continuous selectors H, continuous functions defined in Rn and such that H(x₁, x₂,..., x_n) ∈ {x₁, x₂,..., x_n}. For each such continuous selector H (except for projections onto a single coordinate) there is a unique point ω_H in the interval (0, 1) so that, for any random variable X, the iterates H^(N) acting on X converge in distribution as N → ∞ to the ωH-quantile of X.     

Realizability of Two-dimensional Linear Groups over Rings of Integers of Algebraic Number Fields

Given the ring of integers O _K of an algebraic number field K, for which natural numbers n there exists a finite group G???GL(n, O _K ) such that O _K G, the O _K -span of G, coincides with M(n, O _K ), the ring of (n?×?n)-matrices over O _K ? The answer is known if n is an odd prime. In this paper we study the case n?=?2; in the cases when the answer is positive for n?=?2, for n?=?2m there is also a finite group G???GL(2m, O _K ) such that O _K G?=?M(2m, O _K ).     

The convolution method for fourier expansions. The case of generalized transmission conditions of crack (screen) type in piecewise inhomogeneous media

We consider boundary value problems for the equation ? _x (K ? _x ?) + KL[?] = 0 in the space R ⁿ with generalized transmission conditions of the type of a strongly permeable crack or a weakly permeable screen on the surface x = 0. (Here L is an arbitrary linear differential operator with respect to the variables y ₁, …, y _n?1.) The coefficients K(x) > 0 are monotone functions of certain classes in the regions separated by the screen x = 0. The desired solution has arbitrary given singular points and satisfies a sufficiently weak condition at infinity.We derive formulas expressing the solutions of the above-mentioned problems in the form of simple quadratures via the solutions of the considered equation with a constant coefficient K for given singular points in the absence of a crack or a screen. In particular, the obtained formulas permit one to solve boundary value problems with generalized transmission conditions for equations with functional piecewise continuous coefficients in the framework of the theory of harmonic functions.     

Castelnuovo-Mumford regularity and projective dimension of a squarefree monomial ideal

Let S = K[x₁; x₂;...; x_n] be the polynomial ring in n variables over a field K; and let I be a squarefree monomial ideal minimally generated by the monomials u₁; u₂;...; u_m: Let w be the smallest number t with the property that for all integers 1 6 i₁ < i₂ <... < i _t 6 m such that \(lcm({u_{{i_1}}},{u_{{i_2}}},...,{u_{{i_t}}}) = lcm({u_1},{u_2},...,{u_m})\) We give an upper bound for Castelnuovo-Mumford regularity of I by the bigsize of I: As a corollary, the projective dimension of I is bounded by the number w.     

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.     

Disjoint cliques in claw-free graphs

A graph is said to be claw-free if it does not contain an induced subgraph isomorphic to K_1,3. Let s and k be two integers with 0 ≤ s ≤ k and let G be a claw-free graph of order n. In this paper, we investigate clique partition problems in claw-free graphs. It is proved that if n ≥ 3s+4(k?s) and d(x)+d(y) ≥ n?2s+2k+1 for any pair of non-adjacent vertices x, y of G, then G contains s disjoint K₃s and k ? s disjoint K₄s such that all of them are disjoint. Moreover, the degree condition is sharp in some cases.     

Global existence of real roots and random Newton flow algorithm for nonlinear system of equations

To solve nonlinear system of equation, F(x) = 0, a continuous Newton flow x _t (t) = V (x) = ?(DF(x))^?1 F(x), x(0) = x ⁰ and its mathematical properties, such as the central field, global existence and uniqueness of real roots and the structure of the singular surface, are studied. We concisely introduce random Newton flow algorithm (NFA) for finding all roots, based on discrete Newton flow x ^j+1 = x ^j + hV (x ^j ) with random initial value x ⁰ and h ∈ (0, 1], and three computable quantities, g _j , d _j and K _j . The numerical experiments with dimension n = 300 are provided.     

Estimation Problems for Periodically Correlated Isotropic Random Fields

Spectral theory of isotropic random fields in Euclidean space developed by M. I. Yadrenko is exploited to find a solution to the problem of optimal linear estimation of the functional

$$ A\zeta ={\sum\limits_{t=0}^{\infty}}\,\,\,{\int_{S_n}} \,\,a(t,x)\zeta (t,x)\,m_n(dx) $$

which depends on unknown values of a periodically correlated (cyclostationary with period T) with respect to time isotropic on the sphere S _n in Euclidean space E ⁿ random field ζ(t, x), t?∈?Z, x?∈?S _n . Estimates are based on observations of the field ζ(t, x)?+?θ(t, x) at points (t, x), t?=???1,???2, ..., x?∈?S _n , where θ(t, x) is an uncorrelated with ζ(t, x) periodically correlated with respect to time isotropic on the sphere S _n random field. Formulas for computing the value of the mean-square error and the spectral characteristic of the optimal linear estimate of the functional Aζ are obtained. The least favourable spectral densities and the minimax (robust) spectral characteristics of the optimal estimates of the functional Aζ are determined for some special classes of spectral densities.

     

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

An algorithm to compute <Emphasis Type="Italic">ω</Emphasis>-primality in a numerical monoid

Let M be a commutative, cancellative, atomic monoid and x a nonunit in M. We define ω(x)=n if n is the smallest positive integer with the property that whenever x∣a ₁???a _t , where each a _i is an atom, there is a T?{1,2,…,t} with |T|≤n such that x∣∏_k∈T a _k . The ω-function measures how far x is from being prime in M. In this paper, we give an algorithm for computing ω(x) in any numerical monoid. Simple formulas for ω(x) are given for numerical monoids of the form 〈n,n+1,…,2n?1〉, where n≥3, and 〈n,n+1,…,2n?2〉, where n≥4. The paper then focuses on the special case of 2-generator numerical monoids. We give a formula for computing ω(x) in this case and also necessary and sufficient conditions for determining when x is an atom. Finally, we analyze the asymptotic behavior of ω(x) by computing \(\lim_{x\rightarrow \infty}\frac{\omega(x)}{x}\).     

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→∞.     

Hankel Determinants of the Generalized Factorials

Denote 〈x|d〉 _n = x(x + d)(x + 2d) · · · (x + (n - 1)d) for n = 1, 2, · · ·, and 〈x|d〉₀ = 1, where 〈x|d〉 _n is called the generalized factorial of x with increment d. In this paper, we present the evaluation of Hankel determinants of sequence of generalized factorials. The main tool used for the evaluation is the method based on exponential Riordan arrays. Furthermore, we provide Hankel determinant evaluations of the Eulerian polynomials and exponential polynomials.     

On the summability factors of infinite series

The author has established that if [λ_n] is a convex sequence such that the series Σn ^-1λ_n is convergent and the sequence {K _n} satisfies the condition |K _n|=O[log(n+1)]^k(C, 1),k?0, whereK _n denotes the (R, logn, 1) mean of the sequence {n log (n+1)a _n}, then the series Σlog(n+1)^1-kλ_n a _n is summable |R, logn, 1|. The result obtained for the particular casek=0 generalises a previous result of the author [1].     

On <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis>,<Emphasis Type="Italic">q</Emphasis></Subscript>-factorization of complete bipartite multigraphs

Let λK _m,n be a complete bipartite multigraph with two partite sets having m and n vertices, respectively. A K _p,q -factorization of λK _m,n is a set of edge-disjoint K _p,q -factors of λK _m,n which partition the set of edges of λK _m,n . When p = 1 and q is a prime number, Wang, in his paper [On K _1,q -factorization of complete bipartite graph, Discrete Math., 126: (1994), 359-364], investigated the K _1,q -factorization of K _m,n and gave a sufficient condition for such a factorization to exist. In papers [K _1,k -factorization of complete bipartite graphs, Discrete Math., 259: 301-306 (2002),; K _p,q -factorization of complete bipartite graphs, Sci. China Ser. A-Math., 47: (2004), 473-479], Du and Wang extended Wang’s result to the case that p and q are any positive integers. In this paper, we give a sufficient condition for λK _m,n to have a K _p,q -factorization. As a special case, it is shown that the necessary condition for the K _p,q -factorization of λK _m,n is always sufficient when p : q = k : (k + 1) for any positive integer k.     

Lie n-derivatio ns o n $ {\mathcal {}}$-subspace lattice algebras

Let \(\mathcal {L}\) be a \(\mathcal {J}\)-subspace lattice on a Banach space X over the real or complex field \(\mathbb {F}\) with dimX ≥ 3 and let n ≥ 2 be an integer. Suppose that dimK ≠ 2 for every \(K\in \mathcal {J}{(\mathcal L)}\) and \(L: \text {Alg}\, \mathcal {L}\rightarrow \text {Alg}\,\mathcal {L}\) is a linear map. It is shown that L satisfies \({\sum }_{i=1}^{n}p_{n} (A_{1}, \ldots , A_{i-1}, L(A_{i}), A_{i+1}, \ldots , A_{n})=0\) whenever p _n (A ₁,A ₂,…,A _n ) = 0 for \(A_{1},A_{2},\ldots ,A_{n}\in \text {Alg}\,\mathcal {L}\) if and only if for each \(K\in \mathcal {J}(\mathcal {L})\), there exists a bounded linear operator \(T_{K}\in \mathcal {B}(K)\), a scalar λ _K and a linear functional \(h_{K}: \text {Alg}\,\mathcal {L}\rightarrow \mathbb {F}\) such that L(A)x = (T _K A ? A T _K + λ _K A + h _K (A)I)x for all x ∈ K and all \(A\in \text {Alg}\,\mathcal {L}\). Based on this result, a complete characterization of linear n-Lie derivations on \(\text {Alg}\,\mathcal {L}\) is obtained.     

On real solutions of systems of equations

Systems of equations f ₁ = ··· = f _n?1 = 0 in ? ⁿ = {x} having the solution x = 0 are considered under the assumption that the quasi-homogeneous truncations of the smooth functions f ₁,..., f _n?1 are independent at x ≠ 0. It is shown that, for n ≠ 2 and n ≠ 4, such a system has a smooth solution which passes through x = 0 and has nonzero Maclaurin series.     

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

<Emphasis Type="Italic">k</Emphasis>-invariant nets over an algebraic extension of a field <Emphasis Type="Italic">k</Emphasis>

Let K be an algebraic extension of a field k, let σ = (σ _ij ) be an irreducible full (elementary) net of order n ≥ 2 (respectively, n ≥ 3) over K, while the additive subgroups σ _ij are k-subspaces of K. We prove that all σij coincide with an intermediate subfield P, k ? P ? K, up to conjugation by a diagonal matrix.