Approximation Characteristics of Spaces $$S_\phi ^p$$

We introduce linear vector spaces and study their approximation properties. By using the general results obtained, we establish statements concerning the approximation of classes of periodic functions of many variables by trigonometric polynomials.     

Critical Points of Real Polynomials and Topology of Real Algebraic T-Surfaces

The paper is devoted to a special class of real polynomials, so-called T-polynomials, which arise in the combinatorial version of the Viro theorem. We study the relation between the numbers of real critical points of a given index of a T-polynomial and the combinatorics of lattice triangulations of Newton polytopes. We obtain upper bounds for the numbers of extrema and saddles of generic T-polynomials of a given degree in three variables, and derive from them upper bounds for Betti numbers of real algebraic surfaces in defined by T-polynomials. The latter upper bounds are stronger than the known upper bounds for arbitrary real algebraic surfaces in . Another result is the existence of an asymptotically maximal family of real polynomials of degree min three variables with 31m ³/36 + O(m ²) saddle points.     

Conjectures on the Quotient Ring by Diagonal Invariants

We formulate a series of conjectures (and a few theorems) on the quotient of the polynomial ring in two sets of variables by the ideal generated by all S _n invariant polynomials without constant term. The theory of the corresponding ring in a single set of variables X = {x ₁, ..., x _n} is classical. Introducing the second set of variables leads to a ring about which little is yet understood, but for which there is strong evidence of deep connections with many fundamental results of enumerative combinatorics, as well as with algebraic geometry and Lie theory.     

Polynomial Interpolation of the Discrete Logarithm

Recently, Coppersmith and Shparlinski proved several results on the interpolation of the discrete logarithm in the finite prime field by polynomials modulo p and modulo p-1, respectively. In this paper most of these results are extended to arbitrary .     

Expansion of the Stratonovich Multiple Stochastic Integrals Based on the Fourier Multiple series

An expansion of multiple Stratonovich stochastic integrals of multiplicity , into multiple series of products of Gaussian random variables is obtained. The coefficients of this expansion are the coefficients of multiple Fourier-series expansion of a function of several variables relative to a complete orthonormal system in the space . The convergence in mean of order , is established. Some expansions of multiple Stratonovich stochastic integrals with the help of polynomial and trigonometric systems are considered. Bibliography: 8 titles.     

The spectrum of the Leray transform for convex Reinhardt domains in

The Leray transform and related boundary operators are studied for a class of convex Reinhardt domains in . Our class is self-dual; it contains some domains with less than C²-smooth boundary and also some domains with smooth boundary and degenerate Levi form. L²-regularity is proved, and essential spectra are computed with respect to a family of boundary measures which includes surface measure. A duality principle is established providing explicit unitary equivalence between operators on domains in our class and operators on the corresponding polar domains. Many of these results are new even for the classical case of smoothly bounded strongly convex Reinhardt domains.     

Gröbner Bases for Complete Uniform Families

We describe (reduced) Gröbner bases of the ideal of polynomials over a field, which vanish on the set of characterisic vectors of the complete unifom families . An interesting feature of the results is that they are largely independent of the monomial order selected. The bases depend only on the ordering of the variables. We can thus use past results related to the lex order in the presence of degree-compatible orders, such as deglex. As applications, we give simple proofs of some known results on incidence matrices.     

On characterizing the solution sets of pseudolinear programs

This paper provides several new and simple characterizations of the solution sets of pseudolinear programs. By means of the basic properties of pseudolinearity, the solution set of a pseudolinear program is characterized, for instance, by the equality that , for each feasible pointx, where is in the solution set. As a consequence, we give characterizations of both the solution set and the boundedness of the solution set of a linear fractional program.     

Formulas for Lagranigian and orthogonal degeneracy loci; \widetilde Q-polynomial approach

The main goal of the paper is to give explicit formulas for the fundamental classes of Schubert subschemes in Lagrangian and orthogonal Grassmannians of maximal isotropic subbundles as well as some globalizations of them. The used geometric tools overlap appropriate desingularizations of such Schubert subschemes and Gysin maps for such Grassmannian bundles. The main algebraic tools are provided by the families of and -polynomials introduced and investigated in the present paper. The key technical result of the paper is the computation of the class of the (relative) diagonal in isotropic Grassmannian bundles based on the orthogonality property of and polynomials. Some relationships with quaternionic Schubert varieties and Schubert polynomials for classical groups are also discussed.     

Multiple Fourier Sums on Sets of \bar \psi-Differentiable Functions (Low Smoothness)

We investigate the behavior of deviations of rectangular partial Fourier sums on sets of -differentiable functions of many variables.     

The Sampling Theorem and Several Equivalent Results in Analysis

First we show that several fundamental results on functions from theBernstein spaces (such as Bernstein's inequality andthe reproducing formula) can be deduced from a weak form of the classicalsampling theorem. In §3 we discuss the mutual equivalence of thesampling theorem, the derivative sampling theorem and a harmonic functionsampling theorem. In §§4–6 we discuss connections between thesampling theorem and various important results in complex analysis andFourier analysis. Our considerations include Cauchy's integral formula,Poisson's summation formula, a Gaussian integral, certain properties ofweighted Hermite polynomials, Plancherel's theorem, the maximum modulusprinciple, and the Phragmén–Lindelöf principle.     

Calogero Operator and Lie Superalgebras

We construct a supersymmetric analogue of the Calogero operator , which depends on the parameter k. This analogue is related to the root system of the Lie superalgebra . It becomes the standard Calogero operator for m = 0 and becomes the operator constructed by Veselov, Chalykh, and Feigin up to changing the variables and the parameter k for m = 1. For k = 1 and 1/2, the operator is the radial part of the second-order Laplace operator for the symmetric superspaces corresponding to the respective pairs . We show that for any m and n, the supersymmetric analogues of the Jack polynomials constructed by Kerov, Okounkov, and Olshanskii are eigenfunctions of the operator . For k = 1 and 1/2, the supersymmetric analogues of the Jack polynomials coincide with the spherical functions on the above superspaces. We also study the algebraic analogue of the Berezin integral.     

Real Factorization of Multivariate Polynomials with Integer Coefficients

In the recent papers, a new efficient probabilistic semi-numerical absolute (i.e., complex) factorization algorithm for multivariate polynomials with integer coefficients is given. It is based on a simple property of the monomials arising after a generic linear change of coordinates for bivariate polynomials and on a deep result of complex algebraic geometry. Here, we consider the a priori simpler problem of factorization over the field of reals. We briefly review our algorithm for complex factorization and adapt it to solving the problem on the field of reals. This allows us to spare a significant part of the computations and to improve the range of tractability. The method provides factors with approximative coefficients and eventually exact factors in a suitable real algebraic extension of . Bibliography: 15 titles.     

Series-parallel posets and relative Ockham lattices

A study is undertaken of order-reversing maps on series-parallel posets and structural characterisations are obtained of various subclasses of such ordered sets. The results are applied to complete the authors' earlier investigation of classes of finite relate lattices, where is a variety of Ockham lattices and the distributive lattice duals of the algebras in are required to be series-parallel.     

Norms of Multipliers and Best Approximations of Holomorphic Functions of Many Variables

We show that the Lebesgue–Landau constants of linear methods for summation of Taylor series of functions holomorphic in a polydisk and in the unit ball from over triangular domains do not depend on the number m. On the basis of this fact, we find a relation between the complete and partial best approximations of holomorphic functions in a polydisk and in the unit ball from .     

On the Connection Between Macdonald Polynomials and Demazure Characters

We show that the specialization of nonsymmetric Macdonald polynomials at t = 0 are, up to multiplication by a simple factor, characters of Demazure modules for . This connection furnishes Lie-theoretic proofs of the nonnegativity and monotonicity of Kostka polynomials.     

Tractable Partially Ordered Sets Derived from Root Systems and Biased Graphs

We study new posets Q obtained by removing from a geometric lattice L ofa biased graph certain flats indexed by a simplicial complex . (One example of L is the lattice of flats of thevector matroid of a root system B _n .) We study the structureand compute the characteristic polynomial of Q. With certainchoices of L and , including ones for which Q is alattice interpolating between those of B _n and D _n , we observe curious relationships among the roots of thecharacteristic polynomials of Q, L, and .     

Efficient Smooth Stratification of an Algebraic Variety in Zero Characteristic and Its Applications

Consider a projective algebraic variety V defined as the set of common zeros of a family of homogeneous polynomials of degree less than d in variables with coefficients from a field k of zero characteristic. We prove that V can be represented as a union (respectively, a disjoint union) of at most (respectively, ) smooth quasiprojective algebraic varieties such that the degrees of these varieties are bounded from above by , where depends only on n. We propose algorithms for constructing regular sequences and sequences of local parameters for irreducible components of V and for computing the dimension of a real variety. The complexity of these algorithms is polynomial in the size of the input and in . Bibliography: 15 titles.