The reconstruction conjecture for finite simple graphs and associated directed graphs

In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let Γ and ${\mathrm{\Gamma }}^{\prime }$ be finite simple graphs with at least three vertices such that there exists a bijective map $f:V(\mathrm{\Gamma })\to V({\mathrm{\Gamma }}^{\prime })$ and for any $v\in V(\mathrm{\Gamma })$, there exists an isomorphism ${?}_v:\mathrm{\Gamma }?v\to {\mathrm{\Gamma }}^{\prime }?f(v)$. Then we define the associated directed graph $\stackrel{?}{\mathrm{\Gamma }}=\stackrel{?}{\mathrm{\Gamma }}(\mathrm{\Gamma },{\mathrm{\Gamma }}^{\prime },f,{\{{?}_v\}}_{v\in V(\mathrm{\Gamma })})$ with two kinds of arrows from the graphs Γ and ${\mathrm{\Gamma }}^{\prime }$, the bijective map f and the isomorphisms ${\{{?}_v\}}_{v\in V(\mathrm{\Gamma })}$. By investigating the associated directed graph $\stackrel{?}{\mathrm{\Gamma }}$, we study when are the two graphs Γ and ${\mathrm{\Gamma }}^{\prime }$ isomorphic.     

Approximation of norms on Banach spaces

Relatively recently it was proved that if Γ is an arbitrary set, then any equivalent norm on $c_0(\mathrm{\Gamma })$ can be approximated uniformly on bounded sets by polyhedral norms and $C^{\infty }$ smooth norms, with arbitrary precision. We extend this result to more classes of spaces having uncountable symmetric bases, such as preduals of the ‘discrete’ Lorentz spaces $d(w,1,\mathrm{\Gamma })$, and certain symmetric Nakano spaces and Orlicz spaces. We also show that, given an arbitrary ordinal number α, there exists a scattered compact space K having Cantor–Bendixson height at least α, such that every equivalent norm on $C(K)$ can be approximated as above.     

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$.     

Endomorphisms and cores of quadratic forms graphs in odd characteristic

A graph G is called a pseudo-core if every endomorphism of G is either an automorphism or a colouring. A graph G is a core if every endomorphism of G is an automorphism. Let ${\mathbb{F}}_q$ be the finite field with q elements where q is a power of an odd prime number. The quadratic forms graph, denoted by $\mathrm{Quad}(n,q)$ where $n\ge 2$, has all quadratic forms on ${\mathbb{F}}_q^n$ as vertices and two vertices f and g are adjacent whenever $\mathrm{rk}(f-g)=1$ or 2. We prove that every $\mathrm{Quad}(n,q)$ is a pseudo-core. Further, when n is even, $\mathrm{Quad}(n,q)$ is a core. When n is odd, $\mathrm{Quad}(n,q)$ is not a core. On the other hand, we completely determine the independence number of $\mathrm{Quad}(n,q)$.     

On the antipode of Hopf algebras with the dual Chevalley property

In this paper, we study the antipode of a finite-dimensional Hopf algebra H with the dual Chevalley property and obtain an annihilation polynomial for the antipode. This generalizes an old result given by Taft and Wilson in 1974. As consequences, we show that 1) the quasi-exponent of H is the same as the exponent of its coradical, that is, $\mathrm{qexp}(H)=\exp ?(H_0)$; 2) $\mathrm{qexp}(H?\mathbb{k}〈S^2〉)=\mathrm{qexp}(H)$.     

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.     

SLE intersecting with random hulls

Lawler, Schramm, and Werner gave in 2003 an explicit formula of the probability that $\mathrm{SLE}(8/3)$ does not intersect a deterministic hull. For general $\mathrm{SLE}(\kappa )$ with $\kappa \ne 8/3$, no such explicit formula has been obtained so far. In this paper, we shall consider a random hull generated by an independent chordal conformal restriction measure and obtain an explicit formula for the probability that $\mathrm{SLE}(\kappa )$ does not intersect this random hull for any $\kappa \in (0,8)$. As a corollary, we will give a new proof of Werner's result on conformal restriction measures.