Related papers: Enumerations and Bijections for Stanley Polyominoe…
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…
Inspired by the Stochastic processes described by the Feller Coupling and Chinese Restaurant Processes, we create four different bijections from words in the set $[1]\times [2] \times\cdot \times[n]$ to $S_n$. We then compose these maps…
We introduce a new approach to the enumeration of rational slope parking functions with respect to the area and a generalized dinv statistics, and relate the combinatorics of parking functions to that of affine permutations. We relate our…
The Menichetti-Kaplansky theorem states that a finite semifield that is three-dimensional over its center is either a field or a twisted field of Albert. This implies that a quadratic homogeneous bijection of $\mathbb{P}^2(\mathbb{F}_q)$ is…
We exhibit a bijection between central Delannoy $n$-paths, that is, lattice paths from the origin to $(n,n)$ with steps $E=(1,0), \,N=(0,1),\,D=(1,1)$ and the lattice paths from the origin to $(n+1,n)$ where the only restriction on the…
This work introduces a new class of symmetric matrix structures, called harmonic structures, which enable the generation of all possible directed transitions $(x_i, x_{i+1})$ over a set of $n$ symbols, without internal repetitions. Unlike…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
Stanley's symmetrized chromatic polynomial is a generalization of the ordinary chromatic polynomial to a graph invariant with values in a ring of polynomials in infnitely many variables. The ordinary chromatic polynomial is a specialization…
Main purpose of this paper is to reconstruct generating function of the Bernstein type polynomials. Some properties this generating functions are given. By applying this generating function, not only derivative of these polynomials but also…
In our joint paper with W. Fulton (math.AG/9804041) we prove a formula for the cohomology class of a quiver variety. This formula is general enough to give new expressions for all known types of Schubert polynomials. In the present paper we…
A well-known open problem in graph theory asks whether Stanley's chromatic symmetric function, a generalization of the chromatic polynomial of a graph, distinguishes between any two non-isomorphic trees. Previous work has proven the…
We define the bigraphical arrangement of a graph and show that the Pak-Stanley labels of its regions are the parking functions of a closely related graph, thus proving conjectures of Duval, Klivans, and Martin and of Hopkins and Perkinson.…
In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
Fullerenes are hollow carbon molecules where each atom is connected to exactly three other atoms, arranged in pentagonal and hexagonal rings. Mathematically, they can be combinatorially modeled as planar, 3-regular graphs with facets…
We study some combinatorial properties of higher-dimensional partitions which generalize plane partitions. We present a natural bijection between $d$-dimensional partitions and $d$-dimensional arrays of nonnegative integers. This bijection…
We consider the path ideal associated to a line graph, we compute \texttt{sdepth} for its quotient ring and note that it is equal with its \texttt{depth}. In particular, it satisfies the Stanley inequality.
We compute the Stanley depth of irreducible monomial ideals and we show that the Stanley depth of a monomial complete intersection ideal is the same as the Stanley depth of it's radical. Also, we give some bounds for the Stanley depth of a…
The aim of this paper is to build a theory of commutative and noncommutative {\it injective} valuations of various algebras (including algebras with zero divisors). The targets of our valuations are (well-)ordered commutative and…