Jamming, relaxation and crystallization of a super-cooled fluid in a three-dimensional lattice

Off-equilibrium dynamics of a three-dimensional lattice model with nearest- and next nearest-neighbors exclusions is studied. At equilibrium, the model undergoes a first-order fluid-solid transition. Non-equilibrium filling, through random sequential adsorption with diffusion, creates amorphous structures and terminates at a disordered state with random closest packing density that lies in the equilibrium solid regime. The approach towards random closest packing is characterized by two distinct power-law regimes, reflecting the formation of small densely packed grains in the long time regime of the filling process. We then study the fixed-density relaxation of these amorphous structures towards the solid phase. The route to crystallization is shown to deviate from the simple grain growth proposed by classical nucleation theory. Our measurements suggest that relaxation is driven mainly by coalescence of neighboring crystallized grains which exist in the initial amorphous state

Homalg: A meta-package for homological algebra

The central notion of this work is that of a functor between categories of finitely presented modules over so-called computable rings, i.e. rings R where one can algorithmically solve inhomogeneous linear equations with coefficients in R. The paper describes a way allowing one to realize such functors, e.g. Hom, tensor product, Ext, Tor, as a mathematical object in a computer algebra system. Once this is achieved, one can compose and derive functors and even iterate this process without the need of any specific knowledge of these functors. These ideas are realized in the ring independent package homalg. It is designed to extend any computer algebra software implementing the arithmetics of a computable ring R, as soon as the latter contains algorithms to solve inhomogeneous linear equations with coefficients in R. Beside explaining how this suffices, the paper describes the nature of the extensions provided by homalg.Comment: clarified some points, added references and more interesting example

Displacement energy of unit disk cotangent bundles

We give an upper bound of a Hamiltonian displacement energy of a unit disk cotangent bundle $D^*M$ in a cotangent bundle $T^*M$, when the base manifold $M$ is an open Riemannian manifold. Our main result is that the displacement energy is not greater than $C r(M)$, where $r(M)$ is the inner radius of $M$, and $C$ is a dimensional constant. As an immediate application, we study symplectic embedding problems of unit disk cotangent bundles. Moreover, combined with results in symplectic geometry, our main result shows the existence of short periodic billiard trajectories and short geodesic loops.Comment: Title slightly changed. Close to the version published online in Math Zei

Quantum walks on quotient graphs

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup used to construct it. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A {\bf 74}, 042334 (2006)] that the hitting time can be infinite. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with fast hitting times correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speed-up.Comment: 18 pages, 7 figures in EPS forma

Comparison of Fenoterol, Isoproterenol, and Isoetharine with Phenylephrine Aerosol in Asthma

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/97253/1/j.1552-4604.1983.tb02708.x.pd

A nilpotent IP polynomial multiple recurrence theorem

We generalize the IP-polynomial Szemer\'edi theorem due to Bergelson and McCutcheon and the nilpotent Szemer\'edi theorem due to Leibman. Important tools in our proof include a generalization of Leibman's result that polynomial mappings into a nilpotent group form a group and a multiparameter version of the nilpotent Hales-Jewett theorem due to Bergelson and Leibman.Comment: v4: switch to TeXlive 2016 and biblate

Bicrossed products for finite groups

We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that can be written as bicrossed products between groups of fixed isomorphism types. The groups obtained as bicrossed products of two finite cyclic groups, one being of prime order, are described.Comment: Final version: to appear in Algebras and Representation Theor

Asymptotic Behavior of Ext functors for modules of finite complete intersection dimension

Let $R$ be a local ring, and let $M$ and $N$ be finitely generated $R$-modules such that $M$ has finite complete intersection dimension. In this paper we define and study, under certain conditions, a pairing using the modules \Ext_R^i(M,N) which generalizes Buchweitz's notion of the Herbrand diference. We exploit this pairing to examine the number of consecutive vanishing of \Ext_R^i(M,N) needed to ensure that \Ext_R^i(M,N)=0 for all $i\gg 0$. Our results recover and improve on most of the known bounds in the literature, especially when $R$ has dimension at most two