相关论文: Schubert Calculus according to Schubert

In this paper we propose a calculus for expressing algorithms for programming languages transformations. We present the type system and operational semantics of the calculus, and we prove that it is type sound. We have implemented our…

This article aims to find explicit congruences between Dirichlet characters and gives various results on how to find some effectively on a computer. It ends with concrete examples putting those ideas in application.

A method for computing the multigraded Hilbert depth of a module was presented in [16]. In this paper we improve the method and we introduce an effective algorithm for performing the computations. In a particular case, the algorithm may…

A consistently specified halting function may be computed.

Herbrand's theorem is often presented as a corollary of Gentzen's sharpened Hauptsatz for the classical sequent calculus. However, the midsequent gives Herbrand's theorem directly only for formulae in prenex normal form. In the Handbook of…

In the paper, the author finds an explicit formula for computing Bernoulli numbers of the second kind in terms of Stirling numbers of the first kind.

We previously obtained a congruence modulo four for the number of real solutions to many Schubert problems on a square Grassmannian given by osculating flags. Here, we consider Schubert problems given by more general isotropic flags, and…

In [MV], some correspondences were defined between critical points of master functions associated to sl_{N+1} and subspaces of C[x] with given ramification properties. In this paper we show that these correspondences are in fact scheme…

This note is a complement to Pusz--Woronowicz's works on functional calculus for two positive forms from the viewpoint of operator theory. Based on an elementary, self-contained and purely Hilbert space operator explanation of their…

We prove an explicit degree formula for certain unitary Deligne-Lusztig varieties. Combining with an alternative degree formula in terms of Schubert calculus, we deduce several algebraic combinatorial identities which may be of independent…

Schubert varieties have been exhaustively studied with a plethora of techniques: Coxeter groups, explicit desingularization, Frobenius splitting, etc. Many authors have applied these techniques to various other varieties, usually defined by…

We prove two lemmata about Schubert calculus on generalized flag manifolds G/B, and in the case of the ordinary flag manifold GL_n/B we interpret them combinatorially in terms of descents, and geometrically in terms of missing subspaces.…

We discuss some aspects of the theory of subelliptic estimates.

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into either a problem involving a set of infinitely coupled differential equations or a problem involving a Shr\"odinger propagator…

The main goal of this paper is to extend two fundamental combinatorial results in Schubert calculus on flag manifolds from equivariant cohomology and $K$-theory to equivariant elliptic cohomology. The foundations of elliptic Schubert…

We apply recent constructions of free Baxter algebras to the study of the umbral calculus. We give a characterization of the umbral calculus in terms of Baxter algebra. This characterization leads to a natural generalization of the umbral…

Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued…

Using numerical, theoretical and general methods, we construct evaluation formulas for the Jacobi $\theta$ functions. Some of our results are conjectures, but are verified numerically.

In 1776, L. Euler proposed three methods, called prima methodus, secunda methodus and tertia methodus, to calculate formulae for double zeta values. However strictly speaking, his last two methods are mathematically incomplete and require…

We present a modification of the superposition calculus that is meant to generate explanations why a set of clauses is satisfiable. This process is related to abductive reasoning, and the explanations generated are clauses constructed over…