A note on the approximate amenability of semigroup algebras

It is known that the bicyclic semigroup S ₁ is an amenable inverse semigroup. In this note we show that the convolution semigroup algebra ℓ ¹(S ₁) is not approximately amenable.     

A universal planar automaton is determined by its semigroup of input symbols

Universal planar automata are universally attracted objects in the category of automata, for which the set of states and the set of output symbols are equipped with structures of planes. We investigate the problem of determinability of these automata by their semigroups of input symbols.     

A comparison of problem decomposition techniques for the FAP

This paper proposes a problem decomposition approach to solve hard Frequency Assignment Problem instances with standard meta-heuristics. The proposed technique aims to divide the initial problem into a number of easier subproblems, solve them and then recompose the partial solutions into one of the original problem. We consider the COST-259 MI-FAP instances and other Cardiff University test problems in order to simulate larger and more realistic networks. For both benchmarks the standard implementations of meta-heuristics do not generally produce a satisfactory performance within reasonable times of execution. However, the decomposed assignment approach can improve their results, both in terms of solution quality and runtime.     

Verified bounds for singular values,in particular for the spectral norm of a matrix and its inverse

The singular value decomposition and spectral norm of a matrix are ubiquitous in numerical analysis. They are extensively used in proofs, but usually it is not necessary to compute them. However, there are some important applications in the realm of verified error bounds for the solution of ordinary and partial differential equations where reasonably tight error bounds for the spectral norm of a matrix are mandatory. We present various approaches to this together with some auxiliary useful estimates.     

A New Regularity Criterion in Terms of the Direction of the Velocity for the MHD Equations

In this paper we obtain a new regularity criterion for weak solutions to the 3D MHD equations. It is proved that if div( \fracu|u|) \mathrm{div}( \frac{u}{|u|}) belongs to L^\frac21-r( 0,T;[(X)\dot]_r( \mathbbR³) ) L^{\frac{2}{1-r}}( 0,T;\dot{X}_{r}( \mathbb{R}^{3}) ) with 0≤r≤1, then the weak solution actually is regular and unique.     

A Generalization of C—semigroup

§ 1.ＴｈｅＧｅｎｅｒａｌＣ ｓｅｍｉｇｒｏｕｐ　Ｉｎｔｈｉｓｐａｐｅｒ,ｗｅｌｅｔＸｂｅａＢａｎａｃｈｓｐａｃｅ,ａｎｄＢ(Ｘ)ｔｈｅｓｐａｃｅｏｆａｌｌｂｏｕｎｄｅｄｌｉｎｅａｒｏｐｅｒａｔｏｒｓｆｒｏｍＸｉｎｔｏＸ .　Ｄｅｆｉｎｉｔｉｏｎ 1 .1　ＳｕｐｐｏｓｅＣｉｓａｂｏｕｎｄｅｄｉｎｊｅｃｔｉｖｅｏｐｅｒａｔｏｒｆｒｏｍＸｉｎｔｏＸ .Ｔｈｅｆａｍｉｌｙｏｆｂｏｕｎｄｅｄｌｉｎｅａｒｏｐｅｒａｔｏｒｓ (Ｓ(ｔ) ) ｔ≥ 0 ｉｓａｇｅｎｅｒａｌＣ ｓｅｍｉｇｒｏｕｐｉｆｉｔｈａｓｔｈｅｆｏｌｌｏｗｉｎｇ…     

A comparison of feasible direction methods for the stochastic transportation problem

The feasible direction method of Frank and Wolfe has been claimed to be efficient for solving the stochastic transportation problem. While this is true for very moderate accuracy requirements, substantially more efficient algorithms are otherwise diagonalized Newton and conjugate Frank–Wolfe algorithms, which we describe and evaluate. Like the Frank–Wolfe algorithm, these two algorithms take advantage of the structure of the stochastic transportation problem. We also introduce a Frank–Wolfe type algorithm with multi-dimensional search; this search procedure exploits the Cartesian product structure of the problem. Numerical results for two classic test problem sets are given. The three new methods that are considered are shown to be superior to the Frank–Wolfe method, and also to an earlier suggested heuristic acceleration of the Frank–Wolfe method.     

A one-parametric class of merit functions for the second-order cone complementarity problem

We investigate a one-parametric class of merit functions for the second-order cone complementarity problem (SOCCP) which is closely related to the popular Fischer–Burmeister (FB) merit function and natural residual merit function. In fact, it will reduce to the FB merit function if the involved parameter τ equals 2, whereas as τ tends to zero, its limit will become a multiple of the natural residual merit function. In this paper, we show that this class of merit functions enjoys several favorable properties as the FB merit function holds, for example, the smoothness. These properties play an important role in the reformulation method of an unconstrained minimization or a nonsmooth system of equations for the SOCCP. Numerical results are reported for some convex second-order cone programs (SOCPs) by solving the unconstrained minimization reformulation of the KKT optimality conditions, which indicate that the FB merit function is not the best. For the sparse linear SOCPs, the merit function corresponding to τ=2.5 or 3 works better than the FB merit function, whereas for the dense convex SOCPs, the merit function with τ=0.1, 0.5 or 1.0 seems to have better numerical performance.     

A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem

In this paper, we propose a new hybrid algorithm for the Hamiltonian cycle problem by synthesizing the Cross Entropy method and Markov decision processes. In particular, this new algorithm assigns a random length to each arc and alters the Hamiltonian cycle problem to the travelling salesman problem. Thus, there is now a probability corresponding to each arc that denotes the probability of the event “this arc is located on the shortest tour.” Those probabilities are then updated as in cross entropy method and used to set a suitable linear programming model. If the solution of the latter yields any tour, the graph is Hamiltonian. Numerical results reveal that when the size of graph is small, say less than 50 nodes, there is a high chance the algorithm will be terminated in its cross entropy component by simply generating a Hamiltonian cycle, randomly. However, for larger graphs, in most of the tests the algorithm terminated in its optimization component (by solving the proposed linear program).     

A continuous analog of the binary Darboux transformation for the Korteweg–de Vries equation

In the Korteweg–de Vries equation (KdV) context, we put forward a continuous version of the binary Darboux transformation (aka the double commutation method). Our approach is based on the Riemann–Hilbert problem and yields a new explicit formula for perturbation of the negative spectrum of a wide class of step-type potentials without changing the rest of the scattering data. This extends the previously known formulas for inserting/removing finitely many bound states to arbitrary sets of negative spectrum of arbitrary nature. In the KdV context, our method offers same benefits as the classical binary Darboux transformation does.     

Determinant representation of Darboux transformation for the AKNS system

The n-fold Darboux transform (DT) is a 2×2 matrix for the Ablowitz-Kaup-Newell-Segur (AKNS) system. In this paper, each element of this matrix is expressed by 2n 1 ranks' determinants. Using these formulae, the determinant expressions of eigenfunctions generated by the n-fold DT are obtained. Furthermore, we give out the explicit forms of the n-soliton surface of the Nonlinear Schrodinger Equation (NLS) by the determinant of eigenfunctions.     

A refined semilocal convergence analysis of an algorithm for solving the Ricatti equation

The semilocal convergence of a numerical algorithm for solving the algebraic Ricatti equation with multiparameter singularly perturbed systems is investigated here. We show that under weaker hypotheses and the some computational cost than in Mukaidani et al. (J. Math. Anal. Appl. 267:209–234, [2002]) finer estimates on the distances involved and a more precise information on the location of the solution can be obtained.     

A proof of Devadze’s theorem on generators of the semigroup of Boolean matrices

In 1968 Devadze described, without a proof, minimal sets of generators of the semigroup of n×n Boolean matrices. We provide a proof of Devadze’s theorem.     

Distributional chaos for operators with full scrambled sets

In this article we answer in the negative the question of whether hypercyclicity is sufficient for distributional chaos for a continuous linear operator (we even prove that the mixing property does not suffice). Moreover, we show that an extremal situation is possible: There are (hypercyclic and non-hypercyclic) operators such that the whole space consists, except zero, of distributionally irregular vectors.     

Equivalent Conditions of Asymptotics for the Density of the Supremum of a Random Walk in the Intermediate Case

This paper obtains some equivalent conditions about the asymptotics for the density of the supremum of a random walk with light-tailed increments in the intermediate case. To do this, the paper first corrects the proofs of some existing results about densities of random sums. On the basis of the above results, the paper obtains some equivalent conditions about the asymptotics for densities of ruin distributions in the intermediate case and densities of infinitely divisible distributions. In the above studies, some differences and relations between the results on a distribution and its corresponding density can be discovered.      

A branch-and-cut procedure for the Udine Course Timetabling problem

A branch-and-cut procedure for the Udine Course Timetabling problem is described. Simple compact integer linear programming formulations of the problem employ only binary variables. In contrast, we give a formulation with fewer variables by using a mix of binary and general integer variables. This formulation has an exponential number of constraints, which are added only upon violation. The number of constraints is exponential. However, this is only with respect to the upper bound on the general integer variables, which is the number of periods per day in the Udine Course Timetabling problem.     

Regularity of the Schrödinger equation for the harmonic oscillator

We consider the Schrödinger equation for the harmonic oscillator i ? _t u=Hu, where H=?Δ+|x|², with initial data in the Hermite–Sobolev space H ^?s/2 L ²(? ⁿ ). We obtain smoothing and maximal estimates and apply these to perturbations of the equation and almost everywhere convergence problems.     

A characterization of arithmetical invariants by the monoid of relations

The investigation and classification of non-unique factorization phenomena have attracted some interest in recent literature. For finitely generated monoids, S.T. Chapman and P. García-Sánchez, together with several co-authors, derived a method to calculate the catenary and tame degree from the monoid of relations, and they applied this method successfully in the case of numerical monoids. In this paper, we investigate the algebraic structure of this approach. Thereby, we dispense with the restriction to finitely generated monoids and give applications to other invariants of non-unique factorizations, such as the elasticity and the set of distances.     

A plactic algebra of extremal weight crystals and the Cauchy identity for Schur operators

We give a new bijective interpretation of the Cauchy identity for Schur operators which is a commutation relation between two formal power series with operator coefficients. We introduce a plactic algebra associated with the Kashiwara’s extremal weight crystals over the Kac–Moody algebra of type A _+∞, and construct a Knuth type correspondence preserving the plactic relations. This bijection yields the Cauchy identity for Schur operators as a homomorphic image of its associated identity for plactic characters of extremal weight crystals, and also recovers Sagan and Stanley’s correspondence for skew tableaux as its restriction.