Perron-Frobenius theorem for nonnegative multilinear forms and extensions

We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to the unique normalized eigenvector.Comment: 13 page

Computing the vertices of tropical polyhedra using directed hypergraphs

We establish a characterization of the vertices of a tropical polyhedron defined as the intersection of finitely many half-spaces. We show that a point is a vertex if, and only if, a directed hypergraph, constructed from the subdifferentials of the active constraints at this point, admits a unique strongly connected component that is maximal with respect to the reachability relation (all the other strongly connected components have access to it). This property can be checked in almost linear-time. This allows us to develop a tropical analogue of the classical double description method, which computes a minimal internal representation (in terms of vertices) of a polyhedron defined externally (by half-spaces or hyperplanes). We provide theoretical worst case complexity bounds and report extensive experimental tests performed using the library TPLib, showing that this method outperforms the other existing approaches.Comment: 29 pages (A4), 10 figures, 1 table; v2: Improved algorithm in section 5 (using directed hypergraphs), detailed appendix; v3: major revision of the article (adding tropical hyperplanes, alternative method by arrangements, etc); v4: minor revisio

Cyclic projectors and separation theorems in idempotent convex geometry

Semimodules over idempotent semirings like the max-plus or tropical semiring have much in common with convex cones. This analogy is particularly apparent in the case of subsemimodules of the n-fold cartesian product of the max-plus semiring it is known that one can separate a vector from a closed subsemimodule that does not contain it. We establish here a more general separation theorem, which applies to any finite collection of closed semimodules with a trivial intersection. In order to prove this theorem, we investigate the spectral properties of certain nonlinear operators called here idempotent cyclic projectors. These are idempotent analogues of the cyclic nearest-point projections known in convex analysis. The spectrum of idempotent cyclic projectors is characterized in terms of a suitable extension of Hilbert's projective metric. We deduce as a corollary of our main results the idempotent analogue of Helly's theorem.Comment: 20 pages, 1 figur

Containment and equivalence of weighted automata: Probabilistic and max-plus cases

This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps from words to real values. Given two weighted automata, the equivalence problem asks whether their semantics are the same, and the containment problem whether one is point-wise smaller than the other one. These problems have been studied intensively and this paper will review some techniques used to show (un)decidability and state a list of open questions that still remain

No detectable effect of ocean acidification on plankton metabolism in the NW oligotrophic Mediterranean Sea: Results from two mesocosm studies

Oligotrophic areas account for about 30% of oceanic primary production and are projected to expand in a warm, high-CO2 world. Changes in primary production in these areas could have important impacts on future global carbon cycling. To assess the response of primary production and respiration of plankton communities to increasing partial pressure of CO2 (pCO2) levels in Low Nutrient Low Chorophyll areas, two mesocosm experiments were conducted in the Bay of Calvi (Corsica, France) and in the Bay of Villefranche (France) in June–July 2012 and February–March 2013 under different trophic state, temperature and irradiance conditions. Nine mesocosms of 50 m3 were deployed for 20 and 12 days, respectively, and were subjected to seven pCO2 levels (3 control and 6 elevated levels). The metabolism of the community was studied using several methods based on in situ incubations (oxygen light–dark, 18O and 14C uptake). Increasing pCO2 had no significant effect on gross primary production, net community production, particulate and dissolved carbon production, as well as on community respiration. These two mesocosm experiments, the first performed under maintained low nutrient and low chlorophyll, suggest that in large areas of the ocean, increasing pCO2 levels may not lead to a significant change in plankton metabolic rates and sea surface biological carbon fixation

Characteristics of Total Column CO2 Retrievals from the OCO Missions: Biases, Information Content and Implications for Flux Inversions

The Orbiting Carbon Observatory-2 and Orbiting Carbon Observatory-3, launched in 2015 and 2019, respectively, are intended to collect and deliver high-resolution observations of CO2 with unprecedented space and time coverage. Observations of CO2 from these remote-sensing missions (also known as XCO2, or column-based average, dry air mole fraction of CO2) are then used by the global carbon cycle community to answer a wide range of science questions, from the distribution and quantification of global and regional CO2 source-sink patterns to quantification of anthropogenic sources at urban scales. Even though we have had the OCO-2 mission flying for a few years now, the retrieval algorithms are continuously evolving and improving to deliver XCO2 retrievals with very high precision and high accuracy (or low biases). In this presentation, we will discuss a simple yet effective quantitative framework that has been developed by the OCO-2 flux team to evaluate the information content of these XCO2 retrievals as soon as they are released, i.e., with lower latency than full-scale flux inversions. This framework serves as a precursor to advanced inverse modeling frameworks and is intended to provide an early but accurate assessment of the signal present in the satellite retrievals, the robustness of that signal, and the ability of these retrievals to resolve patterns in CO2 surface fluxes that cannot be resolved by our current network of surface sites. Specific results will tackle a tiered set of questions that are being addressed using this framework: (a) what are the distribution of retrievals in the different modes of operation and how do they vary in space and time? (b) what is the information that is being given to the inverse modeling frameworks from the space-based data, information above and beyond what is provided by the in-situ data? and (c) how do these factors influence our choices for doing flux inversions with the satellite retrievals? While the primary focus of the results will be on application of this technique to mature OCO-2 retrievals, we will show early results for a couple of months of OCO-3 retrievals. For the time-period that the retrievals from the two missions overlap, we will highlight how this framework allows us to effortlessly put the information from OCO-3 and OCO-2 on an equal footing, thus enabling easy comparison between the two pioneering missions

Production of multi-charged phosphorus ions with ecris 'SUPERSHyPIE' at GANIL

The Ganil's Ion Production Group tested the source SUPERSHyPIE123 for theproduction of phosphorus n+ ion beams. The SUPERSHyPIE ecris is used for many testsof multi-charged ion production and supply ion beams for LIMBE4 (low energie beamline). This ion source works with a 14.5ghz RF power injected by a circular waveguide inthe axis of the sourc

Logico-numerical max-strategy iteration

Strategy iteration methods are used for solving fixed point equations. It has been shown that they improve precision in static analysis based on abstract interpretation and template abstract domains, e.g. intervals, octagons or template polyhedra. However, they are limited to numerical programs. In this paper, we propose a method for applying max-strategy iteration to logico-numerical programs, i.e. programs with numerical and Boolean variables, without explicitly enumerating the Boolean state space. The method is optimal in the sense that it computes the least fixed point w.r.t. the abstract domain; in particular, it does not resort to widening. Moreover, we give experimental evidence about the efficiency and precision of the approach