Arithmetic invariants from Sato–Tate moments

We give some arithmetic-geometric interpretations of the moments ${\mathrm{M}}_2[a_1]$, ${\mathrm{M}}_1[a_2]$, and ${\mathrm{M}}_1[s_2]$ of the Sato–Tate group of an abelian variety A defined over a number field by relating them to the ranks of the endomorphism ring and Néron–Severi group of A.     

On the chromatic number of some P5-free graphs

Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, $V(H)$ can be partitioned into A and B such that $H[A]$ is perfect and $\omega (H[B])<\omega (H)$. We use $P_t$ and $C_t$ to denote a path and a cycle on t vertices, respectively. For two disjoint graphs $F_1$ and $F_2$, we use $F_1\cup F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)$, and use $F_1+F_2$ to denote the graph with vertex set $V(F_1)\cup V(F_2)$ and edge set $E(F_1)\cup E(F_2)\cup \{xy|x\in V(F_1)\text{ and }y\in V(F_2)\}$. In this paper, we prove that (i) $(P_5,C_5,K_{2,3})$-free graphs are perfectly divisible, (ii) $\chi (G)\le 2{\omega }^2(G)?\omega (G)?3$ if G is $(P_5,K_{2,3})$-free with $\omega (G)\ge 2$, (iii) $\chi (G)\le \frac{3}{2}({\omega }^2(G)?\omega (G))$ if G is $(P_5,K_1+2K_2)$-free, and (iv) $\chi (G)\le 3\omega (G)+11$ if G is $(P_5,K_1+(K_1\cup K_3))$-free.     

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.     

The sharp conditions of the uniqueness for inverse nodal problems

In this paper we provide the sharp conditions of the uniqueness for inverse nodal Sturm–Liouville problems defined on interval $[0,1]$ with separated boundary conditions. We prove that the potential and boundary parameters can be uniquely determined by a dense nodal subset contained on $[a_1,a_2](?[0,1])$ with $1/2\in (a_1,a_2)$ through two cases of $a_1=0$ and $a_1>0$, where in the latter case the nodal subset also need to be paired. Note that, the dense nodal subset was required to be twin for both cases in the previous works.     

Self-dual codes over F5 and s-extremal unimodular lattices

New s-extremal extremal unimodular lattices in dimensions 38, 40, 42 and 44 are constructed from self-dual codes over ${\mathbb{F}}_5$ by Construction A. In the process of constructing these codes, we obtain a self-dual $[44,22,14]$ code over ${\mathbb{F}}_5$. In addition, the code implies a $[43,22,13]$ code over ${\mathbb{F}}_5$. These codes have larger minimum weights than the previously known $[44,22]$ codes and $[43,22]$ codes, respectively.     

Powers of ideals associated to (C4,2K2)-free graphs

Let G be a $(C_4,2K_2)$-free graph with edge ideal $I(G)?\mathbb{k}[x_1,\dots ,x_n]$. We show that $I{(G)}^s$ has linear resolution for every $s\ge 2$. Also, we show that every power of the vertex cover ideal of G has linear quotients. As a result, we describe the Castelnuovo–Mumford regularity of powers of $I{(G)}^{\vee }$ in terms of the maximum degree of G.     

A note on the Hambleton-Taylor-Williams conjecture

I. Hambleton, L. Taylor and B. Williams conjectured a general formula in the spirit of H. Lenstra for the decomposition of $G_n(RG)$ for any finite group G and noetherian ring R. The conjectured decomposition was shown to hold for some large classes of finite groups. D. Webb and D. Yao discovered that the conjecture failed for the symmetric group $S_5$, but remarked that it still might be reasonable to expect the HTW-decomposition for solvable groups. In this paper we show that the solvable group $\mathrm{SL}(2,{\mathbb{F}}_3)$ is also a counterexample to the conjectured HTW-decomposition. Nevertheless, we prove that for any finite group G the rank of $G_1(\mathbb{Z}G)$ does not exceed the rank of the expression in the HTW-decomposition. We also show that the HTW-decomposition predicts correct torsion for $G_1(\mathbb{Z}G)$ for any finite group G. Furthermore, we prove that for any degree other than $n=1$ the conjecture gives a correct prediction for the rank of $G_n(\mathbb{Z}G)$.