Standardly stratified lower triangular K-algebras with enough idempotents

In this paper we study the lower triangular matrix $\mathbb{K}$-algebra $\mathrm{\Lambda }:=\left[\begin{array}{cc}\hfill T\hfill & \hfill 0\hfill \\ \hfill M\hfill & \hfill U\hfill \end{array}\right]$, where U and T are basic $\mathbb{K}$-algebras with enough idempotents and M is an U-T-bimodule where $\mathbb{K}$ acts centrally. Moreover, we characterise in terms of U, T and M when, on one hand, the lower triangular matrix $\mathbb{K}$-algebra Λ is standardly stratified in the sense of [15]; and on the other hand, when Λ is locally bounded in the sense of Gabriel [10]. Finally, we also study several properties relating the projective dimensions in the categories of finitely generated modules $\mathrm{mod}(U)$, $\mathrm{mod}(T)$ and $\mathrm{mod}(\mathrm{\Lambda })$.     

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.     

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

Universal deformation rings and self-injective Nakayama algebras

Let k be a field and let Λ be an indecomposable finite dimensional k-algebra such that there is a stable equivalence of Morita type between Λ and a self-injective split basic Nakayama algebra over k. We show that every indecomposable finitely generated Λ-module V has a universal deformation ring $R(\mathrm{\Lambda },V)$ and we describe $R(\mathrm{\Lambda },V)$ explicitly as a quotient ring of a power series ring over k in finitely many variables. This result applies in particular to Brauer tree algebras, and hence to p-modular blocks of finite groups with cyclic defect groups.     

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

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.     

On the weak 2-coloring number of planar graphs

For a graph $G=(V,E)$, a total ordering L on V, and a vertex $v\in V$, let ${\mathrm{Wcol}}_2[G,L,v]$ be the set of vertices $w\in V$ for which there is a path from v to w whose length is 0, 1 or 2 and whose L-least vertex is w. The weak 2-coloring number ${\mathrm{wcol}}_2(G)$ of G is the least k such that there is a total ordering L on V with $|{\mathrm{Wcol}}_2[G,L,v]|\le k$ for all vertices $v\in V$. We improve the known upper bound on the weak 2-coloring number of planar graphs from 28 to 23. As the weak 2-coloring number is the best known upper bound on the star list chromatic number of planar graphs, this bound is also improved.     

Regular characters of classical groups over complete discrete valuation rings

Let $\mathfrak{o}$ be a complete discrete valuation ring with finite residue field $\mathsf{k}$ of odd characteristic, and let G be a symplectic or special orthogonal group scheme over $\mathfrak{o}$. For any $?\in \mathbb{N}$ let $G^{?}$ denote the ?-th principal congruence subgroup of $\mathbf{G}(\mathfrak{o})$. An irreducible character of the group $\mathbf{G}(\mathfrak{o})$ is said to be regular if it is trivial on a subgroup $G^{?+1}$ for some ?, and if its restriction to $G^{?}/G^{?+1}?\mathrm{Lie}(\mathbf{G})(\mathsf{k})$ consists of characters of minimal $\mathbf{G}({\mathsf{k}}^{\mathrm{alg}})$-stabilizer dimension. In the present paper we consider the regular characters of such classical groups over $\mathfrak{o}$, and construct and enumerate all regular characters of $\mathbf{G}(\mathfrak{o})$, when the characteristic of $\mathsf{k}$ is greater than two. As a result, we compute the regular part of their representation zeta function.     

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.     

Irredundance trees of diameter 3

A set D of vertices of a graph $G=(V,E)$ is irredundant if each non-isolated vertex of $G[D]$ has a neighbour in $V?D$ that is not adjacent to any other vertex in D. The upper irredundance number $\mathrm{IR}(G)$ is the largest cardinality of an irredundant set of G; an $\mathrm{IR}(G)$-set is an irredundant set of cardinality $\mathrm{IR}(G)$.The IR-graph of G has the $\mathrm{IR}(G)$-sets as vertex set, and sets D and $D^{\prime }$ are adjacent if and only if $D^{\prime }$ can be obtained from D by exchanging a single vertex of D for an adjacent vertex in $D^{\prime }$. An IR-tree is an IR-graph that is a tree. We characterize IR-trees of diameter 3 by showing that these graphs are precisely the double stars $S(2n,2n)$, i.e., trees obtained by joining the central vertices of two disjoint stars $K_{1,2n}$.