Oriented hypergraphs: Balanceability

An oriented hypergraph is an oriented incidence structure that extends the concepts of signed graphs, balanced hypergraphs, and balanced matrices. We introduce hypergraphic structures and techniques that generalize the circuit classification of the signed graphic frame matroid to any oriented hypergraphic incidence matrix via its locally-signed-graphic substructure. To achieve this, Camion's algorithm is applied to oriented hypergraphs to provide a generalization of reorientation sets and frustration that is only well-defined on balanceable oriented hypergraphs. A simple partial characterization of unbalanceable circuits extends the applications to representable matroids demonstrating that the difference between the Fano and non-Fano matroids is one of balance.     

Randomized algorithms for the separation of point sets and for solving quadratic programs

A randomized algorithm for finding a hyperplane separating two finite point sets in the Euclidean space ^d and a randomized algorithm for solving linearly constrained general convex quadratic problems are proposed. The expected running time of the separating algorithm isO(dd! (m + n)), wherem andn are cardinalities of sets to be separated. The expected running time of the algorithm for solving quadratic problems isO(dd! s) wheres is the number of inequality constraints. These algorithms are based on the ideas of Seidel's linear programming algorithm [6]. They are closely related to algorithms of [8], [2], and [9] and belong to an abstract class of algorithms investigated in [1]. The algorithm for solving quadratic problems has some features of the one proposed in [7].This research was done when the author was supported by the Alexander von Humboldt Foundation, Germany.On leave from the Institute of Mathematics and Mechanics, Ural Department of the Russian Academy of Sciences, 620219 Ekaterinburg, S. Kovalevskaya str. 16, Russia.     

Real analysis related to the Monge-Ampère equation

In this paper we consider a family of convex sets in , , , , satisfying certain axioms of affine invariance, and a Borel measure satisfying a doubling condition with respect to the family The axioms are modelled on the properties of the solutions of the real Monge-Ampère equation. The purpose of the paper is to show a variant of the Calderón-Zygmund decomposition in terms of the members of This is achieved by showing first a Besicovitch-type covering lemma for the family and then using the doubling property of the measure The decomposition is motivated by the study of the properties of the linearized Monge-Ampère equation. We show certain applications to maximal functions, and we prove a John and Nirenberg-type inequality for functions with bounded mean oscillation with respect to

     

On a class of functions with equal infima over a domain and its boundary

In this paper, we present a class of functions:f:X such that inf _xX f(x)= , whereX is a nonempty, finitely compact and convex set in a vector space andB _x ={xX: y aff(X){x:[x, y]X={x}. Our main tool is a recent minimax theorem by Ricceri (Ref. 1).     

Coupling of the GB set property for ergodic averages

Let (Y,,,T) be an ergodic dynamical system. LetA be an nonempty subset ofL ²() such that , whereA=sup{||sȒt||₂ ,s, tA} andN(A, u) is the smallest number ofL ²()-open balls of radiusu, centered inA, enough to coverA. Let . We prove as a consequence of a more general result, thatC(A) is aGB subset ofL ²().     

Weak separation properties for self-similar sets

We develop a theory for self-similar sets in that fulfil the weak separation property of Lau and Ngai, which is weaker than the open set condition of Hutchinson.

     

HYPERFINITE TRANSVERSAL THEORY. II

We continue the investigation of validity of Hall's theorem in the case of the Loeb space of an internal, uniformly distributed, hyperfinite measure space initiated in1992 by the author. Some new classes of graphs are introduced for which the measure theoretic version of Hall's theorem still holds.

     

Realization of fixed point sets

Letf:XX be a selfmap of a compact connected polyhedron, andA a nonempty closed subset ofX. In this paper, we shall deal with the question whether or not there is a mapg:XX homotopic tof such that the fixed point set Fixg ofg equalsA. We introduce a necessary condition for the existence of such a mapg. It is shown that this condition is easy to check, and hence some sufficient conditions are obtained.Partially supported by the Natural Science Foundation of Liaoning University.     

Quantitative stability of variational systems: III.ε-approximate solutions

We prove that the-optimal solutions of convex optimization problems are Lipschitz continuous with respect to data perturbations when these are measured in terms of the epi-distance. A similar property is obtained for the distance between the level sets of extended real valued functions. We also show that these properties imply that the-subgradient mapping is Lipschitz continuous.Research supported in part by the National Science Foundation and the Air Force Office of Scientific Research.     

Electronic structure of BeH2

Nonorthogonal single‐configuration and multiconfiguration ab initio calculations are carried out on the BeH₂ molecule in its equilibrium (D_∞h) geometry, using a highly optimized even‐tempered Slater‐type orbital (STO) basis set. The results are used as a basis for a discussion of the electronic structure of the molecule in modern‐VB terms. A value of R_e = 1.329 Å is obtained. Values are also obtained for the symmetric‐stretch harmonic frequency (2053 cm^?1), electric quadrupole moment (?5.60 Buckingham), and nuclear quadrupole coupling constants (?3.59 MHz for ⁹Be and 0.0915 MHz for ²H). © 2005 Wiley Periodicals, Inc. Int J Quantum Chem, 2006