New results on q-positivity

In this paper we discuss symmetrically self-dual spaces, which are simply real vector spaces with a symmetric bilinear form. Certain subsets of the space will be called q-positive, where q is the quadratic form induced by the original bilinear form. The notion of q-positivity generalizes the classical notion of the monotonicity of a subset of a product of a Banach space and its dual. Maximal q-positivity then generalizes maximal monotonicity. We discuss concepts generalizing the representations of monotone sets by convex functions, as well as the number of maximally q-positive extensions of a q-positive set. We also discuss symmetrically self-dual Banach spaces, in which we add a Banach space structure, giving new characterizations of maximal q-positivity. The paper finishes with two new examples.Comment: 18 page

A convex representation of totally balanced games

AbstractWe analyze the least increment function, a convex function of n variables associated to an n-person cooperative game. Another convex representation of cooperative games, the indirect function, has previously been studied. At every point the least increment function is greater than or equal to the indirect function, and both functions coincide in the case of convex games, but an example shows that they do not necessarily coincide if the game is totally balanced but not convex. We prove that the least increment function of a game contains all the information of the game if and only if the game is totally balanced. We also give necessary and sufficient conditions for a function to be the least increment function of a game as well as an expression for the core of a game in terms of its least increment function

New insights into the genetic etiology of Alzheimer's disease and related dementias

Characterization of the genetic landscape of Alzheimer's disease (AD) and related dementias (ADD) provides a unique opportunity for a better understanding of the associated pathophysiological processes. We performed a two-stage genome-wide association study totaling 111,326 clinically diagnosed/'proxy' AD cases and 677,663 controls. We found 75 risk loci, of which 42 were new at the time of analysis. Pathway enrichment analyses confirmed the involvement of amyloid/tau pathways and highlighted microglia implication. Gene prioritization in the new loci identified 31 genes that were suggestive of new genetically associated processes, including the tumor necrosis factor alpha pathway through the linear ubiquitin chain assembly complex. We also built a new genetic risk score associated with the risk of future AD/dementia or progression from mild cognitive impairment to AD/dementia. The improvement in prediction led to a 1.6- to 1.9-fold increase in AD risk from the lowest to the highest decile, in addition to effects of age and the APOE ε4 allele

A formula on the approximate subdifferential of the difference of convex functions

International audienc

Motzkin decomposition of closed convex sets

Theodore Motzkin proved, in 1936, that any polyhedral convex set can be expressed as the (Minkowski) sum of a polytope and a polyhedral convex cone. This paper provides five characterizations of the larger class of closed convex sets in finite dimensional Euclidean spaces which are the sum of a compact convex set with a closed convex cone. These characterizations involve different types of representations of closed convex sets as the support functions, dual cones and linear systems whose relationships are also analyzed in the paper. The obtaining of information about a given closed convex set F and the parametric linear optimization problem with feasible set F from each of its different representations, including the Motzkin decomposition, is also discussed.This work has been supported by MICINN of Spain, Grants MTM2008-06695-C03-01/03, by Generalitat Valenciana, by Generalitat de Catalunya, by the Barcelona GSE Research Network, and by CONACyT of Mexico, Grant 55681