G-symmetric spectra,semistability and the multiplicative norm

In this paper we develop the basic homotopy theory of G-symmetric spectra (that is, symmetric spectra with a G-action) for a finite group G, as a model for equivariant stable homotopy with respect to a G-set universe. This model lies in between Mandell's equivariant symmetric spectra and the G-orthogonal spectra of Mandell and May and is Quillen equivalent to the two. We further discuss equivariant semistability, construct model structures on module, algebra and commutative algebra categories and describe the homotopical properties of the multiplicative norm in this context.     

d-Symmetric d-orthogonal polynomials of Brenke type

In this paper, we characterize the d-symmetric d-orthogonal polynomials of Brenke type. We obtain two new families of polynomials and the moments of the corresponding d-dimensional vectors of linear functionals. Weights, providing integral representations for these moments, were also given.     

Some relations among term rank, clique number and list chromatic number of a graph

Let G be a graph with a nonempty edge set, we denote the rank of the adjacency matrix of G and term rank of G, by rk(G) and Rk(G), respectively. van Nuffelen conjectured that for any graph G, χ(G)?rk(G). The first counterexample to this conjecture was obtained by Alon and Seymour. In 2002, Fishkind and Kotlov proved that for any graph G, χ(G)?Rk(G). Here we improve this upper bound and show that χ_l(G)?(rk(G)+Rk(G))/2, where χ_l(G) is the list chromatic number of G.     

Embeddings of minimal non-abelian p-groups

By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. For a given finite group G, let p(G) denote the minimal degree of a faithful representation of G by permutation matrices, and let c(G) denote the minimal degree of a faithful representation of G by quasi-permutation matrices. See [4]. It is easy to see that c(G) is a lower bound for p(G). Behravesh [H. Behravesh, The minimal degree of a faithful quasi-permutation representation of an abelian group, Glasg. Math. J. 39 (1) (1997) 51-57] determined c(G) for every finite abelian group G and also [H. Behravesh, Quasi-permutation representations of p-groups of class 2, J. Lond. Math. Soc. (2) 55 (2) (1997) 251-260] gave the algorithm of c(G) for each finite group G. In this paper, we first improve this algorithm and then determine c(G) and p(G) for an arbitrary minimal non-abelian p-group G.     

The principle of symmetric criticality for non-differentiable mappings

Let X be a Banach space on which a symmetry group G linearly acts and let J be a G-invariant functional defined on X. In 1979, R. Palais (Comm. Math. Phys. 69 (1979) 19) gave some sufficient conditions to guarantee the so-called “Principle of Symmetric Criticality”: every critical point of J restricted on the subspace of G-symmetric points becomes also a critical point of J on the whole space X. This principle is generalized to the case where J is not differentiable within the setting which does not require the full variational structure under the hypothesis that the action of G is isometry or G is compact.     

Some bounds on the p-domination number in trees

Let p be a positive integer and G=(V,E) a graph. A subset S of V is a p-dominating set if every vertex of V-S is dominated at least p times, and S is a p-dependent set of G if the subgraph induced by the vertices of S has maximum degree at most p-1. The minimum cardinality of a p-dominating set a of G is the p-domination number γ_p(G) and the maximum cardinality of a p-dependent set of G is the p-dependence number β_p(G). For every positive integer p?2, we show that for a bipartite graph G, γ_p(G) is bounded above by (|V|+|Y_p|)/2, where Y_p is the set of vertices of G of degree at most p-1, and for every tree T, γ_p(T) is bounded below by β_p-1(T). Moreover, we characterize the trees achieving equality in each bound.     

Common fixed point theorems for three maps in discontinuous Gb metric spaces

In [Aghajani A, Abbas M, Roshan JR. Common fixed point of generalized weak contractive mappings in partially ordered G_b-metric spaces. Filomat, 2013, in press], using the concepts of G-metric and b-metric Aghajani et al. defined a new type of metric which is called generalized b-metric or G_b-metric. In this paper, we prove a common fixed point theorem for three mappings in G_b-metric space which is not continuous. An example is presented to verify the effectiveness and applicability of our main result.     

Frobenius splitting and geometry of G-Schubert varieties

Let X be an equivariant embedding of a connected reductive group G over an algebraically closed field k of positive characteristic. Let B denote a Borel subgroup of G. A G-Schubert variety in X is a subvariety of the form diag(G)⋅V, where V is a B×B-orbit closure in X. In the case where X is the wonderful compactification of a group of adjoint type, the G-Schubert varieties are the closures of Lusztig's G-stable pieces. We prove that X admits a Frobenius splitting which is compatible with all G-Schubert varieties. Moreover, when X is smooth, projective and toroidal, then any G-Schubert variety in X admits a stable Frobenius splitting along an ample divisors. Although this indicates that G-Schubert varieties have nice singularities we present an example of a nonnormal G-Schubert variety in the wonderful compactification of a group of type G₂. Finally we also extend the Frobenius splitting results to the more general class of R-Schubert varieties.     

Symmetric Graphs and Flag Graphs

 With any G-symmetric graph Γ admitting a nontrivial G-invariant partition , we may associate a natural “cross-sectional” geometry, namely the 1-design in which for and if and only if α is adjacent to at least one vertex in C, where and is the neighbourhood of B in the quotient graph of Γ with respect to . In a vast number of cases, the dual 1-design of contains no repeated blocks, that is, distinct vertices of B are incident in with distinct subsets of blocks of . The purpose of this paper is to give a general construction of such graphs, and then prove that it produces all of them. In particular, we show that such graphs can be reconstructed from and the induced action of G on . The construction reveals a close connection between such graphs and certain G-point-transitive and G-block-transitive 1-designs. By using this construction we give a characterization of G-symmetric graphs such that there is at most one edge between any two blocks of . This leads to, in a subsequent paper, a construction of G-symmetric graphs such that and each is incident in with vertices of B. The work was supported by a discovery-project grant from the Australian Research Council. Received April 24, 2001; in revised form October 9, 2002 Published online May 9, 2003     

Compact group actions on equivariant absolute neighborhood retracts and their orbit spaces

We apply equivariant joins to give a new and more transparent proof of the following result: if G is a compact Hausdorff group and X a G-ANR (respectively, a G-AR), then for every closed normal subgroup H of G, the H-orbit space X/H is a G/H-ANR (respectively, a G/H-AR). In particular, X/G is an ANR (respectively, an AR).     

On the zeros of d-symmetric d-orthogonal polynomials

In this paper, we give some properties of the zeros of d-symmetric d-orthogonal polynomials and we localize these zeros on (d+1) rays emanating from the origin. We apply the obtained results to some known polynomials. In particular, we partially solve the conjecture about the zeros of the Humbert polynomials stated by Milovanovi? and Dordevi? [G.V. Milovanovi?, G.B. Dordevi?, On some properties of Humbert's polynomials, II, Ser. Math. Inform. 6 (1991) 23-30]. A study of the eigenvalues of a particular banded Hessenberg matrix is done.     

Isometric path numbers of graphs

An isometric path between two vertices in a graph G is a shortest path joining them. The isometric path number of G, denoted by ip(G), is the minimum number of isometric paths needed to cover all vertices of G. In this paper, we determine exact values of isometric path numbers of complete r-partite graphs and Cartesian products of 2 or 3 complete graphs.     

Functorial topologies and finite-index subgroups of abelian groups

In the general context of functorial topologies, we prove that in the lattice of all group topologies on an abelian group, the infimum between the Bohr topology and the natural topology is the profinite topology. The profinite topology and its connection to other functorial topologies is the main objective of the paper. We are particularly interested in the poset C(G) of all finite-index subgroups of an abelian group G, since it is a local base for the profinite topology of G. We describe various features of the poset C(G) (its cardinality, its cofinality, etc.) and we characterize the abelian groups G for which C(G)?{G} is cofinal in the poset of all subgroups of G ordered by inclusion. Finally, for pairs of functorial topologies T, S we define the equalizer E(T,S), which permits to describe relevant classes of abelian groups in terms of functorial topologies.     

H-domination in graphs

Let H be some fixed graph of order p. For a given graph G and vertex set S⊆V(G), we say that S is H-decomposable if S can be partitioned as S=S₁∪S₂∪?∪S_j where, for each of the disjoint subsets S_i, with 1?i?j, we have |S_i|=p and H is a spanning subgraph of 〈S_i〉, the subgraph induced by S_i. We define the H-domination number of G, denoted as γ_H(G), to be the minimum cardinality of an H-decomposable dominating set S. If no such dominating set exists, we write γ_H(G)=∞. We show that the associated H-domination decision problem is NP-complete for every choice of H. Bounds are shown for γ_H(G). We show, in particular, that if δ(G)?2, then γ_P3(G)?3γ(G). Also, if γ_P3(G)=3γ(G), then every γ(G)-set is an efficient dominating set.     

Generalizing D-graphs

Let ω₀(G) denote the number of odd components of a graph G. The deficiency of G is defined as def(G)=max_X⊆V(G)(ω₀(G-X)-|X|), and this equals the number of vertices unmatched by any maximum matching of G. A subset X⊆V(G) is called a Tutte set (or barrier set) of G if def(G)=ω₀(G-X)-|X|, and an extreme set if def(G-X)=def(G)+|X|. Recently a graph operator, called the D-graph D(G), was defined that has proven very useful in examining Tutte sets and extreme sets of graphs which contain a perfect matching. In this paper we give two natural and related generalizations of the D-graph operator to all simple graphs, both of which have analogues for many of the interesting and useful properties of the original.     

On 3-regular 4-ordered graphs

A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v₁,…,v_kof G there exists a cycle (respectively, hamiltonian cycle) in G containing these k vertices in the specified order. In 1997 Ng and Schultz introduced these concepts of cycle orderability and posed the question of the existence of 3-regular 4-ordered (hamiltonian) graphs other than K₄ and K_3,3. Ng and Schultz observed that a 3-regular 4-ordered graph on more than 4 vertices is triangle free. We prove that a 3-regular 4-ordered graph G on more than 6 vertices is square free,and we show that the smallest graph that is triangle and square free, namely the Petersen graph, is 4-ordered. Furthermore, we prove that the smallest graph after K₄ and K_3,3 that is 3-regular 4-ordered hamiltonianis the Heawood graph. Finally, we construct an infinite family of 3-regular 4-ordered graphs.     

Unitary graphs and classification of a family of symmetric graphs with complete quotients

A finite graph Γ is called G-symmetric if G is a group of automorphisms of Γ which is transitive on the set of ordered pairs of adjacent vertices of Γ. We study a family of symmetric graphs, called the unitary graphs, whose vertices are flags of the Hermitian unital and whose adjacency relations are determined by certain elements of the underlying finite fields. Such graphs admit the unitary groups as groups of automorphisms, and play a significant role in the classification of a family of symmetric graphs with complete quotients such that an associated incidence structure is a doubly point-transitive linear space. We give this classification in the paper and also investigate combinatorial properties of the unitary graphs.     

Degrees of rational characters of finite groups

A classical theorem of John Thompson on character degrees states that if the degree of any complex irreducible character of a finite group G is 1 or divisible by a prime p, then G has a normal p-complement. In this paper, we consider fields of values of characters and prove some improvements of this result.     

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.     

On p-approximation properties for p-operator spaces

This paper has a two-fold purpose. Let 1<p<∞. We first introduce the p-operator space injective tensor product and study various properties related to this tensor product, including the p-operator space approximation property, for p-operator spaces on Lp-spaces. We then apply these properties to the study of the pseudofunction algebra PFp(G), the pseudomeasure algebra PMp(G), and the Figà-Talamanca-Herz algebra Ap(G) of a locally compact group G. We show that if G is a discrete group, then most of approximation properties for the reduced group C^∗-algebra , the group von Neumann algebra VN(G), and the Fourier algebra A(G) (related to amenability, weak amenability, and approximation property of G) have the natural p-analogues for PFp(G), PMp(G), and Ap(G), respectively. The p-completely bounded multiplier algebra McbAp(G) plays an important role in this work.