English
Related papers

Related papers: Triangular Ladders $P_{d,2}$ are $e$-positive

200 papers

We construct a new family of graded representations $\widetilde{W}_{\lambda}$ indexed by Young diagrams $\lambda$ for the positive elliptic Hall algebra $\mathcal{E}^{+}$ which generalizes the standard $\mathcal{E}^{+}$ action on symmetric…

Representation Theory · Mathematics 2023-10-17 Milo Bechtloff Weising

We construct a new family of graded representations $\widetilde{W}_{\lambda}$ for the positive elliptic Hall algebra $\mathcal{E}^{+}$ indexed by Young diagrams $\lambda$ which generalize the standard $\mathcal{E}^{+}$ action on symmetric…

Combinatorics · Mathematics 2024-05-03 Milo Bechtloff Weising

Sazdanovic and Yip defined a categorification of Stanley's chromatic function called the chromatic symmetric homology. In this paper we prove that (as conjectured by Chandler, Sazdanovic, Stella and Yip), if a graph $G$ is non-planar, then…

Combinatorics · Mathematics 2023-07-19 Azzurra Ciliberti , Luca Moci

Thomassen conjectured that triangle-free planar graphs have an exponential number of $3$-colorings. We show this conjecture to be equivalent to the following statement: there exists a positive real $\alpha$ such that whenever $G$ is a…

Combinatorics · Mathematics 2017-09-20 Zdeněk Dvořák , Jean-Sébastien Sereni

Amit, Linial, and Matou\vsek (Random lifts of graphs III: independence and chromatic number, Random Struct. Algorithms, 2001) have raised the following question: Is the chromatic number of random $h$-lifts of $K_5$ asymptotically (for…

Combinatorics · Mathematics 2011-08-02 Babak Farzad , Dirk Oliver Theis

Motivated by the notion of nice graphs, we introduce the concept of strongly nice property, which can be used to study the Schur positivity of symmetric functions. We show that a graph and all its induced subgraphs are strongly nice if and…

Combinatorics · Mathematics 2024-08-28 Ethan Y. H. Li , Grace M. X. Li , Arthur L. B. Yang , Zhong-Xue Zhang

We provide a purely local computation of the (elliptic) twisted (by "transpose-inverse") character of the representation \pi=I(\1) of PGL(3) over a p-adic field induced from the trivial representation of the maximal parabolic subgroup. This…

Representation Theory · Mathematics 2007-11-29 Yuval Z. Flicker , Dmitrii Zinoviev

We study two parameters obtained from the Euler characteristic by replacing the number of faces with that of induced and induced non-separating cycles. By establishing monotonicity of such parameters under certain homomorphism and edge…

Combinatorics · Mathematics 2018-08-31 Hanbaek Lyu

We present an infinite family of 3-connected non-bipartite graphs with chromatic roots in the interval (1,2) thus resolving a conjecture of Jackson's in the negative. In addition, we briefly consider other graph classes that are conjectured…

Combinatorics · Mathematics 2007-05-23 Gordon F. Royle

Let $P$ be a poset, $inc(P)$ its incomparability graph, and $X_{inc(P)}$ the corresponding chromatic symmetric function, as defined by Stanley in {\em Adv. Math.}, {\bf 111} (1995) pp.~166--194. Certain conditions on $P$ imply that the…

Combinatorics · Mathematics 2021-05-04 Mark Skandera

Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…

Combinatorics · Mathematics 2015-08-12 Masahiko Yoshinaga

FPSAC 2013 Extended Abstract. We introduce a new basis of the non-commutative symmetric functions whose elements have Schur functions as their commutative images. Dually, we build a basis of the quasi-symmetric functions which expand…

Combinatorics · Mathematics 2013-03-21 Chris Berg , Nantel Bergeron , Franco Saliola , Luis Serrano , Mike Zabrocki

Resolving a conjecture of Bollob\'{a}s and Erd\H{o}s, Gy\'{a}rf\'{a}s proved that every graph $G$ of chromatic number $k+1\geq 3$ contains cycles of $\lfloor\frac{k}{2}\rfloor$ distinct odd lengths. We strengthen this prominent result by…

Combinatorics · Mathematics 2021-04-07 Jun Gao , Qingyi Huo , Jie Ma

In this paper, we characterize graphs with circular chromatic number less than 3 in terms of certain balancing labellings studied in the context of signed graphs. In fact, we construct a signed graph which is universal for all such…

Combinatorics · Mathematics 2025-12-09 Manuel Bodirsky , Santiago Guzmán-Pro , Moritz Jahn , Matěj Konečný , Paul Winkler

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

In this note we study the Landis conjecture for positive Schr\"odin\-ger operators on graphs. More precisely, we prove a Landis-type result in the form of a decay criterion that ensures when $\mathcal{H}$-harmonic functions for a positive…

Analysis of PDEs · Mathematics 2025-05-27 Ujjal Das , Matthias Keller , Yehuda Pinchover

In a previous work [Scientific Reports 4, 6193(2014)] we proved the existence of scale symmetry in square and triangular (thus honeycomb) lattices by investigating the functiony=\arcsin(\sin(2\pinx)), where the parameter is either the…

Mathematical Physics · Physics 2014-10-21 Cao Zexian

Cylindric skew Schur functions, which are a generalisation of skew Schur functions, arise naturally in the study of P-partitions. Also, recent work of A. Postnikov shows they have a strong connection with a problem of considerable current…

Combinatorics · Mathematics 2007-05-23 Peter McNamara

Let $G$ be a simple graph with the Laplacian matrix $L(G)$ and let $e(G)$ be the number of edges of $G$. A conjecture by Brouwer and a conjecture by Grone and Merris state that the sum of the $k$ largest Laplacian eigenvalues of $G$ is at…

Combinatorics · Mathematics 2018-09-13 Asghar Bahmani

A $(a,b)$-coloring of a graph $G$ associates to each vertex a $b$-subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define general reduction tools for $(a,b)$-coloring of graphs for $2\le…

Combinatorics · Mathematics 2023-10-06 Jean-Christophe Godin , Olivier Togni