Iterating the Cesàro operators

The discrete Cesàro operator associates to a given complex sequence the sequence , where . When is a convergent sequence we show that converges under the sup-norm if, and only if, . For its adjoint operator , we establish that converges for any .

The continuous Cesàro operator, , has two versions: the finite range case is defined for and the infinite range case for . In the first situation, when is continuous we prove that converges under the sup-norm to the constant function . In the second situation, when is a continuous function having a limit at infinity, we prove that converges under the sup-norm if, and only if, .

     

On the approximation of convex functions by Bernstein-type operators

As a consequence of Jensen's inequality, centered operators of probabilistic type (also called Bernstein-type operators) approximate convex functions from above. Starting from this fact, we consider several pairs of classical operators and determine, in each case, which one is better to approximate convex functions. In almost all the discussed examples, the conclusion follows from a simple argument concerning composition of operators. However, when comparing Szász-Mirakyan operators with Bernstein operators over the positive semi-axis, the result is derived from the convex ordering of the involved probability distributions. Analogous results for non-centered operators are also considered.     

Effect of 300 and 500 MPa pressure treatments on starch–water adsorption/desorption isotherms and hysteresis

Pressure treatments of 300 and 500?MPa during 15?min were found to change starch–water sorption (adsorption and desorption) isotherms and the hysteresis effect, particularly the 500?MPa. This last treatment shifted the adsorption/desorption isotherms downward, compared with non-treated starch and starch treated at 300?MPa. The observed hysteresis effect decreased with the increase in pressure level in the whole a_w range, indicating that adsorption and desorption isotherms became closer. Guggenheim–Anderson–De Boer and Brunauer–Emmett–Teller model parameters Cb, Cg, K and Mm also showed changes caused by pressure, the latter being lower in the pressure-processed samples, thus indicating possible changes on microbial and (bio)chemical stabilities of pressure-processed food products containing starch.     

Augmented Lagrangian Algorithms Based on the Spectral Projected Gradient Method for Solving Nonlinear Programming Problems

The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP.     

Towards the Evaluation of the Relevant Degrees of Freedom in Nonlinear Partial Differential Equations

We investigate an operator renormalization group method to extract and describe the relevant degrees of freedom in the evolution of partial differential equations. The proposed renormalization group approach is formulated as an analytical method providing the fundamental concepts of a numerical algorithm applicable to various dynamical systems. We examine dynamical scaling characteristics in the short-time and the long-time evolution regime providing only a reduced number of degrees of freedom to the evolution process.     

On Influence of Contranormal Subgroups on the Structure of Infinite Groups

Following Rose, a subgroup H of a group G is called contranormal, if G = H ^G . In certain sense, contranormal subgroups are antipodes to subnormal subgroups. It is well known that a finite group is nilpotent if and only if it has no proper contranormal subgroups. However, for the infinite groups this criterion is not valid. There are examples of non-nilpotent infinite groups whose subgroups are subnormal; in paricular, these groups have no contranormal subgroups. Nevertheless, for some classes of infinite groups, the absence of contranormal subgroups implies the nilpotency of the group. The current article is devoted to the search of such classes. Some new criteria of nilpotency in certain classes of infinite groups have been established.     

Minimum sum set coloring of trees and line graphs of trees

In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices is empty and the sum of the assigned set of numbers to each vertex of the graph is minimum. The MSSC problem occurs in two versions: non-preemptive and preemptive. We show that the MSSC problem is strongly NP-hard both in the preemptive case on trees and in the non-preemptive case in line graphs of trees. Finally, we give exact parameterized algorithms for these two versions on trees and line graphs of trees.     

Ricci dark energy in Chern–Simons modified gravity

In this work, we have considered the Ricci dark energy model, where the energy density of the universe is proportional to the Ricci scalar curvature, in the dynamic Chern–Simons modified gravity. We show that in this context the evolution of the scale factor is similar to that displayed by the modified Chaplygin gas.     

On the Kadomtsev-Petviashvili Equation and Associated Constraints

The initial-boundary-value problem for the Kadomtsev-Petviashvili equation in infinite space is considered. When formulated as an evolution equation, found that a symmetric integral is the appropriate choice in the nonlocal term; namely, . If one simply chooses , then an infinite number of constraints on the initial data in physical space are required, the first being . The conserved quantities are calculated, and it is shown that they must be suitably regularized from those that have been used when the constraints are imposed.