We study continuous-time quantum walks on graphs which generalize the hypercube. The only known family of graphs whose quantum walk instantaneously mixes to uniform is the Hamming graphs with small arities. We show that quantum uniform mixing on the hypercube is robust under the addition of perfect matchings but not much else. Our specific results include: • The graph obtained by augmenting the...

Incomplete mixing of reactive solutes is well known to slow down reaction rates relative to what would be expected from assuming perfect mixing. In purely diffusive systems, for example, it is known that small initial fluctuations in reactant concentrations can lead to reactant segregation, which in the long run can reduce global reaction rates due to poor mixing. In contrast, nonuniform flows ...

With the accumulation of many years of solar and atmospheric neutrino oscillation data, the approximate form of the 3 × 3 neutrino mixing matrix is now known. The theoretical challenge is to understand where this mixing matrix comes from. Recently, a remarkable fact was discovered that for a specific pattern of the neutrino mass matrix at a high scale, any flavor-changing radiative correction w...

Although initially originated as a totally empirical relationship to explain the volume of trade between two partners, gravity equation has been the focus of several theoretic models that try to explain it. Specialization models are of great importance in providing a solid theoretic ground for gravity equation in bilateral trade. Some research papers try to improve specialization models by addi...

Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(Kn) ≥ n∗φ(n) 2 and for m and n which are odd and co-prime to each other, c(Kmn) ≥ 2 ∗ c(Km) ∗ c(Kn). In this note, we establish that both these results are equivalent in the sense that they both give rise to the same lower bound.

V. Chv atal proved that no minimal imperfect graph has a small transversal, that is, a set of vertices of cardinality at most + ! 1 which meets every !-clique and every -stable set. In this paper we prove that a slight generalization of this notion of small transversal leads to a conjecture which is as strong as Berge's Strong Perfect Graph Conjecture for a very large class of graphs, although ...

This paper examines how the fertility of enslaved women was affected by the promise of freedom. Exploiting geographic variation in the effect of the Fugitive Slave Law of 1850, I demonstrate a negative correlation between fertility and the distance to freedom. This negative correlation is stronger on larger plantations but weaker when the slaveholder is a woman. A similar correlation is not pre...

In order to prove the Strong Perfect Graph Conjecture, the existence of a ”simple” property P holding for any minimal non-quasi-parity Berge graph G would really reduce the difficulty of the problem. We prove here that this property cannot be of type ”G is F-free”, where F is any fixed family of Berge graphs.

In biogeochemical models coupled to ocean circulation models, vertical mixing is an important physical process which governs the nutrient supply and the plankton residence in the euphotic layer. However, vertical mixing is often poorly represented in numerical simulations because of approximate parameterizations of sub-grid scale turbulence, wind forcing errors and other mis-represented process...