Zeros of linear combinations of Laguerre polynomials from different sequences

We study interlacing properties of the zeros of two types of linear combinations of Laguerre polynomials with different parameters, namely and . Proofs and numerical counterexamples are given in situations where the zeros of R_n, and S_n, respectively, interlace (or do not in general) with the zeros of , , k=n or n−1. The results we prove hold for continuous, as well as integral, shifts of the parameter α.     

Distance irredundance and connected domination numbers of a graph

Let k be a positive integer and G be a connected graph. This paper considers the relations among four graph theoretical parameters: the k-domination number γ_k(G), the connected k-domination number ; the k-independent domination number and the k-irredundance number ir_k(G). The authors prove that if an ir_k-set X is a k-independent set of G, then , and that for k?2, if ir_k(G)=1, if ir_k(G) is odd, and if ir_k(G) is even, which generalize some known results.     

Monoids with sub-log-exponential free spectra

A classic result from the 1960s states that the asymptotic growth of the free spectrum of a finite group is sub-log-exponential if and only if is nilpotent. Thus a monoid is sub-log-exponential implies , the pseudovariety of semigroups with nilpotent subgroups. Unfortunately, little more is known about the boundary between the sub-log-exponential and log-exponential monoids.The pseudovariety consists of those finite semigroups satisfying (x^ωy^ω)^ω(y^ωx^ω)^ω(x^ωy^ω)^ω≈(x^ωy^ω)^ω. Here it is shown that a monoid is sub-log-exponential implies . A quick application: a regular sub-log-exponential monoid is orthodox. It is conjectured that a finite monoid is sub-log-exponential if and only if it is , the finite monoids in having nilpotent subgroups. The forward direction of the conjecture is proved; moreover, the conjecture is proved for when is completely (0)-simple. In particular, the six-element Brandt monoid (the Perkins semigroup) is sub-log-exponential.     

Cospectral graphs and the generalized adjacency matrix

Let J be the all-ones matrix, and let A denote the adjacency matrix of a graph. An old result of Johnson and Newman states that if two graphs are cospectral with respect to yJ − A for two distinct values of y, then they are cospectral for all y. Here we will focus on graphs cospectral with respect to yJ − A for exactly one value of y. We call such graphs -cospectral. It follows that is a rational number, and we prove existence of a pair of -cospectral graphs for every rational . In addition, we generate by computer all -cospectral pairs on at most nine vertices. Recently, Chesnokov and the second author constructed pairs of -cospectral graphs for all rational , where one graph is regular and the other one is not. This phenomenon is only possible for the mentioned values of , and by computer we find all such pairs of -cospectral graphs on at most eleven vertices.     

Total domination and total domination subdivision number of a graph and its complement

A set S of vertices of a graph G=(V,E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination numberγ_t(G) is the minimum cardinality of a total dominating set of G. The total domination subdivision numbersd_γt(G) is the minimum number of edges that must be subdivided in order to increase the total domination number. We consider graphs of order n?4, minimum degree δ and maximum degree Δ. We prove that if each component of G and has order at least 3 and , then and if each component of G and has order at least 2 and at least one component of G and has order at least 3, then . We also give a result on stronger than a conjecture by Harary and Haynes.     

Some relations between rank of a graph and its complement

Let G be a graph of order n and rank(G) denotes the rank of its adjacency matrix. Clearly, . In this paper we characterize all graphs G such that or n + 2. Also for every integer n ? 5 and any k, 0 ? k ? n, we construct a graph G of order n, such that .     

The Laplacian spectral radius of some bipartite graphs

In this paper, we study the largest Laplacian spectral radius of the bipartite graphs with n vertices and k cut edges and the bicyclic bipartite graphs, respectively. Identifying the center of a star K_1,k and one vertex of degree n of K_m,n, we denote by the resulting graph. We show that the graph (1?k?n-4) is the unique graph with the largest Laplacian spectral radius among the bipartite graphs with n vertices and k cut edges, and (n?7) is the unique graph with the largest Laplacian spectral radius among all the bicyclic bipartite graphs.     

A note on the kth eigenvalue of trees

In [Linear Algebra Appl. 149 (1991) 19-34], Shao proved that for a tree T on n vertices, the kth eigenvalue

     

Density estimation by the penalized combinatorial method

Let f be an unknown multivariate density belonging to a prespecified parametric class of densities, , where k is unknown, but for all k and each has finite Vapnik-Chervonenkis dimension. Given an i.i.d. sample of size n drawn from f, we show that it is possible to select automatically, and without extra restrictions on f, an estimate with the property that . Our method is inspired by the combinatorial tools developed in Devroye and Lugosi (Combinatorial Methods in Density Estimation, Springer, New York, 2001) and it includes a wide range of density models, such as mixture models or exponential families.     

Sufficient conditions for the existence of at least n or exactly n limit cycles for the Liénard differential systems

In this paper we study the limit cycles of the Liénard differential system of the form , or its equivalent system , . We provide sufficient conditions in order that the system exhibits at least n or exactly n limit cycles.     

On limit points of Laplacian spectral radii of graphs

The study of limit points of eigenvalues of adjacency matrices of graphs was initiated by Hoffman [A.J. Hoffman, On limit points of spectral radii of non-negative symmetric integral matrices, in: Y. Alavi et al. (Eds.), Lecture Notes Math., vol. 303, Springer-Verlag, Berlin, Heidelberg, New York, 1972, pp. 165-172]. There he described all of the limit points of the largest eigenvalue of adjacency matrices of graphs that are no more than . In this paper, we investigate limit points of Laplacian spectral radii of graphs. The result is obtained: Let , β₀=1 and be the largest positive root of

     

r-Strong edge colorings of graphs

Let G be a graph and for any natural number r, denotes the minimum number of colors required for a proper edge coloring of G in which no two vertices with distance at most r are incident to edges colored with the same set of colors. In [Z. Zhang, L. Liu, J. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15 (2002) 623-626] it has been proved that for any tree T with at least three vertices, . Here we generalize this result and show that . Moreover, we show that if for any two vertices u and v with maximum degree d(u,v)?3, then . Also for any tree T with Δ(T)?3 we prove that . Finally, it is shown that for any graph G with no isolated edges, .     

Deduction of L. Hörmander's extension of Ásgeirsson's mean value theorem

L. Hörmander's extension of Ásgeirsson's mean value theorem states that if u is a solution of the inhomogeneous ultrahyperbolic equation (Δ_x−Δ_y)u=f, , , then

     

Cyclic bandwidth with an edge added

B_c(G) denotes the cyclic bandwidth of graph G. In this paper, we obtain the maximum cyclic bandwidth of graphs of order p with adding an edge as follows:

     

Large matchings from eigenvalues

We find lower bounds on the difference between the spectral radius λ₁ and the average degree of an irregular graph G of order n and size e. In particular, we show that, if n ? 4, then

     

On a relation between certain cohomological invariants

Let G be a group, the supremum of the projective lengths of the injective ZG-modules and the supremum of the injective lengths of the projective ZG-modules. The invariants and were studied in [T.V. Gedrich, K.W. Gruenberg, Complete cohomological functors on groups, Topology Appl. 25 (1987) 203-223] in connection with the existence of complete cohomological functors. If is finite then [T.V. Gedrich, K.W. Gruenberg, Complete cohomological functors on groups, Topology Appl. 25 (1987) 203-223] and , where is the generalized cohomological dimension of G [B.M. Ikenaga, Homological dimension and Farrell cohomology, J. Algebra 87 (1984) 422-457]. Note that if G is of finite virtual cohomological dimension. It has been conjectured in [O. Talelli, On groups of type Φ, Arch. Math. 89 (1) (2007) 24-32] that if is finite then G admits a finite dimensional model for , the classifying space for proper actions.We conjecture that for any group G and we prove the conjecture for duality groups, fundamental groups of graphs of finite groups and fundamental groups of certain finite graphs of groups of type .     

Toughness, degrees and 2-factors

In this paper we generalize a Theorem of Jung which shows that 1-tough graphs with are hamiltonian. Our generalization shows that these graphs contain a wide variety of 2-factors. In fact, these graphs contain not only 2-factors having just one cycle (the hamiltonian case) but 2-factors with k cycles, for any k such that .     

Graph colourings and solutions of systems of equations over finite fields

A congruence (p is a prime) is said to be strong homogeneous if it has the form

     

Cap pairings and spectral sequences

Let be a small category. For an -diagram X and -diagrams A and B of pointed spaces, each pairing X∧A→B satisfying the projection formula induces a pairing . In this note we show that there is an induced pairing of homotopy spectral sequences compatible with abutments in the sense that