Critical Exponents of Quasilinear Parabolic Equations

In this paper we study the critical exponents of the Cauchy problem in Rⁿ of the quasilinear singular parabolic equations: u_t = div(|∇u|^m − 1∇u) + t^s|x|^σu^p, with non-negative initial data. Here s ≥ 0, (n − 1)/(n + 1) < m < 1, p > 1 and σ > n(1 − m) − (1 + m + 2s). We prove that p_c ≡ m + (1 + m + 2s + σ)/n > 1 is the critical exponent. That is, if 1 < p ≤ p_c then every non-trivial solution blows up in finite time, but for p > p_c, a small positive global solution exists.     

Inequalities between ∥f(A + B)∥ and ∥f(A) + f(B)∥

The conjecture posed by Aujla and Silva [J.S. Aujla, F.C. Silva, Weak majorization inequalities and convex functions, Linear Algebra Appl. 369 (2003) 217-233] is proved. It is shown that for any m-tuple of positive-semidefinite n × n complex matrices A_j and for any non-negative convex function f on [0, ∞) with f(0) = 0 the inequality ?f(A₁) + f(A₂) + ? + f(A_m)? ? ? f(A₁ + A₂ + ? + A_m)? holds for any unitarily invariant norm ? · ?. It is also proved that ?f(A₁) + f(A₂) + ? + f(A_m)? ? f(?A₁ + A₂ + ? + A_m?), where f is a non-negative concave function on [0, ∞) and ? · ? is normalized.     

Recursive algorithm for the reliability of a connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system

The connected-(1, 2)-or-(2, 1)-out-of-(m, n):F lattice system is included by the connected-X-out-of-(m, n):F lattice system defined by Boehme et al. [Boehme, T.K., Kossow, A., Preuss, W., 1992. A generalization of consecutive-k-out-of-n:F system. IEEE Transactions on Reliability 41, 451–457]. This system fails if and only if at least one subset of connected failed components occurs which includes at least a (1, 2)-matrix (that is, a row and two columns) or a (2, 1)-matrix(that is, two rows and a column) of failed components. This system is applied to two-dimensional network problems with adjacent constraints, and various systems, for example, a supervision system, etc.     

Soliton solutions for (2 + 1)-dimensional and (3 + 1)-dimensional K(m, n) equations

We consider the nonlinear dispersive K(m,n) equation with the generalized evolution term and derive analytical expressions for some conserved quantities. By using a solitary wave ansatz in the form of sech^p function, we obtain exact bright soliton solutions for (2 + 1)-dimensional and (3 + 1)-dimensional K(m,n) equations with the generalized evolution terms. The results are then generalized to multi-dimensional K(m,n) equations in the presence of the generalized evolution term. An extended form of the K(m,n) equation with perturbation term is investigated. Exact bright soliton solution for the proposed K(m,n) equation having higher-order nonlinear term is determined. The physical parameters in the soliton solutions are obtained as function of the dependent model coefficients.     

Probability of unique integer solution to a system of linear equations

We consider a system of m linear equations in n variables Ax = d and give necessary and sufficient conditions for the existence of a unique solution to the system that is integer: x ∈ {−1, 1}ⁿ. We achieve this by reformulating the problem as a linear program and deriving necessary and sufficient conditions for the integer solution to be the unique primal optimal solution. We show that as long as m is larger than n/2, then the linear programming reformulation succeeds for most instances, but if m is less than n/2, the reformulation fails on most instances. We also demonstrate that these predictions match the empirical performance of the linear programming formulation to very high accuracy.     

Enumerating K best paths in length order in DAGs

We address the problem of finding the K best paths connecting a given pair of nodes in a directed acyclic graph (DAG) with arbitrary lengths. One of the main results in this paper is the proof that a tree representing the kth shortest path is obtained by an arc exchange in one of the previous (k − 1) trees (each of which contains a previous best path). An O(m + K(n + log K)) time and O(K + m) space algorithm is designed to explicitly determine the K shortest paths in a DAG with n nodes and m arcs. The algorithm runs in O(m + Kn) time using O(K + m) space in DAGs with integer length arcs. Empirical results confirming the superior performance of the algorithm to others found in the literature for randomly generated graphs are reported.     

Matrix semigroup homomorphisms into higher dimensions

We study non-degenerate irreducible homomorphisms from the multiplicative semigroup of all n-by-n matrices over an algebraically closed field of characteristic zero to the semigroup of m-by-m matrices over the same field. We prove that every non-degenerate homomorphism from the multiplicative semigroup of all n-by-n matrices to the semigroup of (n + 1)-by-(n + 1) matrices when n ? 3 is reducible and that every non-degenerate homomorphism from the multiplicative semigroup of all 3-by-3 matrices to the semigroup of 5-by-5 matrices is reducible.     

Reliability of a consecutive (r, s)-out-of-(m, n):F lattice system with conditions on the number of failed components in the system

A consecutive(r, s)-out-of-(m, n):F lattice system which is defined as a two-dimensional version of a consecutive k-out-of-n:F system is used as a reliability evaluation model for a sensor system, an X-ray diagnostic system, a pattern search system, etc. This system consists of m × n components arranged like an (m, n) matrix and fails iff the system has an (r, s) submatrix that contains all failed components. In this paper we deal a combined model of a k-out-of-mn:F and a consecutive (r, s)-out-of-(m, n):F lattice system. Namely, the system has one more condition of system down, that is the total number of failed components, in addition to that of a consecutive (r, s)-out-of-(m, n):F lattice system. We present a method to obtain reliability of the system. The proposed method obtains the reliability by using a combinatorial equation that does not depend on the system size. Some numerical examples are presented to show the relationship between component reliability and system reliability.     

Approximate methods for convex minimization problems with series–parallel structure

Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The problem has a series–parallel structure, with the variables divided serially into n disjoint subsets, whose elements are considered in parallel. This special structure is exploited in two algorithms proposed here for the approximate solution of the problem. The first algorithm solves at most min{m, ν − n + 1} subproblems; each subproblem has exactly one equality constraint and at most n variables. The second algorithm solves a dynamically generated sequence of subproblems; each subproblem has at most ν − n + 1 equality constraints, where ν is the total number of variables. To solve these subproblems both algorithms use the authors’ Projected Newton Bracketing method for linearly constrained convex minimization, in conjunction with the steepest descent method. We report the results of numerical experiments for both algorithms.     

The domination numbers of cylindrical grid graphs

Let γ(P_m □ C_n) denote the domination number of the cylindrical grid graph formed by the Cartesian product of the graphs P_m, the path of length m, m ? 2 and the graph C_n, the cycle of length n, n ? 3. In this paper, methods to find the domination numbers of graphs of the form P_m □ C_n with n ? 3 and m = 2, 3 and 4 are proposed. Moreover, bounds on domination numbers of the graphs P₅ □ C_n, n ? 3 are found. The methods that are used to prove that results readily lead to algorithms for finding minimum dominating sets of the above mentioned graphs.     

Properties of non-simultaneous blow-up in heat equations coupled via different localized sources

This paper deals with u_t = Δu + u^m(x, t)e^pv(0,t), v_t = Δv + u^q(0, t)e^nv(x,t), subject to homogeneous Dirichlet boundary conditions. The complete classification on non-simultaneous and simultaneous blow-up is obtained by four sufficient and necessary conditions. It is interesting that, in some exponent region, large initial data u₀(v₀) leads to the blow-up of u(v), and in some betweenness, simultaneous blow-up occurs. For all of the nonnegative exponents, we find that u(v) blows up only at a single point if m > 1(n > 0), while u(v) blows up everywhere for 0 ? m ? 1 (n = 0). Moreover, blow-up rates are considered for both non-simultaneous and simultaneous blow-up solutions.     

On extremal matrices of second largest exponent by Boolean rank

Let b = b(A) be the Boolean rank of an n × n primitive Boolean matrix A and exp(A) be the exponent of A. Then exp(A) ? (b − 1)² + 2, and the matrices for which equality occurs have been determined in [D.A. Gregory, S.J. Kirkland, N.J. Pullman, A bound on the exponent of a primitive matrix using Boolean rank, Linear Algebra Appl. 217 (1995) 101-116]. In this paper, we show that for each 3 ? b ? n − 1, there are n × n primitive Boolean matrices A with b(A) = b such that exp(A) = (b − 1)² + 1, and we explicitly describe all such matrices.     

On the nonnegative rank of Euclidean distance matrices

The Euclidean distance matrix for n distinct points in R^r is generically of rank r + 2. It is shown in this paper via a geometric argument that its nonnegative rank for the case r = 1 is generically n.     

The generating function of a family of the sequences in terms of the continuant

Let a₀, a₁, … , a_r−1 be positive numbers and define a sequence {q_m}, with initial conditions q₀ = 0 and q₁ = 1, and for all m ? 2, q_m = a_tq_m−1 + q_m−2 where m ≡ t(mod r). For r = 2, the author called the sequence {q_m} as the generalized Fibonacci sequences and studied it in [1]. But, it remains open to find a closed form of the generating function for general {q_m}. In this paper, we solve this open problem, that is, we find a closed form of the generating function for {q_m}in terms of the continuant.     

Construction of nonnegative symmetric matrices with given spectrum

Let σ = (λ₁, … , λ_n) be the spectrum of a nonnegative symmetric matrix A with the Perron eigenvalue λ₁, a diagonal entry c and let τ = (μ₁, … , μ_m) be the spectrum of a nonnegative symmetric matrix B with the Perron eigenvalue μ₁. We show how to construct a nonnegative symmetric matrix C with the spectrum

(λ₁+max{0,μ₁-c},λ₂,…,λ_n,μ₂,…,μ_m).     

Meromorphic Functions That Share Fixed-Points

In this paper, we prove the following result: Let f(z) and g(z) be two nonconstant meromorphic(entire) functions, n ≥ 11(n ≥ 6) a positive integer. If fⁿ(z)f′(z) and gⁿ(z)g′(z) have the same fixed-points, then either f(z) = c₁e^cz2, g(z) = c₂e^− cz2, where c₁, c₂, and c are three constants satisfying 4(c₁c₂)^n + 1c² = −1, or f(z) ≡ tg(z) for a constant t such that t^n + 1 = 1.     

Spectral radius of graphs with given matching number

In this paper, we show that of all graphs of order n with matching number β, the graphs with maximal spectral radius are K_n if n = 2β or 2β + 1; if 2β + 2 ? n < 3β + 2; or if n = 3β + 2; if n > 3β + 2, where is the empty graph on t vertices.     

A two-unit general parallel system with (n − 2) cold standbys—Analytic and simulation approach

A parallel (2, n − 2)-system is investigated here where two units start their operation simultaneously and any one of them is replaced instantaneously upon its failure by one of the (n − 2) cold standbys. We assume availability of n non-identical, non-repairable units for replacement or support. The system reliability is evaluated by recursive relations with unit-lifetimes T_i (i = 1, … , n) that have a general joint distribution function F(t). On the basis of the derived expression, simulation techniques have been developed for the evaluation of the system reliability and the mean time to failure, useful when dealing with large systems or correlated unit-lifetimes and less mathematically manageable distributions. Simulation results are presented for various lifetime distributions and comparisons are made with derived analytic results for some special distributions and moderate values of n.