Dependence of Topological Conjugacies on Parameters

For impulsive differential equations, we establish the existence of invariant stable manifolds under sufficiently small perturbations of a linear equation. We consider the general case of nonautonomous equations for which the linear part has a nonuniform exponential dichotomy. One of the main advantages of our work is that our results are optimal, in the sense that for vector fields of class C ¹ outside the jumping times, we show that the invariant manifolds are also of class C ¹ outside these times. The novelty of our proof is the use of the fiber contraction principle to establish the smoothness of the invariant manifolds. In addition, using the same approach we can also consider linear perturbations.     

Two-stage data segmentation permitting multiscale change points,heavy tails and dependence

Annals of the Institute of Statistical Mathematics - The segmentation of a time series into piecewise stationary segments is an important problem both in time series analysis and signal processing....     

The core of zero-dimensional monomial ideals

The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas.     

Reversibility of Conjugacies for Nonautonomous Equations

We establish a reversible version of the Grobman–Hartman theorem for nonautonomous differential equations in Banach spaces. Namely, we show that if the differential equation is reversible, then the topological conjugacies in the Grobman–Hartman theorem also commute with the symmetries. The result is illustrated with an example.     

A note on weakly hyperbolic equations with analytic principal part

In this note we show how to include low order terms in the C^∞$C^{\infty }$ well-posedness results for weakly hyperbolic equations with analytic time-dependent coefficients. This is achieved by doing a different reduction to a system from the previously used one. We find the Levi conditions such that the C^∞$C^{\infty }$ well-posedness continues to hold.     

P-stable models of strong kernel programs

The research community has long recognized the study of non-monotonic reasoning (NMR) as a promising approach to model features of commonsense reasoning. We study one of the semantics that are useful to formalize NMR, called the p-stable semantics. We introduce three different formats for normal programs: negative normal programs, restricted negative normal programs and strong kernel programs. These forms help to simplify the search of p-stable models of the original program. One of the main results of this paper indicates that the p-stable semantics for strong kernel programs is the same as the stable semantics. This way, all the applications based on stable semantics for those kernel programs (defined in [S. Costantini, A. Provetti, Normal forms for answer set programming, J. Theory Pract. Log. Program. 5 (2005) 747-760]) that are strong kernel programs can also be based on the p-stable semantics.     

Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization

We introduce a new method for solving box-constrained mixed-integer polynomial problems to global optimality. The approach, a specialized branch-and-bound algorithm, is based on the computation of lower bounds provided by the minimization of separable underestimators of the polynomial objective function. The underestimators are the novelty of the approach because the standard approaches in global optimization are based on convex relaxations. Thanks to the fact that only simple bound constraints are present, minimizing the separable underestimator can be done very quickly. The underestimators are computed monomial-wise after the original polynomial has been shifted. We show that such valid underestimators exist and their degree can be bounded when the degree of the polynomial objective function is bounded, too. For the quartic case, all optimal monomial underestimators are determined analytically. We implemented and tested the branch-and-bound algorithm where these underestimators are hardcoded. The comparison against standard global optimization and polynomial optimization solvers clearly shows that our method outperforms the others, the only exception being the binary case where, though, it is still competitive. Moreover, our branch-and-bound approach suffers less in case of dense polynomial objective function, i.e., in case of polynomials having a large number of monomials. This paper is an extended and revised version of the preliminary paper [4].     

P-Partitions and the plactic congruence

A conjecture of Stanley states that if the generating function of a posetP is symmetric, then in factP belongs to the family of posets induced by some skew shape /. In this paper we show that if the setL(P) of the linear extensions of a posetP is plactic-closed, thenP is a poset induced by a skew shape.Supported by LA CIM-UQAM and Consiglio Nazionale delle Ricerche     

Stable Manifolds and Nonuniform Hyperbolicity: Optimal Estimates

We establish the existence of invariant stable manifolds for C ¹ perturbations of a nonuniform exponential dichotomy with an arbitrary nonuniform part. We consider the general case of sequences of maps, which corresponds to a nonautonomous dynamics with discrete time. We also obtain optimal estimates for the decay of trajectories along the stable manifolds. The optimal C ¹ smoothness of the invariant manifolds is obtained using an invariant family of cones.