Applications of the zero–one law to problems connected with Cauchy's functional equation

Summary Marek Kuczma's book, entitled An Introduction To The Theory Of Functional Equations And Inequalities, mentions a certain setV ₀ in several places and presents references as to where this set is discussed in the literature. The main result of this paper is a proof of the fact that the setA _M (V ₀)={xV ₀ f(x)>M} is saturated non-measurable for each additive discontinuous functionf and each real numberM. Other results aboutV ₀ are also presented. Connections between measure and category are stressed. The main tool in our proofs is a certain so-called zero–one law and its topological analogue. In addition it is shown that the zero–one law is equivalent to Smital's lemma.     

A mapping connected with the Schur–Szegő composition

Every monic polynomial in one variable of the form $(x+1)S$, $\mathrm{deg}S=n?1$, is presentable in a unique way as a Schur–Szeg? composition of $n?1$ polynomials of the form ${(x+1)}^{n?1}(x+a_i)$. We prove geometric properties of the affine mapping associating to the coefficients of S the $(n?1)$-tuple of values of the elementary symmetric functions of the numbers $a_i$. To cite this article: V.P. Kostov, C. R. Acad. Sci. Paris, Ser. I 347 (2009).     

Some new perspectives for solving 0–1 integer programming problems using Balas method

Computational Management Science - Egon Balas’s additive algorithm, also known as implicit enumeration, is a technique that uses a branch-and-bound (B&B) approach to finding optimal...     

A new optimal algorithm for weighted approximation and integration over ℝ

The complexities of weighted approximation and weighted integration problems for univariate functions defined over ℝ have recently been found in [7]. Complexity (almost) optimal algorithms have also been provided therein. In this paper, we propose another class of (almost) optimal algorithms that, for a number of instances, are easier to implement. More importantly, these new algorithms have a cost smaller than the original algorithms from [7]. Since both classes of algorithms are (almost) optimal, their costs differ by a multiplicative constant that depends on the specific weight functions and the error demand. In one of our tests we observed this constant to be as large as four, which means a cost reduction by a factor of four. This revised version was published online in June 2006 with corrections to the Cover Date.     

A theorem connected with results of Steinhaus and Smítal

We will prove that if A and B are subsets of the real line, each having positive outer Lebesgue measure, then A + B, the set of all numbers a + b with a ϵ A and b ϵ B, is “full,” in the sense of outer Lebesgue measure, in some interval K. This result is related to theorems of Steinhaus and Smítal.     

Some aspects of reachability for parabolic boundary control problems with control constraints

A class of one-dimensional parabolic optimal boundary control problems is considered. The discussion includes Neumann, Robin, and Dirichlet boundary conditions. The reachability of a given target state in final time is discussed under box constraints on the control. As a mathematical tool, related exponential moment problems are investigated. Moreover, based on a detailed study of the adjoint state, a technique is presented to find the location and the number of the switching points of optimal bang-bang controls. Numerical examples illustrate this procedure.     

A new predictor–corrector method for solving unconstrained minimization problems

This paper presents a new predictor–corrector method for finding a local minimum of a twice continuously differentiable function. The method successively constructs an approximation to the solution curve and determines a predictor on it using a technique similar to that used in trust region methods for unconstrained optimization. The proposed predictor is expected to be more effective than Euler's predictor in the sense that the former is usually much closer to the solution curve than the latter for the same step size. Results of numerical experiments are reported to demonstrate the effectiveness of the proposed method.     

Some new three-term Hestenes–Stiefel conjugate gradient methods with affine combination

In this paper, a modified Hestenes–Stiefel conjugate gradient method for unconstrained problems is developed, which can achieves the twin goals of generating sufficient descent direction at each iteration as well as being close to the Newton direction. In our methods, the hybridization parameter can also be obtained based on other kinds of conjugacy conditions. Under mild condition, we establish their global convergence for general objective functions. Numerical experimentation with the new method indicates that it efficiently solves the test problems and therefore is promising.     

A new self-adaptive alternating direction method for variational inequality problems with linear equality and inequality constraints

In this paper, we present a new self-adaptive alternating direction method for solving a class of variational inequality problems with both linear equality and inequality constraints without the need to add any extra slack variables. The method is simple because it needs only to perform some projections and function evaluations. In addition, to further enhance its efficiency, we adopt a self-adaptive strategy to adjust parameter μ at each iteration. Convergence of the proposed method is proved under certain conditions. Numerical experience illustrates the efficiency of the new method.     

Some new domains with complete Kähler metrics of negative curvature

We add to the known examples of complete Kähler manifolds with negative sectional curvature by showing that the following three classes of domains in euclidean spaces also belong: perturbations of ellipsoidal domains in ?ⁿ, intersections of complex-ellipsoidal domains in ?², and intersections of fractional linear transforms of the unit ball in ?². In the process, we prove the following theorem in differential geometry: in the intersection of two complex-ellipsoidal domains in ?², the sum of the Bergman metrics is a Kähler metric with negative curvature operator.     

A new symmetric linear eight-step method with fifth trigonometric order for the efficient integration of the Schrödinger equation

On the basis of a classical symmetric eight-step method, an optimized method with fifth trigonometric order for the numerical solution of the Schrödinger equation is developed in this work. The local truncation error analysis of the method proves the decrease of the maximum power of the energy in relation to the corresponding classical method, which renders the method highly efficient. This is confirmed by comparing the method to other methods from the literature while integrating the equation. The superiority of the method is strengthened by the existence of a larger interval of periodicity of the new method in comparison to the corresponding classical method.     

A note on “A new method for solving fully fuzzy linear programming problems”

This note shows that solving fully fuzzy linear programming (FFLP) model presented by Kumar et al. [A. Kumar, J. Kaur, P. Singh, A new method for solving fully fuzzy linear programming problems, Appl. Math. Model. 35 (2011) 817–823] needs some corrections to make the model well in general. A new version is provided in this note. A simple example is also presented to demonstrate the new form.     

A new penalty parameter for linearly constrained 0–1 quadratic programming problems

The equivalence between the linearly constrained 0–1 quadratic programming problem and the continuous quadratic programming problem is studied in this note. Specifically, we show that the existing penalty parameter from the literature can be further improved.     

A consistent talmudic rule for division problems with?multiple references

We consider an extension of the classic division problem with claims, division problems with multiple references. We show that the theory of cooperative games is able to provide a single-valued allocation rule for this class of problems. Moreover, this rule can be related with the Talmud rule for the classic division problem, as in Aumann and Maschler (J. Econ. Theory 36, 195?C213, 1985). Finally, we establish the consistency and other basic properties of the rule.     

Calderón–Zygmund estimates for a class of obstacle problems with nonstandard growth

We prove Calderón–Zygmund type estimates for obstacle problems with so-called \({L^{p(\cdot)} \log L}\)-growth. We also find suitable conditions on the variable exponent \({p(\cdot)}\) and the coefficients of the obstacle problems to obtain desired estimates.     

A new Liu–Storey type nonlinear conjugate gradient method for unconstrained optimization problems

Although the Liu–Storey (LS) nonlinear conjugate gradient method has a similar structure as the well-known Polak–Ribière–Polyak (PRP) and Hestenes–Stiefel (HS) methods, research about this method is very rare. In this paper, based on the memoryless BFGS quasi-Newton method, we propose a new LS type method, which converges globally for general functions with the Grippo–Lucidi line search. Moreover, we modify this new LS method such that the modified scheme is globally convergent for nonconvex minimization if the strong Wolfe line search is used. Numerical results are also reported.     

A new proof of the Komlós-Révész-theorem

The Komlós-Révész theorem states: For r.v.s.X _n with X _{n 1}M there exists a subsequenceX _{k n} and a r.v.X with X₁M such that