Generalizing the continuous rank function of Barja-Pardini-Stoppino, in this paper we consider cohomological rank functions of Q-twisted (complexes of) coherent sheaves on abelian varieties. They satisfy a natural transformation formula with respect to the Fourier-Mukai-Poincar´e transform, which has several consequences. In many concrete geometric contexts these functions provide useful invariants. We illustrate this with two different applications, the first one to GVsubschemes and the second one to multiplication maps of global sections of ample line bundles on abelian varieties.

No abstract uploaded!

Surface-related-multiple wavefields constitute redundant information in conventional migration and can often be difficult to attenuate. However, when used for migration, multiple wavefields can improve subsurface illumination. Unfortunately, the process of imaging using multiples involves the management of crosstalk, which largely restricts its application. Crosstalk causes phantom images formed by spurious correlation of unrelated events in a migration process. These events can be unrelated orders of multiples in the source and receiver wavefields; they can also be one event associated with a reflector in the source wavefield and another event generated by a different reflector in the receiver wavefield. We have first examined crosstalk by explicitly investigating its generation mechanisms in a migration process and classifying it into different categories based on causality. Following this analysis, crosstalk can be predicted in a migration process and subtracted in the image domain; however, this method is usually difficult to apply due to the complexity of wavefield separation and adaptive subtraction. Furthermore, we develop different algorithms to attenuate the crosstalk, including a deconvolution imaging condition, a least-squares migration (LSM) method, and an advanced algorithm combining LSM with a deconvolution imaging condition. We evaluate these different strategies with synthetic examples. A deconvolution imaging condition can attenuate some crosstalk, but it is less effective at suppressing strong coherent crosstalk events. However, the LSM method can fundamentally address the crosstalk issue, and this approach is further optimized when combined with a deconvolution imaging condition.

Current methods cannot tell us what the nature of the protein universe is concretely. They are based on different models of amino acid substitution and multiple sequence alignment which is an NP-hard problem and requires manual intervention. Protein structural analysis also gives a direction for mapping the protein universe. Unfortunately, now only a minuscule fraction of proteins' 3-dimensional structures are known. Furthermore, the phylogenetic tree representations are not unique for any existing tree construction methods. Here we develop a novel method to realize the nature of protein universe. We show the protein universe can be realized as a protein space in 60-dimensional Euclidean space using a distance based on a normalized distribution of amino acids. Every protein is in one-to-one correspondence with a point in protein space, where proteins with similar properties stay close together. Thus the distance between two points in protein space represents the biological distance of the corresponding two proteins. We also propose a natural graphical representation for inferring phylogenies. The representation is natural and unique based on the biological distances of proteins in protein space. This will solve the fundamental question of how proteins are distributed in the protein universe.

We determine the asymptotics of the independence number of the random d-regular graph for all d≥d0. It is highly concentrated, with constant-order fluctuations around nα∗−c∗logn for explicit constants α∗(d) and c∗(d). Our proof rigorously confirms the one-step replica symmetry breaking heuristics for this problem, and we believe the techniques will be more broadly applicable to the study of other combinatorial properties of random graphs.