Related papers: Dual graphs from noncommutative and quasisymmetric…

We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…

We prove that a fractional perfect matching in a non-bipartite graph can be written, in polynomial time, as a convex combination of perfect matchings. This extends the Birkhoff-von Neumann Theorem from bipartite to non-bipartite graphs. The…

The overall aim of this paper is to define a structure of graph operads, thus generalizing the celebrated pre-Lie operad on rooted trees. More precisely, we define two operads on multigraphs, and exhibit a non trivial link between them and…

The Pieri rule expresses the product of a Schur function and a single row Schur function in terms of Schur functions. We extend the classical Pieri rule by expressing the product of a skew Schur function and a single row Schur function in…

We make a systematic study of a new combinatorial construction called a dual equivalence graph. We axiomatize these graphs and prove that their generating functions are symmetric and Schur positive. By constructing a graph on ribbon…

We propose 2d $\mathcal{N}=(0,2)$ dualities between SU(N) gauge theories with fundamental and antisymmetric chiral matter and Landau-Ginzburg theories with chiral and Fermi multiplets. Many of these dualities can be derived by topologically…

In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental…

We show that the left and right adjoint of the Schur functor can be expressed in terms of the monoidal structure of strict polynomial functors. Using this result we give a necessary and sufficient condition for when the tensor product of…

We introduce structured decompositions, category-theoretic structures which simultaneously generalize notions from graph theory (including treewidth, layered treewidth, co-treewidth, graph decomposition width, tree independence number,…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with diameter $D \geq 3$ and standard module $V$. Recently Ito and Terwilliger introduced four direct sum decompositions of $V$; we call these the $(\mu,\nu)$--{\it split…

We introduce a notion of $Q$-algebra that can be considered as a generalization of the notion of $Q$-manifold (a supermanifold equipped with an odd vector field obeying $\{Q,Q\} =0$). We develop the theory of connections on modules over…

We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The…

A digraph $D=(V, A)$ has a good pair at a vertex $r$ if $D$ has a pair of arc-disjoint in- and out-branchings rooted at $r$. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such that $H_i$ has…

To every labeled poset (P,\omega), one can associate a quasisymmetric generating function for its (P,\omega)-partitions. We ask: when do two labeled posets have the same generating function? Since the special case corresponding to skew…

The Schubert bases of the torus-equivariant homology and cohomology rings of the affine Grassmannian of the special linear group are realized by new families of symmetric functions called k-double Schur functions and affine double Schur…

In our previous papers, together with J. Paseka we introduced so-called sectionally pseudocomplemented lattices and posets and illuminated their role in algebraic constructions. We believe that - similar to relatively pseudocomplemented…

The action of the Bernstein operators on Schur functions was given in terms of codes in [CG] and extended to the analog in Schur Q-functions in [HJS]. We define a new combinatorial model of extended codes and show that both of these results…

Graph symmetries intervene in diverse applications, from enumeration, to graph structure compression, to the discovery of graph dynamics (e.g., node arrival order inference). Whereas Erd\H{o}s-R\'enyi graphs are typically asymmetric, real…

The non-renormalization theorems of chiral vertex functions are derived on the basis of an algebraic analysis. The property, that the interaction vertex is a second supersymmetry variation of a lower dimensional field monomial, is used to…

There is considerable current interest in determining when the difference of two skew Schur functions is Schur positive. We consider the posets that result from ordering skew diagrams according to Schur positivity, before focussing on the…