Systems of differential inclusions with maximal monotone terms

In this paper, we establish the existence of solutions to systems of second order differential inclusions with maximal monotone terms. Our proofs rely on the theory of maximal monotone operators and the Schauder degree theory. A notion of solution-tube to these problems is introduced. This notion generalizes the notion of upper and lower solutions of second order differential equations.     

Transfinite Diameter with Generalized Polynomial Degree

Potential Analysis - We prove a Chebyshev transform formula for a notion of (weighted) transfinite diameter that is defined using a generalized notion of polynomial degree. We also generalize Leja...     

Systems of first order differential inclusions with maximal monotone terms

In this paper, we establish the existence of solutions to systems of first order differential inclusions with maximal monotone terms satisfying the periodic boundary condition. Our proofs rely on the theory of maximal monotone operators, and the Schauder and the Kakutani fixed point theorems. A notion of solution-tube to these problems is introduced. This notion generalizes the notion of upper and lower solutions of first order differential equations.     

On the Comparison of Relative Spacings with Applications

In this paper we introduce the notion of relative spacings. We show the interest of this notion in several contexts like reliability and economy, and we provide several results for the comparison of relative spacings from two populations.     

Closure Operators with Respect to a Functor

A notion of closure operator with respect to a functor U is introduced. This allows us to describe a number of mathematical constructions that could not be described by means of the already existing notion of closure operator. Some basic results and examples are provided.     

Cooperative games with coalition structures

Many game-theoretic solution notions have been defined or can be defined not only with reference to the all-player coalition, but also with reference to an arbitrary coalition structure. In this paper, theorems are established that connect a given solution notion, defined for a coalition structure ? with the same solution notion applied to appropriately defined games on each of the coalitions in ?. This is done for the kernel, nucleolus, bargaining set, value, core, and thevon Neumann-Morgenstern solution. It turns out that there is a single function that plays the central role in five out of the six solution notions in question, though each of these five notions is entirely different. This is an unusual instance of a game theoretic phenomenon that does not depend on a particular solution notion but holds across a wide class of such notions.     

Universal Padé approximants with respect to the chordal metric

The use of the chordal distance does not change the notion of Universal Taylor series. However, it changes the notion of Universal Padé approximants. Using Padé approximants of meromorphic or holomorphic functions we can approximate all rational functions on compact sets of arbitrary connectivity.     

A model with no strongly separable almost disjoint families

We answer a question of Shelah and Steprāns [6] by producing a model of ZFC where there are no strongly separable almost disjoint families. The notion of a strongly separable almost disjoint family is a natural variation on the well known notion of a completely separable almost disjoint family, and is closely related to the metrization problem for countable Fréchet groups.     

On properties of fuzzy hyperideals in hypernear-rings with t-Norms

By means of the use of a triangular normT, the notion ofT-fuzzy hyperideals in hypernear-rings is stated, and basic properties are investigated. Moreover, the notion of Noetherian hypernear-rings is introduced, and its characterization is given. At last, the properties of quotient hypernear-rings andT-fuzzy characteristic hyperideals are discussed.     

Formal power series with cyclically ordered exponents

We define and study a notion of ring of formal power series with exponents in a cyclically ordered group. Such a ring is a quotient of various subrings of classical formal power series rings. It carries a two variable valuation function. In the particular case where the cyclically ordered group is actually totally ordered, our notion of formal power series is equivalent to the classical one in a language enriched with a predicate interpreted by the set of all monomials.Received: 24 February 2003     

First-order methods of smooth convex optimization with inexact oracle

We introduce the notion of inexact first-order oracle and analyze the behavior of several first-order methods of smooth convex optimization used with such an oracle. This notion of inexact oracle naturally appears in the context of smoothing techniques, Moreau–Yosida regularization, Augmented Lagrangians and many other situations. We derive complexity estimates for primal, dual and fast gradient methods, and study in particular their dependence on the accuracy of the oracle and the desired accuracy of the objective function. We observe that the superiority of fast gradient methods over the classical ones is no longer absolute when an inexact oracle is used. We prove that, contrary to simple gradient schemes, fast gradient methods must necessarily suffer from error accumulation. Finally, we show that the notion of inexact oracle allows the application of first-order methods of smooth convex optimization to solve non-smooth or weakly smooth convex problems.     

Existence Theorems in Vector Optimization with Generalized Order

In the present paper, we establish some results for the existence of optimal solutions in vector optimization in infinite-dimensional spaces, where the optimality notion is understood in the sense of generalized order (may not be convex and/or conical). This notion is induced by the concept of set extremality and covers many of the conventional notions of optimality in vector optimization. Some sufficient optimality conditions for optimal solutions of a class of vector optimization problems, which satisfies the free disposal hypothesis, are also examined.     

Exceptional Families of Elements for Optimization Problems in Reflexive Banach Spaces with Applications

In this paper, we propose a new notion of ‘exceptional family of elements’ for convex optimization problems. By employing the notion of ‘exceptional family of elements’, we establish some existence results for convex optimization problem in reflexive Banach spaces. We show that the nonexistence of an exceptional family of elements is a sufficient and necessary condition for the solvability of the optimization problem. Furthermore, we establish several equivalent conditions for the solvability of convex optimization problems. As applications, the notion of ‘exceptional family of elements’ for convex optimization problems is applied to the constrained optimization problem and convex quadratic programming problem and some existence results for solutions of these problems are obtained.     

Tensor approach to the problem of averaging differential equations with δ-correlated random coefficients

Linear ordinary differential equations with δ-correlated random coefficients are considered. We introduce the notion of linearizing tensor and use this notion to construct an algorithm for deriving differential equations for higher-order statistical moments of the solution of arbitrary positive integer orders.     

Vector subspaces and operators with the Stone condition

We introduce the notion of an operating function on a subset of a F{\Phi} -algebra E. Then we use this notion to generalize results from Huijsmans and de Pagter (Proc. Lond. Math. Soc. 48:161–174, 1984) about the connection between vector subspaces and subalgebras of E. In the second part we investigate the analogous problem for operators.     

The computational complexity of the criticality problems in a network with interval activity times

The paper analyzes the criticality in a network with interval activities duration times. A natural generalization of the criticality notion (for a path, an activity and an event) for the case of network with interval activity duration times is given. The computation complexity of five problems linked to the introduced criticality notion is presented.     

A Generalization of Mixed Problems with an Application to Multiobjective Optimal Control

This paper generalizes to multiobjective optimization the notion of mixed problems as Philippe Michel calls it for single-objective optimization. This notion is then applied to a multiobjective control problem under constraints in the discrete time framework to obtain strong Pontryagin maximum principles in the finite-horizon case. The infinite-horizon case is also treated with conditions ensuring that the multipliers associated to the objective functions are not all zero.     

Pseudo core inverses in rings with involution

Let R be a ring with involution. In this paper, we introduce a new type of generalized inverse called pseudo core inverse in R. The notion of core inverse was introduced by Baksalary and Trenkler for matrices of index 1 in 2010 and then it was generalized to an arbitrary ?-ring case by Raki?, Din?i? and Djordjevi? in 2014. Our definition of pseudo core inverse extends the notion of core inverse to elements of an arbitrary index in R. Meanwhile, it generalizes the notion of core-EP inverse, introduced by Manjunatha Prasad and Mohana for matrices in 2014, to the case of ?-ring. Some equivalent characterizations for elements in R to be pseudo core invertible are given and expressions are presented especially in terms of Drazin inverse and {1,3}-inverse. Then, we investigate the relationship between pseudo core inverse and other generalized inverses. Further, we establish several properties of the pseudo core inverse. Finally, the computations for pseudo core inverses of matrices are exhibited.     

Stability of dichotomies in difference equations with infinite delay

For delay difference equations with infinite delay we consider the notion of nonuniform exponential dichotomy. This includes the notion of uniform exponential dichotomy as a very special case. Our main aim is to establish a stable manifold theorem under sufficiently small nonlinear perturbations. We also establish the robustness of nonuniform exponential dichotomies under sufficiently small linear perturbations. Finally, we characterize the nonuniform exponential dichotomies in terms of strict Lyapunov sequences. In particular, we construct explicitly a strict Lyapunov sequence for each exponential dichotomy.     

Buchsbaum Stanley-Reisner rings with minimal multiplicity

In this paper, we study Buchsbaum Stanley-Reisner rings with linear free resolution. We introduce the notion of Buchsbaum Stanley-Reisner rings with minimal multiplicity of initial degree , which extends the notion of Buchsbaum rings with minimal multiplicity defined by Goto. As an application, we give many examples of non-Cohen-Macaulay Buchsbaum Stanley-Reisner rings with linear resolution.