A proof of the covariant entropy bound

... If (b) the light-sheet is terminated at finite cross-sectional area A , then the covariant bound can be strengthened: S≤ A A 4G Flanagan, Marolf & Wald, 1999 Generalized Covariant Entropy Bound ... contradiction (b) A s spacelike sections into two parts (a) The cova part, as indicated by the normal wedges (se Generalized Covariant Entropy Bound increasing area de...

Ngày tải lên: 27/09/2017, 09:44

... Frame (a) depicts two quasi-regular tetrahedra that share a face The same convex body may also be viewed as three quarters that share a diagonal, as in Frame (b) 1083 A PROOF OF THE KEPLER CONJECTURE ... is an anchor of {v1 , v2 } if its distances to v1 and v2 are at most 2t0 The two vertices of a quarter that are not on the diagonal are anchors of the diagona...

Ngày tải lên: 22/03/2014, 20:20

... path of length n For example, the complete graph K4 is an edge-disjoint union of two paths of length 3, each path meeting the other in four vertices The cycle C6 is the edge-disjoint union of two ... decompose H By the theorem of Thomason, there is another Hamiltonian decomposition C1 , C2 of H with e in C1 and f in C2 Now we reverse our steps Restore the vertices of...

Ngày tải lên: 07/08/2014, 06:23

... proof of the Kahn-Lov´sz theorem a The entropy proof of the Kahn-Lov´sz theorem is complicated by the fact that there can a be edges of the graph (and a fixed matching) amongst the neighbors of ... understanding our proof of the Kahn-Lov´sz, which we present in Section a Radhakrishnan’s proof This section presents the entropy proof of Radhakri...

Ngày tải lên: 08/08/2014, 12:23

... expansions obtained from (1) and (2), that yield a stable trace formula A STABLE TRACE FORMULA III 771 Parts (a) of the theorems apply to “endoscopic” analogues of the terms in the trace formula ... both a stable trace formula, and a decomposition of the ordinary trace formula into stable trace formulas for endoscopic groups Various reduction...

Ngày tải lên: 05/03/2014, 23:20

... Mukaiyama et al B BSA holo-NPAS2 ∆ F (Hz) holo-NPAS2 holo-NPAS2 holo-NPAS2 holo-NPAS2 a p o- N PAS apo-NPAS2 apo-NPAS2 apo-NPAS2 BSA apo-NPAS2 ∆ F (Hz) A Characterization of bHLH -PAS- A of NPAS2 T ... (bHLH) -PAS- A domain FEBS Journal 27 3 (20 06) 25 28 25 39 ª 20 06 The Authors Journal compilation ª 20 06 FEBS Y Mukaiyama et al Characterization of bHLH -PAS- A...

Ngày tải lên: 30/03/2014, 11:20

Ngày tải lên: 05/08/2014, 09:46

... [d] × [d] Then rk (x + d − k)d−k is the number of ways of first placing k rooks on B and then placing d − k more rooks anywhere (i.e., on B, B or on the extra rows) such that no two rooks can ... take each other in the final configuration By inclusion-exclusion, we see that the resulting configurations in which the set S of rooks on B is nonempty cancel out of the above sum, b...

Ngày tải lên: 07/08/2014, 06:20

... proof of Lemma 2, an argument based on linear programming was used It is slightly more powerful than the cloning here In the proof of Lemma 3, a more sophisticated argument due to Kalai4 , based ... remarkable success at making powerful mathematics appear simple was the inspiration for it References Alon N and Kleitman, D J., Piercing Convex Sets and the Hadwiger- Debrunne...

Ngày tải lên: 07/08/2014, 06:22

... extension of the Littlewood-Richardson rule [Z] Taking the specialization λ = , we obtain the decomposition of sµ/ν into Schur functions; it is simpler than the traditional formulation of the Littlewood-Richardson ... The Details Let P denote the set of nonnegative integer sequences of the form λ = (λ1 ≥ λ2 ≥ · · ·) with finitely many nonzero terms; i.e., the se...

Ngày tải lên: 07/08/2014, 06:23

... about a proof described to him by N.M Ferrers The Ferrers shape of a partition is an array of boxes, left justified, in which the number of boxes in the first row is equal to the size of the first ... that the set S consists of pairs of partitions with no primed parts In the definition of φ−1 when there is a primed integer in the image, we consider only the value...

Ngày tải lên: 07/08/2014, 08:20

... three of them Let HIVEν denote the set of hives dec dec λµ of size n such that • the lower left entry is zero • the differences on the Northwest side of the hive give λ • the differences on the Northeast ... give a bijective proof of this, using the octahedron rule from [RR, P, FZ, S] This bijection was first found by CW in the honeycomb model, where the con...

Ngày tải lên: 07/08/2014, 08:20

... adjacency matrix of the graph is less than ε as long as k ≥ (cε + o(1)) log |G| Their proof involves a clever combinatorial argument that controls the behavior of random walks taken on the ... representations: we write ρ = σ1 ⊕ · · · ⊕ σk If two representations ρ and σ are the same up to an isometric change of basis, we say that they are equivalent It is a fact that an...

Ngày tải lên: 07/08/2014, 08:20

... and decrease the entry of p that was one larger than p1 by one Let the obtained permutation be p Similarly, decrease q1 by 1, and increase the entry of q that was one larger than q1 by Let the ... = 1, then remove these entries, to get the permutations p∗ and q∗ (After natural relabeling, these are both permutations of length n − 1.) Because of the extreme values of at l...

Ngày tải lên: 07/08/2014, 08:22

... 12 (2005), #R18 Theorem 2.3 (Aztec diamond theorem) The number of domino tilings of the Aztec diamond of order n is 2n(n+1)/2 Remark: The proof of Proposition 2.1 relies on the recurrence relation ... define a path τi from the center of the left-hand edge of the ith row to the center of the right-hand edge of the ith row Namely, each step of the...

Ngày tải lên: 07/08/2014, 08:22