Neighbor sum distinguishing total chromatic number of <Emphasis Type="Italic">K</Emphasis><Subscript>4</Subscript>-minor free graph

A k-total coloring of a graph G is a mapping ?: V (G) ? E(G) → {1; 2,..., k} such that no two adjacent or incident elements in V (G) ? E(G) receive the same color. Let f(v) denote the sum of the color on the vertex v and the colors on all edges incident with v: We say that ? is a k-neighbor sum distinguishing total coloring of G if f(u) 6 ≠ f(v) for each edge uv ∈ E(G): Denote χ _Σ ^″ (G) the smallest value k in such a coloring of G: Pil?niak and Wo?niak conjectured that for any simple graph with maximum degree Δ(G), χ _Σ ^″ ≤ Δ(G)+3. In this paper, by using the famous Combinatorial Nullstellensatz, we prove that for K ₄-minor free graph G with Δ(G) > 5; χ _Σ ^″ = Δ(G) + 1 if G contains no two adjacent Δ-vertices, otherwise, χ _Σ ^″ (G) = Δ(G) + 2.     

Every graph is (2,3)-choosable

A total weighting of a graph G is a mapping ? that assigns to each element z ∈ V (G)∪E(G) a weight ?(z). A total weighting ? is proper if for any two adjacent vertices u and v, ∑ _e∈E(u) ?(e)+?(u)≠∑ _e∈E(v) ?(e)+?(v). This paper proves that if each edge e is given a set L(e) of 3 permissible weights, and each vertex v is given a set L(v) of 2 permissible weights, then G has a proper total weighting ? with ?(z) ∈ L(z) for each element z ∈ V (G)∪E(G).     

Spectral invariant subalgebras of reduced groupoid <Emphasis Type="Italic">C</Emphasis>*-algebras

We introduce the notion of property (RD) for a locally compact, Hausdorff and r-discrete groupoid G, and show that the set S ₂ ^l (G) of rapidly decreasing functions on G with respect to a continuous length function l is a dense spectral invariant and Fréchet *-subalgebra of the reduced groupoid C*-algebra C _r ^* (G) of G when G has property (RD) with respect to l, so the K-theories of both algebras are isomorphic under inclusion. Each normalized cocycle c on G, together with an invariant probability measure on the unit space G ⁰ of G, gives rise to a canonical map τ _c on the algebra C _c (G) of complex continuous functions with compact support on G. We show that the map τ _c can be extended continuously to S ₂ ^l (G) and plays the same role as an n-trace on C _r ^* (G) when G has property (RD) and c is of polynomial growth with respect to l, so the Connes’ fundament paring between the K-theory and the cyclic cohomology gives us the K-theory invariants on C _r ^* (G).     

Degree sum of a pair of independent edges and <Emphasis Type="Italic">Z</Emphasis><Subscript>3</Subscript>-connectivity

Let G be a 2-edge-connected simple graph on n vertices. For an edge e = uv ∈ E(G), define d(e) = d(u) + d(v). Let F denote the set of all simple 2-edge-connected graphs on n ≥ 4 vertices such that G ∈ F if and only if d(e) + d(e’) ≥ 2n for every pair of independent edges e, e’ of G. We prove in this paper that for each G ∈ F, G is not Z ₃-connected if and only if G is one of K _2,n?2, K _3,n?3, K _2,n?2 ⁺ , K _3,n?3 ⁺ or one of the 16 specified graphs, which generalizes the results of X. Zhang et al. [Discrete Math., 2010, 310: 3390–3397] and G. Fan and X. Zhou [Discrete Math., 2008, 308: 6233–6240].     

An implicit degree condition for relative length of long paths and cycles in graphs

For a graph G, we denote by p(G) and c(G) the number of vertices of a longest path and a longest cycle in G, respectively. For a vertex v in G, id(v) denotes the implicit degree of v. In this paper, we obtain that if G is a 2-connected graph on n vertices such that the implicit degree sum of any three independent vertices is at least n + 1, then either G contains a hamiltonian path, or c(G) ≥ p(G) ? 1.     

(3, 1)*-Choosability of graphs of nonnegative characteristic without intersecting short cycles

A graph G is called (k,d)^?-choosable if for every list assignment L satisfying ∣L(v)∣ ≥k for all v∈V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this paper, it is proved that every graph of nonnegative characteristic without intersecting i-cycles for all i=3,4,5 is (3,1)^?-choosable.     

Minimum Difference Representations of Graphs

Define a k-minimum-difference-representation (k-MDR) of a graph G to be a family of sets \({\{S(v): v\in V(G)\}}\) such that u and v are adjacent in G if and only if min{|S(u)?S(v)|, |S(v)?S(u)|} ≥ k. Define ρ _min(G) to be the smallest k for which G has a k-MDR. In this note, we show that {ρ _min(G)} is unbounded. In particular, we prove that for every k there is an n ₀ such that for n > n ₀ ‘almost all’ graphs of order n satisfy ρ _min(G) > k. As our main tool, we prove a Ramsey-type result on traces of hypergraphs.     

Distance domination of generalized de Bruijn and Kautz digraphs

Let G = (V,A) be a digraph and k ≥ 1 an integer. For u, v ∈ V, we say that the vertex u distance k-dominate v if the distance from u to v at most k. A set D of vertices in G is a distance k-dominating set if each vertex of V D is distance k-dominated by some vertex of D. The distance k-domination number of G, denoted by γ _k (G), is the minimum cardinality of a distance k-dominating set of G. Generalized de Bruijn digraphs G _B (n, d) and generalized Kautz digraphs G _K (n, d) are good candidates for interconnection networks. Denote Δ _k := (∑ _j=0 ^k d ^j )^?1. F. Tian and J. Xu showed that ?nΔ _k ? γ _k (G _B (n, d)) ≤?n/d ^k? and ?nΔ _k ? ≤ γ _k (G _K (n, d)) ≤ ?n/d ^k ?. In this paper, we prove that every generalized de Bruijn digraph G _B (n, d) has the distance k-domination number ?nΔ _k ? or ?nΔ _k ?+1, and the distance k-domination number of every generalized Kautz digraph G _K (n, d) bounded above by ?n/(d ^k?1+d ^k )?. Additionally, we present various sufficient conditions for γ _k (G _B (n, d)) = ?nΔ _k ? and γ _k (G _K (n, d)) = ?nΔ _k ?.     

Holomorphic injective extensions of functions in <Emphasis Type="Italic">P</Emphasis>(<Emphasis Type="Italic">K</Emphasis>) and algebra generators

We present necessary and sufficient conditions on planar compacta K and continuous functions f on K in order that f generate the algebras P(K), R(K), A(K) or C(K). We also unveil quite surprisingly simple examples of non-polynomial convex compacta K ? C and f ∈ P(K) with the property that f ∈ P(K) is a homeomorphism of K onto its image, but for which f ^?1 ? P(f(K)). As a consequence, such functions do not admit injective holomorphic extensions to the interior of the polynomial convex hull \(\widehat K\). On the other hand, it is shown that the restriction f*|_G of the Gelfand-transform f* of an injective function f ∈ P(K) is injective on every regular, bounded complementary component G of K. A necessary and sufficient condition in terms of the behaviour of f on the outer boundary of K is given in order that f admit a holomorphic injective extension to \(\widehat K\). We also include some results on the existence of continuous logarithms on punctured compacta containing the origin in their boundary.     

On Singular Points of Solutions of the Minimal Surface Equation on Sets of Positive Measure

It is shown that, for any compact set K ? ? ⁿ (n ? 2) of positive Lebesgue measure and any bounded domain G ? K, there exists a function in the Hölder class C^1,1(G) that is a solution of the minimal surface equation in G \ K and cannot be extended from G \ K to G as a solution of this equation.     

Quantum quaternion spheres

For the quantum symplectic group SP _q (2n), we describe the C ^?-algebra of continuous functions on the quotient space S P _q (2n)/S P _q (2n?2) as an universal C ^?-algebra given by a finite set of generators and relations. The proof involves a careful analysis of the relations, and use of the branching rules for representations of the symplectic group due to Zhelobenko. We then exhibit a set of generators of the K-groups of this C ^?-algebra in terms of generators of the C ^?-algebra.     

Pseudo-amenability of certain semigroup algebras

In this paper, we investigate the pseudo-amenability of semigroup algebra ? ¹(S), where S is an inverse semigroup with uniformly locally finite idempotent set. In particular, we show that for a Brandt semigroup \(S={\mathcal{M}}^{0}(G,I)\), the pseudo-amenability of ? ¹(S) is equivalent to the amenability of G.     

Hopf Modules and Representations of Finite Wreath Products

For a finite group G and nonnegative integer n ≥ 0, one may consider the associated tower \(G \wr S_{n} := S_{n} \ltimes G^{n}\) of wreath product groups. Zelevinsky associated to such a tower the structure of a positive self-adjoint Hopf algebra (PSH-algebra) R(G) on the direct sum over integers n ≥ 0 of the Grothendieck groups K ₀(R e p?G?S _n ). In this paper, we study the interaction via induction and restriction of the PSH-algebras R(G) and R(H) associated to finite groups H ? G. A class of Hopf modules over PSH-algebras with a compatibility between the comultiplication and multiplication involving the Hopf k ^{t h} -power map arise naturally and are studied independently. We also give an explicit formula for the natural PSH-algebra morphisms R(H) → R(G) and R(G) → R(H) arising from induction and restriction. In an appendix, we consider a family of subgroups of wreath product groups analogous to the subgroups G(m, p, n) of the wreath product cyclotomic complex reflection groups G(m, 1, n).     

On trees with total domination number equal to edge-vertex domination number plus one

An edge e∈E(G) dominates a vertex v∈V(G) if e is incident with v or e is incident with a vertex adjacent to v. An edge-vertex dominating set of a graph G is a set D of edges of G such that every vertex of G is edge-vertex dominated by an edge of D. The edge-vertex domination number of a graph G is the minimum cardinality of an edge-vertex dominating set of G. A subset D?V(G) is a total dominating set of G if every vertex of G has a neighbor in D. The total domination number of G is the minimum cardinality of a total dominating set of G. We characterize all trees with total domination number equal to edge-vertex domination number plus one.     

Minimum implicit degree condition restricted to claws for hamiltonian cycles

Let id(v) denote the implicit degree of a vertex v in a graph G. We define G to be implicit 1-heavy (implicit 2-heavy) if at least one (two) of the end vertices of each induced claw has (have) implicit degree at least n/2. In this paper, we prove that: (a) Let G be a 2-connected graph of order n ≥ 3. If G is implicit 2-heavy and |N(u) ∩ N(v)| ≥ 2 for every pair of vertices u and v with d(u, v) = 2 and max{id(u), id(v)} < n/2, then G is hamiltonian. (b) Let G be a 3-connected graph of order n ≥ 3. If G is implicit 1-heavy and |N(u) ∩ N(v)| ≥ 2 for each pair of vertices u and v with d(u, v) = 2 and max{id(u), id(v)} < n/2, then G is hamiltonian.     

A discrete version of Koldobsky’s slicing inequality

Let #K be a number of integer lattice points contained in a set K. In this paper we prove that for each d ∈ N there exists a constant C(d) depending on d only, such that for any origin-symmetric convex body K ? R ^d containing d linearly independent lattice points

$$\# K \leqslant C\left( d \right)\max \left( {\# \left( {K \cap H} \right)} \right)vo{l_d}{\left( K \right)^{\frac{{d - m}}{d}}},$$

where the maximum is taken over all m-dimensional subspaces of R ^d . We also prove that C(d) can be chosen asymptotically of order O(1) ^d d ^d?m . In particular, we have order O(1) ^d for hyperplane slices. Additionally, we show that if K is an unconditional convex body then C(d) can be chosen asymptotically of order O(d) ^d?m .

     

Variational Problems with Unilateral Pointwise Functional Constraints in Variable Domains

We consider a sequence of convex integral functionals F_s: W¹,^p(Ω_s) → ? and a sequence of weakly lower semicontinuous and generally nonintegral functionals G_s: W¹,^p(Ω_s) → ?, where {Ω_s} is a sequence of domains in ?ⁿ contained in a bounded domain Ω ? ?ⁿ (n ≥ 2) and p > 1. Along with this, we consider a sequence of closed convex sets V_s = {v ∈ W¹,^p(Ω_s): v ≥ K_s(v) a.e. in Ω_s}, where K_s is a mapping from the space W¹,^p(Ω_s) to the set of all functions defined on Ω_s. We establish conditions under which minimizers and minimum values of the functionals F_s + G_s on the sets V_s converge to a minimizer and the minimum value of a functional on the set V = {v ∈ W¹,^p(Ω): v ≥ K(v) a.e. in Ω}, where K is a mapping from the space W¹,^p(Ω) to the set of all functions defined on Ω. These conditions include, in particular, the strong connectedness of the spaces W¹,^p(Ω_s) with the space W¹,^p(Ω), the condition of exhaustion of the domain Ω by the domains Ω_s, the Γ-convergence of the sequence {F_s} to a functional F: W¹,^p(Ω) → ?, and a certain convergence of the sequence {G_s} to a functional G: W¹,^p(Ω) → ?. We also assume some conditions characterizing both the internal properties of the mappings K_s and their relation to the mapping K. In particular, these conditions admit the study of variational problems with irregular varying unilateral obstacles and with varying constraints combining the pointwise dependence and the functional dependence of the integral form.     

Lower bounds on the signed total k-domination number of graphs

Let G be a graph with vertex set V(G). For any integer k ≥ 1, a signed total k-dominating function is a function f: V(G) → {?1, 1} satisfying ∑_x∈N(v)f(x) ≥ k for every v ∈ V(G), where N(v) is the neighborhood of v. The minimum of the values ∑_v∈V(G)f(v), taken over all signed total k-dominating functions f, is called the signed total k-domination number. In this note we present some new sharp lower bounds on the signed total k-domination number of a graph. Some of our results improve known bounds.     

Bessel Property of the System of Root Functions of a Second-Order Singular Operator on an Interval

For the system of root functions of an operator defined by the differential operation ?u″ + p(x)u′ + q(x)u, x ∈ G = (0, 1), with complex-valued singular coefficients, sufficient conditions for the Bessel property in the space L₂(G) are obtained and a theorem on the unconditional basis property is proved. It is assumed that the functions p(x) and q(x) locally belong to the spaces L₂ and W₂^?1, respectively, and may have singularities at the endpoints of G such that q(x) = q_R(x) +q′S(x) and the functions q_S(x), p(x), q ₂ ^S (x)w(x), p²(x)w(x), and q_R(x)w(x) are integrable on the whole interval G, where w(x) = x(1 ? x).