Calculus of Functorial Morphisms

We prove that, if F, G: 𝒞 → 𝒟 are two right exact functors between two Grothendieck categories such that they commute with coproducts and U is a generator of 𝒞, then there is a bijection between Nat(F, G) and the centralizer of Hom_𝒟(F(U), G(U)) considered as an Hom_𝒞(U, U)-Hom_𝒞(U, U)-bimodule. We also prove a dual of this result and give applications to Frobenius functors between Grothendieck categories.     

Every T-space is equivalent to a T-space of continuous functions

A T-space U of degree k is a (k + 1)-dimensional vector space over (the real line) of real-valued functions defined on a linearly ordered set, satisfying the condition: for every nonzero u ε U, Z(u), the number of distinct zeros of u and ^-(u), the number of alternations in sign of u(t) with increasing t, each do not exceed k. It is demonstrated that given a T-space U of degree k > 0 on an arbitrary linearly ordered set T, there is a subset T′ of the real line and a nonsingular linear map L:U→ C(T′), the set of continuous functions on T′, such that the following hold: L(U) is a T-space of degree k; for u ε U, Z(u) = Z(L(u)), S^−(u) = S^−(L(u); and for some order-preserving bijection Θ:T → T′, u(t) = O if and only if L(u)(Θ(t) = 0. It is also shown that a T-space on a subset T can be extended to a T-space on the closure of T in ]inf T, sup T], provided that there are no “interval gaps” in T. Examples show that, in general, a T-space cannot be extended across an “interval gap” in its domain, and cannot be extended to both the infimum and supremum of its domain. Conditions for a T-space to be Markov, and to admit an adjoined function are derived.     

X-inner automorphisms of enveloping rings

In this paper, we determine the X-inner automorphisms of the smash product R # U(L) of a prime ring R by the universal enveloping algebra U(L) of a characteristic 0 Lie algebra L. Specifically, we show that any such automorphism σ stabilizing R can be written as a product σ = σ₁σ₂, where σ₁ is induced by conjugation by a unit of Q₃(R), the symmetric Martindale ring of quotients of R, and σ₂ is induced by conjugation by a unit of Q₃(T). Here S = Q_l(R) is the left Martindale ring of quotients of R and T is the centralizer of S in S # U(L) - R # U(L). One of the subtleties of the proof is that we must work in several unrelated overrings of R # U(L).     

Direct products of cyclic semigroups an unions of groups

We consider direct productsS×U_eεE G _e=S ₁×…×S _n × U_eεE G _e of non-group finite cyclic semigroupsS _i, 1 ≤i ≤n, and finite unions of finite groups U_eεE G _e We prove that if such a semigroup is isomorphic to another of the same form, sayT×U _fεF H _f =T ₁×…×U _fεF H _f , whereT _j are non-group cyclic semigroups, 1≤j≤l, and U _fεF H _f is a union of groups, thenS is isomorphic toT and U_eεE G _e is isomorphic to U_fεF H _f . We then determine when a finite semigroup has such a decomposition and show how the direct factors can be found.     

Full range solution of half space neutron transport problem

Based on the fact that the complete set of eigenfunctions of a half-range problem in [0,U] is also part of a larger set that is complete in the full-range [ –U,U], a full-range boundary condition is introduced for solving the half-range problem. Specifically, this condition expresses the solution at the boundary valid for allu [ –U,U] as the sum of a given forward component inu [0,U] and the unknown backward component inu [ –U, 0). Thus the basically ill-posed nature of the half-range problem, viz., that is required to find the response in [ —U,U] from given data in [0,U], is formulated over the entire domain at the boundary as compared to the usual approach that expresses the boundary condition only over [0,U]. This allows us, through a two-step process that considers the full-range properties of the eigenfunctions in [ —U,U] only, to obtainnumerically exact extrapolated end-point and CaseX-function. This means, because of the relationship of these fundamental half-range data with standard half-range expansion coefficientsa ₀₊ andA(v) [2], that the transient integral of the half-range solution has been reduced to mechanical quadratures.     

On the distributions of the form ∑i (δpi−δni)

We present some properties of the distributions T of the form ∑_i (δ_pi−δ_ni), with ∑_i d(p_i,n_i)<∞, which arise in the study of the 3-d Ginzburg–Landau problem; see Bourgain et al. (C. R. Acad. Sci. Paris, Ser. I 331 (2000) 119–124). We show that there always exists an irreducible representation of T. We also extend a result of Smets (C. R. Acad. Sci. Paris, Ser. I 334 (2002) 371–374) which says that T is a measure iff T can be written as a finite sum of dipoles.     

Inverse product Toeplitz preconditioners for non-Hermitian Toeplitz systems

In this paper, we first propose product Toeplitz preconditioners (in an inverse form) for non-Hermitian Toeplitz matrices generated by functions with zeros. Our inverse product-type preconditioner is of the form T_F T_L^-1 T_U^-1T_F T_L^{-1} T_U^{-1} where T _F , T _L , and T _U are full, band lower triangular, and band upper triangular Toeplitz matrices, respectively. Our basic idea is to decompose the generating function properly such that all factors T _F , T _L , and T _U of the preconditioner are as well-conditioned as possible. We prove that under certain conditions, the preconditioned matrix has eigenvalues and singular values clustered around 1. Then we use a similar idea to modify the preconditioner proposed in Ku and Kuo (SIAM J Sci Stat Comput 13:1470–1487, 1992) to handle the zeros in rational generating functions. Numerical results, including applications to the computation of the stationary probability distribution of Markovian queuing models with batch arrival, are given to illustrate the good performance of the proposed preconditioners.     

Estimation of a Mean Vector in a Two-Sample Problem

We consider the problem of estimating a p-dimensional vector μ₁ based on independent variables X₁, X₂, and U, where X₁ is N_p(μ₁, σ²Σ₁), X₂ is N_p(μ₂, σ²Σ₂), and U is σ²χ²_n (Σ₁ and Σ₂ are known). A family of minimax estimators is proposed. Some of these estimators can be obtained via Bayesian arguments as well. Comparisons between our results and the one of Ghosh and Sinha (1988, J. Multivariate Anal.27 206-207) are presented.     

Functional Equation Related to Quadratic and Norm Forms

Let T(a ₁, a ₂,..., a _n ) be a norm form of some finite proper extension of ℚ in a certain fixed integral basis, or even some integer form satisfying certain conditions. We are interested in two problems. One is finding all functions f : ℤ → ℂ satisfying the integer functional equation f(T(a ₁, a ₂,..., a _n )) = T(f(a ₁), f(a ₂),..., f(a _n )). Another closely related problem is finding all functions f : ℤ → ℂ such that T(f(a ₁, f(a ₂,..., f(a _n )) depends only on the value of T(a ₁, a ₂,..., a _n ).The second question was studied before for special quadratic forms. We extend these investigations to other types of quadratic forms and, thus, partially solve the second problem for them. The solution of the first problem for one cubic field is also presented. Finally, we give the corresponding conjecture for the first problem and, additionally, several remarks concerning the choice of norm forms.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 2, pp. 153–172, April–June, 2005.     

Finding cheapest cycles in vertex-weighted quasi-transitive and extended semicomplete digraphs

We consider the problem of finding a minimum cost cycle in a digraph with real-valued costs on the vertices. This problem generalizes the problem of finding a longest cycle and hence is NP-hard for general digraphs. We prove that the problem is solvable in polynomial time for extended semicomplete digraphs and for quasi-transitive digraphs, thereby generalizing a number of previous results on these classes. As a byproduct of our method we develop polynomial algorithms for the following problem: Given a quasi-transitive digraph D with real-valued vertex costs, find, for each j=1,2,…,|V(D)|, j disjoint paths P₁,P₂,…,P_j such that the total cost of these paths is minimum among all collections of j disjoint paths in D.     

The iterated Aluthge transforms of a matrix converge

Given an r×r complex matrix T, if T=U|T| is the polar decomposition of T, then, the Aluthge transform is defined byΔ(T)=|T|^1/2U|T|^1/2. Let Δn(T) denote the n-times iterated Aluthge transform of T, i.e., Δ⁰(T)=T and Δn(T)=Δ(Δn−1(T)), n∈N. We prove that the sequence {Δn(T)}_n∈N converges for every r×r matrix T. This result was conjectured by Jung, Ko and Pearcy in 2003. We also analyze the regularity of the limit function.     

Possible limit laws for entrance times of an ergodic aperiodic dynamical system

LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ ₀ ^∞ G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ _U (x)=inf{k⩾1:T ^k xεU}, and defineG _U (t)=1/u(U)u({xεU:u(U)τU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U _n ) _n≥1 of neighbourhoods ofx such that {x}=∩ _n U _n , and for anyG ∈G, there exists a subsequence (n _k ) _k≥1 withG _{U n k} ↑U weakly. We also construct a uniquely ergodic Toeplitz flowO(x ^∞,S, μ), the orbit closure of a Toeplitz sequencex ^∞, such that the above conclusion still holds, with moreover the requirement that eachU _n be a cylinder set. In memory of Anzelm Iwanik     

Regularity properties of time-optimal trajectories of an analytic single-input control-linear system in dimension three

We consider the problem of time-optimal control for systems of the form , where the state spaceM is a three-dimensional real-analytic manifold,f andg are real-analytic vector fields onM, and admissible controls are scalar measurable functionsu(·) with values in –1u1 a.e. We prove, for arbitraryf andg, that there exists an analytic subsetA ofM with positive codimension such that every point not inA has a neighborhoodU such that time-optimal trajectories that lie inU are, in nondegenerate cases, bang-bang with at most two switchings or concatenations of at most a bang arc, followed by a singular arc and another bang arc; in degenerate cases, wheneverq ₁ U can be steered toq ₂U in timeT inU, then there also exists a bang-bang trajectory with at most two switchings that steersq ₁ toq ₂ in timeT.     

Approaching an extinction point in one-dimensional semilinear heat equations with strong absorption

This paper deals with the Cauchy problem u_t − u_xx + u^p = 0; − ∞ < x < + ∞, t>0, u(x, 0) = u₀(x); − ∞ < x < + ∞, where 0 < p < 1 and u₀(x) is continuous, nonnegative, and bounded. In this case, solutions are known to vanish in a finite time T, and interfaces separating the regions where u(x, t) > 0 and u(x, t) = 0 appear when t is close to T. We describe here all possible asymptotic behaviours of solutions and interfaces near an extinction point as the extinction time is approached. We also give conditions under which some of these behaviours actually occur.     

Approximation Algorithms for Maximization Problems Arising in Graph Partitioning

Given a graph G = (V, E), a weight function w: E → R⁺, and a parameter k, we consider the problem of finding a subset U  V of size k that maximizes: Max-Vertex Cover_k: the weight of edges incident with vertices in U,Max-Dense Subgraph_k: the weight of edges in the subgraph induced by U,Max-Cut_k: the weight of edges cut by the partition (U, V\U),Max-Uncut_k: the weight of edges not cut by the partition (U, V\U).For each of the above problems we present approximation algorithms based on semidefinite programming and obtain approximation ratios better than those previously published. In particular we show that if a graph has a vertex cover of size k, then one can select in polynomial time a set of k vertices that covers over 80% of the edges.     

Amalgams of free inverse semigroups

We study inverse semigroup amalgams of the formS * _U T whereS andT are free inverse semigroups andU is an arbitrary finitely generated inverse subsemigroup ofS andT. We make use of recent work of Bennett to show that the word problem is decidable for any such amalgam. This is in contrast to the general situation for semigroup amalgams, where recent work of Birget, Margolis and Meakin shows that the word problem for a semigroup amalgamS * _U T is in general undecidable, even ifS andT have decidable word problem,U is a free semigroup, and the membership problem forU inS andT is decidable. We also obtain a number of results concerning the structure of such amalgams. We obtain conditions for theD-classes of such an amalgam to be finite and we show that the amalgam is combinatorial in such a case. For example every one-relator amalgam of this type has finiteD-classes and is combinatorial. We also obtain information concerning when such an amalgam isE-unitary: for example every one relator amalgam of the formInv<A ∪B :u =v > whereA andB are disjoint andu (resp.v) is a cyclically reduced word overA ∪A ⁻¹ (resp.B ∪B ⁻¹) isE-unitary. Research of all authors supported by a grant from the Italian CNR. The first and third authors’ research was partially supported by MURST. The second author’s research was also partially supported by NSF and the Center for Communication and Information Science of the University of Nebraska at Lincoln.     

On the distribution of Pickands coordinates in bivariate EV and GP models

Let (U,V) be a random vector with U0, V0. The random variables Z=V/(U+V), C=U+V are the Pickands coordinates of (U,V). They are a useful tool for the investigation of the tail behavior in bivariate peaks-over-threshold models in extreme value theory.We compute the distribution of (Z,C) among others under the assumption that the distribution function H of (U,V) is in a smooth neighborhood of a generalized Pareto distribution (GP) with uniform marginals. It turns out that if H is a GP, then Z and C are independent, conditional on C>c−1.These results are used to derive approximations of the empirical point process of the exceedances (Z_i,C_i) with C_i>c in an iid sample of size n. Local asymptotic normality is established for the approximating point process in a parametric model, where c=c(n)↑0 as n→∞.     

Pattern Matching with Swaps

Let a text string T of n symbols and a pattern string P of m symbols from alphabet Σ be given. A swapped version T′ of T is a length n string derived from T by a series of local swaps (i.e., t′_ℓ ← t_ℓ + 1 and t′_ℓ + 1 ← t_ℓ), where each element can participate in no more than one swap. The pattern matching with swaps problem is that of finding all locations i for which there exists a swapped version T′ of T with an exact matching of P in location i of T′. It has been an open problem whether swapped matching can be done in less than O(nm) time. In this paper we show the first algorithm that solves the pattern matching with swaps problem in time o(nm). We present an algorithm whose time complexity is O(nm^1/3 log m log σ) for a general alphabet Σ, where σ = min(m,Σ).     

Codeterminants and <Emphasis Type="Italic">q</Emphasis>-Schur Algebras

We study codeterminants in the q-Schur algebra S _q (n,r) and prove that the standard ones form a basis of S _q (n,r), using a quantized version of the Désarménien matrix. We find elements of the form F _S 1_λ E _T in Lusztig’s modified enveloping algebra of gl(n), which, up to powers of q, map to the basis of standard codeterminants, where F _S ∈U ^– and E _T ∈U ⁺ are explicitly given products of root vectors, depending on Young tableaux S and T.     

On Genuine Bernstein–Durrmeyer Operators

We continue the studies on the so–called genuine Bernstein–Durrmeyer operators U _n by establishing a recurrence formula for the moments and by investigating the semigroup T(t) approximated by U _n . Moreover, for sufficiently smooth functions the degree of this convergence is estimated. We also determine the eigenstructure of U _n , compute the moments of T(t) and establish asymptotic formulas. Received: January 26, 2007.