نتایج جستجو برای: full edge

تعداد نتایج: 404805  

Journal: :Physical review letters 2014
L E F Foa Torres P M Perez-Piskunow C A Balseiro Gonzalo Usaj

We report on simulations of the dc conductance and quantum Hall response of a Floquet topological insulator using Floquet scattering theory. Our results reveal that laser-induced edge states lead to quantum Hall plateaus once imperfect matching with the nonilluminated leads is lessened. The magnitude of the Hall plateaus, however, is not directly related to the number and chirality of all the e...

The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...

2016
S. C. Chapman R. O. Dendy T. N. Todd N. W. Watkins A. J. Webster F. A. Calderon J. Morris

(2014). Relationship of edge localized mode burst times with divertor flux loop signal phase in JET. Articles you may be interested in The global build-up to intrinsic edge localized mode bursts seen in divertor full flux loops in JET JET divertor diagnostic upgrade for neutral gas analysisa) Transport of edge localized modes energy and particles into the scrape off layer and divertor of DIII-D...

Journal: :J. Comb. Theory, Ser. B 2017
Julien Bensmail Ararat Harutyunyan Tien-Nam Le Martin Merker Stéphan Thomassé

The Barát-Thomassen conjecture asserts that for every tree T on m edges, there exists a constant kT such that every kT -edge-connected graph with size divisible by m can be edge-decomposed into copies of T . So far this conjecture has only been verified when T is a path or when T has diameter at most 4. Here we prove the full statement of the conjecture.

Journal: :Electr. J. Comb. 2010
Gabor Fulep Nándor Sieben

An animal is an edge connected set of nitely many cells of a regular tiling of the plane. The site-perimeter of an animal is the number of empty cells connected to the animal by an edge. The minimum site-perimeter with a given cell size is found for animals on the triangular and hexagonal grid. The formulas are used to show the e ectiveness of a simple random strategy in full set animal achieve...

Journal: :Physical review letters 2013
Viktor Eisler

We study the distribution of particle number in extended subsystems of a one-dimensional noninteracting Fermi gas confined in a potential well at zero temperature. Universal features are identified in the scaled bulk and edge regions of the trapped gas where the full counting statistics are given by the corresponding limits of the eigenvalue statistics in Gaussian unitary random matrix ensemble...

Journal: :Prehospital and disaster medicine 2002
Marvin L Birnbaum

Twas a dangerous cliff, they freely confessed, Though to walk near its crest was so pleasant, But, over its terrible edge there had slipped A duke and full many a peasant; So the people said something would have to be done, But their projects did not at all tally. Some said: "Put a fence round the edge of the cliff." Others said: An ambulance down in the valley." Joseph Malines Prevention and C...

Journal: :Nano letters 2007
Maxim Durach Anastasia Rusina Mark I Stockman Keith Nelson

We introduce an approach to implement full coherent control on nanometer length scales. It is based on spatiotemporal modulation of the surface plasmon polariton (SPP) fields at the thick edge of a nanowedge. The SPP wavepackets propagating toward the sharp edge of this nanowedge are compressed and adiabatically concentrated at a nanofocus, forming an ultrashort pulse of local fields. The profi...

Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an  ...

1990
C. Cammarota

We consider the one dimensional nearest neighbor branching exclusion process with initial configurations having a rightmost particle. We prove that, conveniently resealed, the position of the rightmost particle (edge) converges to a nondegenerate Brownian motion. Convergence to a convex combination of measures concentrating on the full and empty configurations at the average position of the edg...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید