33,790 research outputs found

    The Cardy-Verlinde Formula and Charged Topological AdS Black Holes

    Full text link
    We consider the brane universe in the bulk background of the charged topological AdS black holes. The evolution of the brane universe is described by the Friedmann equations for a flat or an open FRW-universe containing radiation and stiff matter. We find that the temperature and entropy of the dual CFT are simply expressed in terms of the Hubble parameter and its time derivative, and the Friedmann equations coincide with thermodynamic formulas of the dual CFT at the moment when the brane crosses the black hole horizon. We obtain the generalized Cardy-Verlinde formula for the CFT with an R-charge, for any values of the curvature parameter k in the Friedmann equations.Comment: 10 pages, LaTeX, references adde

    Cyclic cosmology from Lagrange-multiplier modified gravity

    Full text link
    We investigate cyclic and singularity-free evolutions in a universe governed by Lagrange-multiplier modified gravity, either in scalar-field cosmology, as well as in f(R)f(R) one. In the scalar case, cyclicity can be induced by a suitably reconstructed simple potential, and the matter content of the universe can be successfully incorporated. In the case of f(R)f(R)-gravity, cyclicity can be induced by a suitable reconstructed second function f2(R)f_2(R) of a very simple form, however the matter evolution cannot be analytically handled. Furthermore, we study the evolution of cosmological perturbations for the two scenarios. For the scalar case the system possesses no wavelike modes due to a dust-like sound speed, while for the f(R)f(R) case there exist an oscillation mode of perturbations which indicates a dynamical degree of freedom. Both scenarios allow for stable parameter spaces of cosmological perturbations through the bouncing point.Comment: 8 pages, 3 figures, references added, accepted for publicatio

    FPTAS for Weighted Fibonacci Gates and Its Applications

    Full text link
    Fibonacci gate problems have severed as computation primitives to solve other problems by holographic algorithm and play an important role in the dichotomy of exact counting for Holant and CSP frameworks. We generalize them to weighted cases and allow each vertex function to have different parameters, which is a much boarder family and #P-hard for exactly counting. We design a fully polynomial-time approximation scheme (FPTAS) for this generalization by correlation decay technique. This is the first deterministic FPTAS for approximate counting in the general Holant framework without a degree bound. We also formally introduce holographic reduction in the study of approximate counting and these weighted Fibonacci gate problems serve as computation primitives for approximate counting. Under holographic reduction, we obtain FPTAS for other Holant problems and spin problems. One important application is developing an FPTAS for a large range of ferromagnetic two-state spin systems. This is the first deterministic FPTAS in the ferromagnetic range for two-state spin systems without a degree bound. Besides these algorithms, we also develop several new tools and techniques to establish the correlation decay property, which are applicable in other problems

    OM Theory and V-duality

    Get PDF
    We show that the (M5, M2, M2', MW) bound state solution of eleven dimensional supergravity recently constructed in hep-th/0009147 is related to the (M5, M2) bound state one by a finite Lorentz boost along a M5-brane direction perpendicular to the M2-brane. Given the (M5, M2) bound state as a defining system for OM theory and the above relation between this system and the (M5, M2, M2', MW) bound state, we test the recently proposed V-duality conjecture in OM theory. Insisting to have a decoupled OM theory, we find that the allowed Lorentz boost has to be infinitesimally small, therefore resulting in a family of OM theories related by Galilean boosts. We argue that such related OM theories are equivalent to each other. In other words, V-duality holds for OM theory as well. Upon compactification on either an electric or a `magnetic' circle (plus T-dualities as well), the V-duality for OM theory gives the known one for either noncommutative open string theories or noncommutative Yang-Mills theories. This further implies that V-duality holds in general for the little m-theory without gravity.Comment: 17 pages, typos corrected and references adde

    Parameterized Algorithms for Graph Partitioning Problems

    Full text link
    We study a broad class of graph partitioning problems, where each problem is specified by a graph G=(V,E)G=(V,E), and parameters kk and pp. We seek a subset UVU\subseteq V of size kk, such that α1m1+α2m2\alpha_1m_1 + \alpha_2m_2 is at most (or at least) pp, where α1,α2R\alpha_1,\alpha_2\in\mathbb{R} are constants defining the problem, and m1,m2m_1, m_2 are the cardinalities of the edge sets having both endpoints, and exactly one endpoint, in UU, respectively. This class of fixed cardinality graph partitioning problems (FGPP) encompasses Max (k,nk)(k,n-k)-Cut, Min kk-Vertex Cover, kk-Densest Subgraph, and kk-Sparsest Subgraph. Our main result is an O(4k+o(k)Δk)O^*(4^{k+o(k)}\Delta^k) algorithm for any problem in this class, where Δ1\Delta \geq 1 is the maximum degree in the input graph. This resolves an open question posed by Bonnet et al. [IPEC 2013]. We obtain faster algorithms for certain subclasses of FGPPs, parameterized by pp, or by (k+p)(k+p). In particular, we give an O(4p+o(p))O^*(4^{p+o(p)}) time algorithm for Max (k,nk)(k,n-k)-Cut, thus improving significantly the best known O(pp)O^*(p^p) time algorithm
    corecore