Some continuous functions related to corner polyhedra,II

The group problem on the unit interval is developed, with and without continuous variables. The connection with cutting planes, or valid inequalities, is reviewed. Certain desirable properties of valid inequalities, such as minimality and extremality are developed, and the connection between valid inequalities for P(I, u ₀) and P _- ⁺ (I, u ₀) is developed. A class of functions is shown to give extreme valid inequalities for P _- ⁺ (I, u ₀) and for certain subsetsU ofI. A method is used to generate such functions. These functions give faces of certain corner polyhedra. Other functions which do not immediately give extreme valid inequalities are altered to construct a class of faces for certain corner polyhedra. This class of faces grows exponentially as the size of the group grows.     

Tangential Interpolation in Weighted Vector-valued H p Spaces, with Applications

In this paper, norm estimates are obtained for the problem of minimal-norm tangential interpolation by vector-valued analytic functions in weighted H^p spaces, expressed in terms of the Carleson constants of related scalar measures. Applications are given to the notion of p-controllability properties of linear semigroup systems and controllability by functions in certain Sobolev spaces.     

Conjugacy Length in Group Extensions

Determining the length of short conjugators in a group can be considered as an effective version of the conjugacy problem. The conjugacy length function provides a measure for these lengths. We study the behavior of conjugacy length functions under group extensions, introducing the twisted and restricted conjugacy length functions. We apply these results to show that certain abelian-by-cyclic groups have linear conjugacy length function and certain semidirect products ?^d ? ?^k have at most exponential (if k > 1) or linear (if k = 1) conjugacy length functions.     

The interpolation problem for ridge functions

It is shown that the interpolation problem for ridge functions can be solved if and only if the rank of a certain matrix A equals the number of interpolation points. The elements of the matrix A are either 0 or 1 and can be easilyfound from the arguments of the unknown functions. It is shown that Sun's Characteristic, or incidence matrix C is given by C = AA ^T . From this it follows that the rank condition is equivalent to Sun's positive definite C condition.     

Numerical solutions of the Dirichlet problem via a density theorem

Under mild conditions a certain subspace M, consisting of functions which are analytic in a simply connected domain Ω and continuous on the boundary Gamma;, is shown to have real parts which are dense, in the sup norm, in the set of all solutions to the Dirichlet problem for continuous boundary data. Similar results hold for L^p boundary data. Numerical solutions of sample Dirichlet problems are computed. © 1994 John Wiley & Sons, Inc.     

无穷远点处亚纯单叶函数的拟Hadamard卷积(英文)

本文研究了圆环域U内亚纯星象和凸象函数的某些新子类的拟Hadamard卷积.利用卷积方法,获得了该类函数的与拟Hadamard卷积有关的某些性质,推广了一些已知结果.     

Boundedness of Convolution Operators and Input–Output Maps between Weighted Spaces

We ask when convolution operators with scalar- or operator-valued kernel functions map between weighted L² spaces of Hilbert space-valued functions. For a certain class of decreasing weights, including negative powers (t + a)^−m for example, we solve the one-weight problem completely by using Laplace transforms and Bergman-type spaces of vector-valued analytic functions. For a much more general class of decreasing weights, we solve the one-weight problem for all positive real kernels (also for L^p(w) with p > 1), by results on Steklov operators which generalise the weighted Hardy inequality. When the kernel function is a strongly continuous semigroup of bounded linear Hilbert space operators, which arises from input–output maps of certain linear systems, then the most obvious sufficient condition for boundedness, obtained by taking norm signs inside the integrals, is also necessary in many cases, but not in general. Submitted: July 15, 2007.,Revised: November 19, 2007.,Accepted: December 14, 2007.     

Minimal infeasible constraint sets in convex integer programs

In this paper we investigate certain aspects of infeasibility in convex integer programs, where the constraint functions are defined either as a composition of a convex increasing function with a convex integer valued function of n variables or the sum of similar functions. In particular we are concerned with the problem of an upper bound for the minimal cardinality of the irreducible infeasible subset of constraints defining the model. We prove that for the considered class of functions, every infeasible system of inequality constraints in the convex integer program contains an inconsistent subsystem of cardinality not greater than 2 ⁿ , this way generalizing the well known theorem of Scarf and Bell for linear systems. The latter result allows us to demonstrate that if the considered convex integer problem is bounded below, then there exists a subset of at most 2 ⁿ −1 constraints in the system, such that the minimum of the objective function subject to the inequalities in the reduced subsystem, equals to the minimum of the objective function over the entire system of constraints.     

Stieltjes Moment Problems and the Friedrichs Extension of a Positive Definite Operator

For an indeterminate Stieltjes moment sequence the multiplication operator Mp(x) = xp(x) is positive definite and has self-adjoint extensions. Exactly one of these extensions has the same lower bound as M, the so-called Friedrichs extension. The spectral measure of this extension gives a certain solution to the moment problem and we identify the corresponding parameter value in the Nevanlinna parametrization of all solutions to the moment problem. In the case where σ is indeterminate in the sense of Stieltjes, relations between the (Nevanlinna matrices of) entire functions associated with the measures t^kdσ(t) are derived. The growth of these entire functions is also investigated.     

Some results concerning cryptographically significant mappings over GF(2<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

In this paper we investigate the existence of permutation polynomials of the form F(x) = x ^d  + L(x) over GF(2 ⁿ ), L being a linear polynomial. The results we derive have a certain impact on the long-term open problem on the nonexistence of APN permutations over GF(2 ⁿ ), when n is even. It is shown that certain choices of exponent d cannot yield APN permutations for even n. When n is odd, an infinite class of APN permutations may be derived from Gold mapping x ³ in a recursive manner, that is starting with a specific APN permutation on GF(2 ^k ), k odd, APN permutations are derived over GF(2 ^k+2i ) for any i ≥ 1. But it is demonstrated that these classes of functions are simply affine permutations of the inverse coset of the Gold mapping x ³. This essentially excludes the possibility of deriving new EA-inequivalent classes of APN functions by applying the method of Berveglieri et al. (approach proposed at Asiacrypt 2004, see [3]) to arbitrary APN functions.     

Mixed problem for x-analytical functions in a halfdisk

The mixed problem for x-analytical functions in a halfdisk with the real part of the x-analytical function defined on a part of the circle and the imaginary part defined on the rest of the circle is reduced to the problem of linear matching of p-analytical functions with different characteristics (p=x in the halfdisk and p=x/(x ² +y ² ) in the halfplane with the halfdisk cut out). The linear matching problem of p-analytical functions is analyzed and the class of p-analytical functions with the characteristic p=x/(x ² +y ² ) is shown to be equivalent to the class of x-analylical functions. An integral representation is obtained for p-analytical functions with the characteristic p=x/(x ² +y ² ) which is analogous to the standard integral representation for x-analytical functions. A procedure is developed for reducing the solution of the linear matching problem to the solution of the Fredholm integral equation of second kind.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 60, pp. 7–15, 1986.     

On global unconstrained minimization of the difference of polyhedral functions

The problem of finding a global minimizer of the difference of polyhedral functions is considered. By means of conjugate functions, necessary and sufficient conditions for the unboundedness and the boundedness of such functions in R ⁿ are derived. Using hypodifferentials of polyhedral functions, necessary and sufficient conditions for a global unconstrained minimum on R ⁿ are proved.     

On the classification of elliptic surfaces withq=1

We classify, up to isomorphism, elliptic surfaces with irregularity one having exactly one singular fiber (necessarily of typeI ₆ ^* ). All of them turn out to be elliptic modular surfaces (Shioda [11]), so that the problem is indirectly equivalent to classifying certain subgroups ofSL ₂(Z). These surfaces are then used to produce examples of (elliptic) surfaces withq=1, anyp _g 1, which have maximal Picard number (see Persson [7] for the caseq=0). Finally, the classification yields some interesting relationships between hypergeometric functions, theta functions, and certain automorphic forms.Supported in part by NSF DMS-8501724     

On the spectrum of a class of differential operators and embedding theorems

The author considers the embedding problem of weighted Sobolev spacesH _p ⁿ in weightedL _s spacesL _s,r , and some sufficient conditions and necessary conditions are given, when weight functions satisfy certain conditions. The author uses the results obtained to the qualitative analysis of the spectrum of 2n-order weighted differential operator, and gives some sufficient conditions and necessary conditions to ensure that the spectrum is discrete. Supported by the National Natural Science Fundation of China and the Natural Science Foundation of Inner Mongolia.     

Estimates for Littlewood-Paley Functions and Extrapolation

We prove certain L ^p -estimates for Littlewood-Paley functions arising from rough kernels. The estimates are useful for extrapolation to prove L ^p -boundedness of the Littlewood-Paley functions under a sharp kernel condition.      

Saturation of the linear methods of summation of Fourier series in the spaces <Emphasis Type="Italic">S</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript><Subscript>φ</Subscript>

We consider the problem of saturation of the linear methods of summation of Fourier series in the spaces S ^p _φ specified by arbitrary sequences of functions defined in a certain subset of the space ℂ. Sufficient conditions for the saturation of the indicated methods in these spaces are established. Translated from Ukrains'kyi Matematychnyi Zhurnal, Vol. 60, No. 6, pp. 815–828, June, 2008.     

Focal points and support functions in affine differential geometry

The notions of focal point and support function are considered for a nondegenerate hypersurfaceM ⁿ in affine spaceR ⁿ⁺¹ equipped with an equiaffine transversal field. IfM ⁿ is locally strictly convex, these two concepts are related via an Index theorem concerning the critical points of the support functions onM ⁿ . This is used to obtain characterizations of spheres and ellipsoids in terms of the critical point behavior of certain classes of affine support functions.Research supported by NSF Grant No. DMS-9101961.     

On optimal polynomial interpolation of analytic functions

This paper discusses the problem of choosing the Lagrange interpolation points T = (t₀, t₁,…, t_n) in the interval −1 t 1 to minimize the norm of the error, considered as an operator from the Hardy space H²(R) of analytic functions to the space C[−1, 1]. It is shown that such optimal choices converge for fixed n, as R → ∞, to the zeros of a Chebyshev polynomial. Asymptotic estimates are given for the norm of the error for these optimal interpolations, as n → ∞ for fixed R. These results are then related to the problem of choosing optimal interpolation points with respect to the Eberlein integral. This integral is based on a probability measure over certain classes of analytic functions, and is used to provide an average interpolation error over these classes. The Chebyshev points are seen to be limits of optimal choices in this case also.     

Recognition problems for special classes of polynomials in 0–1 variables

This paper investigates the complexity of various recognition problems for pseudo-Boolean functions (i.e., real-valued functions defined on the unit hypercubeB ⁿ = {0, 1} ⁿ ), when such functions are represented as multilinear polynomials in their variables. Determining whether a pseudo-Boolean function (a) is monotonic, or (b) is supermodular, or (c) is threshold, or (d) has a unique local maximum in each face ofB ⁿ , or (e) has a unique local maximum inB ⁿ , is shown to be NP-hard. A polynomial-time recognition algorithm is presented for unimodular functions, previously introduced by Hansen and Simeone as a class of functions whose maximization overB ⁿ is reducible to a network minimum cut problem.     

Mixed sensitivity minimization problems with rationall 1-optimal solutions

Up to this time, the only known method to solve the discrete-time mixed sensitivity minimization problem inl ¹ has been to use a certain infinite-dimensional linear programming approach, presented by Dahleh and Pearson in 1988 and later modified by Mendlovitz. That approach does not give in general true optimal solutions; only suboptimal ones are obtained. Here, for the first time, the truel ¹-optimal solutions are found for some mixed sensitivity minimization problems. In particular, Dahleh and Pearson construct an 11h order suboptimal compensator for a certain second-order plan with first-order weight functions; it is shown that the unique optimal compensator for that problem is rational and of order two. The author discovered this fact when trying out a new scheme of solving the infinite-dimensional linear programming system. This scheme is of independent interest, because when it is combined with the Dahleh-Pearson-Mendlovitz scheme, it gives both an upper bound and a lower bound on the optimal performance; hence, it provides the missing error bound that enables one to truncate the solution. Of course, truncation is appropriate only if the order of the optimal compensator is too high. This may indeed be the case, as is shown with an example where the order of the optimal compensator can be arbitrarily high.