中文
相关论文

相关论文: Dual equivalence graphs I: A new paradigm for Schu…

200 篇论文

Dual equivalence graphs are a powerful tool in symmetric function theory that provide a general framework for proving that a given quasisymmetric function is symmetric and Schur positive. In this paper, we study a larger family of graphs…

组合数学 · 数学 2017-04-25 Sami Assaf

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…

组合数学 · 数学 2013-10-24 Sami H. Assaf

We define dual equivalence for any collection of combinatorial objects endowed with a descent set, and we show that giving a dual equivalence establishes the symmetry and Schur positivity of the quasi-symmetric generating function. We give…

组合数学 · 数学 2015-06-15 Sami H. Assaf

We introduce a new paradigm for proving the Schur $P$-positivity. Generalizing dual equivalence, we give an axiomatic definition for a family of involutions on a set of objects to be a queer dual equivalence, and we prove whenever such a…

组合数学 · 数学 2021-03-10 Sami H. Assaf

We consider families of quasisymmetric functions with the property that if a symmetric function $f$ is a positive sum of functions in one of these families, then f is necessarily a positive sum of Schur functions. Furthermore, in each of…

组合数学 · 数学 2015-08-31 Austin Roberts

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…

组合数学 · 数学 2015-03-13 Austin Roberts

By considering type B analogs of permutations and tableaux, we extend abstract dual equivalence to type B in two directions. In one direction, we define involutions on signed permutations and shifted tableaux that give a weak dual…

组合数学 · 数学 2020-03-05 Sami Assaf

In this paper we introduce doubly symmetric functions, arising from the equivalence of particular linear combinations of Schur functions and hook Schur functions. We study algebraic and combinatorial aspects of doubly symmetric functions,…

组合数学 · 数学 2009-04-01 Allan Berele , Bridget Eileen Tenner

Given an element in a finite-dimensional real vector space, $V$, that is a nonnegative linear combination of basis vectors for some basis $B$, we compute the probability that it is furthermore a nonnegative linear combination of basis…

组合数学 · 数学 2021-03-29 Rebecca Patrias , Stephanie van Willigenburg

A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a…

组合数学 · 数学 2024-12-24 Ethan Shelburne , Stephanie van Willigenburg

Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper we present a general method to construct Schur-positive sets…

组合数学 · 数学 2016-11-01 Sergi Elizalde , Yuval Roichman

In this note we classify when a skew Schur function is a positive linear combination of power sum symmetric functions. We then use this to determine precisely when any scalar multiple of a skew Schur function is the chromatic symmetric…

组合数学 · 数学 2018-09-03 Soojin Cho , Stephanie van Willigenburg

We present a single operation for constructing skew diagrams whose corresponding skew Schur functions are equal. This combinatorial operation naturally generalises and unifies all results of this type to date. Moreover, our operation…

组合数学 · 数学 2012-02-01 Peter McNamara , Stephanie van Willigenburg

We prove a general inclusion-exclusion relation for the extended chromatic symmetric function of a weighted graph, which specializes to (extended) $k$-deletion, and we give two methods to obtain numerous new bases from weighted graphs for…

组合数学 · 数学 2021-03-29 Farid Aliniaeifard , Victor Wang , Stephanie van Willigenburg

We define a D_0 graph to be a graph whose vertex set is a subset of permutations of n, with edges of the form ...bac... <--> ...bca... or ...acb... <--> ...cab... (Knuth transformations), or ...bac... <--> ...acb... or ...bca... <-->…

组合数学 · 数学 2016-12-20 Jonah Blasiak

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…

组合数学 · 数学 2026-04-30 Ethan Shelburne , Stephanie van Willigenburg

By establishing relations between operators on compositions, we show that the posets of compositions arising from the right and left Pieri rules for noncommutative Schur functions can each be endowed with both the structure of dual graded…

组合数学 · 数学 2019-07-31 Stephanie van Willigenburg

In this paper we classify when (row-strict) dual immaculate functions and (row-strict) extended Schur functions, as well as their skew generalizations, are symmetric. We also classify when their natural variants, termed advanced functions,…

组合数学 · 数学 2026-04-02 Maria Esipova , Jinting Liang , Stephanie van Willigenburg

This article is dedicated to the study of positivity phenomena for the chromatic symmetric function of a graph with respect to various bases of symmetric functions. We give a new proof of Gasharov's theorem on the Schur-positivity of the…

组合数学 · 数学 2017-03-20 Alexander Paunov

We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $\omega$ on the ring of…

组合数学 · 数学 2018-09-13 Graham Hawkes
‹ 上一页 1 2 3 10 下一页 ›