GE2-rings and a graph of unimodular rows

For a commutative ring A we consider a related graph, $\mathrm{\Gamma }(A)$, whose vertices are the unimodular rows of length 2 up to multiplication by units. We prove that $\mathrm{\Gamma }(A)$ is path-connected if and only if A is a ${\mathrm{GE}}_2$-ring, in the terminology of P. M. Cohn. Furthermore, if $Y(A)$ denotes the clique complex of $\mathrm{\Gamma }(A)$, we prove that $Y(A)$ is simply connected if and only if A is universal for ${\mathrm{GE}}_2$. More precisely, our main theorem is that for any commutative ring A the fundamental group of $Y(A)$ is isomorphic to the group $K_2(2,A)$ modulo the subgroup generated by symbols.     

Flow number and circular flow number of signed cubic graphs

Let $\mathrm{\Phi }(G,\sigma )$ and ${\mathrm{\Phi }}_c(G,\sigma )$ denote the flow number and the circular flow number of a flow-admissible signed graph $(G,\sigma )$, respectively. It is known that $\mathrm{\Phi }(G)=?{\mathrm{\Phi }}_c(G)?$ for every unsigned graph G. Based on this fact, in 2011 Raspaud and Zhu conjectured that $\mathrm{\Phi }(G,\sigma )?{\mathrm{\Phi }}_c(G,\sigma )<1$ holds also for every flow-admissible signed graph $(G,\sigma )$. This conjecture was disproved by Schubert and Steffen using graphs with bridges and vertices of large degree. In this paper we focus on cubic graphs, since they play a crucial role in many open problems in graph theory. For cubic graphs we show that $\mathrm{\Phi }(G,\sigma )=3$ if and only if ${\mathrm{\Phi }}_c(G,\sigma )=3$ and if $\mathrm{\Phi }(G,\sigma )\in \{4,5\}$, then $4\le {\mathrm{\Phi }}_c(G,\sigma )\le \mathrm{\Phi }(G,\sigma )$. We also prove that all pairs of flow number and circular flow number that fulfil these conditions can be achieved in the family of bridgeless cubic graphs and thereby disprove the conjecture of Raspaud and Zhu even for bridgeless signed cubic graphs. Finally, we prove that all currently known flow-admissible graphs without nowhere-zero 5-flow have flow number and circular flow number 6 and propose several conjectures in this area.     

Existence of solutions of a non-linear eigenvalue problem with a variable weight

We study the non-linear minimization problem on $H_0^1(\mathrm{\Omega })?L^q$ with $q=\frac{2n}{n?2}$, $\alpha >0$ and $n\ge 4$:

$\underset{\begin{array}{c}\hfill u\in H_0^1(\mathrm{\Omega })\hfill \\ \hfill {6u6}_{L^q}=1\hfill \end{array}}{\inf }?\underset{\mathrm{\Omega }}{\int }a(x,u)|\mathrm{?}u{|}^2?\lambda \underset{\mathrm{\Omega }}{\int }|u{|}^2$

where $a(x,s)$ presents a global minimum α at $(x_0,0)$ with $x_0\in \mathrm{\Omega }$. In order to describe the concentration of $u(x)$ around $x_0$, one needs to calibrate the behavior of $a(x,s)$ with respect to s. The model case is

$\underset{\begin{array}{c}\hfill u\in H_0^1(\mathrm{\Omega })\hfill \\ \hfill {6u6}_{L^q}=1\hfill \end{array}}{\inf }?\underset{\mathrm{\Omega }}{\int }(\alpha +|x{|}^{\beta }|u{|}^k)|\mathrm{?}u{|}^2?\lambda \underset{\mathrm{\Omega }}{\int }|u{|}^2.$

In a previous paper dedicated to the same problem with $\lambda =0$, we showed that minimizers exist only in the range $\beta <kn/q$, which corresponds to a dominant non-linear term. On the contrary, the linear influence for $\beta \ge kn/q$ prevented their existence. The goal of this present paper is to show that for $0<\lambda \le \alpha {\lambda }_1(\mathrm{\Omega })$, $0\le k\le q?2$ and $\beta >kn/q+2$, minimizers do exist.     

An improvement to the Hilton-Zhao vertex-splitting conjecture

For a simple graph G, denote by n, $\mathrm{\Delta }(G)$, and ${\chi }^{\prime }(G)$ its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if ${\chi }^{\prime }(G)=\mathrm{\Delta }(G)+1$ and ${\chi }^{\prime }(H)<{\chi }^{\prime }(G)$ for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let $G^{?}$ be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that $G^{?}$ must be edge-chromatic critical if $\mathrm{\Delta }(G)>n/3$, and they verified this when $\mathrm{\Delta }(G)\ge \frac{n}{2}(\sqrt{7}?1)\approx 0.82n$. In this paper, we prove it for $\mathrm{\Delta }(G)\ge 0.75n$.     

SL(m,C)-equivariant and translation covariant continuous tensor valuations

The space of continuous, $\mathrm{SL}(m,\mathbb{C})$-equivariant, $m\ge 2$, and translation covariant valuations taking values in the space of real symmetric tensors on ${\mathbb{C}}^m?{\mathbb{R}}^{2m}$ of rank $r\ge 0$ is completely described. The classification involves the moment tensor valuation for $r\ge 1$ and is analogous to the known classification of the corresponding tensor valuations that are $\mathrm{SL}(2m,\mathbb{R})$-equivariant, although the method of proof cannot be adapted.     

Stability of attractors for the Kirchhoff wave equation with strong damping and critical nonlinearities

The paper investigates longtime dynamics of the Kirchhoff wave equation with strong damping and critical nonlinearities: $u_{tt}?(1+?{\Vert \mathrm{?}u\Vert }^2)\mathrm{\Delta }u?\mathrm{\Delta }{u}_t+h(u_t)+g(u)=f(x)$, with $?\in [0,1]$. The well-posedness and the existence of global and exponential attractors are established, and the stability of the attractors on the perturbation parameter ? is proved for the IBVP of the equation provided that both nonlinearities $h(s)$ and $g(s)$ are of critical growth.     

Generalized rainbow Turán numbers of odd cycles

Given graphs F and H, the generalized rainbow Turán number $\mathrm{ex}(n,F,\mathrm{rainbow-}H)$ is the maximum number of copies of F in an n-vertex graph with a proper edge-coloring that contains no rainbow copy of H. B. Janzer determined the order of magnitude of $\mathrm{ex}(n,C_s,\mathrm{rainbow-}{C}_t)$ for all $s\ge 4$ and $t\ge 3$, and a recent result of O. Janzer implied that $\mathrm{ex}(n,C_3,\mathrm{rainbow-}{C}_{2k})=O(n^{1+1/k})$. We prove the corresponding upper bound for the remaining cases, showing that $\mathrm{ex}(n,C_3,\mathrm{rainbow-}{C}_{2k+1})=O(n^{1+1/k})$. This matches the known lower bound for k even and is conjectured to be tight for k odd.