hcp‐Co Nanowires Grown on Metallic Foams as Catalysts for Fischer–Tropsch Synthesis

The Fischer–Tropsch synthesis (FTS) is a structure‐sensitive exothermic reaction that enables catalytic transformation of syngas to high quality liquid fuels. Now, monolithic cobalt‐based heterogeneous catalysts were elaborated through a wet chemistry approach that allows control over nanocrystal shape and crystallographic phase, while at the same time enables heat management. Copper and nickel foams have been employed as supports for the epitaxial growth of hcp‐Co nanowires directly from a solution containing a coordination compound of cobalt and stabilizing ligands. The Co/Cu_foam catalyst was tested for Fischer–Tropsch synthesis in a fixed‐bed reactor, showing stability and significantly superior activity and selectivity towards C5+ compared to a Co/SiO₂‐Al₂O₃ reference catalyst under the same conditions.     

Positive block matrices and numerical ranges

Any positive matrix M partitioned in four n-by-n blocks satisfies the unitarily invariant norm inequality $6M6\le 6M_{1,1}+M_{2,2}+\omega I6$, where ω is the width of the numerical range of $M_{1,2}$. Some related inequalities and a reverse Lidskii majorization are given.     

Reachability analysis of linear systems using support functions

This work is concerned with the algorithmic reachability analysis of continuous-time linear systems with constrained initial states and inputs. We propose an approach for computing an over-approximation of the set of states reachable on a bounded time interval. The main contribution over previous works is that it allows us to consider systems whose sets of initial states and inputs are given by arbitrary compact convex sets represented by their support functions. We actually compute two over-approximations of the reachable set. The first one is given by the union of convex sets with computable support functions. As the representation of convex sets by their support function is not suitable for some tasks, we derive from this first over-approximation a second one given by the union of polyhedrons. The overall computational complexity of our approach is comparable to the complexity of the most competitive available specialized algorithms for reachability analysis of linear systems using zonotopes or ellipsoids. The effectiveness of our approach is demonstrated on several examples.     

A construction of commutative nilsemigroups

All commutative nilsemigroups are constructed from congruences on free commutative semigroups.     

Maximal Elements Under Reference-Dependent Preferences with Applications to Behavioral Traps and Games

We study reference-dependent preference relations defined by a real-valued bivariate function and prove an existence criterion for maximal elements. Then we formulate a generalized version of the well-known Brondsted maximum principle and apply it to behavioral traps and Nash equilibrium in games with preference relations that are not necessarily partial orders.