English
Related papers

Related papers: Acyclic orientations and Hessenberg varieties

200 papers

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics and LLT polynomials. In the, so called, abelian case they are also…

Combinatorics · Mathematics 2023-01-11 Laura Colmenarejo , Alejandro H. Morales , Greta Panova

Using similarities between topological $K$-theory and periodic cyclic homology we show that, after tensoring with $\mathbb C$, for certain Fr\'echet algebras the Chern character provides an isomorphism between these functors. This is…

K-Theory and Homology · Mathematics 2008-09-29 Maarten Solleveld

We express the integral form Macdonald polynomials as a weighted sum of Shareshian and Wachs' chromatic quasisymmetric functions of certain graphs. Then we use known expansions of these chromatic quasisymmetric functions into Schur and…

Combinatorics · Mathematics 2018-03-26 James Haglund , Andrew Timothy Wilson

In this we consider weighted symmetric digraph. Our result generalizes the work of Zhu (J.Comb.Theory, Ser.B, 86 (2002) 109-113) concerning the (k,d)-coloring of a graph, and thus is also a generalization of a corresponding result of Tuza…

Combinatorics · Mathematics 2007-05-23 Hong-Gwa Yeh

The dichromatic number and the diachromatic number are generalizations of the chromatic number and the achromatic number for digraphs considering acyclic colorings. In this paper, we determine the diachromatic number of digraphs arising…

Combinatorics · Mathematics 2024-12-05 Mika Olsen , Christian Rubio-Montiel , Alejandra Silva-Ramírez

We provide a general framework for proving asymptotic equidistribution, convexity, and log concavity of coefficients of generating functions on arithmetic progressions. Our central tool is a variant of Wright's Circle Method proved by two…

Number Theory · Mathematics 2021-12-08 Giulia Cesana , William Craig , Joshua Males

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

Combinatorics · Mathematics 2018-08-09 Veselin Blagoev

We exhibit non-switching-isomorphic signed graphs that share a common underlying graph and common chromatic polynomials, thereby answering a question posed by Zaslavsky. For various joins of all-positive or all-negative signed complete…

Combinatorics · Mathematics 2024-07-02 Gary R. W. Greaves , Jeven Syatriadi , Charissa I. Utomo

We introduce and study elementary properties of graph homology of algebras. This new homology theory shares many features of cyclic and Hochschild homology. We also define a graph K-theory together with an analog of Chern character.

K-Theory and Homology · Mathematics 2007-05-23 M. V. Movshev

There is a natural bijection between Dyck paths and basis diagrams of the Temperley-Lieb algebra defined via tiling. Overhang paths are certain generalisations of Dyck paths allowing more general steps but restricted to a rectangle in the…

Combinatorics · Mathematics 2020-12-21 Bethany Marsh , Paul Martin

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics, and LLT polynomials. In the case of, so-called, abelian Dyck paths…

Combinatorics · Mathematics 2021-04-22 Laura Colmenarejo , Alejandro H. Morales , Greta Panova

We prove generating series formulae for suitable twisted characteristic classes of symmetric products of a singular complex quasi-projective variety. More concretely, we study homology Hirzebruch classes for motivic coefficients, as well as…

Algebraic Geometry · Mathematics 2012-07-25 Sylvain E. Cappell , Laurentiu Maxim , Joerg Schuermann , Julius L. Shaneson , Shoji Yokura

An orientation of a graph is semi-transitive if it contains no directed cycles and has no shortcuts. An undirected graph is semi-transitive if it can be oriented in a semi-transitive manner. The class of semi-transitive graphs includes…

Combinatorics · Mathematics 2024-08-12 Sergey Kitaev , Artem Pyatkin

We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…

Regular semisimple Hessenberg varieties admit actions of associated Weyl groups on their cohomology space of each degree. In this paper, we consider the module structure of the cohomology spaces of regular semisimple Hessenberg varieties of…

Algebraic Geometry · Mathematics 2022-06-30 Soojin Cho , Jaehyun Hong , Eunjeong Lee

We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…

Discrete Mathematics · Computer Science 2023-06-22 Christopher Duffy , Gary MacGillivray , Éric Sopena

We prove a new signed elementary symmetric function expansion of the chromatic quasisymmetric function of any natural unit interval graph. We then use a sign-reversing involution to prove a new combinatorial formula for K-chains, which are…

Combinatorics · Mathematics 2024-05-09 Foster Tom

It is known that unicellular LLT polynomials are related to the quasi-symmetric chromatic polynomials of certain graphs by the $(t-1)$-transform of symmetric functions. We investigate the extension of this transformation to various…

Combinatorics · Mathematics 2020-03-23 Jean-Christophe Novelli , Jean-Yves Thibon

In this paper, we will show that for a smooth quasi-projective variety over $\C,$ and a regular function $W:X\to \C,$ the periodic cyclic homology of the DG category of matrix factorizations $MF(X,W)$ is identified (unde Riemann-Hilbert…

Algebraic Geometry · Mathematics 2025-02-10 Alexander I. Efimov

We introduce path-conjoined graphs defined for two rooted graphs by joining their roots with a path, and investigate the chromatic symmetric functions of its two generalizations: spider-conjoined graphs and chain-conjoined graphs. By using…

Combinatorics · Mathematics 2026-02-04 E. Y. J. Qi , D. Q. B. Tang , D. G. L. Wang
‹ Prev 1 3 4 5 6 7 10 Next ›