Related papers: The Littlewood-Richardson rule, and related combin…
A topological version of Levinson's theorem is presented. Its proof relies on a C*-algebraic framework which is introduced in detail. Various scattering systems are considered in this framework, and more coherent explanations for the…
In the framework of scattering theory, we show how the scattering matrix can be related to the projection on the bound states by an index map of K-theory. Pairings with appropriate cyclic cocyles lead naturally to a topological version of…
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
In this paper, some of formulations of Hamilton-Jacobi equations for Hamiltonian system and regular reduced Hamiltonian systems are given. At first, an important lemma is proved, and it is a modification for the corresponding result of…
This work deals with a new generalization of $r$-Stirling numbers using $l$-tuple of permutations and partitions called $(l,r)$-Stirling numbers of both kinds. We study various properties of these numbers using combinatorial interpretations…
In arXiv:0907.3784, we introduced a variant of non-commutative Donaldson-Thomas theory in a combinatorial way, which is related with topological vertex by a wall-crossing phenomenon. In this paper, we (1) provide an alternative definition…
Building upon the rule-algebraic stochastic mechanics framework, we present new results on the relationship of stochastic rewriting systems described in terms of continuous-time Markov chains, their embedded discrete-time Markov chains and…
Wall-crossing phenomena are ubiquitous in many problems of algebraic geometry and theoretical physics. Various ways to encode the relevant information and the need to track the changes under the variation of parameters lead to rather…
We survey the classical results of the Dirichlet Approximation Theorem.
We attempt to survey the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status. We give a personal viewpoint on the field, while remaining aware that there is…
This paper proves a combinatorial rule expressing the product $s_\tau(s_{\lambda/\mu} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur…
We propose a combinatorial model for the Schubert structure constants of the complete flag manifold when one of the factors is Grassmannian.
A consequence of work of Klyachko and of Knutson-Tao is the Horn recursion to determine when a Littlewood-Richardson coefficient is non-zero. Briefly, a Littlewood-Richardson coefficient is non-zero if and only if it satisfies a collection…
We prove that a conjecture of Fomin, Fulton, Li, and Poon, associated to ordered pairs of partitions, holds for many infinite families of such pairs. We also show that the bounded height case can be reduced to checking that the conjecture…
Gordon and Litherland's paper $\textit{On the Signature of a link}$ introduced a bilinear form that simultaneously unifies both the quadratic forms of Trotter and Goeritz. This remarkable pairing of combinatorics and topology has had…
In his 1951 book "Infinite Abelian Groups", Kaplansky gives a combinatorial characterization of the isomorphism types of embeddings of a cyclic subgroup in a finite abelian group. In this paper we first use partial maps on…
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…
The control of bilinear systems has attracted considerable attention in the field of systems and control for decades, owing to their prevalence in diverse applications across science and engineering disciplines. Although much work has been…