Interior estimates for solutions of a fourth order nonlinear partial differential equation

Let be a locally strongly convex hypersurface, given by the graph of a convex function xn+1=f(x₁,…,xn) defined in a convex domain Ω⊂Rn. M is called a α-extremal hypersurface, if f is a solution of

     

The structure of max-min hyperplanes

In this article, continuing [12,13], further contributions to the theory of max-min convex geometry are given. The max-min semiring is the set endowed with the operations ⊕=max,⊗=min in . A max-min hyperplane (briefly, a hyperplane) is the set of all points satisfying an equation of the form

a₁⊗x₁⊕…⊕a_n⊗x_n⊕a_n+1=b₁⊗x₁⊕…⊕b_n⊗x_n⊕b_n+1,     

A fractional Helly theorem for convex lattice sets

A set of the form , where is convex and denotes the integer lattice, is called a convex lattice set. It is known that the Helly number of d-dimensional convex lattice sets is 2^d. We prove that the fractional Helly number is only d+1: For every d and every α∈(0,1] there exists β>0 such that whenever F₁,…,F_n are convex lattice sets in such that for at least index sets I⊆{1,2,…,n} of size d+1, then there exists a (lattice) point common to at least βn of the F_i. This implies a (p,d+1)-theorem for every p?d+1; that is, if is a finite family of convex lattice sets in such that among every p sets of , some d+1 intersect, then has a transversal of size bounded by a function of d and p.     

On the vertex index of convex bodies

We introduce the vertex index, vein(K), of a given centrally symmetric convex body K⊂Rd, which, in a sense, measures how well K can be inscribed into a convex polytope with small number of vertices. This index is closely connected to the illumination parameter of a body, introduced earlier by the first named author, and, thus, related to the famous conjecture in Convex Geometry about covering of a d-dimensional body by d² smaller positively homothetic copies. We provide asymptotically sharp estimates (up to a logarithmic term) of this index in the general case. More precisely, we show that for every centrally symmetric convex body K⊂Rd one has

     

Second-order conditions in C 1,1 constrained vector optimization

We consider the constrained vector optimization problem min _C f(x), g(x) ∈ ?K, where f:? ⁿ →? ^m and g:? ⁿ →? ^p are C ^1,1 functions, and C ? ^m and K ? ^p are closed convex cones with nonempty interiors. Two type of solutions are important for our considerations, namely w-minimizers (weakly efficient points) and i-minimizers (isolated minimizers). We formulate and prove in terms of the Dini directional derivative second-order necessary conditions for a point x ⁰ to be a w-minimizer and second-order sufficient conditions for x ⁰ to be an i-minimizer of order two. We discuss the reversal of the sufficient conditions under suitable constraint qualifications of Kuhn-Tucker type. The obtained results improve the ones in Liu, Neittaanmäki, K?í?ek [21].     

Convexity properties of harmonic measures

It is shown that any convex combination of harmonic measures , where U₁,…,Uk are relatively compact open neighborhoods of a given point x∈Rd, d?2, can be approximated by a sequence of harmonic measures such that each Wn is an open neighborhood of x in U₁∪?∪Uk.This answers a question raised in connection with Jensen measures. Moreover, it implies that, for every Green domain X containing x, the extremal representing measures for x with respect to the convex cone of potentials on X (these measures are obtained by balayage of the Dirac measure at x on Borel subsets of X) are dense in the compact convex set of all representing measures.This is achieved approximating balayage on open sets by balayage on unions of balls which are pairwise disjoint and very small with respect to their mutual distances and then reducing the size of these balls in a suitable manner.These results, which are presented simultaneously for the classical potential theory and for the theory of Riesz potentials, can be sharpened if the complements or the boundaries of the open sets have a capacity doubling property. The methods developed for this purpose (continuous balayage on increasing families of compact sets, approximation using scattered sets with small capacity) finally lead to answers even in a very general potential-theoretic setting covering a wide class of second order partial differential operators (uniformly elliptic or in divergence form, or sums of squares of vector fields satisfying Hörmander's condition, for example, sub-Laplacians on stratified Lie algebras).     

Line graph eigenvalues and line energy of caterpillars

The energy of a graph G is the sum of the absolute values of the eigenvalues of the adjacency matrix of G. A caterpillar is a tree in which the removal of all pendant vertices makes it a path. Let d?3 and n?2(d-1). Let p=[p₁,p₂,…,p_d-1] with p₁?1,p₂?1,…,p_d-1?1 such that

p₁+p₂+?+p_d-1=n-d+1.     

The combinatorial structure of random polytopes

Choose n random points in , let P_n be their convex hull, and denote by f_i(P_n) the number of i-dimensional faces of P_n. A general method for computing the expectation of f_i(P_n), i=0,…,d−1, is presented. This generalizes classical results of Efron (in the case i=0) and Rényi and Sulanke (in the case i=d−1) to arbitrary i. For random points chosen in a smooth convex body a limit law for f_i(P_n) is proved as n→∞. For random points chosen in a polytope the expectation of f_i(P_n) is determined as n→∞. This implies an extremal property for random points chosen in a simplex.     

Reduction of the c-numerical range to the classical numerical range

Let A be an n×n complex matrix and c=(c₁,c₂,…,c_n) a real n-tuple. The c-numerical range of A is defined as the set

     

On the number of antipodal or strictly antipodal pairs of points in finite subsets ofR d,II

The paper is a continuation of [MM], namely containing several statements related to the concept of antipodal and strictly antipodal pairs of points in a subsetX ofR ^d , which has cardinalityn. The pointsx _i, x_jX are called antipodal if each of them is contained in one of two different parallel supporting hyperplanes of the convex hull ofX. If such hyperplanes contain no further point ofX, thenx _i, x_j are even strictly antipodal. We shall prove some lower bounds on the number of strictly antipodal pairs for givend andn. Furthermore, this concept leads us to a statement on the quotient of the lengths of longest and shortest edges of speciald-simplices, and finally a generalization (concerning strictly antipodal segments) is proved.Research (partially) supported by Hungarian National Foundation for Scientific Research, grant no. 1817     

On various restricted sumsets

For finite subsets A₁,…,A_n of a field, their sumset is given by . In this paper, we study various restricted sumsets of A₁,…,A_n with restrictions of the following forms:

     

On semigroup presentations and Adian graphs

Let P be a semigroup presentation of the form

〈a₁,…,a_n∣w₁=a₁,…,w_n=a_n〉.     

The zeros of a quadratic form at square-free points

Let F(x₁,…,xn) be a nonsingular indefinite quadratic form, n=3 or 4. For n=4, suppose the determinant of F is a square. Results are obtained on the number of solutions of

F(x₁,…,xn)=0     

Schatten p-norm inequalities related to an extended operator parallelogram law

Let C_p be the Schatten p-class for p>0. Generalizations of the parallelogram law for the Schatten 2-norms have been given in the following form: if A={A₁,A₂,…,A_n} and B={B₁,B₂,…,B_n} are two sets of operators in, then C₂

     

All 0–1 polytopes are traveling salesman polytopes

We study the facial structure of two important permutation polytopes in , theBirkhoff orassignment polytopeB _n , defined as the convex hull of alln×n permutation matrices, and theasymmetric traveling salesman polytopeT _n , defined as the convex hull of thosen×n permutation matrices corresponding ton-cycles. Using an isomorphism between the face lattice ofB _n and the lattice of elementary bipartite graphs, we show, for example, that every pair of vertices ofB _n is contained in a cubical face, showing faces ofB _n to be fairly special 0–1 polytopes. On the other hand, we show thatevery 0–1d-polytope is affinely equivalent to a face ofT _n , fordlogn, by showing that every 0–1d-polytope is affinely equivalent to the asymmetric traveling salesman polytope of some directed graph withn nodes. The latter class of polytopes is shown to have maximum diameter [n/3].Partially supported by NSF grant DMS-9207700.     

Representations of matroids and free resolutions for multigraded modules

Let k be a field, let R=k[x₁,…,xm] be a polynomial ring with the standard Zm-grading (multigrading), let L be a Noetherian multigraded R-module, and let be a finite free multigraded presentation of L over R. Given a choice S of a multihomogeneous basis of E, we construct an explicit canonical finite free multigraded resolution T_•(Φ,S) of the R-module L. In the case of monomial ideals our construction recovers the Taylor resolution. A main ingredient of our work is a new linear algebra construction of independent interest, which produces from a representation ? over k of a matroid M a canonical finite complex of finite dimensional k-vector spaces T_•(?) that is a resolution of Ker?. We also show that the length of T_•(?) and the dimensions of its components are combinatorial invariants of the matroid M, and are independent of the representation map ?.     

Two equivalent measures on weighted hypergraphs

Let H=(N,E,w) be a hypergraph with a node set N={0,1,…,n-1}, a hyperedge set E⊆2^N, and real edge-weights w(e) for e∈E. Given a convex n-gon P in the plane with vertices x₀,x₁,…,x_n-1 which are arranged in this order clockwisely, let each node i∈N correspond to the vertex x_i and define the area A_P(H) of H on P by the sum of the weighted areas of convex hulls for all hyperedges in H. For 0?i<j<k?n-1, a convex three-cut C(i,j,k) of N is {{i,…,j-1}, {j,…,k-1}, {k,…,n-1,0,…,i-1}} and its size c_H(i,j,k) in H is defined as the sum of weights of edges e∈E such that e contains at least one node from each of {i,…,j-1}, {j,…,k-1} and {k,…,n-1,0,…,i-1}. We show that the following two conditions are equivalent:

•

A_P(H)?A_P(H^′) for all convex n-gons P.

•

c_H(i,j,k)?c_H^′(i,j,k) for all convex three-cuts C(i,j,k).

From this property, a polynomial time algorithm for determining whether or not given weighted hypergraphs H and H^′ satisfy “A_P(H)?A_P(H^′) for all convex n-gons P” is immediately obtained.     

Realization of prescribed patterns in the competition model

We demonstrate that for any prescribed set of finitely many disjoint closed subdomains D₁,…,D_m of a given spatial domain Ω in R^N, if d₁,d₂,a₁,a₂,c,d,e are positive continuous functions on Ω and b(x) is identically zero on D?D₁∪?∪D_m and positive in the rest of Ω, then for suitable choices of the parameters λ, μ and all small ε>0, the competition model

     

Cocentralizing and vanishing derivations on multilinear polynomials in prime rings

Let R be a prime ring of characteristic different from 2 and extended centroid C and let f(x1,..., x _n ) be a multilinear polynomial over C not central-valued on R, while δ is a nonzero derivation of R. Suppose that d and g are derivations of R such that

$\delta (d(f(r_1 , \ldots ,r_n ))f(r_1 , \ldots ,r_n ) - f(r_1 , \ldots ,r_n )g(f(r_1 , \ldots ,r_n ))) = 0$

for all r1,..., r _n ∈ R. Then d and g are both inner derivations on R and one of the following holds: (1) d = g = 0; (2) d = ?g and f(x ₁,..., x _n )² is central-valued on R.