Lattice-based cryptography is one of the leading proposals for post-quantum cryptography. The Shortest Vector Problem (SVP) arguably most important problem cryptanalysis lattice-based cryptography, and many schemes have security claims based on its hardness. best quantum algorithm SVP due to Laarhoven [] runs in (heuristic) time \(2^{0.2653d + o(d)}\). In this article, we present an improvement...

Segregation is a complex and poorly understood phenomenon that is prevalent in many industrial and natural granular flows. When grains flow down a slope [1–5], are spun in a rotating drum [6–8] or shaken in a box [9], we observe those grains organising into intriguing patterns. Kinetic sieving is the dominant mode of segregation in granular avalanches, where separation of particles occurs accor...

We present an experimental study of Ogston-like sieving process of rodlike DNA in patterned periodic nanofluidic filter arrays. The electrophoretic motion of DNA through the array is described as a biased Brownian motion overcoming periodically modulated free-energy landscape. A kinetic model, constructed based on the equilibrium partitioning theory and the Kramers theory, explains the field-de...

The MARAPUR concept is a biological wastewater treatment process based on the MBR functional principle. The ultrafiltration of activated sludge takes place in pressure-driven hollow fiber membranes. The vertical membrane modules are installed compactly in a MEGAMODUL. The permeate extraction is accomplished in the cross-flow, which is supported by rinsing aeration. The main process advantages a...

Introduction The molecular sieving of isotopes has long been considered impossible, as they are of essentially identical size and shape. However, for light isotopes such as H2 and D2, quantum effects can lead to sufficiently large differences in de Broglie wavelengths at cryogenic conditions to make their molecular sieving possible in nanoporous materials having pores of molecular dimension. Wh...

School of Mathematical and Statistical Sciences, Arizona State University Abstract. Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action on a finite set and a polynomial. Sagan observed the CSP on the set of non-crossing matchings on [2n] := {1, 2, . . . , 2n} using the cyclic group C2n generated by a cyclic shift of order 2n and the q-Cata...