Related papers: An equivalent formulation of chromatic quasi-polyn…
In this study, we introduce the notion of $PL_\delta$-homeomorphisms of $\mathbb{R}^n$. Furthermore, we provide a combinatorial criterion reliant on the vertices and edges of simplicial structures, to determine whether a piecewise-linear…
We study a very large family of graphs, the members of which comprise disjoint paths of cliques with extremal cliques identified. This broad characterisation naturally generalises those of various smaller families of graphs having…
We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…
We introduce partial differential encodings of Boolean functions as a way of measuring the complexity of Boolean functions. These encodings enable us to derive from group actions non-trivial bounds on the Chow-Rank of polynomials used to…
We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials. We show that there are parallel…
The purpose of this article is to study the relationship between numerical invariants of certain subspace arrangements coming from reflection groups and numerical invariants arising in the representation theory of Cherednik algebras. For…
Let G be a graph, and let $\chi$G be its chromatic polynomial. For any non-negative integers i, j, we give an interpretation for the evaluation $\chi$ (i) G (--j) in terms of acyclic orientations. This recovers the classical interpretations…
Recently, we have witnessed tremendous applications of algebraic intersection theory to branches of mathematics, that previously seemed very distant. In this article we review some of them. Our aim is to provide a unified approach to the…
A quasi-ordinary polynomial is a monic polynomial with coefficients in the power series ring such that its discriminant equals a monomial up to unit. In this paper we study higher derivatives of quasi-ordinary polynomials, also called…
In 2008 Br\"and\'en proved a $(p,q)$-analogue of the $\gamma$-expansion formula for Eulerian polynomials and conjectured the divisibility of the $\gamma$-coefficient $\gamma_{n,k}(p,q)$ by $(p+q)^k$. As a follow-up, in 2012 Shin and Zeng…
Polynomial and spline quasi-interpolants (QIs) are practical and effective approximation operators. Among their remarkable properties, let us cite for example: good shape properties, easy computation and evaluation (no linear system to…
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…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
Inou and Shishikura provided a class of maps that is invariant by near-parabolic renormalization, and that has proved extremely useful in the study of the dynamics of quadratic polynomials. We provide here another construction, using more…
We develop a general procedure, based on the renormalized eta-cochain, which allows to find local representatives of the bivariant Chern character of finitely summable quasihomomorphisms. In particular, using zeta-function renormalization…
We consider s-chromatic polynomials of simplicial complexes, higher dimensional analogues of chromatic polynomials for graphs.
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
We provide a construction for the kromatic symmetric function $\overline{X}_G$ of a graph introduced by Crew, Pechenik, and Spirkl using combinatorial (linearly compact) Hopf algebras. As an application, we show that $\overline{X}_G$ has a…
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement graphs of simple great-circle arrangements have chromatic number at most $3$. Motivated by this conjecture, we study the colorability of arrangement graphs for different…
Our motivation is the question of how similar the $f$-colouring problem is to the classic edge-colouring problem, particularly with regard to graph parameters. In 2010, Zhang, Yu, and Liu gave a new description of the $f$-matching polytope…