CD-independent subsets in meet-distributive lattices

A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice have the same number of elements. In this paper, we prove that if $L$ is a finite meet-distributive lattice, then the size of every CD-independent subset of $L$ is at most the number of atoms of $L$ plus the length of $L$. If, in addition, there is no three-element antichain of meet-irreducible elements, then we give a recursive description of maximal CD-independent subsets. Finally, to give an application of CD-independent subsets, we give a new approach to count islands on a rectangular board.Comment: 14 pages, 4 figure

KP line solitons and Tamari lattices

The KP-II equation possesses a class of line soliton solutions which can be qualitatively described via a tropical approximation as a chain of rooted binary trees, except at "critical" events where a transition to a different rooted binary tree takes place. We prove that these correspond to maximal chains in Tamari lattices (which are poset structures on associahedra). We further derive results that allow to compute details of the evolution, including the critical events. Moreover, we present some insights into the structure of the more general line soliton solutions. All this yields a characterization of possible evolutions of line soliton patterns on a shallow fluid surface (provided that the KP-II approximation applies).Comment: 49 pages, 36 figures, second version: section 4 expande

Adherence with statins in a real-life setting is better when associated cardiovascular risk factors increase: a cohort study

<p>Abstract</p> <p>Background</p> <p>While the factors for poor adherence for treatment with statins have been highlighted, the impact of their combination on adherence is not clear.</p> <p>Aims</p> <p>To estimate adherence for statins and whether it differs according to the number of cardiovascular risk factors.</p> <p>Methods</p> <p>A cohort study was conducted using data from the main French national health insurance system reimbursement database. Newly treated patients with statins between September 1 and December 31, 2004 were included. Patients were followed up 15 months. The cohort was split into three groups according to their number of additional cardiovascular risk factors that included age and gender, diabetes mellitus and cardiovascular disease (using co-medications as a <it>proxy</it>). Adherence was assessed for each group by using four parameters: <it>(i) </it>proportion of days covered by statins, <it>(ii) </it>regularity of the treatment over time, <it>(iii) </it>persistence, and <it>(iv) </it>the refill delay.</p> <p>Results</p> <p>16,397 newly treated patients were identified. Of these statin users, 21.7% did not have additional cardiovascular risk factors. Thirty-one percent had two cardiovascular risk factors and 47% had at least three risk factors. All the parameters showed a sub-optimal adherence whatever the group: days covered ranged from 56% to 72%, regularity ranged from 23% to 33% and persistence ranged from 44% to 59%, but adherence was better for those with a higher number of cardiovascular risk factors.</p> <p>Conclusions</p> <p>The results confirm that long-term drug treatments are a difficult challenge, particularly in patients at lower risk and invite to the development of therapeutic education.</p

Whiting–related sediment export along the Middle Miocene carbonate ramp of Great Bahama Bank.

International audienc

Abstract Concept Lattices

International audienceWe present a view of abstraction based on a structure preserving reduction of the Galois connection between a language of terms and the powerset of a set of instances O. Such a relation is materialized as an extension-intension lattice, namely a concept lattice when L is the powerset of a set P of attributes. We define and characterize an abstraction A as some part of either the language or the powerset of O, defined in such a way that the extension-intension latticial structure is preserved. Such a structure is denoted for short as an abstract lattice. We discuss the extensional abstract lattices obtained by so reducing the powerset of O, together together with the corresponding abstract implications, and discuss alpha lattices as particular abstract lattices. Finally we give formal framework allowing to define a generalized abstract lattice whose language is made of terms mixing abstract and non abstract conjunctions of properties

MIX STAR-AUTONOMOUS QUANTALES AND THE CONTINUOUS WEAK ORDER

International audienceThe set of permutations on a finite set can be given a lattice structure (known as the weak Bruhat order). The lattice structure is generalized to the set of words on a fixed alphabet Σ = { x, y, z,. .. }, where each letter has a fixed number of occurrences (these lattices are known as multinomial lattices and, in dimension 2, as lattices of lattice paths). By interpreting the letters x, y, z,. .. as axes, these words can be interpreted as discrete increasing paths on a grid of a d-dimensional cube, where d = card(Σ). We show in this paper how to extend this order to images of continuous monotone paths from the unit interval to a d-dimensional cube. The key tool used to realize this construction is the quantale L ∨ (I) of join-continuous functions from the unit interval to itself; the construction relies on a few algebraic properties of this quantale: it is-autonomous and it satisfies the mix rule. We begin developing a structural theory of these lattices by characterizing join-irreducible elements, and by proving these lattices are generated from their join-irreducible elements under infinite joins