A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares

We provide two new constructions for pairs of mutually orthogonal symmetric hamiltonian double Latin squares. The first is a tripling construction, and the second is derived from known constructions of hamilton cycle decompositions of when is prime.     

A fitted numerical method for parabolic turning point singularly perturbed problems with an interior layer

The objective of this paper is to construct and analyze a fitted operator finite difference method (FOFDM) for the family of time‐dependent singularly perturbed parabolic convection–diffusion problems. The solution to the problems we consider exhibits an interior layer due to the presence of a turning point. We first establish sharp bounds on the solution and its derivatives. Then, we discretize the time variable using the classical Euler method. This results in a system of singularly perturbed interior layer two‐point boundary value problems. We propose a FOFDM to solve the system above. Through a rigorous error analysis, we show that the scheme is uniformly convergent of order one with respect to both time and space variables. Moreover, we apply Richardson extrapolation to enhance the accuracy and the order of convergence of the proposed scheme. Numerical investigations are carried out to demonstrate the efficacy and robustness of the scheme.     

The rigid relation principle,a new weak choice principle

The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well‐orders are rigid, but we prove that it is neither equivalent to the axiom of choice nor provable in Zermelo‐Fraenkel set theory without the axiom of choice. Thus, it is a new weak choice principle. Nevertheless, the restriction of the principle to sets of reals (among other general instances) is provable without the axiom of choice.     

Ship-pack optimization in a two-echelon distribution system

In large distribution systems, distribution centers (DC) deliver some merchandize to their retail stores in size-specific packages, also called ship-packs. These ship-packs include cases (e.g., cartons containing 24 or 48 units), inners (packages of 6 or 8 units) or eaches (individual units). For each Stock Keeping Unit (SKU), a retailer can decide which of these ship-pack options to use when replenishing its retail stores. Working with a major US retailer, we have developed a cost model that balances DC handling costs, store handling costs and inventory-related costs at both the DC and the stores, and therefore can help to determine the optimum warehouse ship-pack for each SKU. We implement our model for a sample of 529 SKUs, and show that by changing ship-pack size for about 30 SKUs, the retailer can reduce its total cost by 0.3% - 0.4%. Interestingly, we find that most of the cost savings occurs at the DC level.     

On the Independent Domination Number of Regular Graphs

A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we consider questions about independent domination in regular graphs.     

Lagrangian and Eulerian models for simulating turbulent dispersion and coalescence of droplets within a spray

Lagrangian and Eulerian modelling approaches are compared for simulating turbulent dispersion and coalescence of droplets within a spray. Both models predict similar droplet dispersion rates and shifts in droplet size distribution due to coalescence within the spray, over a wide range of droplet and gas flows, and for sprays with different droplet-size distributions at the nozzle exit. The computer time required for simulating coalescence within a steady axisymmetric spray is of a similar order of magnitude regardless of which formulation, Eulerian or Lagrangian, is adopted. However, the Lagrangian formulation is more practical in terms of the range of applicability and ease of implementation.     

Semi-crossed products of C1-algebras

Given a C¹-algebra $\text{U}$ and endomorphim α, there is an associated nonselfadjoint operator algebra $\text{Z}$⁺ X_α$\text{U}$, called the semi-crossed product of $\text{U}$ with α. If α is an automorphim, $\text{Z}$⁺ X_α$\text{U}$ can be identified with a subalgebra of the C¹-crossed product $\text{Z}$⁺ X_α$\text{U}$. If $\text{U}$ is commutative and α is an automorphim satisfying certain conditions, $\text{Z}$⁺ X_α$\text{U}$ is an operator algebra of the type studied by Arveson and Josephson. Suppose S is a locally compact Hausdorff space, φ: S → S is a continuous and proper map, and α is the endomorphim of U=C₀(S) given by α(?) = ? ō φ. Necessary and sufficient conditions on the map φ are given to insure that the semi-crossed product Z⁺X_αC₀(S) is (i) semiprime; (ii) semisimple; (ii) strongly semisimple.     

Desingularization of a Steady Vortex Pair in the Lake Equation

Potential Analysis - We construct a family of steady solutions of the lake model perturbed by some small Coriolis force, that converge to a singular vortex pair. The desingularized solutions are...     

Lexicographic TAF Algebras

Lexicographic TAF algebras constitute a class of triangular AF
algebras which are determined by a countable ordered set , a dimension function, and a third parameter. While some of the important examples of TAF algebras belong to the class, most algebras in this class have not been studied. The semigroupoid of the algebra, the lattice of invariant projections, the Jacobson radical, and for some cases the automorphism group are computed. Necessary and sufficient conditions for analyticity are given. The results often involve the order properties of the set .