Minimum total coloring of planar graph

Graph coloring is an important tool in the study of optimization, computer science, network design, e.g., file transferring in a computer network, pattern matching, computation of Hessians matrix and so on. In this paper, we consider one important coloring, vertex coloring of a total graph, which is familiar to us by the name of “total coloring”. Total coloring is a coloring of \(V\cup {E}\) such that no two adjacent or incident elements receive the same color. In other words, total chromatic number of \(G\) is the minimum number of disjoint vertex independent sets covering a total graph of \(G\) . Here, let \(G\) be a planar graph with \(\varDelta \ge 8\) . We proved that if for every vertex \(v\in V\) , there exists two integers \(i_{v},j_{v} \in \{3,4,5,6,7,8\}\) such that \(v\) is not incident with intersecting \(i_v\) -cycles and \(j_v\) -cycles, then the vertex chromatic number of total graph of \(G\) is \(\varDelta +1\) , i.e., the total chromatic number of \(G\) is \(\varDelta +1\) .     

On the Chromatic Number of \mathbb {R}^4

The lower bound for the chromatic number of \(\mathbb {R}^4\) is improved from \(7\) to \(9\) . Three graphs with unit distance embeddings in \(\mathbb {R}^4\) are described. The first is a \(7\) -chromatic graph of order \(14\) whose chromatic number can be verified by inspection. The second is an \(8\) -chromatic graph of order \(26\) . In this case the chromatic number can be verified quickly by a simple computer program. The third graph is a \(9\) -chromatic graph of order \(65\) for which computer verification takes about one minute.     

Characterization of ellipses as uniformly dense sets with respect to a family of convex bodies

Let \(K\subset \mathbb R ^N\) be a convex body containing the origin. A measurable set \(G\subset \mathbb R ^N\) with positive Lebesgue measure is said to be uniformly \(K\) -dense if, for any fixed \(r>0\) , the measure of \(G\cap (x+r K)\) is constant when \(x\) varies on the boundary of \(G\) (here, \(x+r K\) denotes a translation of a dilation of \(K\) ). We first prove that \(G\) must always be strictly convex and at least \(C^{1,1}\) -regular; also, if \(K\) is centrally symmetric, \(K\) must be strictly convex, \(C^{1,1}\) -regular and such that \(K=G-G\) up to homotheties; this implies in turn that \(G\) must be \(C^{2,1}\) -regular. Then for \(N=2\) , we prove that \(G\) is uniformly \(K\) -dense if and only if \(K\) and \(G\) are homothetic to the same ellipse. This result was already proven by Amar et al. in 2008 . However, our proof removes their regularity assumptions on \(K\) and \(G\) , and more importantly, it is susceptible to be generalized to higher dimension since, by the use of Minkowski’s inequality and an affine inequality, avoids the delicate computations of the higher-order terms in the Taylor expansion near \(r=0\) for the measure of \(G\cap (x+r\,K)\) (needed in 2008).     

The Cauchy–Riemann equations in the unit ball of l^{2}

We study the local exactness of the \(\overline{\partial }\) operator in the Hilbert space \(l^2\) for a particular class of \((0,1)\) -forms \(\omega \) of the type \(\omega (z) = \sum _i z_i\omega ^i(z) d\overline{z}_i\) , \(z = (z_i)\) in \(l^2\) . We suppose each function \(\omega ^i\) of class \(C^\infty \) in the closed unit ball of \(l^2\) , of the form \(\omega ^i(z) = \sum _k \omega ^i_k\left( z^k\right) \) , where \(\mathbf N = \bigcup I_k\) is a partition of \(\mathbf N\) , \((\) card \(I_k < +\infty )\) and \(z^k\) is the projection of \(z\) on \(\mathbf C^{I_k}\) . We establish sufficient conditions for exactness of \(\omega \) related to the expansion in Fourier series of the functions \(\omega ^i_k\) .     

On matching cover of graphs

A k-matching cover of a graph \(G\) is a union of \(k\) matchings of \(G\) which covers \(V(G)\) . The matching cover number of \(G\) , denoted by \(mc(G)\) , is the minimum number \(k\) such that \(G\) has a \(k\) -matching cover. A matching cover of \(G\) is optimal if it consists of \(mc(G)\) matchings of \(G\) . In this paper, we present an algorithm for finding an optimal matching cover of a graph on \(n\) vertices in \(O(n^3)\) time (if use a faster maximum matching algorithm, the time complexity can be reduced to \(O(nm)\) , where \(m=|E(G)|\) ), and give an upper bound on matching cover number of graphs. In particular, for trees, a linear-time algorithm is given, and as a by-product, the matching cover number of trees is determined.     

Laplacian ideals,arrangements, and resolutions

The Laplacian matrix of a graph \(G\) describes the combinatorial dynamics of the Abelian Sandpile Model and the more general Riemann–Roch theory of \(G\) . The lattice ideal associated to the lattice generated by the columns of the Laplacian provides an algebraic perspective on this recently (re)emerging field. This binomial ideal \(I_G\) has a distinguished monomial initial ideal \(M_G\) , characterized by the property that the standard monomials are in bijection with the \(G\) -parking functions of the graph \(G\) . The ideal \(M_G\) was also considered by Postnikov and Shapiro (Trans Am Math Soc 356:3109–3142, 2004) in the context of monotone monomial ideals. We study resolutions of \(M_G\) and show that a minimal-free cellular resolution is supported on the bounded subcomplex of a section of the graphical arrangement of \(G\) . This generalizes constructions from Postnikov and Shapiro (for the case of the complete graph) and connects to work of Manjunath and Sturmfels, and of Perkinson et al. on the commutative algebra of Sandpiles. As a corollary, we verify a conjecture of Perkinson et al. regarding the Betti numbers of \(M_G\) and in the process provide a combinatorial characterization in terms of acyclic orientations.     

On the commuting probability and supersolvability of finite groups

For a finite group \(G\) , let \(d(G)\) denote the probability that a randomly chosen pair of elements of \(G\) commute. We prove that if \(d(G)>1/s\) for some integer \(s>1\) and \(G\) splits over an abelian normal nontrivial subgroup \(N\) , then \(G\) has a nontrivial conjugacy class inside \(N\) of size at most \(s-1\) . We also extend two results of Barry, MacHale, and Ní Shé on the commuting probability in connection with supersolvability of finite groups. In particular, we prove that if \(d(G)>5/16\) then either \(G\) is supersolvable, or \(G\) isoclinic to \(A_4\) , or \(G/\mathbf{Z}(G)\) is isoclinic to \(A_4\) .     

On an extension of the Frobenius^{\prime } theorem about p-nilpotency of a finite group

Suppose that \(G\) is a finite group and \(H\) is a subgroup of \(G\) . \(H\) is said to be \(s\) -quasinormally embedded in \(G\) if for each prime \(p\) dividing the order of \(H\) , a Sylow \(p\) -subgroup of \(H\) is also a Sylow \(p\) -subgroup of some \(s\) -quasinormal subgroup of \(G\) . We fix in every non-cyclic Sylow subgroup \(P\) of \(G\) some subgroup \(D\) satisfying \(1<|D|<|P|\) and study the \(p\) -nilpotency of \(G\) under the assumption that every subgroup \(H\) of \(P\) with \(|H|=|D|\) is \(s\) -quasinormally embedded in \(G\) . Some recent results and the Frobenius \(^{\prime }\) theorem are generalized.     

On weakly closed subgroups of finite groups

Suppose that \(G\) is a finite group and \(H\) , \(K\) are subgroups of \(G\) . We say that \(H\) is weakly closed in \(K\) with respect to \(G\) if, for any \(g \in G\) such that \(H^{g}\le K\) , we have \(H^{g}=H\) . In particular, when \(H\) is a subgroup of prime-power order and \(K\) is a Sylow subgroup containing it, \(H\) is simply said to be a weakly closed subgroup of \(G\) or weakly closed in \(G\) . In the paper, we investigate the structure of finite groups by means of weakly closed subgroups.     

Fully inert subgroups of free Abelian groups

A subgroup \(H\) of an Abelian group \(G\) is called fully inert if \((\phi H + H)/H\) is finite for every \(\phi \in \mathrm{End}(G)\) . Fully inert subgroups of free Abelian groups are characterized. It is proved that \(H\) is fully inert in the free group \(G\) if and only if it is commensurable with \(n G\) for some \(n \ge 0\) , that is, \((H + nG)/H\) and \((H + nG)/nG\) are both finite. From this fact we derive a more structural characterization of fully inert subgroups \(H\) of free groups \(G\) , in terms of the Ulm–Kaplansky invariants of \(G/H\) and the Hill–Megibben invariants of the exact sequence \(0 \rightarrow H \rightarrow G \rightarrow G/H \rightarrow 0\) .     

Relatively congruence-free regular semigroups

Yu, Wang, Wu and Ye call a semigroup \(S\) \(\tau \) -congruence-free, where \(\tau \) is an equivalence relation on \(S\) , if any congruence \(\rho \) on \(S\) is either disjoint from \(\tau \) or contains \(\tau \) . A congruence-free semigroup is then just an \(\omega \) -congruence-free semigroup, where \(\omega \) is the universal relation. They determined the completely regular semigroups that are \(\tau \) -congruence-free with respect to each of the Green’s relations. The goal of this paper is to extend their results to all regular semigroups. Such a semigroup is \(\mathrel {\mathcal {J}}\) -congruence-free if and only if it is either a semilattice or has a single nontrivial \(\mathrel {\mathcal {J}}\) -class, \(J\) , say, and either \(J\) is a subsemigroup, in which case it is congruence-free, or otherwise its principal factor is congruence-free. Given the current knowledge of congruence-free regular semigroups, this result is probably best possible. When specialized to completely semisimple semigroups, however, a complete answer is obtained, one that specializes to that of Yu et al. A similar outcome is obtained for \(\mathrel {\mathcal {L}}\) and \(\mathrel {\mathcal {R}}\) . In the case of \(\mathrel {\mathcal {H}}\) , only the completely semisimple case is fully resolved, again specializing to those of Yu et al.     

Approximation faible et principe de Hasse pour des espaces homogènes à stabilisateur fini résoluble

Let \(K\) be a global field and \(G\) a finite solvable \(K\) -group. Under certain hypotheses concerning the extension splitting \(G\) , we show that the homogeneous space \(V=G'/G\) with \(G'\) a semi-simple simply connected \(K\) -group has the weak approximation property. We use a more precise version of this result to prove the Hasse principle for homogeneous spaces \(X\) under a semi-simple simply connected \(K\) -group \(G'\) with finite solvable geometric stabilizer \({\bar{G}}\) , under certain hypotheses concerning the \(K\) -kernel (or \(K\) -lien) \(({\bar{G}},\kappa )\) defined by \(X\) .     

Bounding the exponent of a verbal subgroup

We deal with the following conjecture. If \(w\) is a group word and \(G\) is a finite group in which any nilpotent subgroup generated by \(w\) -values has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only. We show that this is true in the case where \(w\) is either the \(n\text{ th }\) Engel word or the word \([x^n,y_1,y_2,\ldots ,y_k]\) (Theorem A). Further, we show that for any positive integer \(e\) there exists a number \(k=k(e)\) such that if \(w\) is a word and \(G\) is a finite group in which any nilpotent subgroup generated by products of \(k\) values of the word \(w\) has exponent dividing \(e\) , then the exponent of the verbal subgroup \(w(G)\) is bounded in terms of \(e\) and \(w\) only (Theorem B).     

On the number of distinct prime factors of nj+a^hk

Let \(\omega (n)\) denote the number of distinct prime factors of \(n\) . Then for any given \(K\ge 2\) , small \(\epsilon >0\) and sufficiently large (only depending on \(K\) and \(\epsilon \) ) \(x\) , there exist at least \(x^{1-\epsilon }\) integers \(n\in [x,(1+K^{-1})x]\) such that \(\omega (nj\pm a^hk)\ge (\log \log \log x)^{\frac{1}{3}-\epsilon }\) for all \(2\le a\le K\) , \(1\le j,k\le K\) and \(0\le h\le K\log x\) .     

Neighbour-transitive codes in Johnson graphs

The Johnson graph \(J(v,k)\) has, as vertices, the \(k\) -subsets of a \(v\) -set \(\mathcal {V}\) and as edges the pairs of \(k\) -subsets with intersection of size \(k-1\) . We introduce the notion of a neighbour-transitive code in \(J(v,k)\) . This is a proper vertex subset \(\Gamma \) such that the subgroup \(G\) of graph automorphisms leaving \(\Gamma \) invariant is transitive on both the set \(\Gamma \) of ‘codewords’ and also the set of ‘neighbours’ of \(\Gamma \) , which are the non-codewords joined by an edge to some codeword. We classify all examples where the group \(G\) is a subgroup of the symmetric group \(\mathrm{Sym}\,(\mathcal {V})\) and is intransitive or imprimitive on the underlying \(v\) -set \(\mathcal {V}\) . In the remaining case where \(G\le \mathrm{Sym}\,(\mathcal {V})\) and \(G\) is primitive on \(\mathcal {V}\) , we prove that, provided distinct codewords are at distance at least \(3\) , then \(G\) is \(2\) -transitive on \(\mathcal {V}\) . We examine many of the infinite families of finite \(2\) -transitive permutation groups and construct surprisingly rich families of examples of neighbour-transitive codes. A major unresolved case remains.     

Decay of matrix coefficients on reductive homogeneous spaces of spherical type

Let \(Z\) be a homogeneous space \(Z=G/H\) of a real reductive Lie group \(G\) with a reductive subgroup \(H\) . The investigation concerns the quantitative decay of matrix coefficients on \(Z\) under the assumption that \(Z\) is of spherical type, that is, minimal parabolic subgroups have open orbits on \(Z\) .     

Algorithmic aspects of Steiner convexity and enumeration of Steiner trees

For a set \(W\) of vertices of a connected graph \(G=(V(G),E(G))\) , a Steiner W-tree is a connected subgraph \(T\) of \(G\) such that \(W\subseteq V(T)\) and \(|E(T)|\) is minimum. Vertices in \(W\) are called terminals. In this work, we design an algorithm for the enumeration of all Steiner \(W\) -trees for a constant number of terminals, which is the usual scenario in many applications. We discuss algorithmic issues involving space requirements to compactly represent the optimal solutions and the time delay to generate them. After generating the first Steiner \(W\) -tree in polynomial time, our algorithm enumerates the remaining trees with \(O(n)\) delay (where \(n=|V(G)|\) ). An algorithm to enumerate all Steiner trees was already known (Khachiyan et al., SIAM J Discret Math 19:966–984, 2005), but this is the first one achieving polynomial delay. A by-product of our algorithm is a representation of all (possibly exponentially many) optimal solutions using polynomially bounded space. We also deal with the following problem: given \(W\) and a vertex \(x\in V(G)\setminus W\) , is \(x\) in a Steiner \(W'\) -tree for some \(\emptyset \ne W' \subseteq W\) ? This problem is investigated from the complexity point of view. We prove that it is NP-hard when \(W\) has arbitrary size. In addition, we prove that deciding whether \(x\) is in some Steiner \(W\) -tree is NP-hard as well. We discuss how these problems can be used to define a notion of Steiner convexity in graphs.     

A groupoid generalisation of Leavitt path algebras

Let \(G\) be a locally compact, Hausdorff, étale groupoid whose unit space is totally disconnected. We show that the collection \(A(G)\) of locally-constant, compactly supported complex-valued functions on \(G\) is a dense \(*\) -subalgebra of \(C_c(G)\) and that it is universal for algebraic representations of the collection of compact open bisections of \(G\) . We also show that if \(G\) is the groupoid associated to a row-finite graph or \(k\) -graph with no sources, then \(A(G)\) is isomorphic to the associated Leavitt path algebra or Kumjian–Pask algebra. We prove versions of the Cuntz–Krieger and graded uniqueness theorems for \(A(G)\) .     

Algebraic quotient modules and subgroup depth

In Kadison J Pure Appl Alg 218:367–380, (2014) it was shown that subgroup depth may be computed from the permutation module of the left or right cosets: this holds more generally for a Hopf subalgebra, from which we note in this paper that finite depth of a Hopf subalgebra \(R \subseteq H\) is equivalent to the \(H\) -module coalgebra \(Q = H/R^+H\) representing an algebraic element in the Green ring of \(H\) or \(R\) . This approach shows that subgroup depth and the subgroup depth of the corefree quotient lie in the same closed interval of length one. We also establish a previous claim that the problem of determining if \(R\) has finite depth in \(H\) is equivalent to determining if \(H\) has finite depth in its smash product \(Q^* \# H\) . A necessary condition is obtained for finite depth from stabilization of a descending chain of annihilator ideals of tensor powers of \(Q\) . As an application of these topics to a centerless finite group \(G\) , we prove that the minimum depth of its group \(\mathbb {C}\,\) -algebra in the Drinfeld double \(D(G)\) is an odd integer, which determines the least tensor power of the adjoint representation \(Q\) that is a faithful \(\mathbb {C}\,G\) -module.