Dense strontium hexaferrite-based permanent magnet composites assisted by cold sintering process

[EN] The use of rare-earth-based permanent magnets is one of the critical points for the development of the current technology. On the one hand, industry of the rare-earths is highly polluting due to the negative environmental impact of their extraction and, on the other hand, the sector is potentially dependent on China. Therefore, investigation is required both in the development of rare-earth-free permanent magnets and in sintering processes that enable their greener fabrication with attractive magnetic properties at a more competitive price. This work presents the use of a cold sintering process (CSP) followed by a post-annealing at 1100 °C as a new way to sinter composite permanent magnets based on strontium ferrite (SFO). Composites that incorporate a percentage ≤ 10% of an additional magnetic phase have been prepared and the morphological, structural and magnetic properties have been evaluated after each stage of the process. CSP induces a phase transformation of SFO in the composites, which is partially recovered by the post-thermal treatment improving the relative density to 92% and the magnetic response of the final magnets with a coercivity of up to 3.0 kOe. Control of the magnetic properties is possible through the composition and the grain size in the sintered magnets. These attractive results show the potential of the sintering approach as an alternative to develop modern rare-earth-free composite permanent magnets.This work has been supported by the Ministerio Español de Ciencia e Innovación (MICINN), Spain, through the projects MAT2017-86540-C4-1-R and RTI2018-095303-A-C52, and by the European Commission through Project H2020 No. 720853 (Amphibian). C.G.-M. and A.Q. acknowledge financial support from MICINN through the “Juan de la Cierva” program (FJC2018-035532-I) and the “Ramón y Cajal” contract (RYC-2017-23320). S. R.-G. gratefully acknowledges the financial support of the Alexander von Humboldt foundation, Germany. A.S. acknowledges the financialsupport from the Comunidad de Madrid, Spain, for an “Atracción de Talento Investigador” contract (No. 2017-t2/IND5395)

On the trapping of stars by a newborn stellar supercluster

Numerical experiments conducted by Fellhauer et al. (MNRAS, 372, 338, 2006) suggest that a supercluster may capture up to about 40 per cent of its mass from the galaxy where it belongs. Nevertheless, in those experiments the cluster was created making appear its mass out of nothing, rather than from mass already present in the galaxy. Here we use a thought experiment, plus a few simple computations, to show that the difference between the dynamical effects of these two scenarios (i.e., mass creation vs. mass concentration) is actually very important. We also present the results of new numerical experiments, simulating the formation of the cluster through mass concentration, that show that trapping depends critically on the process of cluster formation and that the amounts of gained mass are substantially smaller than those obtained from mass creation.Comment: 6 pages, 3 figures. Submitted to MNRA

3-d Lattice QCD Free Energy to Four Loops

We compute the expansion of the 3-d Lattice QCD free energy to four loop order by means of Numerical Stochastic Perturbation Theory. The first and second order are already known and are correctly reproduced. The third and fourth order coefficients are new results. The known logarithmic divergence in the fourth order is correctly identified. We comment on the relevance of our computation in the context of dimensionally reduced finite temperature QCD.Comment: 8 pages, 3 figures, latex typeset with JHEP3.cl

System calibration method for Fourier ptychographic microscopy

Fourier ptychographic microscopy (FPM) is a recently proposed quantitative phase imaging technique with high resolution and wide field-of-view (FOV). In current FPM imaging platforms, systematic error sources come from the aberrations, LED intensity fluctuation, parameter imperfections and noise, which will severely corrupt the reconstruction results with artifacts. Although these problems have been researched and some special methods have been proposed respectively, there is no method to solve all of them. However, the systematic error is a mixture of various sources in the real situation. It is difficult to distinguish a kind of error source from another due to the similar artifacts. To this end, we report a system calibration procedure, termed SC-FPM, based on the simulated annealing (SA) algorithm, LED intensity correction and adaptive step-size strategy, which involves the evaluation of an error matric at each iteration step, followed by the re-estimation of accurate parameters. The great performance has been achieved both in simulation and experiments. The reported system calibration scheme improves the robustness of FPM and relaxes the experiment conditions, which makes the FPM more pragmatic.Comment: 18 pages, 9 figure

Bounded Search Tree Algorithms for Parameterized Cograph Deletion: Efficient Branching Rules by Exploiting Structures of Special Graph Classes

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general search strategy that branches on the forbidden subgraphs of a graph class relaxation. By using the class of $P_4$-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems. We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the trivially perfect edge-deletion problems. For the cograph vertex deletion problem, a refined analysis of the runtime of our simple bounded search algorithm gives a faster exponential factor than those algorithms designed with the help of complicated case distinctions and non-trivial running time analysis [21] and computer-aided branching rules [11].Comment: 23 pages. Accepted in Discrete Mathematics, Algorithms and Applications (DMAA

Bipartite induced density in triangle-free graphs

We prove that any triangle-free graph on $n$ vertices with minimum degree at least $d$ contains a bipartite induced subgraph of minimum degree at least $d^2/(2n)$. This is sharp up to a logarithmic factor in $n$. Relatedly, we show that the fractional chromatic number of any such triangle-free graph is at most the minimum of $n/d$ and $(2+o(1))\sqrt{n/\log n}$ as $n\to\infty$. This is sharp up to constant factors. Similarly, we show that the list chromatic number of any such triangle-free graph is at most $O(\min\{\sqrt{n},(n\log n)/d\})$ as $n\to\infty$. Relatedly, we also make two conjectures. First, any triangle-free graph on $n$ vertices has fractional chromatic number at most $(\sqrt{2}+o(1))\sqrt{n/\log n}$ as $n\to\infty$. Second, any triangle-free graph on $n$ vertices has list chromatic number at most $O(\sqrt{n/\log n})$ as $n\to\infty$.Comment: 20 pages; in v2 added note of concurrent work and one reference; in v3 added more notes of ensuing work and a result towards one of the conjectures (for list colouring

Conditional strategies and the evolution of cooperation in spatial public goods games

The fact that individuals will most likely behave differently in different situations begets the introduction of conditional strategies. Inspired by this, we study the evolution of cooperation in the spatial public goods game, where besides unconditional cooperators and defectors, also different types of conditional cooperators compete for space. Conditional cooperators will contribute to the public good only if other players within the group are likely to cooperate as well, but will withhold their contribution otherwise. Depending on the number of other cooperators that are required to elicit cooperation of a conditional cooperator, the latter can be classified in as many types as there are players within each group. We find that the most cautious cooperators, such that require all other players within a group to be conditional cooperators, are the undisputed victors of the evolutionary process, even at very low synergy factors. We show that the remarkable promotion of cooperation is due primarily to the spontaneous emergence of quarantining of defectors, which become surrounded by conditional cooperators and are forced into isolated convex "bubbles" from where they are unable to exploit the public good. This phenomenon can be observed only in structured populations, thus adding to the relevance of pattern formation for the successful evolution of cooperation.Comment: 7 two-column pages, 7 figures; accepted for publication in Physical Review