Deciding the existence of uniform interpolants over transitive models

We consider the problem of the existence of uniform interpolants in the modal logic K4. We first prove that all ${\square}$ -free formulas have uniform interpolants in this logic. In the general case, we shall prove that given a modal formula ${\phi}$ and a sublanguage L of the language of the formula, we can decide whether ${\phi}$ has a uniform interpolant with respect to L in K4. The ${\square}$ -free case is proved using a reduction to the G?del L?b Logic GL, while in the general case we prove that the question of whether a modal formula has uniform interpolants over transitive frames can be reduced to a decidable expressivity problem on the???-calculus.     

Quasidiagonal Solutions of the Yang–Baxter Equation, Quantum Groups and Quantum Super Groups

This paper answers a few questions about algebraic aspects of bialgebras, associated with the family of solutions of the quantum Yang–Baxter equation in Acta Appl. Math. 41 (1995), pp. 57–98. We describe the relations of the bialgebras associated with these solutions and the standard deformations of GL_n and of the supergroup GL(m|n). We also show how the existence of zero divisors in some of these algebras are related to the combinatorics of their related matrix, providing a necessary and sufficient condition for the bialgebras to be a domain. We consider their Poincaré series, and we provide a Hopf algebra structure to quotients of these bialgebras in an explicit way. We discuss the problems involved with the lift of the Hopf algebra structure, working only by localization.     

On the stereochemistry of photoaddition between α,β-unsaturated ketones and olefins—II

Some years ago an empirical rule, which allows the prediction of product stereochemistry in cis-photocycloaddition reactions of α,β-unsaturated ketones and olefins was tentatively proposed. Several additional examples, both selected from the literature and synthesized in our laboratory, seem to strengthen the validity of the rule.     

On solving the Lagrangian dual of integer programs via an incremental approach

The Lagrangian dual of an integer program can be formulated as a min-max problem where the objective function is convex, piecewise affine and, hence, nonsmooth. It is usually tackled by means of subgradient algorithms, or multiplier adjustment techniques, or even more sophisticated nonsmooth optimization methods such as bundle-type algorithms. Recently a new approach to solving unconstrained convex finite min-max problems has been proposed, which has the nice property of working almost independently of the exact evaluation of the objective function at every iterate-point.     

Elliptic systems with nonlinearity q greater or equal than two with controlled growth. Global Hölder continuity of solutions to the Dirichlet problem

Hölder regularity up to the boundary of the solutions to the Dirichlet problem for second order elliptic systems with nonlinearity q>2 and with controlled growth is proved when n?q+2.     

Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations

We introduce a proximal bundle method for the numerical minimization of a nonsmooth difference-of-convex (DC) function. Exploiting some classic ideas coming from cutting-plane approaches for the convex case, we iteratively build two separate piecewise-affine approximations of the component functions, grouping the corresponding information in two separate bundles. In the bundle of the first component, only information related to points close to the current iterate are maintained, while the second bundle only refers to a global model of the corresponding component function. We combine the two convex piecewise-affine approximations, and generate a DC piecewise-affine model, which can also be seen as the pointwise maximum of several concave piecewise-affine functions. Such a nonconvex model is locally approximated by means of an auxiliary quadratic program, whose solution is used to certify approximate criticality or to generate a descent search-direction, along with a predicted reduction, that is next explored in a line-search setting. To improve the approximation properties at points that are far from the current iterate a supplementary quadratic program is also introduced to generate an alternative more promising search-direction. We discuss the main convergence issues of the line-search based proximal bundle method, and provide computational results on a set of academic benchmark test problems.     

Laplace equations,Lefschetz properties and line arrangements

In this note we extend the main result in [6] on artinian ideals failing Lefschetz properties, varieties satisfying Laplace equations and existence of suitable singular hypersurfaces. Moreover we characterize the minimal generation of ideals generated by powers of linear forms by the configuration of their dual points in the projective plane and we use this result to improve some propositions on line arrangements and Strong Lefschetz Property at range 2 in [6]. The starting point was an example in [3]. Finally we show the equivalence among failing SLP, Laplace equations and some unexpected curves introduced in [3].     

Multiplicity of positive and nodal solutions for scalar field equations

In this paper the question of finding infinitely many solutions to the problem −Δu+a(x)u=|u|^p−2u$-\mathrm{\Delta }u+a(x)u={|u|}^{p-2}u$, in R^N${\mathbb{R}}^N$, u∈H¹(R^N)$u\in H^1({\mathbb{R}}^N)$, is considered when N≥2$N\ge 2$, p∈(2,2N/(N−2))$p\in (2,2N/(N-2))$, and the potential a(x)$a(x)$ is a positive function which is not required to enjoy symmetry properties. Assuming that a(x)$a(x)$ satisfies a suitable “slow decay at infinity” condition and, moreover, that its graph has some “dips”, we prove that the problem admits either infinitely many nodal solutions or infinitely many constant sign solutions. The proof method is purely variational and allows to describe the shape of the solutions.