Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userSur les extensions intermediaires des syst`emes locaux dHarris-Taylor
164
0
0.0
(
0
)
Authors
Pascal Boyer
Ask ChatGPT about the research
No Arabic abstract
In the geometric situation of some simple unitary Shimura varieties studied by Harris and Taylor, I have built two filtrations of the perverse sheaf of vanishing cycles. The graduate of the first are the $p$-intermediate extension of some local Harris-Taylors local systems, while for the second, obtained by duality, they are the $p+$-intermediate extensions. In this work, we describe the difference between these $p$ and $p+$ intermediate extension. Precisely, we show, in the case where the local system is associated to an irreducible cuspidal representation whose reduction modulo $l$ is supercuspidal, that the two intermediate extensions are the same. Otherwise, if the reduction modulo $l$ is just cuspidal, we describe the $l$-torsion of their difference.
rate research
Read More
The principal aim of this paper is to construct torsion cohomology classes in the initial terms of a spectral sequence computing the cohomology of a Kottwitz-Harris-Taylor Shimura variety. Beside we produce some global congruences between automorphic representations.
The 2013 Defi de Fouille de Textes (DEFT) campaign is interested in two types of language analysis tasks, the document classification and the information extraction in the specialized domain of cuisine recipes. We present the systems that the LIA has used in DEFT 2013. Our systems show interesting results, even though the complexity of the proposed tasks.
In this paper we present a study of the non-linear effects of anharmonicity of the potential of the simple pendulum. In a theoretical reminder we highlight that anharmonicity of the potential generates additional harmonics and the non-isochronism of oscillations. These phenomena are all the more important as we move away from the oscillations at small angles, which represent the domain of validity of the harmonic approximation. The measurement is apprehended by means of the acquisition box SYSAM-SP5 coupled with the Latis pro software and the Eurosmart pendulum. We show that only a detailed analysis by fitting the recorded curve can provide sufficient accuracy to describe the quadratic evolution of the period as a function of the amplitude of the oscillations. We we can detect the additional harmonics in the oscillations when the amplitude becomes very high.
Let X be a complex analytic manifold and D subset X a free divisor. Integrable logarithmic connections along D can be seen as locally free {cal O}_X-modules endowed with a (left) module structure over the ring of logarithmic differential operators {cal D}_X(log D). In this paper we study two related results: the relationship between the duals of any integrable logarithmic connection over the base rings {cal D}_X and {cal D}_X(log D), and a differential criterion for the logarithmic comparison theorem. We also generalize a formula of Esnault-Viehweg in the normal crossing case for the Verdier dual of a logarithmic de Rham complex.
Bitmap indexes are frequently used to index multidimensional data. They rely mostly on sequential input/output. Bitmaps can be compressed to reduce input/output costs and minimize CPU usage. The most efficient compression techniques are based on run-length encoding (RLE), such as Word-Aligned Hybrid (WAH) compression. This type of compression accelerates logical operations (AND, OR) over the bitmaps. However, run-length encoding is sensitive to the order of the facts. Thus, we propose to sort the fact tables. We review lexicographic, Gray-code, and block-wise sorting. We found that a lexicographic sort improves compression--sometimes generating indexes twice as small--and make indexes several times faster. While sorting takes time, this is partially offset by the fact that it is faster to index a sorted table. Column order is significant: it is generally preferable to put the columns having more distinct values at the beginning. A block-wise sort is much less efficient than a full sort. Moreover, we found that Gray-code sorting is not better than lexicographic sorting when using word-aligned compression.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
