Related papers: The Littlewood-Richardson rule, and related combin…
We present a class of lattices in R^d (d >= 2) which we call GL-lattices and conjecture that any lattice is such. This conjecture is referred to as GLC. Littlewood's conjecture amounts to saying that Z^2 is GL. We then prove existence of GL…
Two general methods for establishing the logarithmic behavior of recursively defined sequences of real numbers are presented. One is the interlacing method, and the other one is based on calculus. Both methods are used to prove logarithmic…
We give elementary and short proofs of the Littlewood-Richardson rules for type A Grassmannians and maximal isotropic Grassmannians, based on the corresponding Pieri rules.
We present a novel algebraic combinatorial view on low-rank matrix completion based on studying relations between a few entries with tools from algebraic geometry and matroid theory. The intrinsic locality of the approach allows for the…
This note is an extended abstract of my talk at the workshop on Representation Theory and Symmetric Functions, MSRI, April 14, 1997. We discuss the problem of finding an explicit description of the semigroup $LR_r$ of triples of partitions…
Wilson's formulation of lattice QCD is attractive for many reasons, but perhaps mainly because of its simplicity and conceptual clarity. Numerical simulations of the Wilson theory (and of its improved versions) tend to be extremely…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…
We present a first result towards the use of entailment in- side relational dual tableau-based decision procedures. To this end, we introduce a fragment of RL(1) which admits a restricted form of composition, (R ; S) or (R ; 1), where the…
We introduce and prove some basic results about a combinatorial model which produces embedded polygons in the plane. The model is closely related to outer billiards on kites, and also is related to corner percolation, to Hooper's Truchet…
In this paper, we first introduce multifrational Riemann-Liouville Brownian sheets. Then, we show a result of approximation in law of the multifractional Riemann-Liouville Brownian sheet. The construction of these approximations is based on…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
Schubert polynomials were introduced in the context of the geometry of flag varieties. This paper investigates some of the connections not yet understood between several combinatorial structures for the construction of Schubert polynomials;…
We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood--Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur…
We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…
We construct new relativistic linear differential equation in $d$ dimensions generalizing Dirac equation by employing the Clifford algebra of the cubic polynomial associated to Klein-Gordon operator multiplied by the mass parameter. Unlike…
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Schuetzenberger's jeu de taquin. More precisely, we describe certain structure constants…
This work is devoted to the establishment of a Poisson structure for a format of equations known as Generalized Lotka-Volterra systems. These equations, which include the classical Lotka-Volterra systems as a particular case, have been…
This paper is concerned with the concept of linear repetitivity in the theory of tilings. We prove a general uniform subadditive ergodic theorem for linearly repetitive tilings. This theorem unifies and extends various known (sub)additive…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…