On the geography of threefolds of general type

Let X be a complex nonsingular projective 3-fold of general type. We show that there are positive constants c, $c^{\prime }$ and $m_1$ such that $\chi ({\omega }_X)??c\mathrm{Vol}(X)$ and $P_m(X)?c^{\prime }{m}^3\mathrm{Vol}(X)$ for all $m?m_1$.     

On the Erdös–Lax inequality concerning polynomials

Let $P(z)$ be a polynomial of degree n and for any complex number α, let $D_{\alpha }P(z):=nP(z)+(\alpha ?z)P^{\prime }(z)$ denote the polar derivative of $P(z)$ with respect to α. In this paper, we present an integral inequality for the polar derivative of a polynomial. Our theorem includes as special cases several interesting generalisations and refinements of Erdöx–Lax theorem.     

Starlike trees whose maximum degree exceed 4 are determined by their Q-spectra

Let $A(G)$ and $D(G)$ be the adjacency matrix and the degree matrix of a graph $G$, respectively. The matrix $D(G)+A(G)$ is called the signless Laplacian matrix of $G$. The spectrum of the matrix $D(G)+A(G)$ is called the Q-spectrum of $G$. A graph is said to be determined by its Q-spectrum if there is no other non-isomorphic graph with the same Q-spectrum. In this paper, we prove that all starlike trees whose maximum degree exceed $4$ are determined by their Q-spectra.     

A note on two source location problems

We consider Source Location ($\mathsf{SL}$) problems: given a capacitated network $G=(V,E)$, cost $c(v)$ and a demand $d(v)$ for every $v\in V$, choose a min-cost $S\subseteq V$ so that $\lambda (v,S)⩾d(v)$ holds for every $v\in V$, where $\lambda (v,S)$ is the maximum flow value from v to S. In the directed variant, we have demands $d^{\mathit{in}}(v)$ and $d^{\mathit{out}}(v)$ and we require $\lambda (S,v)⩾d^{\mathit{in}}(v)$ and $\lambda (v,S)⩾d^{\mathit{out}}(v)$. Undirected $\mathsf{SL}$ is (weakly) NP-hard on stars with $r(v)=0$ for all v except the center. But, it is known to be polynomially solvable for uniform costs and uniform demands. For general instances, both directed an undirected $\mathsf{SL}$ admit a $(\ln D+1)$-approximation algorithms, where D is the sum of the demands; up to constant this is tight, unless P = NP. We give a pseudopolynomial algorithm for undirected $\mathsf{SL}$ on trees with running time $O(|V|{\Delta }^3)$, where $\Delta ={\max }_{v\in V}d(v)$. This algorithm is used to derive a linear time algorithm for undirected $\mathsf{SL}$ with $\Delta ⩽3$. We also consider the Single Assignment Source Location ($\mathsf{SASL}$) where every $v\in V$ should be assigned to a single node $s(v)\in S$. While the undirected $\mathsf{SASL}$ is in P, we give a $(\ln |V|+1)$-approximation algorithm for the directed case, and show that this is tight, unless P = NP.     

Odd values of the Rogers–Ramanujan functions

Let $g(n)$ and $h(n)$ be the coefficients of the Rogers–Ramanujan identities. We obtain asymptotic formulas for the number of odd values of $g(n)$ for odd n, and $h(n)$ for even n, which improve Gordon's results. We also obtain lower bounds for the number of odd values of $g(n)$ for even n, and $h(n)$ for odd n.     

Rank,term rank and chromatic number of a graph

Let G be a graph with a nonempty edge set, we denote the rank of the adjacency matrix of G and the term rank of G, by $\mathrm{rk}(G)$ and $\mathrm{Rk}(G)$, respectively. It was conjectured [C. van Nuffelen, Amer. Math. Monthly 83 (1976) 265–266], for any graph G, $\chi (G)?\mathrm{rk}(G)$. The first counterexample to this conjecture was obtained by Alon and Seymour [J. Graph Theor. 13 (1989) 523–525]. Recently, Fishkind and Kotlov [Discrete Math. 250 (2002) 253–257] have proved that for any graph G, $\chi (G)?\mathrm{Rk}(G)$. In this Note we improve Fishkind–Kotlov upper bound and show that $\chi (G)?\frac{\mathrm{rk}(G)+\mathrm{Rk}(G)}{2}$. To cite this article: S. Akbari, H.-R. Fanaï, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Krull dimension,overrings and semistar operations of an integral domain

In this paper, we will present new developments in the study of the links between the cardinality of the sets $O(R)$ of all overrings of R, $\mathit{SSF}c(R)$ of all semistar operations of finite character when finite to the Krull dimension of an integral domain R. In particular, we prove that if $|\mathit{SSF}c(R)|=n+\dim R$, then R has at most $n?1$ distinct maximal ideals. Moreover, R has exactly $n?1$ maximal ideals if and only if $n=3$. In this case R is a Prüfer domain with exactly two maximal ideals and Y-graph spectrum. We also give a complete characterizations for local domains R such that $|\mathit{SSF}c(R)|=3+\dim R$, and nonlocal domains R with $|\mathit{SSF}c(R)|=|O(R)|=n+\dim R$ for $n=4$, $n=5$, $n=6$ and $n=7$. Examples to illustrate the scopes and limits of the results are constructed.