A new rational auxiliary equation method and exact solutions of a generalized Zakharov system

A new rational auxiliary equation method for obtaining exact traveling wave solutions of constant coefficient nonlinear partial differential equations of evolution is proposed. Its effectiveness is evinced by obtaining exact solutions of a generalized Zakharov system, some of which are new. It is shown that the G^′/G and the generalized projective Ricatti expansion methods are special cases of the auxiliary equation method. Further, due the solutions obtained, four other new and practicable rational methods are deduced.     

Asymptotic behavior of the least energy solution of a problem with competing powers

We consider the problem ε²Δu−uq+up=0 in Ω, u>0 in Ω, u=0 on ∂Ω. Here Ω is a smooth bounded domain in RN, if N?3 and ε is a small positive parameter. We study the asymptotic behavior of the least energy solution as ε goes to zero in the case . We show that the limiting behavior is dominated by the singular solution ΔG−Gq=0 in Ω\{P}, G=0 on ∂Ω. The reduced energy is of nonlocal type.     

Circuit preserving edge maps II

In Section 1 of this article we prove the following. Let f: G → G′ be a circuit surjection, i.e., a mapping of the edge set of G onto the edge set of G′ which maps circuits of G onto circuits of G′, where G, G′ are graphs without loops or multiple edges and G′ has no isolated vertices. We show that if G is assumed finite and 3-connected, then f is induced by a vertex isomorphism. If G is assumed 3-connected but not necessarily finite and G′ is assumed to not be a circuit, then f is induced by a vertex isomorphism. Examples of circuit surjections f: G → G′ where G′ is a circuit and G is an infinite graph of arbitrarily large connectivity are given. In general if we assume G two-connected and G′ not a circuit then any circuit surjection f: G → G′ may be written as the composite of three maps, f(G) = q(h(k(G))), where k is a 1-1 onto edge map which preserves circuits in both directions (the “2-isomorphism” of Whitney (Amer. J. Math. 55 (1933), 245–254) when G is finite), h is an onto edge map obtained by replacing “suspended chains” of k(G) with single edges, and G is a circuit injection (a 1-1 circuit surjection). Let f: G → M be a 1-1 onto mapping of the edges of G onto the cells of M which takes circuits of G onto circuits of M where G is a graph with no isolated vertices, M a matroid. If there exists a circuit C of M which is not the image of a circuit in G, we call f nontrivial, otherwise trivial. In Section 2 we show the following. Let G be a graph of even order. Then the statement “no trivial map f: G → M exists, where M is a binary matroid,” is equivalent to “G is Hamiltonian.” If G is a graph of odd order, then the statement “no nontrivial map f: G → M exists, where M is a binary matroid” is equivalent to “G is almost Hamiltonian,” where we define a graph G of order n to be almost Hamiltonian if every subset of vertices of order n − 1 is contained in some circuit of G.     

On the well-coveredness of Cartesian products of graphs

A graph G is well-covered if every maximal independent set has the same cardinality. This paper investigates when the Cartesian product of two graphs is well-covered. We prove that if G and H both belong to a large class of graphs that includes all non-well-covered triangle-free graphs and most well-covered triangle-free graphs, then G×H is not well-covered. We also show that if G is not well-covered, then neither is G×G. Finally, we show that G×G is not well-covered for all graphs of girth at least 5 by introducing super well-covered graphs and classifying all such graphs of girth at least 5.     

Contractibility and the clique graph operator

To any graph G we can associate a simplicial complex Δ(G) whose simplices are the complete subgraphs of G, and thus we say that G is contractible whenever Δ(G) is so. We study the relationship between contractibility and K-nullity of G, where G is called K-null if some iterated clique graph of G is trivial. We show that there are contractible graphs which are not K-null, and that any graph whose clique graph is a cone is contractible.     

Modules over integer group rings of locally soluble groups with minimax restriction

Let ? be the ring of integers, and A be a ?G-module, where A/C _A (G) is not a minimax ?-module, C _G (A) = 1, and G is a locally soluble group. Let L _nm(G) be the system of all subgroups H ?? G such that quotient modules A/C _A (H) are not minimax Z-modules. The author studies ?G-modules A such that L _nm(G) satisfies the minimal condition as an ordered set. It is proved that a locally soluble group G with these conditions is soluble. The structure of the group G is described.     

Amenability properties of the centres of group algebras

Let G be a locally compact group, and ZL¹(G) be the centre of its group algebra. We show that when G is compact ZL¹(G) is not amenable when G is either non-abelian and connected, or is a product of infinitely many finite non-abelian groups. We also, study, for some non-compact groups G, some conditions which imply amenability and hyper-Tauberian property, for ZL¹(G).     

On the existence of a free subgroup of finite index

Let G be a finitely generated accessible group. We will study the homology of G with coefficients in the left G-module H¹(G;$\text{Z}$[G]). This G-module may be identified with the G-module of continuous functions with values in $\text{Z}$ on the G-space of ends of G, quotiented by the constant functions. The main result is as follows: Suppose G is infinite, then the abelian group H₁(G;H¹(G;$\text{Z}$[G])) has rank 1 if G has a free subgroup of finite index and it has rank 0 if G has not.     

An answer to a question of Isaacs on character degree graphs

Let N be a normal subgroup of a finite group G. We consider the graph Γ(G|N) whose vertices are the prime divisors of the degrees of the irreducible characters of G whose kernel does not contain N and two vertices are joined by an edge if the product of the two primes divides the degree of some of the characters of G whose kernel does not contain N. We prove that if Γ(G|N) is disconnected then G/N is solvable. This proves a strong form of a conjecture of Isaacs.     

Bipartite graphs are not universal fixers

For any permutation π of the vertex set of a graph G, the graph πG is obtained from two copies G^′ and G^″ of G by joining u∈V(G^′) and v∈V(G^″) if and only if v=π(u). Denote the domination number of G by γ(G). For all permutations π of V(G), γ(G)≤γ(πG)≤2γ(G). If γ(πG)=γ(G) for all π, then G is called a universal fixer. We prove that graphs without 5-cycles are not universal fixers, from which it follows that bipartite graphs are not universal fixers.     

Edges not contained in triangles and the distribution of contractible edges in a 4-connected graph

We prove results concerning the distribution of 4-contractible edges in a 4-connected graph G in connection with the edges of G not contained in a triangle. As a corollary, we show that if G is 4-regular 4-connected graph, then the number of 4-contractible edges of G is at least one half of the number of edges of G not contained in a triangle.     

Almost fixed-point-free automorphisms of order 2

Let φ be an automorphism of order 2 of the group G with C _G (φ) finite. We prove the following. If G has finite Hirsch number then G is (nilpotent of class at most 2)-by-finite but need not be abelian-by-finite. If G is a finite extension of a soluble group with finite abelian ranks, then G is abelian-by-finite.     

Chromatic coloring with a maximum color class

Let G be any graph, and also let Δ(G), χ(G) and α(G) denote the maximum degree, the chromatic number and the independence number of G, respectively. A chromatic coloring of G is a proper coloring of G using χ(G) colors. A color class in a proper coloring of G is maximum if it has size α(G). In this paper, we prove that if a graph G (not necessarily connected) satisfies χ(G)≥Δ(G), then there exists a chromatic coloring of G in which some color class is maximum. This cannot be guaranteed if χ(G)<Δ(G). We shall also give some other extensions.     

A characterization of maximal non-k-factor-critical graphs

A graph G of order p is k-factor-critical,where p and k are positive integers with the same parity, if the deletion of any set of k vertices results in a graph with a perfect matching. G is called maximal non-k-factor-critical if G is not k-factor-critical but G+e is k-factor-critical for every missing edge e∉E(G). A connected graph G with a perfect matching on 2n vertices is k-extendable, for 1?k?n-1, if for every matching M of size k in G there is a perfect matching in G containing all edges of M. G is called maximal non-k-extendable if G is not k-extendable but G+e is k-extendable for every missing edge e∉E(G) . A connected bipartite graph G with a bipartitioning set (X,Y) such that |X|=|Y|=n is maximal non-k-extendable bipartite if G is not k-extendable but G+xy is k-extendable for any edge xy∉E(G) with x∈X and y∈Y. A complete characterization of maximal non-k-factor-critical graphs, maximal non-k-extendable graphs and maximal non-k-extendable bipartite graphs is given.     

First countability, tightness, and other cardinal invariants in remainders of topological groups

We consider the following natural questions: when a topological group G has a first countable remainder, when G has a remainder of countable tightness? This leads to some further questions on the properties of remainders of topological groups. Let G be a topological group. The following facts are established. 1. If Gω has a first countable remainder, then either G is metrizable, or G is locally compact. 2. If G has a countable network and a first countable remainder, then either G is separable and metrizable, or G is σ-compact. 3. Under (MA+¬CH) every topological group with a countable network and a first countable remainder is separable and metrizable. Some new open problems are formulated.     

Whiskers and sequentially Cohen-Macaulay graphs

We investigate how to modify a simple graph G combinatorially to obtain a sequentially Cohen-Macaulay graph. We focus on adding configurations of whiskers to G, where to add a whisker one adds a new vertex and an edge connecting this vertex to an existing vertex of G. We give various sufficient conditions and necessary conditions on a subset S of the vertices of G so that the graph G∪W(S), obtained from G by adding a whisker to each vertex in S, is a sequentially Cohen-Macaulay graph. For instance, we show that if S is a vertex cover of G, then G∪W(S) is a sequentially Cohen-Macaulay graph. On the other hand, we show that if G?S is not sequentially Cohen-Macaulay, then G∪W(S) is not a sequentially Cohen-Macaulay graph. Our work is inspired by and generalizes a result of Villarreal on the use of whiskers to get Cohen-Macaulay graphs.     

On the reduced signless Laplacian spectrum of a degree maximal graph

For a (simple) graph G, the signless Laplacian of G is the matrix A(G)+D(G), where A(G) is the adjacency matrix and D(G) is the diagonal matrix of vertex degrees of G; the reduced signless Laplacian of G is the matrix Δ(G)+B(G), where B(G) is the reduced adjacency matrix of G and Δ(G) is the diagonal matrix whose diagonal entries are the common degrees for vertices belonging to the same neighborhood equivalence class of G. A graph is said to be (degree) maximal if it is connected and its degree sequence is not majorized by the degree sequence of any other connected graph. For a maximal graph, we obtain a formula for the characteristic polynomial of its reduced signless Laplacian and use the formula to derive a localization result for its reduced signless Laplacian eigenvalues, and to compare the signless Laplacian spectral radii of two well-known maximal graphs. We also obtain a necessary condition for a maximal graph to have maximal signless Laplacian spectral radius among all connected graphs with given numbers of vertices and edges.     

Orbit-equivalent infinite permutation groups

Let G,H be closed permutation groups on an infinite set X, with H a subgroup of G. It is shown that if G and H are orbit-equivalent, that is, have the same orbits on the collection of finite subsets of X, and G is primitive but not 2-transitive, then G=H.     

Transformation de Fourier des distributions de type positif sur un groupe de Lie unimodulaire

Call a locally compact group G, C¹-unique, if L¹(G) has exactly one (separating) C¹-norm. It is easy to see that a ¹-regular group G is C¹-unique and that a C¹-unique group is amenable. For connected groups G it is proved that G is C¹-unique, if the interior R(G)⁰ of a certain part R(G) of Prim(G), called the regular part of Prim(G), is dense in Prim(G), and that C¹-uniqueness of G implies the density of R(G) in Prim(G). From this it is derived that a connected group of type I is C¹-unique if and only if R(G)⁰ is dense in Prim(G). For exponential G, a quite explicit version of this result in terms of the Lie algebra of G is given. As an easy consequence, examples of amenable groups, which are not C¹-unique, and C¹-unique groups, which are not ¹-regular are obtained. Furthermore it is shown that a connected locally compact group G is amenable if and only if L¹(G) has exactly one C¹-norm, which is invariant under the isometric ¹-automorphisms of L¹(G).     

Tricyclic graphs with exactly two main eigenvalues

An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let G ₀ be the graph obtained from G by deleting all pendant vertices and δ(G) the minimum degree of vertices of G. In this paper, all connected tricyclic graphs G with δ(G ₀) ≥ 2 and exactly two main eigenvalues are determined.