3,475 research outputs found
Nonlocal Quantum Effective Actions in Weyl-Flat Spacetimes
Virtual massless particles in quantum loops lead to nonlocal effects which
can have interesting consequences, for example, for primordial magnetogenesis
in cosmology or for computing finite corrections in holography. We describe
how the quantum effective actions summarizing these effects can be computed
efficiently for Weyl-flat metrics by integrating the Weyl anomaly or,
equivalently, the local renormalization group equation. This method relies only
on the local Schwinger-DeWitt expansion of the heat kernel and allows for a
re-summation of leading large logarithms in situations where the Weyl factor
changes by several e-foldings. As an illustration, we obtain the quantum
effective action for the Yang-Mills field coupled to massless matter, and the
self-interacting massless scalar field. Our action reduces to the nonlocal
action obtained using the Barvinsky-Vilkovisky covariant perturbation theory in
the regime for a typical curvature scale , but has
a greater range of validity effectively re-summing the covariant perturbation
theory to all orders in curvatures. In particular, it is applicable also in the
opposite regime , which is often of interest in
cosmology.Comment: 24 page
To or not to : Primordial magnetic fields from Weyl anomaly
The quantum effective action for the electromagnetic field in an expanding
universe has an anomalous dependence on the scale factor of the metric arising
from virtual charged particles in the loops. It has been argued that this Weyl
anomaly of quantum electrodynamics sources cosmological magnetic fields in the
early universe. We examine this long-standing claim by using the effective
action beyond the weak gravitational field limit which has recently been
determined. We introduce a general criteria for assessing the quantumness of
field fluctuations, and show that the Weyl anomaly is not able to convert
vacuum fluctuations of the gauge field into classical fluctuations. We conclude
that there is no production of coherent magnetic fields in the universe from
the Weyl anomaly of quantum electrodynamics, irrespective of the number of
massless charged particles in the theory.Comment: 23 pages, 3 figures, v2: published in JHE
Using HMM in Strategic Games
In this paper we describe an approach to resolve strategic games in which
players can assume different types along the game. Our goal is to infer which
type the opponent is adopting at each moment so that we can increase the
player's odds. To achieve that we use Markov games combined with hidden Markov
model. We discuss a hypothetical example of a tennis game whose solution can be
applied to any game with similar characteristics.Comment: In Proceedings DCM 2013, arXiv:1403.768
Caprinocultura: aumento do consumo da carne e do leite por meio da melhoria da qualidade.
bitstream/item/53394/1/Midia-Caprinocultura-aumento.pd
On Ramsey Theory and Slow Bootstrap Percolation
This dissertation concerns two sets of problems in extremal combinatorics. The major part, Chapters 1 to 4, is about Ramsey-type problems for cycles. The shorter second part, Chapter 5, is about a problem in bootstrap percolation. Next, we describe each topic more precisely. Given three graphs G, L1 and L2, we say that G arrows (L1, L2) and write G → (L1, L2), if for every edge-coloring of G by two colors, say 1 and 2, there exists a color i whose color class contains Li as a subgraph. The classical problem in Ramsey theory is the case where G, L1 and L2 are complete graphs; in this case the question is how large the order of G must be (in terms of the orders of L1 andL2) to guarantee that G → (L1, L2). Recently there has been much interest in the case where L1 and L2 are cycles and G is a graph whose minimum degree is large. In the past decade, numerous results have been proved about those problems. We will continue this work and prove two conjectures that have been left open. Our main weapon is Szemeredi\u27s Regularity Lemma.Our second topic is about a rather unusual aspect of the fast expanding theory of bootstrap percolation. Bootstrap percolation on a graph G with parameter r is a cellular automaton modeling the spread of an infection: starting with a set A0, cointained in V(G), of initially infected vertices, define a nested sequence of sets, A0 ⊆ A1 ⊆. . . ⊆ V(G), by the update rule that At+1, the set of vertices infected at time t + 1, is obtained from At by adding to it all vertices with at least r neighbors in At. The initial set A0 percolates if At = V(G) for some t. The minimal such t is the time it takes for A0 to percolate. We prove results about the maximum percolation time on the two-dimensional grid with parameter r = 2
- …