Krull’s theory for the double gamma function

The Barnes’ G-function G(x) = 1/Γ₂, satisfies the functional equation logG(x + 1) − logG(x) = logΓ(x). We complement W. Krull’s work in Bemerkungen zur Differenzengleichung g(x + 1) − g(x) = φ(x), Math. Nachrichten 1 (1948), 365-376 with additional results that yield a different characterization of the function G, new expansions and sharp bounds for G on x > 0 in terms of Gamma and Digamma functions, a new expansion for the Gamma function and summation formulae with Polygamma functions.     

The double travelling salesman problem with multiple stacks – Formulation and heuristic solution approaches

This paper introduces the double travelling salesman problem with multiple stacks and presents four different metaheuristic approaches to its solution. The double TSP with multiple stacks is concerned with determining the shortest route performing pickups and deliveries in two separated networks (one for pickups and one for deliveries) using only one container. Repacking is not allowed, instead each item can be positioned in one of several rows in the container, such that each row can be considered a LIFO (last in, first out) stack, but no mutual constraints exist between the rows. Two different neighbourhood structures are developed for the problem and used with each of three local search metaheuristics. Additionally some simpler removal and reinsertion operators are used in a Large neighbourhood search framework. Finally some computational results are given along with lower bounds on the objective value.     

A compound control chart for monitoring and controlling high quality processes

In the present article, we propose a new control chart for monitoring high quality processes. More specifically, we suggest declaring the monitored process out of control, by exploiting a compound rule couching on the number of conforming units observed between the (i − 1)th and the ith nonconforming item and the number of conforming items observed between the (i − 2)th and the ith nonconforming item. Our numerical experimentation demonstrates that the proposed control chart, in most of the cases, exhibits a better (or at least equivalent) performance than its competitors.     

The Linear Ordering Problem with cumulative costs

The optimization problem of finding a permutation of a given set of items that minimizes a certain cost function is naturally modeled by introducing a complete digraph G whose vertices correspond to the items to be sorted. Depending on the cost function to be used, different optimization problems can be defined on G. The most familiar one is the min-cost Hamiltonian path problem (or its closed-path version, the Traveling Salesman Problem), arising when the cost of a given permutation only depends on consecutive node pairs. A more complex situation arises when a given cost has to be paid whenever an item is ranked before another one in the final permutation. In this case, a feasible solution is associated with an acyclic tournament (the transitive closure of an Hamiltonian path), and the resulting problem is known as the Linear Ordering Problem (LOP).     

Co-cliques and star complements in extremal strongly regular graphs

Suppose that the positive integer μ is the eigenvalue of largest multiplicity in an extremal strongly regular graph G. By interlacing, the independence number of G is at most 4μ² + 4μ − 2. Star complements are used to show that if this bound is attained then either (a) μ = 1 and G is the Schläfli graph or (b) μ = 2 and G is the McLaughlin graph.     

A note on the partition dimension of Cartesian product graphs

Let G = (V, E) be a connected graph. The distance between two vertices u, v ∈ V, denoted by d(u, v), is the length of a shortest u − v path in G. The distance between a vertex v ∈ V and a subset P ⊂ V is defined as , and it is denoted by d(v, P). An ordered partition {P₁, P₂, … , P_t} of vertices of a graph G, is a resolving partition of G, if all the distance vectors (d(v, P₁), d(v, P₂), … , d(v, P_t)) are different. The partition dimension of G, denoted by pd(G), is the minimum number of sets in any resolving partition of G. In this article we study the partition dimension of Cartesian product graphs. More precisely, we show that for all pairs of connected graphs G, H, pd(G × H) ? pd(G) + pd(H) and pd(G × H) ? pd(G) + dim(H), where dim(H) denotes the metric dimension of H. Consequently, we show that pd(G × H) ? dim(G) + dim(H) + 1.     

Compactified Picard stacks over the moduli stack of stable curves with marked points

In this paper we give a construction of algebraic (Artin) stacks endowed with a modular map onto the moduli stack of stable curves of genus g with n marked points. The stacks we construct are smooth, irreducible and have dimension 4g−3+n, yielding a geometrically meaningful compactification of the universal Picard stack parametrizing n-pointed smooth curves together with a line bundle.     

Fundamental group and cycle space of dual graphs and applications

In this work, we study the fundamental group of dual graph of a planar graph. Moreover, we show that a planar graph G has no cut vertex if and only if N(Π(D(G))) = N(Π(D(G − v))) − 1 for any v ∈ V(G). Some applications relevant to quantum space time are indicated. Our results generalize and extend results in paper [1] [S.I. Nada, E.H. Hamouda, Fundamental group of dual graphs and applications to quantum space time, Chaos Soliton Fractals 42 (2009) 500-503].     

The reconstruction problem for certain infinite graphs

We are concerned with the notion of the degree-type (D _G ⁱ )_i∈ω of a graphG, whereD _G ⁱ is defined to be the number of vertices inG with degreei. In the first section the following results are proven:

1. IfG is a connected, locally finite, countably infinite graph such that there exists ani so thatD _G ⁱ andD _G ⁱ⁺¹ are both finite and different from 0, thenG is reconstructible.
2. Locally finite, countably infinite graphsG, for which infinitely manyD _G ⁱ are different from 0 but only finitely manyD _G ⁱ are infinite, are reconstructible.

In the second section we give some results about the reconstructibility of certain locally finite countably infinite interval graphs and show that a reconstruction of a planar, infinite graph has to be planar too.     

Finite projective planes admitting a projective linear group PSL (2, q)

Let S be a projective plane, and let G?Aut(S) and PSL(2, q) ? G ? PΓL(2, q) with q > 3. If G acts point-transitively on S, then q = 7 and S is of order 2.     

Allocation of empty containers between multi-ports

Owing to imbalances in international trade activities, shipping companies accumulate a large number of unnecessary empty containers in the import-dominant ports, whilst request a large number of empty containers in export-dominant ports. The logistics challenge to shipping companies is to better manage and control their containers, which consist of company-owned containers and leased containers. The multi-port empty container allocation problem is concerned with the allocation of empty containers from supply ports to demand ports. In this paper, optimal pairs of critical policies, (U, D) for one port, which are importing empty containers up to U when the number of empty containers in the port is less than U, or exporting empty containers down to D when the number of empty containers is larger than D, doing nothing otherwise, are adapted to multi-port case so that decision-makers can make decisions about allocating the right amounts of empty containers to the right ports at the right time. This allocation problem has been formulated and the heuristic methods are designed according to that the average cost using (u, d) policy at one port is convex in u and d. Furthermore, the examples show that, using the heuristic algorithm, the result in the inland line case is quite close to the lower bound, even the distance is not so close in the global line case.     

Physical Sorting of Coded Documents

A large number of coded items such as bank checks are initially mixed randomly. It is desired to sort them into k categories using a sorting device with m pockets (m < k). Several possible objectives are noted, and a new criterion oriented to the average time until categories are sorted out is analyzed. A simple strategy is shown to minimize the average number of sorting passes that elapse until an item is sorted out.     

On the de Rham cohomology of differential and algebraic stacks

We introduce the notion of cofoliation on a stack. A cofoliation is a change of the differentiable structure which amounts to giving a full representable smooth epimorphism. Cofoliations are uniquely determined by their associated Lie algebroids.Cofoliations on stacks arise from flat connections on groupoids. Connections on groupoids generalize connections on gerbes and bundles in a natural way. A flat connection on a groupoid is an integrable distribution of the morphism space compatible with the groupoid structure and complementary to both source and target fibres. A cofoliation of a stack determines the flat groupoid up to étale equivalence.We show how a cofoliation on a stack gives rise to a refinement of the Hodge to De Rham spectral sequence, where the E₁-term consists entirely of vector bundle valued cohomology groups.Our theory works for differentiable, holomorphic and algebraic stacks.     

Isospectral flows that preserve matrix structure

The matrix A = (a_ij) ∈ S_n is said to lie on a strict undirected graph G if a_ij = 0 (i ≠ j) whenever (i, j) is not in E(G). If S is skew-symmetric, the isospectral flow maintains the spectrum of A. We consider isospectral flows that maintain a matrix A(t) on a given graph G. We review known results for a graph G that is a (generalised) path, and construct isospectral flows for a (generalised) ring, and a star, and show how a flow may be constructed for a general graph. The analysis may be applied to the isospectral problem for a lumped-mass finite element model of an undamped vibrating system. In that context, it is important that the flow maintain other properties such as irreducibility or positivity, and we discuss whether they are maintained.     

Graphs for small multiprocessor interconnection networks

Let D be the diameter of a graph G and let λ₁ be the largest eigenvalue of its (0, 1)-adjacency matrix. We give a proof of the fact that there are exactly 69 non-trivial connected graphs with (D + 1)λ₁ ? 9. These 69 graphs all have up to 10 vertices and were recently found to be suitable models for small multiprocessor interconnection networks. We also examine the suitability of integral graphs to model multiprocessor interconnection networks, especially with respect to the load balancing problem. In addition, we classify integral graphs with small values of (D + 1)λ₁ in connection with the load balancing problem for multiprocessor systems.     

Generalized Gaussian quadrature rules over two-dimensional regions with linear sides

This paper presents a generalized Gaussian quadrature method for numerical integration over triangular, parallelogram and quadrilateral elements with linear sides. In order to derive the quadrature rule, a general transformation of the regions, R₁ = {(x, y)∣a ? x ? b, g(x) ? y ? h(x)} and R₂ = {(x, y)∣a ? y ? b, g(y) ? x ? h(y)}, where g(x), h(x), g(y) and h(y) are linear functions, is given from (x, y) space to a square in (ξ, η) space, S: {(ξ, η)∣0 ? ξ ? 1, 0 ? η ? 1}. Generlized Gaussian quadrature nodes and weights introduced by Ma et.al. in 1997 are used in the product formula presented in this paper to evaluate the integral over S, as it is proved to give more accurate results than the classical Gauss Legendre nodes and weights. The method can be used to integrate a wide class of functions including smooth functions and functions with end-point singularities, over any two-dimensional region, bounded by linear sides. The performance of the method is illustrated for different functions over different two-dimensional regions with numerical examples.     

Proof of conjecture involving the second largest signless Laplacian eigenvalue and the index of graphs

Let G = (V, E) be a simple graph. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G) = D(G) + A(G). In [5], Cvetkovi? et al. have given the following conjecture involving the second largest signless Laplacian eigenvalue (q₂) and the index (λ₁) of graph G (see also Aouchiche and Hansen [1]):

     

Convolution on L p -spaces of a locally compact group

We have recently shown that, for 2 < p < ∞, a locally compact group G is compact if and only if the convolution multiplication f * g exists for all f, g ∈ L ^p (G). Here, we study the existence of f * g for all f, g ∈ L ^p (G) in the case where 0 < p ≤ 2. Also, for 0 < p < ∞, we offer some necessary and sufficient conditions for L ^p (G) * L ^p (G) to be contained in certain function spaces on G.