Related papers: Two combinatorial puzzles arising from the theory …
We associate a polynomial to any diagram of unit cells in the first quadrant of the plane using Kohnert's algorithm for moving cells down. In this way, for every weak composition one can choose a cell diagram with corresponding row-counts,…
Kohnert polynomials and their associated posets are combinatorial objects with deep geometric and representation theoretic connections, generalizing both Schubert polynomials and type A Demazure characters. In this paper, we explore the…
Recently, Pan and Yu showed that Lascoux polynomials can be defined in terms of certain collections of diagrams consisting of unit cells arranged in the first quadrant. Starting from certain initial diagrams, one forms a finite set of…
Lascoux polynomials are a class of nonhomogeneous polynomials which form a basis of the full polynomial ring. Recently, Pan and Yu showed that Lascoux polynomials can be defined as generating polynomials for certain collections of diagrams…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
The meander problem is a combinatorial problem which provides a toy model of the compact folding of polymer chains. In this paper we study various questions relating to the enumeration of meander diagrams, using diagrammatical methods. By…
Kohnert polynomials are polynomials indexed by unit cell diagrams in the first quadrant defined earlier by the author and Searles that give a common generalization of Schubert polynomials and Demazure characters for the general linear…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
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 present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…
This is a book on higher-categorical diagrams, including pasting diagrams. It aims to provide a thorough and modern reference on the subject, collecting, revisiting and expanding results scattered across the literature, informed by recent…
Kohnert proposed the first monomial positive formula for Schubert polynomials as the generating polynomial for certain unit cell diagrams obtained from the Rothe diagram of a permutation. Billey, Jockusch and Stanley gave the first proven…
In this paper, we explore combinatorial properties of the posets associated with Kohnert polynomials. In particular, we determine a sufficient condition guaranteeing when such ``Kohnert posets'' are bounded and two necessary conditions for…
Schubert polynomials are a basis for the polynomial ring that represent Schubert classes for the flag manifold. In this paper, we introduce and develop several new combinatorial models for Schubert polynomials that relate them to other…
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend in some blocks and descend in others. In particular, we…
In this article we consider combinatorial maps approach to graphs on surfaces, and how between them can be establish terminological uniformity in favor of combinatorial maps in way rotations are set as base structural elements and all other…
There are many different algebraic, geometric and combinatorial objects that one can attach to a complex polynomial with distinct roots. In this article we introduce a new object that encodes many of the existing objects that have…
The move-minimizing puzzles presented here are certain types of one-player combinatorial games that are shown to have explicit solutions whenever they can be encoded in a certain way as diamond-colored modular or distributive lattices. Our…
This paper investigates the combinatorics that gives rise to the Boltzmann probability distribution. Despite being one of the most important distributions in physics and other fields of science, the mathematics of the underlying model of…