The multiplicative fragment of second order propositional linear logic is shown to be undecidable.

We state and prove a Local Stable Manifold Theorem (Theorem 4.1) for non-linear stochastic differential systems with finite memory (viz. stochastic functional differential equations (sfde’s)). We introduce the notion of hyperbolicity for stationary trajectories of sfde’s. We then establish the existence of smooth stable and unstable manifolds in a neighborhood of a hyperbolic stationary traject...

We give a series of glueing constructions for categorical models of fragments of linear logic. Specifically, we consider the glueing of (i) symmetric monoidal closed categories (models of Multiplicative Intuitionistic Linear Logic), (ii) symmetric monoidal adjunctions (for interpreting the modality !) and (iii) -autonomous categories (models of Multiplicative Linear Logic); the glueing construc...

There are several kinds of hyperrings, for example, Krasnerhyperrings, multiplicative hyperring, general hyperrings and$H_v$-rings. In a multiplicative hyperring, the multiplication isa hyperoperation, while the addition is a binary operation. In this paper, the notion of derivation on multiplicative hyperrings is introduced and some related properties are investigated. {bf Keywords:} multiplic...

Multiplicative update rules have proven useful in many areas of machine learning. Simple to implement, guaranteed to converge, they account in part for the widespread popularity of algorithms such as nonnegative matrix factorization and Expectation-Maximization. In this paper, we show how to derive multiplicative updates for problems in L1-regularized linear and logistic regression. For L1–regu...

A bstract This paper addresses itself to an algorithm for a convex minimization problem with an additional convex multiplicative constraint. A convex multiplicative constraint is such that a product of two convex functions is less than or equal to some constant. It is shown that this non convex problem can be solved by solving a sequence of convex programming problems. The basic idea of this al...

Multiplicative linear secret sharing is a fundamental notion in the area of secure multiparty computation (MPC) and, since recently, in the area of two-party cryptography as well. In a nutshell, this notion guarantees that “the product of two secrets is obtained as a linear function of the vector consisting of the coordinate-wise product of two respective share-vectors”. This paper focuses on t...