<Emphasis Type="Bold">K</Emphasis><Subscript>0</Subscript> of Semiartinian Von Neumann Regular Rings. Direct Finiteness Versus Unit-Regularity

If R is a regular and semiartinian ring, it is proved that the following conditions are equivalent: (1) R is unit-regular, (2) every factor ring of R is directly finite, (3) the abelian group K _O(R) is free and admits a basis which is in a canonical one to one correspondence with a set of representatives of simple right R-modules. For the class of semiartinian and unit-regular rings the canonical partial order of K _O(R) is investigated. Starting from any partially ordered set I, a special dimension group G(I) is built and a large class of semiartinian and unit-regular rings is shown to have the corresponding K _O(R) order isomorphic to G(P r i m _R ), where P r i m _R is the primitive spectrum of R. Conversely, if I is an artinian partially ordered set having a finite cofinal subset, it is proved that the dimension group G(I) is realizable as K _O(R) for a suitable semiartinian and unit-regular ring R.     

Rings of h-deformed differential operators

We describe the center of the ring Diff _h (n) of h-deformed differential operators of type A. We establish an isomorphism between certain localizations of Diff _h (n) and the Weyl algebra W _n , extended by n indeterminates.     

Analysis of algorithms for an online version of the convoy movement problem

In the convoy movement problem (CMP), a set of convoys must be routed from specified origins to destinations in a transportation network, represented by an undirected graph. Two convoys may not cross each other on the same edge while travelling in opposing directions, a restriction referred to as blocking. However, convoys are permitted to follow each other on the same edge, with a specified headway separating them, but no overtaking is permitted. Further, the convoys to be routed are distinguished based on their length. Particle convoys have zero length and are permitted to traverse an edge simultaneously, whereas convoys with non-zero length have to follow each other, observing a headway. The objective is to minimize the total time taken by convoys to travel from their origins to their destinations, given the travel constraints on the edges. We consider an online version of the CMP where convoy demands arise dynamically over time. For the special case of particle convoys, we present an algorithm that has a competitive ratio of 3 in the worst case and (5/2) on average. For the particle convoy problem, we also present an alternate, randomized algorithm that provides a competitive ratio of (√13?1). We then extend the results to the case of convoys with length, which leads to an algorithm with an O(T+CL) competitive ratio, where T={Max _e t(e)}/{Min _e t(e)}, C is the maximum congestion (the number of distinct convoy origin–destination pairs that use any edge e) and L={Max _c L(c)}/{Min _c L(c)}; here L(c)>0 represents the time-headway to be observed by any convoy that follows c and t(e) represents the travel time for a convoy c on edge e.     

Calculation of Geometric Probabilities Using Covariogram of Convex Bodies

In the paper, a formula to calculate the probability that a random segment L(ω, u) in R ⁿ with a fixed direction u and length l lies entirely in the bounded convex body D ? R ⁿ (n ≥ 2) is obtained in terms of covariogram of the body D. For any dimension n ≥ 2, a relationship between the probability P(L(ω, u) ? D) and the orientation-dependent chord length distribution is also obtained. Using this formula, we obtain the explicit form of the probability P(L(ω, u) ? D) in the cases where D is an n-dimensional ball (n ≥ 2), or a regular triangle on the plane.     

Hopf Modules and Representations of Finite Wreath Products

For a finite group G and nonnegative integer n ≥ 0, one may consider the associated tower \(G \wr S_{n} := S_{n} \ltimes G^{n}\) of wreath product groups. Zelevinsky associated to such a tower the structure of a positive self-adjoint Hopf algebra (PSH-algebra) R(G) on the direct sum over integers n ≥ 0 of the Grothendieck groups K ₀(R e p?G?S _n ). In this paper, we study the interaction via induction and restriction of the PSH-algebras R(G) and R(H) associated to finite groups H ? G. A class of Hopf modules over PSH-algebras with a compatibility between the comultiplication and multiplication involving the Hopf k ^{t h} -power map arise naturally and are studied independently. We also give an explicit formula for the natural PSH-algebra morphisms R(H) → R(G) and R(G) → R(H) arising from induction and restriction. In an appendix, we consider a family of subgroups of wreath product groups analogous to the subgroups G(m, p, n) of the wreath product cyclotomic complex reflection groups G(m, 1, n).     

Some matrix functional equations

We investigate the pair of matrix functional equations G(x)F(y) = G(xy) and G(x)G(y) = F(y/x), featuring the two independent scalar variables x and y and the two N×N matrices F(z) andG(z) (with N an arbitrary positive integer and the elements of these two matrices functions of the scalar variable z). We focus on the simplest class of solutions, i.e., on matrices all of whose elements are analytic functions of the independent variable. While in the scalar (N = 1) case this pair of functional equations only possess altogether trivial constant solutions, in the matrix (N > 1) case there are nontrivial solutions. These solutions satisfy the additional pair of functional equations F(x)G(y) = G(y/x) andF(x)F(y) = F(xy), and an endless hierarchy of other functional equations featuring more than two independent variables.     

On the homotopy type of (<Emphasis Type="Italic">n</Emphasis>-1)-connected (3<Emphasis Type="Italic">n</Emphasis>+1)-dimensional free chain Lie algebra

Let R be a subring ring of Q. We reserve the symbol p for the least prime which is not a unit in R; if R ?Q, then p=∞. Denote by DGL _n ^np , n≥1, the category of (n-1)-connected np-dimensional differential graded free Lie algebras over R. In [1] D. Anick has shown that there is a reasonable concept of homotopy in the category DGL _n ^np . In this work we intend to answer the following two questions: Given an object (L(V), ?) in DGL _n ³ⁿ⁺² and denote by S(L(V), ?) the class of objects homotopy equivalent to (L(V), ?). How we can characterize a free dgl to belong to S(L(V), ?)? Fix an object (L(V), ?) in DGL _n ³ⁿ⁺² . How many homotopy equivalence classes of objects (L(W), δ) in DGL _n ³ⁿ⁺² such that H _* (W, d′)?H _* (V, d) are there? Note that DGL _n ³ⁿ⁺² is a subcategory of DGL _n ^np when p>3. Our tool to address this problem is the exact sequence of Whitehead associated with a free dgl.     

Projections of Patterson-Sullivan measures and the dichotomy of Mohammadi-Oh

Let Γ be some discrete subgroup of SO°(n + 1, R) with finite Bowen-Margulis-Sullivan measure. We study the dynamics of the Bowen-Margulis-Sullivan measure with respect to closed connected subspaces of the N component in some Iwasawa decomposition SO°(n+1, R) = KAN. We also study the dimension of projected Patterson-Sullivan measures along some fixed direction.     

Homogenization of hyperbolic equations

We consider a self-adjoint matrix elliptic operator A _{ε, ε} > 0, on L ₂(R ^d ;C ⁿ ) given by the differential expression b(D)*g(x/ε)b(D). The matrix-valued function g(x) is bounded, positive definite, and periodic with respect to some lattice; b(D) is an (m × n)-matrix first order differential operator such that m ≥ n and the symbol b(ξ) has maximal rank. We study the operator cosine cos(τA _ε ^1/2 ), where τ ∈ R. It is shown that, as ε → 0, the operator cos(τA _ε ^1/2 ) converges to cos(τ(A ⁰)^1/2) in the norm of operators acting from the Sobolev space H ^s (R ^d ;C ⁿ ) (with a suitable s) to L ₂(R ^d ;C ⁿ ). Here A ₀ is the effective operator with constant coefficients. Sharp-order error estimates are obtained. The question about the sharpness of the result with respect to the type of the operator norm is studied. Similar results are obtained for more general operators. The results are applied to study the behavior of the solution of the Cauchy problem for the hyperbolic equation ? _τ ² u _ε (x, τ) = ?A _ε u _ε (x, τ).     

Curvature inequalities for operators of the Cowen–Douglas class

Let T be an operator tuple in the Cowen–Douglas class B _n (Ω) for Ω ? C ^m . The kernels Ker(T ? w) ^l , for w ∈ Ω, l = 1, 2, ···, define Hermitian vector bundles E _T ^l over Ω. We prove certain negativity of the curvature of E _T ^l . We also study the relation between certain curvature inequality and the contractive property of T when Ω is a planar domain.     

Asymptotics of the Codimensions <Emphasis Type="Italic">c</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> in the Algebra <Emphasis Type="Italic">F</Emphasis><Superscript>(7)</Superscript>

The paper studies the additive structure of the algebra F⁽⁷⁾, i.e., a relatively free associative countably generated algebra with the identity [x₁,..., x₇] = 0 over an infinite field of characteristic ≠ 2, 3. First, the space of proper multilinear polynomials in this algebra is investigated. As an application, estimates for the codimensions c_n = dimF_n⁽⁷⁾ are obtained, where F_n⁽⁷⁾ stands for the subspace of multilinear polynomials of degree n in the algebra F⁽⁷⁾.     

On the existence of strips inside domains convex in one direction

A plane domain Ω is convex in the positive direction if for every ω ∈ Ω, the entire half-line {ω + t: t ≥ 0} is contained in Ω. Suppose that h maps the unit disk onto such a domain Ω with the normalization h(0) = 0 and lim_t→∞h^?1(h(z) + t) = 1. We show that if ∠lim_z→?1 Re h(z) = ?∞ and ∠lim_z→?1(1 + z)h′(z) = ν ∈ (0, +∞), then Ω contains a maximal horizontal strip of width πν. We also prove a converse statement. These results provide a solution to a problem posed by Elin and Shoikhet in connection with semigroups of holomorphic functions.     

Hamiltonian cycles in Dirac graphs

We prove that for any n-vertex Dirac graph (graph with minimum degree at least n/2) G=(V,E), the number, Ψ(G), of Hamiltonian cycles in G is at least

$exp_2 [2h(G) - n\log e - o(n)],$

where h(G)=maxΣ _e x _e log(1/x _e ), the maximum over x: E → ?⁺ satisfying Σ _e?υ x _e = 1 for each υ ∈ V, and log =log₂. (A second paper will show that this bound is tight up to the o(n).)

We also show that for any (Dirac) G of minimum degree at least d, h(G) ≥ (n/2) logd, so that Ψ(G) > (d/(e + o(1))) ⁿ . In particular, this says that for any Dirac G we have Ψ(G) > n!/(2 + o(1)) ⁿ , confirming a conjecture of G. Sárközy, Selkow, and Szemerédi which was the original motivation for this work.     

Higher Algebraic <Emphasis Type="Italic">K</Emphasis>-theory of Ring Epimorphisms

Given a homological ring epimorphism from a ring R to another ring S, we show that if the left R-module S has a finite-type resolution, then the algebraic K-group K _n (R) of R splits as the direct sum of the algebraic K-group K _n (S) of S and the algebraic K-group K _n (R) of a Waldhausen category R determined by the ring epimorphism. This result is then applied to endomorphism rings, matrix subrings, rings with idempotent ideals, and universal localizations which appear often in representation theory and algebraic topology.     

Growth rates of algebras,III: finite solvable algebras

We investigate how the behavior of the function d_A(n), which gives the size of a least size generating set for Aⁿ, influences the structure of a finite solvable algebra A.     

A limit theorem for continuous selectors

Any (measurable) function K from Rⁿ to R defines an operator K acting on random variables X by K(X) = K(X₁,..., X_n), where the X_j are independent copies of X. The main result of this paper concerns continuous selectors H, continuous functions defined in Rn and such that H(x₁, x₂,..., x_n) ∈ {x₁, x₂,..., x_n}. For each such continuous selector H (except for projections onto a single coordinate) there is a unique point ω_H in the interval (0, 1) so that, for any random variable X, the iterates H^(N) acting on X converge in distribution as N → ∞ to the ωH-quantile of X.     

Sum-free sets in abelian groups

An IP system is a functionn taking finite subsets ofN to a commutative, additive group Ω satisfyingn(α∪β)=n(α)+n(β) whenever α∩β=ø. In an extension of their Szemerédi theorem for finitely many commuting measure preserving transformations, Furstenberg and Katznelson showed that ifS _i ,1≤i≤k, are IP systems into a commutative (possibly infinitely generated) group Ω of measure preserving transformations of a probability space (X, B, μ, andA∈B with μ(A)>0, then for some ø≠α one has μ(? _i=1 ^k S _i({α})A>0). We extend this to so-called FVIP systems, which are polynomial analogs of IP systems, thereby generalizing as well joint work by the author and V. Bergelson concerning special FVIP systems of the formS(α)=T(p(n(α))), wherep:Z ^t →Z ^d is a polynomial vanishing at zero,T is a measure preservingZ ^d action andn is an IP system intoZ ^t . The primary novelty here is potential infinite generation of the underlying group action, however there are new applications inZ ^d as well, for example multiple recurrence along a wide class ofgeneralized polynomials (very roughly, functions built out of regular polynomials by iterated use of the greatest integer function).     

Searching for a Best Least Absolute Deviations Solution of an Overdetermined System of Linear Equations Motivated by Searching for a Best Least Absolute Deviations Hyperplane on the Basis of Given Data

We consider the problem of searching for a best LAD-solution of an overdetermined system of linear equations Xa=z, X∈?^m×n, m≥n, \(\mathbf{a}\in \mathbb{R}^{n}, \mathbf {z}\in\mathbb{R}^{m}\). This problem is equivalent to the problem of determining a best LAD-hyperplane x?a ^T x, x∈? ⁿ on the basis of given data \((\mathbf{x}_{i},z_{i}), \mathbf{x}_{i}= (x_{1}^{(i)},\ldots,x_{n}^{(i)})^{T}\in \mathbb{R}^{n}, z_{i}\in\mathbb{R}, i=1,\ldots,m\), whereby the minimizing functional is of the form

$F(\mathbf{a})=\|\mathbf{z}-\mathbf{Xa}\|_1=\sum_{i=1}^m|z_i-\mathbf {a}^T\mathbf{x}_i|.$

An iterative procedure is constructed as a sequence of weighted median problems, which gives the solution in finitely many steps. A criterion of optimality follows from the fact that the minimizing functional F is convex, and therefore the point a ^?∈? ⁿ is the point of a global minimum of the functional F if and only if 0∈?F(a ^?).

Motivation for the construction of the algorithm was found in a geometrically visible algorithm for determining a best LAD-plane (x,y)?αx+βy, passing through the origin of the coordinate system, on the basis of the data (x _i ,y _i ,z _i ),i=1,…,m.     

Geometric Realizations of Lusztig’s Symmetries of Symmetrizable Quantum Groups

Let U be the quantum group and f be the Lusztig’s algebra associated with a symmetrizable generalized Cartan matrix. The algebra f can be viewed as the positive part of U. Lusztig introduced some symmetries T _i on U for all i ∈ I. Since T _i (f) is not contained in f, Lusztig considered two subalgebras _i f and ⁱ f of f for any i ∈ I, where _i f={x ∈ f | T _i (x) ∈ f} and \({^{i}\mathbf {f}}=\{x\in \mathbf {f}\,\,|\,\,T^{-1}_{i}(x)\in \mathbf {f}\}\). The restriction of T _i on _i f is also denoted by \(T_{i}:{_{i}\mathbf {f}}\rightarrow {^{i}\mathbf {f}}\). The geometric realization of f and its canonical basis are introduced by Lusztig via some semisimple complexes on the variety consisting of representations of the corresponding quiver. When the generalized Cartan matrix is symmetric, Xiao and Zhao gave geometric realizations of Lusztig’s symmetries in the sense of Lusztig. In this paper, we shall generalize this result and give geometric realizations of _i f, ⁱ f and \(T_{i}:{_{i}\mathbf {f}}\rightarrow {^{i}\mathbf {f}}\) by using the language ’quiver with automorphism’ introduced by Lusztig.     

A sharp eigenvalue theorem for fractional elliptic equations

The invisibility graph I(X) of a set X ? R ^d is a (possibly infinite) graph whose vertices are the points of X and two vertices are connected by an edge if and only if the straight-line segment connecting the two corresponding points is not fully contained in X. We consider the following three parameters of a set X: the clique number ω(I(X)), the chromatic number χ(I(X)) and the convexity number γ(X), which is the minimum number of convex subsets of X that cover X.We settle a conjecture of Matou?ek and Valtr claiming that for every planar set X, γ(X) can be bounded in terms of χ(I(X)). As a part of the proof we show that a disc with n one-point holes near its boundary has χ(I(X)) ≥ log log(n) but ω(I(X)) = 3.We also find sets X in R⁵ with χ(X) = 2, but γ(X) arbitrarily large.