Minimal length, Friedmann equations and maximum density
نویسندگان
چکیده
منابع مشابه
Cardassian Expansion: Dark Energy Density from Modified Friedmann Equations
The Cardassian universe is a proposed modification to the Friedmann equation in which the universe is flat, matter dominated, and accelerating. In the ordinary Friedmann equation, the right hand side is a linear function of the energy density, H ∼ ρ. Here, instead, the right hand side of the Friedmann equation is a different function of the energy density, H ∼ g(ρ). This function returns to ord...
متن کاملCapillary electrophoresis sequencing: maximum read length at minimal cost.
DNA sequencing is a mainstay of molecular genetic and genomic research (1). In recent years, increased throughput and the ability to automate gel preparation and sample loading have driven the popularity of capillary electrophoresis (CE)-based DNA sequencers such as the CEQ 2000XL (Beckman Coulter, Fullerton, CA, USA), the MegaBACE (Amersham Biosciences, Piscataway, NJ, USA), and the ABI PRIS...
متن کاملOn asymptotic solutions of Friedmann equations
Our main aim is to apply the theory of regularly varying functions to the asymptotical analysis at infinity of solutions of Friedmann cosmological equations. A new constant C is introduced related to the Friedmann cosmological equations. Determining the values of C we obtain the asymptotical behavior of the solutions, i.e. of the expansion scale factor aðtÞ of a universe. The instance C < 4 is ...
متن کاملFirst Law of Thermodynamics and Friedmann Equations of Friedmann-Robertson-Walker Universe
Applying the first law of thermodynamics to the apparent horizon of a FriedmannRobertson-Walker universe and assuming the geometric entropy given by a quarter of the apparent horizon area, we derive the Friedmann equations describing the dynamics of the universe with any spatial curvature. Using entropy formulae for the static spherically symmetric black hole horizons in Gauss-Bonnet gravity an...
متن کاملFinding a Length-Constrained Maximum-Density Path in a Tree
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E , where w(e) is an edge weight function for e ∈ E . The density of a path, say e1, e2, . . . , ek , is defined as ∑k i=1 w(ei )/k. The length of a path is the number of its edges. Given a tree with n edges and a lower bound L where 1 ≤ L ≤ n, this paper presents two efficient algorithms for finding a maximum-den...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2014
ISSN: 1029-8479
DOI: 10.1007/jhep06(2014)093