We combine lensing, stellar kinematic and mass-to-light ratio constraints to build a twocomponent (luminous plus dark) mass model of the early-type lens galaxy in PG1115+080. We find a total mass density profile steeper than r, effectively ρ ∝ r ′ with γ = 2.35± 0.1± 0.05 (random + systematic). The stellar mass fraction is f∗ = 0.67 +0.20 −0.25 ± 0.03 inside the Einstein Radius (RE≈1.2 effectiv...

We investigate the computational complexity of two decision problems on hypergraphs, namely the Spanning Acyclic Subhypergraph problem and the Maximal Acyclic Subhypergraph problem. The former is the existence of an acyclic subhypergraph such that each vertex of the input hypergraph is contained in at least one hyperedge of the subhypergraph. The latter is the existence of an acyclic subhypergr...

introduction sectoral retinitis pigmentosa (rp) is a rare clinical condition. case presentation we present a 60-year-old female with a history of mild night blindness and decreased vision in the left eye for about 15 years. conclusions fundus examination revealed retinal pigmentary changes in the inferotemporal sector and reduced arterial caliber. in addition, fundus autofluorescence, fluoresce...

The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with bounded-degree instances, for constraint languages containing the two unary constant relations {0} and {1}. When the maximum degree is at least 25 we obtain a complete classification of the complexity of this probl...

The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with bounded-degree instances, for constraint languages containing the two unary constant relations {0} and {1}. When the maximum degree is at least 25 we obtain a complete classification of the complexity of this probl...