首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
In this paper we compute the cohomology with compact supports of a Siegelthreefold as a virtual module over the product of the Galois group of over and the Hecke algebra. We use a method which has been developed by Ihara, Langlands and Kottwitz: comparison of the Grothendieck--Lefschetz formula and the Arthur--Selberg trace formula.  相似文献   

2.
We provide a characterization of the real-valued univariate polynomials that have only real zeros, all in a prescribed interval [a,b]. The conditions are stated in terms of positive semidefiniteness of related Hankel matrices.  相似文献   

3.
Let X be a complex analytic manifold, a C 2 submanifold, an openset with C 2 boundary .Denote by (resp. ) the microlocalization along M (resp. ) of the sheaf of holomorphic functions.In the literature (cf. [A-G], [K-S 1,2])one encounters two classical results concerning the vanishing of the cohomology groups .The most general gives the vanishing outside a range of indices j whose length is equal to (with being the number of respectively positive, negative and null eigenvalues for themicrolocal Levi form ).The sharpest result gives the concentration in a single degree, provided that the difference is locally constant for near p (with for z the base point of p).The first result was restated for the complex in [D'A-Z 2], in the case codim We extend it here to any codimension and moreover we also restate for the second vanishing theorem.We also point out that the principle of our proof, related to a criterion for constancy of sheaves due to [K-S 1], is a quite new one.  相似文献   

4.
We calculate the skew-symmetric cohomology of the complement of a discriminantal hyperplane arrangement with coefficients in local systems arising in the context of the representation theory of the Lie algebra . For a discriminantal arrangement in k, the skew-symmetric cohomology is nontrivial in dimension k–1 precisely when the 'master function' which defines the local system on the complement has nonisolated criticalpoints. In symmetric coordinates, the critical set is a union of lines. Generically, the dimension of this nontrivial skew-symmetric cohomology group is equal to the number of critical lines.  相似文献   

5.
A modal logic associated with the -spaces introduced by Ershov is examined. We construct a modal calculus that is complete w.r.t. the class of all strictly linearly ordered -frames, and the class of all strictly linearly ordered -frames.  相似文献   

6.
We show that, under conditions about the microcharacteristic variety of a coherent -module, the Cauchy problem is well-posed in the spaces of formal power series with Gevrey growth. We deduce that the filtration of the Irregularity Sheaf of a holonomic -module, which we defined in a previous work, is preserved under inverse image if some rather general geometric conditions are fullfilled.  相似文献   

7.
8.
A formalism for studying dispersionless integrable hierarchies is applied to the dispersionless KP (dKP) hierarchy. We relate this formalism to the theory of quasiconformal mappings on the plane and present some classes of explicit solutions of the dKP hierarchy.  相似文献   

9.
Let X be a G-connected nilpotent simplicial set, where G is a finite Hamiltonian group. We construct a cofibrant equivariant minimal model of X with the strong homotopy type of the injective minimal model of X defined by Triantafillou.  相似文献   

10.
In this paper, we introduce a simple formula for conditional Wiener integrals over , the space of abstract Wiener space valued continuous functions. Using this formula, we establish various formulas for a conditional Wiener integral and a conditional Feynman integral of functionals on in certain classes which correspond to the classes of functionals on the classical Wiener space introduced by Cameron and Storvick. We also evaluate the conditional Wiener integral and conditional Feynman integral for functionals of the form which are of interest in Feynman integration theories and quantum mechanics.  相似文献   

11.
S. Goncharov and S. Badaev showed that for , there exist infinite families whose Rogers semilattices contain ideals without minimal elements. In this connection, the question was posed as to whether there are examples of families that lack this property. We answer this question in the negative. It is proved that independently of a family chosen, the class of semilattices that are principal ideals of the Rogers semilattice of that family is rather wide: it includes both a factor lattice of the lattice of recursively enumerable sets modulo finite sets and a family of initial segments in the semilattice of -degrees generated by immune sets.  相似文献   

12.
In this paper, we classify all optimal linear[n, n/2] codes up to length 12. We show that thereis a unique optimal [10, 5, 5] code up to equivalence.  相似文献   

13.
It is shown that the braid group defies lattice ordering.  相似文献   

14.
With the help of some new results about weight enumerators of self-dual codes over we investigate a class of double circulant codes over , one of which leads to an extremal even unimodular 40–dimensional lattice. It is conjectured that there should be Nine more constructions of the Leech lattice  相似文献   

15.
The main goal of the paper is to give explicit formulas for the fundamental classes of Schubert subschemes in Lagrangian and orthogonal Grassmannians of maximal isotropic subbundles as well as some globalizations of them. The used geometric tools overlap appropriate desingularizations of such Schubert subschemes and Gysin maps for such Grassmannian bundles. The main algebraic tools are provided by the families of and -polynomials introduced and investigated in the present paper. The key technical result of the paper is the computation of the class of the (relative) diagonal in isotropic Grassmannian bundles based on the orthogonality property of and polynomials. Some relationships with quaternionic Schubert varieties and Schubert polynomials for classical groups are also discussed.  相似文献   

16.
The appearance of the theory of zero-knowledge, presented by Goldwasser, Micali and Rackoff in 1985, opened a way to secure identification schemes. The first application was the famous Fiat-Shamir scheme based on the problem of modular square roots extraction. In the following years, many other schemes have been proposed, some Fiat-Shamir extensions but also new discrete logarithm based schemes. Therefore, all of them were based on problems from number theory. Their main common drawback is high computational load because of arithmetical operations modulo large integers. Implementation on low-cost smart cards was made difficult and inefficient.With the Permuted Kernels Problem (PKP), Shamir proposed the first efficient scheme allowing for an implementation on such low-cost smart cards, but very few others have afterwards been suggested.In this paper, we present an efficient identification scheme based on a combinatorial -complete problem: the Permuted Perceptrons Problem (PPP). This problem seems hard enough to be unsolvable even with very small parameters, and some recent cryptanalysis studies confirm that position. Furthermore, it admits efficient zero-knowledge proofs of knowledge and so it is well-suited for cryptographic purposes. An actual implementation completes the optimistic opinion about efficiency and practicability on low-cost smart cards, and namely with less than 2KB of EEPROM and just 100 Bytes of RAM and 6.4 KB of communication.  相似文献   

17.
In this paper, we study the -optimal control problem with additional constraints on the magnitude of the closed-loop frequency response. In particular, we study the case of magnitude constraints at fixed frequency points (a finite number of such constraints can be used to approximate an -norm constraint). In previous work, we have shown that the primal-dual formulation for this problem has no duality gap and both primal and dual problems are equivalent to convex, possibly infinite-dimensional, optimization problems with LMI constraints. Here, we study the effect of approximating the convex magnitude constraints with a finite number of linear constraints and provide a bound on the accuracy of the approximation. The resulting problems are linear programs. In the one-block case, both primal and dual programs are semi-infinite dimensional. The optimal cost can be approximated, arbitrarily well from above and within any predefined accuracy from below, by the solutions of finite-dimensional linear programs. In the multiblock case, the approximate LP problem (as well as the exact LMI problem) is infinite-dimensional in both the variables and the constraints. We show that the standard finite-dimensional approximation method, based on approximating the dual linear programming problem by sequences of finite-support problems, may fail to converge to the optimal cost of the infinite-dimensional problem.  相似文献   

18.
Grobler  J.J. 《Positivity》1999,3(4):357-364
Let be an Abelian Archimedean lattice ordered algebra. The order bidual furnished with the Arens product is again a lattice ordered algebra. We show that the order continuous order bidual is Abelian. This solves an open problem and improves a result of Scheffold, who proved it for the case of normed lattice ordered algebras. The proof is based on the up-down-up approximation of positive elements in the order continuous order bidual by elements in the canonical image of in Components of positive elements in are characterized and the result is applied to the Arens product of -and almost -algebras.  相似文献   

19.
We describe an algorithm for embedding a finite-dimensional Lie algebra (superalgebra) into a Lie algebra (superalgebra) of vector fields that is suitable for a ground field of any characteristic and also a way to select the Cartan, complete, and partial prolongations of the Lie algebra of vector fields using differential equations. We illustrate the algorithm with the example of Cartan’s interpretation of the exceptional simple Lie algebra (2) as the Lie algebra preserving a certain nonintegrable distribution and also several other examples. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 147, No. 3, pp. 450–469, June, 2006.  相似文献   

20.
Generalizing techniques developed by Cuesta and Matrán for Bochner integrable random vectors of a separable Banach space, we prove a strong law of large numbers for Pettis integrable random elements of a separable locally convex space E. This result may be seen as a compactness result in a suitable topology on the set of Pettis integrable probabilities on E.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号