Results 11 to 20 of about 4,241 (108)

Coherent Matter Wave Transport in Speckle Potentials [PDF]

, 2007
This article studies multiple scattering of matter waves by a disordered optical potential in two and in three dimensions. We calculate fundamental transport quantities such as the scattering mean free path $\ell_s$, the Boltzmann transport mean free ...
Akkermans E, Akkermans E, Allen L, Ashcroft N, Bender C M, Berry M V, Born M, C A Müller, C Miniatura, Chandrasekhar S, Clément D, Cohen-Tannoudji C, D Delande, Domb C, Frisch U, Galindo A, Goodman J W, Henkel C, Ishimaru A, John S, Kaiser R, Kopp T, Kopp T, Kramer B, Le Bellac M, Mahan G D, Mandel L, McCrea W H, Minkov G M Germanenko A V Rut O E Sherstobitov A A Zvonkov B N, Mott N F, O Sigwarth, Perrin H, R C Kuhn, Rammer J, Sachdev S, Shapiro B, Sheng P, van Tiggelen B A, Vollhardt D   +38 more
core   +2 more sources

Nonlocal Electrodynamics of Accelerated Systems [PDF]

, 2007
Acceleration-induced nonlocality is discussed and a simple field theory of nonlocal electrodynamics is developed. The theory involves a pair of real parameters that are to be determined from observation. The implications of this theory for the phenomenon
Anderson, Ashby, Bahram Mashhoon, Bohr, Buchholz, Chicone, Chicone, Hehl, Kennard, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Mashhoon, Muench, Pegram   +19 more
core   +3 more sources

Kernels by monochromatic paths in digraphs with covering number 2

Discrete Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Galeana-Sánchez, Hortensia, Olsen, Mika
openaire   +2 more sources

Localization of Matter Waves in 2D-Disordered Optical Potentials [PDF]

, 2005
We consider ultracold atoms in 2D-disordered optical potentials and calculate microscopic quantities characterizing matter wave quantum transport in the non-interacting regime.
B. L. Altshuler, C. A. Müller, C. Miniatura, D. Delande, E. Akkermans, J. Rammer, M. Born, O. Sigwarth, R. C. Kuhn   +8 more
core   +1 more source

H-kernels by walks in H-colored digraphs and the color-class digraph

AKCE International Journal of Graphs and Combinatorics, 2016
Let H be a digraph possibly with loops and D a finite digraph without loops whose arcs are colored with the vertices of H (D is an H-colored digraph). V(D) and A(D) will denote the sets of vertices and arcs of D respectively.
Hortensia Galeana-Sánchez, Rocío Sánchez-López   +1 more
doaj   +1 more source

Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems [PDF]

, 2015
The typical problem in (generalized) Ramsey theory is to find the order of the largest monochromatic member of a family {Mathematical expression} (for example matchings, paths, cycles, connected subgraphs) that must be present in any edge coloring of a ...
Gyárfás, András, Selkow, Stanley, Sárközy, Gábor   +2 more
core   +1 more source

γ-Cycles And Transitivity By Monochromatic Paths In Arc-Coloured Digraphs

Discussiones Mathematicae Graph Theory, 2013
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. If D is an m-coloured digraph and a ∈ A(D), colour(a) will denote the colour has been used on a.
Casas-Bautista Enrique, Galeana-Sánchez Hortensia, Rojas-Monroy Rocío   +2 more
doaj   +1 more source

Independent and monochromatic absorbent sets in infinite digraphs

AKCE International Journal of Graphs and Combinatorics, 2015
Let D be a digraph, we say that it is an m-coloured digraph if the arcs of D are coloured with at most m-colours. An (u,v) arc is symmetrical if (v,u) is also an arc of D. A directed path (resp.
Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy   +2 more
doaj   +1 more source

γ-Cycles In Arc-Colored Digraphs

Discussiones Mathematicae Graph Theory, 2016
We call a digraph D an m-colored digraph if the arcs of D are colored with m colors. A directed path (or a directed cycle) is called monochromatic if all of its arcs are colored alike.
Galeana-Sánchez Hortensia, Gaytán-Gómez Guadalupe, Rojas-Monroy Rocío   +2 more
doaj   +1 more source

On the Parameterized Complexity of Contraction to Generalization of Trees [PDF]

, 2017
For a family of graphs F, the F-Contraction problem takes as an input a graph G and an integer k, and the goal is to decide if there exists S subseteq E(G) of size at most k such that G/S belongs to F.
Agrawal, Akanksha, Saurabh, Saket, Tale, Prafullkumar   +2 more
core   +2 more sources