Lengths of involutions in finite Coxeter groups

Let W be a finite Coxeter group and X a subset of W. The length polynomial $L_{W,X}(t)$ is defined by $L_{W,X}(t)={\sum }_{x\in X}{t}^{?(x)}$, where ? is the length function on W. If $X=\{x\in W:x^2=1\}$ then we call $L_{W,X}(t)$ the involution length polynomial of W. In this article we derive expressions for the length polynomial where X is any conjugacy class of involutions, and the involution length polynomial, in any finite Coxeter group W. In particular, these results correct errors in [11] for the involution length polynomials of Coxeter groups of type $B_n$ and $D_n$. Moreover, we give a counterexample to a unimodality conjecture stated in [11].     

Stabilization in three-dimensional chemotaxis-growth model with indirect attractant production

This paper deals with the chemotaxis-growth system: $u_t=\mathrm{\Delta }u?\mathrm{?}?(u\mathrm{?}v)+\mu u(1?u)$, $v_t=\mathrm{\Delta }v?v+w$, $\tau w_t+\delta w=u$ in a smooth bounded domain $\mathrm{\Omega }?{\mathbb{R}}^3$ with zero-flux boundary conditions, where μ, δ, and τ are given positive parameters. It is shown that the solution $(u,v,w)$ exponentially stabilizes to the constant stationary solution $(1,\frac{1}{\delta },\frac{1}{\delta })$ in the norm of $L^{\infty }(\mathrm{\Omega })$ as $t\to \infty$ provided that $\mu >0$ and any given nonnegative and suitably smooth initial data $(u_0,v_0,w_0)$ fulfills $u_0?0$, which extends the condition $\mu >\frac{1}{8{\delta }^2}$ in [8].     

On the size of special class 1 graphs and (P3;k)-co-critical graphs

A well-known theorem of Vizing states that if G is a simple graph with maximum degree Δ, then the chromatic index ${\chi }^{\prime }(G)$ of G is Δ or $\mathrm{\Delta }+1$. A graph G is class 1 if ${\chi }^{\prime }(G)=\mathrm{\Delta }$, and class 2 if ${\chi }^{\prime }(G)=\mathrm{\Delta }+1$; G is Δ-critical if it is connected, class 2 and ${\chi }^{\prime }(G-e)<{\chi }^{\prime }(G)$ for every $e\in E(G)$. A long-standing conjecture of Vizing from 1968 states that every Δ-critical graph on n vertices has at least $(n(\mathrm{\Delta }-1)+3)/2$ edges. We initiate the study of determining the minimum number of edges of class 1 graphs G, in addition, ${\chi }^{\prime }(G+e)={\chi }^{\prime }(G)+1$ for every $e\in E(\bar{G})$. Such graphs have intimate relation to $(P_3;k)$-co-critical graphs, where a non-complete graph G is $(P_3;k)$-co-critical if there exists a k-coloring of $E(G)$ such that G does not contain a monochromatic copy of $P_3$ but every k-coloring of $E(G+e)$ contains a monochromatic copy of $P_3$ for every $e\in E(\bar{G})$. We use the bound on the size of the aforementioned class 1 graphs to study the minimum number of edges over all $(P_3;k)$-co-critical graphs. We prove that if G is a $(P_3;k)$-co-critical graph on $n\ge k+2$ vertices, then$e(G)\ge \frac{k}{2}(n-\lceil \frac{k}{2}\rceil -\epsilon )+\left(\begin{array}{c}\lceil k/2\rceil +\epsilon \\ 2\end{array}\right),$ where ε is the remainder of $n-\lceil k/2\rceil$ when divided by 2. This bound is best possible for all $k\ge 1$ and $n\ge \lceil 3k/2\rceil +2$.     

Packed words and quotient rings

The coinvariant algebra is a quotient of the polynomial ring $\mathbb{Q}[x_1,\dots ,x_n]$ whose algebraic properties are governed by the combinatorics of permutations of length n. A word $w=w_1\dots w_n$ over the positive integers is packed if whenever $i>2$ appears as a letter of w, so does $i?1$. We introduce a quotient $S_n$ of $\mathbb{Q}[x_1,\dots ,x_n]$ which is governed by the combinatorics of packed words. We relate our quotient $S_n$ to the generalized coinvariant rings of Haglund, Rhoades, and Shimozono as well as the superspace coinvariant ring.     

Point partition numbers: Decomposable and indecomposable critical graphs

Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number ${\chi }_t(G)$ is the least integer k for which G admits a coloring with k colors such that each color class induces a $(t?1)$-degenerate subgraph of G. So ${\chi }_1$ is the chromatic number and ${\chi }_2$ is the point arboricity. The point partition number ${\chi }_t$ with $t\ge 1$ was introduced by Lick and White. A graph G is called ${\chi }_t$-critical if every proper subgraph H of G satisfies ${\chi }_t(H)<{\chi }_t(G)$. In this paper we prove that if G is a ${\chi }_t$-critical graph whose order satisfies $|G|\le 2{\chi }_t(G)?2$, then G can be obtained from two non-empty disjoint subgraphs $G_1$ and $G_2$ by adding t edges between any pair $u,v$ of vertices with $u\in V(G_1)$ and $v\in V(G_2)$. Based on this result we establish the minimum number of edges possible in a ${\chi }_t$-critical graph G of order n and with ${\chi }_t(G)=k$, provided that $n\le 2k?1$ and t is even. For $t=1$ the corresponding two results were obtained in 1963 by Tibor Gallai.     

Spectral strengthening of a theorem on transversal critical graphs

A transversal set of a graph G is a set of vertices incident to all edges of G. The transversal number of G, denoted by $\tau (G)$, is the minimum cardinality of a transversal set of G. A simple graph G with no isolated vertex is called τ-critical if $\tau (G?e)<\tau (G)$ for every edge $e\in E(G)$. For any τ-critical graph G with $\tau (G)=t$, it has been shown that $|V(G)|\le 2t$ by Erd?s and Gallai and that $|E(G)|\le \left(\begin{array}{c}t+1\\ 2\end{array}\right)$ by Erd?s, Hajnal and Moon. Most recently, it was extended by Gyárfás and Lehel to $|V(G)|+|E(G)|\le \left(\begin{array}{c}t+2\\ 2\end{array}\right)$. In this paper, we prove stronger results via spectrum. Let G be a τ-critical graph with $\tau (G)=t$ and $|V(G)|=n$, and let ${\lambda }_1$ denote the largest eigenvalue of the adjacency matrix of G. We show that $n+{\lambda }_1\le 2t+1$ with equality if and only if G is $t{K}_2$, $K_{s+1}\cup (t?s)K_2$, or $C_{2s?1}\cup (t?s)K_2$, where $2\le s\le t$; and in particular, ${\lambda }_1(G)\le t$ with equality if and only if G is $K_{t+1}$. We then apply it to show that for any nonnegative integer r, we have $n(r+\frac{{\lambda }_1}{2})\le \left(\begin{array}{c}t+r+1\\ 2\end{array}\right)$ and characterize all extremal graphs. This implies a pure combinatorial result that $r|V(G)|+|E(G)|\le \left(\begin{array}{c}t+r+1\\ 2\end{array}\right)$, which is stronger than Erd?s-Hajnal-Moon Theorem and Gyárfás-Lehel Theorem. We also have some other generalizations.