Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDegrees $d geqslant big( sqrt{n}, log, nbig)^n$ and $d geqslant big( n, log, nbig)^n$ in the Conjectures of Green-Griffiths and of Kobayashi
107
0
0.0
(
0
)
Authors
Joel Merker
Ask ChatGPT about the research
No Arabic abstract
Once first answers in any dimension to the Green-Griffiths and Kobayashi conjectures for generic algebraic hypersurfaces $mathbb{X}^{n-1} subset mathbb{P}^n(mathbb{C})$ have been reached, the principal goal is to decrease (to improve) the degree bounds, knowing that the `celestial horizon lies near $d geqslant 2n$. For Green-Griffiths algebraic degeneracy of entire holomorphic curves, we obtain: [ d ,geqslant, big(sqrt{n},{sf log},nbig)^n, ] and for Kobayashi-hyperbolicity (constancy of entire curves), we obtain: [ d ,geqslant, big(n,{sf log},nbig)^n. ] The latter improves $d geqslant n^{2n}$ obtained by Merker in arxiv.org/1807/11309/. Admitting a certain technical conjecture $I_0 geqslant widetilde{I}_0$, the method employed (Diverio-Merker-Rousseau, Berczi, Darondeau) conducts to constant power $n$, namely to: [ d ,geqslant, 2^{5n} qquad text{and, respectively, to:} qquad d ,geqslant, 4^{5n}. ] In Spring 2019, a forthcoming prepublication based on intensive computer explorations will present several subconjectures supporting the belief that $I_0 geqslant widetilde{I}_0$, a conjecture which will be established up to dimension $n = 50$.
rate research
Read More
Let $p(n)$ denote the partition function. Desalvo and Pak proved the log-concavity of $p(n)$ for $n>25$ and the inequality $frac{p(n-1)}{p(n)}left(1+frac{1}{n}right)>frac{p(n)}{p(n+1)}$ for $n>1$. Let $r(n)=sqrt[n]{p(n)/n}$ and $Delta$ be the difference operator respect to $n$. Desalvo and Pak pointed out that their approach to proving the log-concavity of $p(n)$ may be employed to prove a conjecture of Sun on the log-convexity of ${r(n)}_{ngeq 61}$, as long as one finds an appropriate estimate of $Delta^2 log r(n-1)$. In this paper, we obtain a lower bound for $Delta^2log r(n-1)$, leading to a proof of this conjecture. From the log-convexity of ${r(n)}_{ngeq61}$ and ${sqrt[n]{n}}_{ngeq4}$, we are led to a proof of another conjecture of Sun on the log-convexity of ${sqrt[n]{p(n)}}_{ngeq27}$. Furthermore, we show that $limlimits_{n rightarrow +infty}n^{frac{5}{2}}Delta^2logsqrt[n]{p(n)}=3pi/sqrt{24}$. Finally, by finding an upper bound of $Delta^2 logsqrt[n-1]{p(n-1)}$, we prove an inequality on the ratio $frac{sqrt[n-1]{p(n-1)}}{sqrt[n]{p(n)}}$ analogous to the above inequality on the ratio $frac{p(n-1)}{p(n)}$.
Recent Wilkinson Microwave Anisotropy Probe (WMAP) measurements have determined the baryon density of the Universe $Omega_b$ with a precision of about 4%. With $Omega_b$ tightly constrained, comparisons of Big Bang Nucleosynthesis (BBN) abundance predictions to primordial abundance observations can be made and used to test BBN models and/or to further constrain abundances of isotopes with weak observational limits. To push the limits and improve constraints on BBN models, uncertainties in key nuclear reaction rates must be minimized. To this end, we made new precise measurements of the d(d,p)t and d(d,n)^3He total cross sections at lab energies from 110 keV to 650 keV. A complete fit was performed in energy and angle to both angular distribution and normalization data for both reactions simultaneously. By including parameters for experimental variables in the fit, error correlations between detectors, reactions, and reaction energies were accurately tabulated by computational methods. With uncertainties around 2% +/- 1% scale error, these new measurements significantly improve on the existing data set. At relevant temperatures, using the data of the present work, both reaction rates are found to be about 7% higher than those in the widely used Nuclear Astrophysics Compilation of Reaction Rates (NACRE). These data will thus lead not only to reduced uncertainties, but also to modifications in the BBN abundance predictions.
We show that the geodesic diameter of a polygonal domain with n vertices can be computed in O(n^4 log n) time by considering O(n^3) candidate diameter endpoints; the endpoints are a subset of vertices of the overlay of shortest path maps from vertices of the domain.
In population protocols, the underlying distributed network consists of $n$ nodes (or agents), denoted by $V$, and a scheduler that continuously selects uniformly random pairs of nodes to interact. When two nodes interact, their states are updated by applying a state transition function that depends only on the states of the two nodes prior to the interaction. The efficiency of a population protocol is measured in terms of both time (which is the number of interactions until the nodes collectively have a valid output) and the number of possible states of nodes used by the protocol. By convention, we consider the parallel time cost, which is the time divided by $n$. In this paper we consider the majority problem, where each node receives as input a color that is either black or white, and the goal is to have all of the nodes output the color that is the majority of the input colors. We design a population protocol that solves the majority problem in $O(log^{3/2}n)$ parallel time, both with high probability and in expectation, while using $O(log n)$ states. Our protocol improves on a recent protocol of Berenbrink et al. that runs in $O(log^{5/3}n)$ parallel time, both with high probability and in expectation, using $O(log n)$ states.
We present the first results from an XMM-Newton serendipitous medium-deep survey, which covers nearly three square degrees. We show the log(N)-log(S) distributions for the 0.5-2, 2-10 and 5-10 keV bands, which are found to be in good agreement with previous determinations and with the predictions of XRB models. In the soft band we detect a break at fluxes around 5x10^-15 cgs. In the harder bands, we fill in the gap at intermediate fluxes between deeper Chandra and XMM-Newton observations and shallower BeppoSAX and ASCA surveys. Moreover, we present an analysis of the broad-band properties of the sources.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
