Solving systems of polynomial inequalities over a real closed field in subexponential time

Let _m= (₁,..., _m) denote an ordered field, where _i+1>0 is infinitesimal relative to the elements of _i, 0 < –i < m (by definition, ₀= ). Given a system of inequalities f₁ > 0, ..., f_s > 0, f_s+1 0, ..., f_k 0, where f_{j m} [X₁,..., X_n] are polynomials such that, and the absolute value of any integer occurring in the coefficients of the f_js is at most 2^M. An algorithm is constructed which tests the above system of inequalities for solvability over the real closure of _m in polynomial time with respect to M, ((d)ⁿd₀)^n+m. In the case _m=, the algorithm explicitly constructs a family of real solutions of the system (provided the latter is consistent). Previously known algorithms for this problem had complexity of the order ofM(d d ₀ ^{m 2U(n)} .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Maternaticheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 174, pp. 3–36, 1988.     

Nonnegative Hall Polynomials

The number of subgroups of type and cotype in a finite abelian p-group of type is a polynomialg with integral coefficients. We prove g has nonnegative coefficients for all partitions and if and only if no two parts of differ by more than one. Necessity follows from a few simple facts about Hall-Littlewood symmetric functions; sufficiency relies on properties of certain order-preserving surjections that associate to each subgroup a vector dominated componentwise by . The nonzero components of (H) are the parts of , the type of H; if no two parts of differ by more than one, the nonzero components of – (H) are the parts of , the cotype of H. In fact, we provide an order-theoretic characterization of those isomorphism types of finite abelian p-groups all of whose Hall polynomials have nonnegative coefficients.     

О предельном распределении для сумм независимых слууайных велиуин на бикомпактных коммутативных топологиуеских группах

,      

Embeddings of Lorentz—Marcinkiewicz spaces with mixed norms

X(Y) f -:X(Y)={fM(×): f_{X(Y)=f(x,.)YX<} . =(0, ), M (×) — , ×, X, Y, Z— . X(Y) Z(×).     

Martingale Hardy spaces,BMO and VMO spaces with nonlinearly ordered stochastic basis

VMO. , ⁺, «» VMO . « » .     

Onp-Helson sets in R n

p- . E R ⁿ -, f () _p(R ⁿ)., ER ⁿ 2nq ₀, E— - q ₀(q ₀-1). : q₀>2 n1 E R ⁿ 2nq ₀, p- p<₀. , f-[-, ]ⁿ, f A _p(R ⁿ) , _p([-, ]ⁿ) (1 << ).     

Divisorial Linear Algebra of Normal Semigroup Rings

We investigate the minimal number of generators and the depth of divisorial ideals over normal semigroup rings. Such ideals are defined by the inhomogeneous systems of linear inequalities associated with the support hyperplanes of the semigroup. The main result is that for every bound C there exist, up to isomorphism, only finitely many divisorial ideals I such that (I)C. It follows that there exist only finitely many Cohen–Macaulay divisor classes. Moreover, we determine the minimal depth of all divisorial ideals and the behaviour of and depth in arithmetic progressions in the divisor class group.The results are generalized to more general systems of linear inequalities whose homogeneous versions define the semigroup in a not necessarily irredundant way. The ideals arising this way can also be considered as defined by the nonnegative solutions of an inhomogeneous system of linear diophantine equations.We also give a more ring-theoretic approach to the theorem on minimal number of generators of divisorial ideals: it turns out to be a special instance of a theorem on the growth of multigraded Hilbert functions.     

On a class of orthogonal series

, [0, 1], (n+1) n-. . [2]. — (. 5.4 5.6). . 6.4 2 [5]. , [4]. , , [6] [7]. [1].     

Characterization,structure and analysis on abelian ℒ∞ groups

An abelian topological group is an group if and only if it is a locally -compactk-space and every compact subset in it is contained in a compactly generated locally compact subgroup. Every abelian groupG is topologically isomorphic to G ₀ where ₀ andG ₀ is an abelian group where every compact subset is contained in a compact subgroup. Intrinsic definitions of measures, convolution of measures, measure algebra,L ₁-algebra, Fourier transforms of abelian groups are given and their properties are studied.     

Admissibility of linear estimators of regression coefficients under quadratic loss

For the general fixed effects linear model:Y=X+, N(0,V),V0, we obtain the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS in the class of all estimators under the loss function (d -S)D(d -S), whereD0 is known. For the general random effects linear model: =XV ₁₁ X+XV ₁₂+V ₂₁ X+V ₂₂0, we also get the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS+Q in the class of all estimators under the loss function (d -S -Q)D(d -S -Q), whereD0 is known.     

Orthonormal systems satisfying an inequality of S. M. Nikol'skii

N- (p, q) (1 pN-, L _p - L _q -. , , , L L _q - , , .     

Best approximation and best unilateral approximation of the kernel of a biharmonic equation and optimal renewal of the values of operators

For the classB _p , 0 < 1, 1p , of 2-periodic functions of the form f(t)=u(,t), whereu (,t) is a biharmonic function in the unit disk, we obtain the exact values of the best approximation and best unilateral approximation of the kernel K(t) of the convolution f= K *g, gl, with respect to the metric of L₁. We also consider the problem of renewal of the values of the convolution operator by using the information about the values of the boundary functions.Translated from Ukrainskii Matematicheskii Zhurnal, Vol.47, No. 11, pp. 1549–1557, November, 1995.     

Riesz representation theorem and weak compactness

. , .     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

The tree number of a graph with a given girth

A family of subtrees of a graphG whose edge sets form a partition of the edge set ofG is called atree decomposition ofG. The minimum number of trees in a tree decomposition ofG is called thetree number ofG and is denoted by(G). It is known that ifG is connected then(G) |G|/2. In this paper we show that ifG is connected and has girthg 5 then(G) |G|/g + 1. Surprisingly, the case wheng = 4 seems to be more difficult. We conjecture that in this case(G) |G|/4 + 1 and show a wide class of graphs that satisfy it. Also, some special graphs like complete bipartite graphs andn-dimensional cubes, for which we determine their tree numbers, satisfy it. In the general case we prove the weaker inequality(G) (|G| – 1)/3 + 1.     

Asymptotic Density and the Asymptotics of Partition Functions

Let A be a set of positive integers with gcd (A) = 1, and let p _A (n) be the partition function of A. Let c ₀ = 2/3. If A has lower asymptotic density and upper asymptotic density , then lim inf log p _A (n)/c ₀ n and lim sup log p _A (n)/c ₀ n . In particular, if A has asymptotic density > 0, then log p _A (n) c₀n. Conversely, if > 0 and log p _A (n) c ₀ n, then the set A has asymptotic density .     

Phragmén-Lindelöf theorems for second-order quasilinear elliptic equations

Analogues are formulated of the well-known, in the theory of analytic functions, Phragmen-Lindelöf theorem for the gradients of solutions of a broad class of quasilinear equations of elliptic type. Examples are given illustrating the accuracy of the results obtained for the gradients of solutions of the equations of the form div(|U|^–2u)=f(x, u, u), where f(x, u, u) is a function locally bounded in ²ⁿ⁺¹. f(x, 0, u)=0, uf(x, u, u) c¦u¦1+q(1+ ¦u|), > 1, c > 0, q > 0, is an arbitrary real number, and n >- 2. The basic role in the technique employed in the paper is played by the apparatus of capacitary characteristics.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 10, pp. 1376–1381, October, 1992.The author sincerely appreciates E. M. Landis's permanent attention and numerous useful discussions.     

Implicit elliptic boundary-value problems with discontinuous nonlinearities

Let be a bounded domain in ⁿ (n3) having a smooth boundary, let be an essentially bounded real-valued function defined on × ^h, and let be a continuous real-valued function defined on a given subset Y of Y ^h. In this paper, the existence of strong solutions u W ^2,p (, ^h) W _o ^1,p (n/2<p<+) to the implicit elliptic equation (–u)=(x,u), with u=(u₁, u₂, ..., u_h) and u=(u ₁, u ₂, ..., u _h), is established. The abstract framework where the problem is placed is that of set-valued analysis.     

Produktsätze für Verfahren zur Limitierung von Doppelfolgen

{p _mn } - ₀₀>0, (1, 1) (1.1) (1.2). {s _mn } J _p - ( bJ _p -lims _mn =), (1.3) 0<x,y<1 p _s (, )/p(x, y) x, y 1-. {r _mn } - , (1.5) 0<, <1. N _rp - , (1.6). , bJ _p -lims _mn = bJ _q -lim(N _rps) _mn =. J _p - . , .     

Boolean Term Orders and the Root System Bn

A Boolean term order is a total order on subsets of [n] ={1,..., n} such that for all [n], , and for all with ( ) = . Boolean term orders arise in several different areas of mathematics, including Gröbner basis theory for the exterior algebra, and comparative probability.The main result of this paper is that Boolean term orders correspond to one-element extensions of the oriented matroid M(B_n), where B_n is the root system {e_i : 1 i n} {e_i ± e_j : 1 i < j n}. This establishes Boolean term orders in the framework of the Baues problem, in the sense of (Reiner, 1998). We also define a notion of coherence for a Boolean term order, and a flip relation between different term orders. Other results include examples of noncoherent term orders, including an example exhibiting flip deficiency, and enumeration of Boolean term orders for small values of n.