Related papers: Dual graphs from noncommutative and quasisymmetric…
Reed showed that, if two graphs are $P_4$-isomorphic, then either both are perfect or none of them is. In this note we will derive an analogous result for perfect digraphs.
Starting from Seiberg's electric-magnetic duality for supersymmetric QCD, we construct dual pairs of non-supersymmetric gauge theories. This is accomplished by first taking the large N limit of supersymmetric QCD and its dual partner and…
We extend the duality between acyclic orientations and totally cyclic orientations on planar graphs to dualities on graphs on orientable surfaces by introducing boundary acyclic orientations and totally bi-walkable orientations. In…
The classical Pieri formula gives a combinatorial rule for decomposing the product of a Schur function and a complete homogeneous symmetric polynomial as a linear combination of Schur functions with integer coefficients. We give a Pieri…
We use Young's raising operators to derive a Pieri rule for the ring generated by the indeterminates $h_{r,s}$ given in Macdonald's 9th Variation of the Schur functions. Under an appropriate specialisation of $h_{r,s}$, we derive the Pieri…
It is shown that shift graphs can be realized as disjointness graphs of 1-intersecting curves in the plane. This implies that the latter class of graphs is not $\chi$-bounded.
The $Q$-polynomial property is an algebraic property of distance-regular graphs, that was introduced by Delsarte in his study of coding theory. Many distance-regular graphs admit the $Q$-polynomial property. Only recently the $Q$-polynomial…
We describe generating functions for several important families of classical symmetric functions and shifted Schur functions. The approach is originated from vertex operator realization of symmetric functions and offers a unified method to…
We characterize Cohen-Macaulay posets of dimension two; they are precisely the shellable and strongly connected posets of dimension two. We also give a combinatorial description of these posets. Using the fact that co-comparability graph of…
Bidirected graphs (earlier studied by Edmonds, Johnson and, in equivalent terms of skew-symmetric graphs, by Tutte, Goldberg, Karzanov, and others) proved to be a useful unifying language for describing both flow and matching problems. In…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
We consider nonsymmetric operads with two binary operations satisfying relations in arity 3; hence these operads are quadratic, and so we can investigate Koszul duality. We first consider operations which are nonassociative (not necessarily…
Distinguished selfadjoint extensions of operators which are not semibounded can be deduced from the positivity of the Schur Complement (as a quadratic form). In practical applications this amounts to proving a Hardy-like inequality.…
We introduce a new categorical framework for studying derived functors, and in particular for comparing composites of left and right derived functors. Our central observation is that model categories are the objects of a double category…
We define a new basis of quasisymmetric functions, the row-strict dual immaculate functions, as the generating function of a particular set of tableaux. We establish that this definition gives a function that can also be obtained by…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. In their original paper they developed formulas, generating…
A graph is Schur-positive if its chromatic symmetric function expands non-negatively in the Schur basis. We determine a full Schur-positivity classification for complete multipartite graphs by showing that a complete multipartite graph…
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…