On the multi-phase M/G/1 queueing system with random feedback

In this paper we consider an M/G/1 queue with k phases of heterogeneous services and random feedback, where the arrival is Poisson and service times has general distribution. After the completion of the i-th phase, with probability θ _i the (i + 1)-th phase starts, with probability p _i the customer feedback to the tail of the queue and with probability 1 − θ _i − p _i  = q _i departs the system if service be successful, for i = 1, 2 , . . . , k. Finally in kth phase with probability p _k feedback to the tail of the queue and with probability 1 − p _k departs the system. We derive the steady-state equations, and PGF’s of the system is obtained. By using them the mean queue size at departure epoch is obtained.     

Transient solution of a non-empty chemical queueing system

In this paper, we illustrate that a power series technique can be used to derive explicit expressions for the transient state distribution of a queueing problem having “chemical” rules with an arbitrary number of customers present initially in the system. Based on generating function and Laplace techniques Conolly et al. (in Math Sci 22:83–91, 1997) have obtained the distributions for a non-empty chemical queue. Their solution enables us only to recover the idle probability of the system in explicit form. Here, we extend not only the model of Conolly et al. but also get a new and simple solution for this model. The derived formula for the transient state is free of Bessel function or any integral forms. The transient solution of the standard M/M/1/∞ queue with λ = μ is a special case of our result. Furthermore, the probability density function of the virtual waiting time in a chemical queue is studied. Finally, the theory is underpinned by numerical results.      

Stochastic nonlinear Perron–Frobenius theorem

We establish a stochastic nonlinear analogue of the Perron–Frobenius theorem on eigenvalues and eigenvectors of positive matrices. The result is formulated in terms of an automorphism T of a probability space and a random transformation D of the non-negative cone of an n-dimensional Euclidean space. Under assumptions of monotonicity and homogeneity of D, we prove the existence of scalar and vector measurable functions α > 0 and x > 0 satisfying the equation αTx = D(x) almost surely. We apply the result obtained to the analysis of a class of random dynamical systems arising in mathematical economics and finance (von Neumann–Gale dynamical systems).     

Binary consecutive covering arrays

A k × n array with entries from a q-letter alphabet is called a t-covering array if each t × n submatrix contains amongst its columns each one of the q ^t different words of length t that can be produced by the q letters. In the present article we use a probabilistic approach based on an appropriate Markov chain embedding technique, to study a t-covering problem where, instead of looking at all possible t × n submatrices, we consider only submatrices of dimension t × n with its rows being consecutive rows of the original k × n array. Moreover, an exact formula is established for the probability distribution function of the random variable, which enumerates the number of deficient submatrices (i.e., submatrices with at least one missing word, amongst their columns), in the case of a k × n binary matrix (q = 2) obtained by realizing kn Bernoulli variables.     

Explicit Construction of RIP Matrices Is Ramsey-Hard

Matrices Φ ∈ ℝ^{n × p} satisfying the restricted isometry property (RIP) are an important ingredient of the compressive sensing methods. While it is known that random matrices satisfy the RIP with high probability even for n = log^O(1)p , the explicit deteministic construction of such matrices defied the repeated efforts, and most of the known approaches hit the so-called sparsity bottleneck. The notable exception is the work by Bourgain et al. constructing an n × p RIP matrix with sparsity s = Θ(n^{1/2 + ϵ}) , but in the regime n = Ω(p^{1 − δ}) . In this short note we resolve this open question by showing that an explicit construction of a matrix satisfying the RIP in the regime n = O(log²p) and s = Θ(n^1/2) implies an explicit construction of a three-colored Ramsey graph on p nodes with clique sizes bounded by O(log²p) — a question in the field of extremal combinatorics that has been open for decades. © 2019 Wiley Periodicals, Inc.     

Twin Solutions to Singular Dirichlet Problems

The existence of two nonnegative solutions to Dirichlet second order boundary value problems is established in this paper. Our nonlinearity may be singular at y = 0, t = 0, and/or t = 1.     

Non-classical Godeaux surfaces

A non-classical Godeaux surface is a minimal surface of general type with χ = K ² = 1 but with h ⁰¹ ≠ 0. We prove that such surfaces fulfill h ⁰¹ = 1 and they can exist only over fields of positive characteristic at most 5. Like non-classical Enriques surfaces they fall into two classes: the singular and the supersingular ones. We give a complete classification in characteristic 5 and compute their Hodge-, Hodge–Witt- and crystalline cohomology (including torsion). Finally, we give an example of a supersingular Godeaux surface in characteristic 5.     

Some Physics Questions in Hyperbolic Complex Space

In hyperbolic complex space, the Clifford algebra is isomorphic to that of a corresponding Minkowski geometry. We define the hyperbolic imaginary unit j (j² = 1, j ≠   ±  1, j*  =   − j) to generate a class of Clifford algebras. We can introduce a class of non-Euclidean spaces and discuss the general form of 4-dimensional Lorentz transformation, and related special relativistic physics.     

Exceptional cases of Terai’s conjecture on Diophantine equations

Let a, b, c be relatively prime positive integers such that a ^p  + b ^q  = c ^r for fixed integers p, q, r ≥ 2. Terai conjectured that the equation a ^x  + b ^y  = c ^z in positive integers has only the solution (x, y, z) = (p, q, r) except for specific cases. In this paper, we consider the case q = r = 2 and give some results related to exceptional cases.     

<Emphasis Type="Italic">k</Emphasis>–Pyramidal One–Factorizations

We consider one–factorizations of complete graphs which possess an automorphism group fixing k ≥ 0 vertices and acting regularly (i.e., sharply transitively) on the others. Since the cases k = 0 and k = 1 are well known in literature, we study the case k≥ 2 in some detail. We prove that both k and the order of the group are even and the group necessarily contains k − 1 involutions. Constructions for some classes of groups are given. In particular we extend the result of [7]: let G be an abelian group of even order and with k − 1 involutions, a one–factorization of a complete graph admitting G as an automorphism group fixing k vertices and acting regularly on the others can be constructed.     

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

Let r and s be nonnegative integers, and let G be a graph of order at least 3r + 4s. In Bialostocki et al. (Discrete Math 308:5886–5890, 2008), conjectured that if the minimum degree of G is at least 2r + 3s, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles, and they showed that the conjecture is true for r = 0, s = 2 and for s = 1. In this paper, we settle this conjecture completely by proving the following stronger statement; if the minimum degree sum of two nonadjacent vertices is at least 4r + 6s−1, then G contains a collection of r + s vertex-disjoint cycles such that s of them are chorded cycles.     

Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence

An ordered tree with specified degree sequence and n internal nodes has a_i nodes of degree i, where a₀ = 1 + ∑_i = 1(i − 1)a_i and n = ∑_i = 0a_i. This paper presents the first loopless algorithm for generating all ordered trees with specified degree sequence. It uses a new version of the algorithm for generating multiset permutations. When a_k = N, a₀ = (k − 1)N + 1, and all other a_i's are 0, all N node k-ary trees are generated.     

Analysis of Carry Propagation in Addition: An Elementary Approach

Our goal in this paper is to analyze carry propagation in addition using only elementary methods (that is, those not involving residues, contour integration, or methods of complex analysis). Our results concern the length of the longest carry chain when two independent uniformly distributed n-bit numbers are added. First, we show using just first- and second-moment arguments that the expected length C_n of the longest carry chain satisfies C_n = log₂n + O(1). Second, we use a sieve (inclusion–exclusion) argument to give an exact formula for C_n. Third, we give an elementary derivation of an asymptotic formula due to Knuth, C_n = log₂n + Φ(log₂ n) + O((logn)⁴/n), where Φ(ν) is a bounded periodic function of ν, with period 1, for which we give both a simple integral expression and a Fourier series. Fourth, we give an analogous asymptotic formula for the variance V_n of the length of the longest carry chain: V_n = Ψ(log₂ n) + O((logn)⁵/n), where Ψ(ν) is another bounded periodic function of ν, with period 1. Our approach can be adapted to addition with the “end-around” carry that occurs in the sign-magnitude and 1s-complement representations. Finally, our approach can be adapted to give elementary derivations of some asymptotic formulas arising in connection with radix-exchange sorting and collision-resolution algorithms, which have previously been derived using contour integration and residues.     

On the number of Galois points for a plane curve in positive characteristic,III

We consider the following problem: For a smooth plane curve C of degree d ≥ 4 in characteristic p > 0, determine the number δ(C) of inner Galois points with respect to C. This problem seems to be open in the case where d ≡ 1 mod p and C is not a Fermat curve F(p ^e  + 1) of degree p ^e  + 1. When p ≠ 2, we completely determine δ(C). If p = 2 (and C is in the open case), then we prove that δ(C) = 0, 1 or d and δ(C) = d only if d−1 is a power of 2, and give an example with δ(C) = d when d = 5. As an application, we characterize a smooth plane curve having both inner and outer Galois points. On the other hand, for Klein quartic curve with suitable coordinates in characteristic two, we prove that the set of outer Galois points coincides with the one of \mathbbF₂{\mathbb{F}_{2}} -rational points in \mathbbP²{\mathbb{P}^{2}}.     

Solutions to Operator Equations on Hilbert C*-Modules II

In this paper, we study the solvability of the operator equations A*X + X*A = C and A*XB + B*X*A = C for general adjointable operators on Hilbert C*-modules whose ranges may not be closed. Based on these results we discuss the solution to the operator equation AXB = C, and obtain some necessary and sufficient conditions for the existence of a real positive solution, of a solution X with B*(X* + X)B ≥ 0, and of a solution X with B*XB ≥ 0. Furthermore in the special case that R(B) í [`(R(A*))]{R(B)\subseteq\overline{R(A*)}} we obtain a necessary and sufficient condition for the existence of a positive solution to the equation AXB = C. The above results generalize some recent results concerning the equations for operators with closed ranges.     

Quasirecognition by prime graph of F4(q) where q?=?2n?>?2

The prime graph of a finite group G is denoted by Γ(G). In this paper as the main result, we show that if G is a finite group such that Γ(G) = Γ(F ₄(q)), where q = 2 ⁿ  > 2, then G has a unique nonabelian composition factor isomorphic to F ₄(q). We also show that if G is a finite group satisfying |G| = |F ₄(q)| and Γ(G) = Γ(F ₄(q)), where q = 2 ⁿ  > 2, then G @ F₄(q){G \cong F_4(q)}. As a consequence of our result we give a new proof for a conjecture of Shi and Bi for F ₄(q) where q = 2 ⁿ  > 2.     

Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph

Splitting off a pair su, sv of edges in a graph G means the operation that deletes su and sv and adds a new edge uv. Given a graph G = (V + s, E) which is k-edge-connected (k ≥ 2) between vertices of V and a specified subset R  V, first we consider the problem of finding a longest possible sequence of disjoint pairs of edges sx, sy, (x ,y  R) which can be split off preserving k-edge-connectivity in V. If R = V and d(s) is even then a well-known theorem of Lovász asserts that a complete R-splitting exists, that is, all the edges connecting s to R can be split off in pairs. This is not the case in general. We characterize the graphs possessing a complete R-splitting and give a formula for the length of a longest R-splitting sequence. Motivated by the connection between splitting off results and connectivity augmentation problems we also investigate the following problem that we call the split completion problem: given G and R as above, find a smallest set F of new edges incident to s such that G′ = (V + s, E + F) has a complete R-splitting. We give a min-max formula for F as well as a polynomial algorithm to find a smallest F. As a corollary we show a polynomial algorithm which finds a solution of size at most k/2 + 1 more than the optimum for the following augmentation problem, raised in [[2]]: given a graph H = (V, E), an integer k ≥ 2, and a set R  V, find a smallest set F′ of new edges for which H′ = (V, E + F′) is k-edge-connected and no edge of F′ crosses R.     

On zero-dimensional points curvature in the dynamics of Cantorian-fractal spacetime setting and high energy particle physics

The mathematics needed for establishing the concept of point-like curvature in fractal-Cantorian spacetime are introduced. The corresponding energy expressions are derived. For a Cantorian spacetime manifold modeled by a fuzzy K3 Kähler it is found that the total curvature corresponding to a Hausdorff dimension 4 + ³ = 4.236067977 is K = 26 + k = 26.18033989. The corresponding internal energy is shown to be given by the dimension of Munroe’s quasi exceptional Lie symmetry group E12, namely 685.4101968. It should be noted that with K found explicitly and as a function of the resolution, writing the equivalent Lagrangian of E-infinity becomes trivial and in addition the dynamics of the theory is manifested in the corresponding Wyle golden ring scaling.     

Sufficient Conditions for the Oscillation of Linear Delay Difference Equations with Oscillating Coefficients

In this paper sufficient conditions for the oscillation of all solutions of the delay difference equation x_n + 1 − x_n + p_nx_n − k = 0, n = 0, 1, 2,…, are established, where the coefficient p_n itself may be allowed to be oscillatory. We also give an example to demonstrate the advantage of our results.