On the complexity of strongly connected components in directed hypergraphs

We study the complexity of some algorithmic problems on directed hypergraphs and their strongly connected components (SCCs). The main contribution is an almost linear time algorithm computing the terminal strongly connected components (i.e. SCCs which do not reach any components but themselves). "Almost linear" here means that the complexity of the algorithm is linear in the size of the hypergraph up to a factor alpha(n), where alpha is the inverse of Ackermann function, and n is the number of vertices. Our motivation to study this problem arises from a recent application of directed hypergraphs to computational tropical geometry. We also discuss the problem of computing all SCCs. We establish a superlinear lower bound on the size of the transitive reduction of the reachability relation in directed hypergraphs, showing that it is combinatorially more complex than in directed graphs. Besides, we prove a linear time reduction from the well-studied problem of finding all minimal sets among a given family to the problem of computing the SCCs. Only subquadratic time algorithms are known for the former problem. These results strongly suggest that the problem of computing the SCCs is harder in directed hypergraphs than in directed graphs.Comment: v1: 32 pages, 7 figures; v2: revised version, 34 pages, 7 figure

Ownership and control in a competitive industry

We study a differentiated product market in which an investor initially owns a controlling stake in one of two competing firms and may acquire a non-controlling or a controlling stake in a competitor, either directly using her own assets, or indirectly via the controlled firm. While industry profits are maximized within a symmetric two product monopoly, the investor attains this only in exceptional cases. Instead, she sometimes acquires a noncontrolling stake. Or she invests asymmetrically rather than pursuing a full takeover if she acquires a controlling one. Generally, she invests indirectly if she only wants to affect the product market outcome, and directly if acquiring shares is profitable per se. --differentiated products,separation of ownership and control,private benefits of control

Euclid preparation: XVII. Cosmic dawn survey: Spitzer space telescope observations of the Euclid deep fields and calibration fields

Galaxie

Euclid preparation. XV. Forecasting cosmological constraints for the Euclid and CMB joint analysis

Galaxie

Euclid preparation: XVIII. The NISP photometric system

Galaxie

Anisotropic Metal-enriched Outflows Driven by AGN in Clusters of Galaxies

International audienc

Euclid preparation VIII. The Complete Calibration of the Colour-Redshift Relation survey : VLT/KMOS observations and data release

The Complete Calibration of the Colour-Redshift Relation survey (C3R2) is a spectroscopic e ffort involving ESO and Keck facilities designed specifically to empirically calibrate the galaxy colour-redshift relation - P(z jC) to the Euclid depth (iAB = 24 :5) and is intimately linked to the success of upcoming Stage IV dark energy missions based on weak lensing cosmology. The aim is to build a spectroscopic calibration sample that is as representative as possible of the galaxies of the Euclid weak lensing sample. In order to minimise the number of spectroscopic observations necessary to fill the gaps in current knowledge of the P(z jC), self-organising map (SOM) representations of the galaxy colour space have been constructed. Here we present the first results of an ESO@VLT Large Programme approved in the context of C3R2, which makes use of the two VLT optical and near-infrared multi-object spectrographs, FORS2 and KMOS. This data release paper focuses on high-quality spectroscopic redshifts of high-redshift galaxies observed with the KMOS spectrograph in the near-infrared H- and K-bands. A total of 424 highly-reliable redshifts are measured in the 1:3 2 galaxies.Peer reviewe