MSS membranes are a good candidate for CO cleanup in fuel cell fuel processing systems due to their ability to selectively permeate H2 over CO via molecular sieving. Successfully scaled up tubular membranes were stable under dry conditions to 400°C with H2 permeance as high as 2 x 10 -6 mol.m.s.Pa at 200°C and H2/CO selectivity up to 6.4, indicating molecular sieving was the dominant mechanism....

Whereas, in usual cases, sieving by a set of primes may be fairly well controlled, through Buchstab’s identity, sieving by a set of integers is a much more complicated task. However, some fairly precise results are known in the case where the set of integers is an interval. We refer to the recent work [1] of the first author for specific statements and references. Define τ(n; y, z) := |{d|n : y...

Recently, it was shown that angular locality-sensitive hashing (LSH) can be used to significantly speed up lattice sieving, leading to a heuristic time complexity for solving the shortest vector problem (SVP) of 2 (and space complexity 2. We study the possibility of applying other LSH methods to sieving, and show that with the spherical LSH method of Andoni et al. we can heuristically solve SVP...

The notion of cyclic sieving phenomenon is introduced by Reiner, Stanton, and White as a generalization of Stembridge’s q = −1 phenomenon. The generalized cluster complexes associated to root systems are given by Fomin and Reading as a generalization of the cluster complexes found by Fomin and Zelevinsky. In this paper, the faces of various dimensions of the generalized cluster complexes in typ...

At a high level, the AKS algorithm for finding the shortest vector in a lattice works by taking a large sphere or box and choosing many (e.g. ∼ 2) random lattice points in the box by taking random combinations of the basis. The points are then refined through an iterative routine called sieving. The sieving procedure Sieve(Y ) will have the following properties. Sieve(Y ) = C ⊆ Y such that: • F...

In this paper we study the details of sieving for Cunningham chains of the first kind of length 3. To find such prime triplets larger than the ones already known, we have to investigate the primality of 2 numbers, each in the magnitude of 2 (more than 10 500 decimal digits). This would not be feasible if it weren’t for the sieving process which reduces the estimated time of completion to only a...