Semigroups strongly Morita equivalent to monoids

Periodica Mathematica Hungarica - We consider semigroups strongly Morita equivalent to a fixed monoid. We prove that such semigroups are precisely the enlargements of that monoid. We also show that...     

Insensitive,maximum stable allocations converge to proportional fairness

We describe a queuing model where service is allocated as a function of queue sizes. We consider allocations policies that are insensitive to service requirements and have a maximal stability region. We take a limit where the queuing model becomes congested. We study how service is allocated under this limit. We demonstrate that the only possible limit allocation is one that maximizes a proportionally fair optimization problem.     

Belief structures,weight generating functions and decision-making

We describe the Dempster–Shafer belief structure and provide some of its basic properties. We introduce the plausibility and belief measures associated with a belief structure. We note that these are not the only measures that can be associated with a belief structure. We describe a general approach for generating a class of measures that can be associated with a belief structure using a monotonic function on the unit interval, called a weight generating function. We study a number of these functions and the measures that result. We show how to use weight-generating functions to obtain dual measures from a belief structure. We show the role of belief structures in representing imprecise probability distributions. We describe the use of dual measures, other then plausibility and belief, to provide alternative bounding intervals for the imprecise probabilities associated with a belief structure. We investigate the problem of decision making under belief structure type uncertain. We discuss two approaches to this decision problem. One of which is based on an expected value of the OWA aggregation of the payoffs associated with the focal elements. The second approach is based on using the Choquet integral of a measure generated from the belief structure. We show the equivalence of these approaches.     

Algorithmic aspects of mean–variance optimization in Markov decision processes

We consider finite horizon Markov decision processes under performance measures that involve both the mean and the variance of the cumulative reward. We show that either randomized or history-based policies can improve performance. We prove that the complexity of computing a policy that maximizes the mean reward under a variance constraint is NP-hard for some cases, and strongly NP-hard for others. We finally offer pseudopolynomial exact and approximation algorithms.     

Spectral properties of three-electron systems in the Hubbard model

We investigate spectral properties of a three-electron system in the Hubbard model framework. We prove that the essential spectrum of the system in a quartet state consists of a single segment and the three-electron bound state is absent. We show that the essential spectrum of the system in doublet states is the union of at most three segments. We also prove that three-electron bound states exist in doublet states.     

Evolution of 3-D crystals from supersaturated vapor with modified Stefan condition: Galerkin method approach

We examine the evolution of crystals in three dimensions. We assume that the Wulff shape is a prism with a hexagonal base. We include the Gibbs-Thomson law on the crystal surface and the so-called Stefan condition. We show local in time existence of solutions assuming that the initial crystal has admissible shape.     

Scheduling and lot sizing models for the single-vendor multi-buyer problem under consignment stock partnership

We consider a centralized supply chain composed of a single vendor serving multiple buyers and operating under consignment stock arrangement. Solving the general problem is hard as it requires finding optimal delivery schedule to the buyers and optimal production lot sizes. We first provide a nonlinear mixed integer programming formulation for the general scheduling and lot sizing problem. We show that the problem is NP-hard in general. We reformulate the problem under the assumption of ‘zero-switch rule’. We also provide a simple sequence independent lower bound to the solution of the general model. We then propose a heuristic procedure to generate a near-optimal delivery schedule. We assess the cost performance of that heuristic by conducting sensitivity analysis on the key model parameters. The results show that the proposed heuristic promises substantial supply-chain cost savings that increase as the number of buyers increases.     

项链李代数的性质

研究项链李代数的性质,给出了其中心元的表示形式,证明了项链李代数非半单、非可解,通过构造项链李代数的可解非幂零子代数,证明了当箭图中有长度大于1的循环时,项链李代数非幂零.还给出了没有圈的箭图上项链李代数的分解.     

A Theory of Complexity for Continuous Time Systems

We present a model of computation with ordinary differential equations (ODEs) which converge to attractors that are interpreted as the output of a computation. We introduce a measure of complexity for exponentially convergent ODEs, enabling an algorithmic analysis of continuous time flows and their comparison with discrete algorithms. We define polynomial and logarithmic continuous time complexity classes and show that an ODE which solves the maximum network flow problem has polynomial time complexity. We also analyze a simple flow that solves the Maximum problem in logarithmic time. We conjecture that a subclass of the continuous P is equivalent to the classical P.     

Chain Dominated Orders

We study finite partial orders which have a chain such that every element of the order either belongs to this chain or has all its covers in this chain. We show that such orders are exactly the orders being both interval orders and truncated lattices. We prove that their jump number is polynomially tractable and that their dimension is unbounded. We also show that every order admits a visibility model having such an order as host.     

United States and South Korean citizens’ interpretation and assessment of COVID-19 quantitative data

We investigate United States and South Korean citizens’ mathematical schemes and how these schemes supported or hindered their attempts to assess the severity of COVID-19. We selected web and media-based COVID-19 data representations that we hypothesized citizens would interpret differently depending on their mathematical schemes. We included items that we conjectured would be easier or more difficult to interpret with schemes that prior research had reported were more or less productive, respectively. We used the representations during clinical interviews with 25 United States and seven South Korean citizens. We illustrate that citizens’ mathematical schemes (as well as their beliefs) impacted how they assessed the severity of COVID-19. We present vignettes of citizens’ schemes that inhibited interpreting representations of COVID-19 in ways compatible with the displayed quantitative data, schemes that aided them in assessing the severity of COVID-19, and beliefs about the reliability of scientific data that overrode their mathematical conclusions.     

Computable Linearizations of Well-partial-orderings

We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results. De Jongh and Parikh showed that every well-partial-order has a linearization of maximal order type. We show that such a linearization can be found computably. We also show that the process of finding such a linearization is not computably uniform, not even hyperarithmetically.     

Constructions Over Tournaments

We investigate tournaments that are projective in the variety that they generate, and free algebras over partial tournaments in that variety. We prove that the variety determined by three-variable equations of tournaments is not locally finite. We also construct infinitely many finite, pairwise incomparable simple tournaments.     

Annuitization and asset allocation with borrowing constraint

We generalize the result of Yaari (1965) on annuitization with borrowing constraint. We show that inability to borrow against future labor income has a significant influence on an individual’s consumption and asset allocation strategies. We also show that there exists a certain threshold of wealth for annuitization. We find that the wealth threshold is lower in the presence of borrowing constraint than in its absence, implying the individual’s earlier retirement.     

Scale transformations in phase space and stretched states of a harmonic oscillator

We consider scale transformations (q, p) → (λq, λp) in phase space. They induce transformations of the Husimi functions H(q, p) defined in this space. We consider the Husimi functions for states that are arbitrary superpositions of n-particle states of a harmonic oscillator. We develop a method that allows finding so-called stretched states to which these superpositions transform under such a scale transformation. We study the properties of the stretched states and calculate their density matrices in explicit form. We establish that the density matrix structure can be described using negative binomial distributions. We find expressions for the energy and entropy of stretched states and calculate the means of the number-ofstates operator. We give the form of the Heisenberg and Robertson–Schrödinger uncertainty relations for stretched states.     

Superalgebraic representation of Dirac matrices

We consider a Clifford extension of the Grassmann algebra in which operators are constructed from products of Grassmann variables and derivatives with respect to them. We show that this algebra contains a subalgebra isomorphic to a matrix algebra and that it additionally contains operators of a generalized matrix algebra that mix states with different numbers of Grassmann variables. We show that these operators are extensions of spin-tensors to the case of superspace. We construct a representation of Dirac matrices in the form of operators of a generalized matrix algebra.     

Weak Convergence of Greedy Algorithms in Banach Spaces

We study the convergence of certain greedy algorithms in Banach spaces. We introduce the WN property for Banach spaces and prove that the algorithms converge in the weak topology for general dictionaries in uniformly smooth Banach spaces with the WN property. We show that reflexive spaces with the uniform Opial property have the WN property. We show that our results do not extend to algorithms which employ a ‘dictionary dual’ greedy step.     

A Calderón–Zygmund operator of higher order Schrödinger type

We consider higher order Schrödinger type operators with nonnegative potentials. We assume that the potential belongs to the reverse Hölder class which includes nonnegative polynomials. We show that an operator of higher order Schrödinger type is a Calderón–Zygmund operator. We also show that there exist potentials which satisfy our assumptions but are not nonnegative polynomials.     

An analysis of a widely used version of the CUSUM tracking signal

Tracking signals are used to determine whether a sequence of forecasts is unbiased. We analyse a version of the CUSUM tracking signal that is based on the unsmoothed average mean absolute deviation of forecasting errors. We make the common assumption that demand values in different periods are independently, identically, and normally distributed. We show that, when forecast errors in different periods are also normal iid, this version of the tracking signal can indicate that the sequence is not unbiased even when it is unbiased. We suggest a simple modification to the tracking signal that serves to eliminate this flaw.