Study of the performances of an oxygen carrier: Experimental investigation of the binder's contribution and characterization of its structural modifications

The aim of this work is to investigate the contribution of the binder (NiAl₂O₄) on the performances of the oxygen carrier NiO/NiAl₂O₄. To this purpose, oxidation/reduction cycles have been performed in a fixed bed reactor using CO as a fuel. The results reveal that the binder can react with the fuel to form CO₂, and that its total reduction capacity increases with temperature. XRD characterizations performed on the binder (on the fresh and after several cycles) show a shift of the diffraction peaks of NiAl₂O₄ toward the ones of γ-alumina, which can be attributed to a progressive decomposition of NiAl₂O₄ to alumina and NiO.     

Vertex-disjoint cycles in local tournaments

Let $r$ be a positive integer. The Bermond–Thomassen conjecture states that, a digraph of minimum out-degree at least $2r-1$ contains $r$ vertex-disjoint directed cycles. A digraph $D$ is called a local tournament if for every vertex $x$ of $D$, both the out-neighbours and the in-neighbours of $x$ induce tournaments. Note that tournaments form the subclass of local tournaments. In this paper, we verify that the Bermond–Thomassen conjecture holds for local tournaments. In particular, we prove that every local tournament $D$ with ${\delta }^{+}\left(D\right)\ge 2r-1$ contains $r$ disjoint cycles $C_1,C_2,\dots ,C_r$, satisfying that either $C_i$ has the length at most 4 or is a shortest cycle of the original digraph of $D-C_1-\dots -C_{i-1}$ for $1\le i\le r$.     

Some results about zero‐cycles on abelian and semi‐abelian varieties

In this short note we extend some results obtained in [7]. First, we prove that for an abelian variety A with good ordinary reduction over a finite extension of with p an odd prime, the Albanese kernel of A is the direct sum of its maximal divisible subgroup and a torsion group. Second, for a semi‐abelian variety G over a perfect field k, we construct a decreasing integral filtration of Suslin's singular homology group, , such that the successive quotients are isomorphic to a certain Somekawa K‐group.     

Powers of Hamilton cycles in random graphs and tight Hamilton cycles in random hypergraphs

We show that for every there exists C > 0 such that if then asymptotically almost surely the random graph contains the k^th power of a Hamilton cycle. This determines the threshold for appearance of the square of a Hamilton cycle up to the logarithmic factor, improving a result of Kühn and Osthus. Moreover, our proof provides a randomized quasi‐polynomial algorithm for finding such powers of cycles. Using similar ideas, we also give a randomized quasi‐polynomial algorithm for finding a tight Hamilton cycle in the random k‐uniform hypergraph for . The proofs are based on the absorbing method and follow the strategy of Kühn and Osthus, and Allen et al. The new ingredient is a general Connecting Lemma which allows us to connect tuples of vertices using arbitrary structures at a nearly optimal value of p. Both the Connecting Lemma and its proof, which is based on Janson's inequality and a greedy embedding strategy, might be of independent interest.     

On the variety of triangles for a hyper-Kähler fourfold constructed by Debarre and Voisin

We study the similarities between the Fano varieties of lines on a cubic fourfold, a hyper-Kähler fourfold studied by Beauville and Donagi, and the hyper-Kähler fourfold constructed by Debarre and Voisin in [3]. We exhibit an analog of the notion of “triangle” for these varieties and prove that the 6-dimensional variety of “triangles” is a Lagrangian subvariety in the cube of the constructed hyper-Kähler fourfold.     

Law of the iterated logarithm for random graphs

A milestone in probability theory is the law of the iterated logarithm (LIL), proved by Khinchin and independently by Kolmogorov in the 1920s, which asserts that for iid random variables with mean 0 and variance 1 In this paper we prove that LIL holds for various functionals of random graphs and hypergraphs models. We first prove LIL for the number of copies of a fixed subgraph H. Two harder results concern the number of global objects: perfect matchings and Hamiltonian cycles. The main new ingredient in these results is a large deviation bound, which may be of independent interest. For random k‐uniform hypergraphs, we obtain the Central Limit Theorem and LIL for the number of Hamilton cycles.