On the epicomplete monoreflection of an archimedean lattice-ordered group

In a category C an object it G is epicomplete if the only epic monics out of G are isomorphisms, epic or monic meant in the categorical sense of right or left cancellable. For each of the categories Arch: archimedean ?-groups with ?-homomorphisms, and its companion category W: Arch-objects with distinguished weak unit and unit-preserving ?-homomorphisms, (and for the corresponding categories of vector lattices) epicompleteness has been characterized as divisible and conditionally and laterally σ-complete, and it has been shown to be monoreflective. Denote the reflecting functors by β and β ^W , respectively. What are they? For W the Yosida representation has been used to realize β ^W A as a certain quotient of B (Y A), the Baire functions on the Yosida space of A. For Arch, very little has been known. Here we give a general representation theorem, Theorem A, for β G as a certain subdirect product of W-epicomplete objects derived from G. That result, some W-theory, and the relation between epicity and relative uniform density are then employed to show Theorem B: β C _K (Y)=B _L (Y), where C _K (Y)is the ?-group of continuous functions on Y with compact support and B _L (Y) is the ?-group of Baire functions on Y having Lindelöf cozero sets.     

Generalized radix representations and dynamical systems. IV

For r = (r₁,…, r_d) ∈ ?^d the mapping τ_r:?^d →?^d given byτ_r(a₁,…,a_d) = (a₂, …, a_d,−⌊r₁a₁+…+ r_da_d⌋)where ⌊·⌋ denotes the floor function, is called a shift radix system if for each a ∈ ?^d there exists an integer k > 0 with τ_r^k(a) = 0. As shown in Part I of this series of papers, shift radix systems are intimately related to certain well-known notions of number systems like β-expansibns and canonical number systems. After characterization results on shift radix systems in Part II of this series of papers and the thorough investigation of the relations between shift radix systems and canonical number systems in Part III, the present part is devoted to further structural relationships between shift radix systems and β-expansions. In particular we establish the distribution of Pisot polynomials with and without the finiteness property (F).     

Strong linear preservers of rank reverse permutability on triangular matrices

Let F be a field with ∣F∣ > 2 and T_n(F) be the set of all n × n upper triangular matrices, where n ? 2. Let k ? 2 be a given integer. A k-tuple of matrices A₁, …, A_k ∈ T_n(F) is called rank reverse permutable if rank(A₁ A₂ ? A_k) = rank(A_k A_k−1 ? A₁). We characterize the linear maps on T_n(F) that strongly preserve the set of rank reverse permutable matrix k-tuples.     

A folk model structure on omega-cat

The primary aim of this work is an intrinsic homotopy theory of strict ω-categories. We establish a model structure on ωCat, the category of strict ω-categories. The constructions leading to the model structure in question are expressed entirely within the scope of ωCat, building on a set of generating cofibrations and a class of weak equivalences as basic items. All objects are fibrant while free objects are cofibrant. We further exhibit model structures of this type on n-categories for arbitrary n∈N, as specializations of the ω-categorical one along right adjoints. In particular, known cases for n=1 and n=2 nicely fit into the scheme.     

Adjoining an Identity to a Reduced Archimedean f-ring, II: Algebras

In “Part I” (presented at Ord05 (Oxford, MS)), we have discussed, for reduced archimedean f-rings, the canonical extension of such a ring, A, to one with identity, uA, and the class U of u-extendable maps (i.e., homomorphisms which lift over the u’s to identity preserving homomorphisms). We showed that U is a category and u becomes a functor from U which is a monoreflection; the maps in U were characterized. This paper addresses the interaction between our functor u, and v , the vector lattice monoreflection in archimedean ?-groups (due to Conrad and Bleier). In short, v restricts to a monoreflection of reduced archimedean f-rings into reduced archimedean f-algebras, ψ ∈ U if and only if v ψ ∈ U, and vu is a monoreflection into reduced archimedean f-algebras with identity. This work was motivated by the question put to us by G. Buskes at Ord05: what maps are o-extendable; i.e., extend over the orthomorphism rings? (The orthomorphism ring oA is a unital extension of uA, and any o-extendable map lies in U.) While a complete answer seems quite complicated (if not hopelessly out of reach), here we shall identify a class of objects D for which oD = vuD and all maps from D lie in U, hence any map from D to a reduced archimedean f-algebra is o-extendable.     

Rank One Perturbations in a Pontryagin Space with One Negative Square

Let N₁ denote the class of generalized Nevanlinna functions with one negative square and let N_1, 0 be the subclass of functions Q(z)∈N₁ with the additional properties lim_y→∞ Q(iy)/y=0 and lim sup_y→∞ y |Im Q(iy)|<∞. These classes form an analytic framework for studying (generalized) rank one perturbations A(τ)=A+τ[·, ω] ω in a Pontryagin space setting. Many functions appearing in quantum mechanical models of point interactions either belong to the subclass N_1, 0 or can be associated with the corresponding generalized Friedrichs extension. In this paper a spectral theoretical analysis of the perturbations A(τ) and the associated Friedrichs extension is carried out. Many results, such as the explicit characterizations for the critical eigenvalues of the perturbations A(τ), are based on a recent factorization result for generalized Nevanlinna functions.     

Some lower bounds for the spectral radius of matrices using traces

Let A be an n×n matrix with eigenvalues λ₁,λ₂,…,λ_n, and let m be an integer satisfying rank(A)?m?n. If A is real, the best possible lower bound for its spectral radius in terms of m, trA and trA² is obtained. If A is any complex matrix, two lower bounds for are compared, and furthermore a new lower bound for the spectral radius is given only in terms of trA,trA²,‖A‖,‖A^∗A-AA^∗‖,n and m.     

On the Laczkovich-Komjáth property of sigma-ideals

Komjáth in 1984 proved that, for each sequence (An) of analytic subsets of a Polish space X, if lim supn∈HAn is uncountable for every H∈ω[N] then _?n∈GAn is uncountable for some G∈ω[N]. This fact, by our definition, means that the σ-ideal [X]^?ω has property (LK). We prove that every σ-ideal generated by X/E has property (LK), for an equivalence relation E⊂X² of type Fσ with uncountably many equivalence classes. We also show the parametric version of this result. Finally, the invariance of property (LK) with respect to various operations is studied.     

Characterization of the absence of a spectral gapfor a class of periodic Jacobi operators

Let q ∈ {2, 3} and let 0 = s₀ < s₁ < … < s_q = T be integers. For m, n ∈ Z, we put ¯m,n = {j ∈ Z| m? j ? n}. We set l_j = s_j − s_j−1 for j ∈ 1, q. Given (p₁,, p_q) ∈ R^q, let b: Z → R be a periodic function of period T such that b(·) = p_j on s_j−1 + 1, s_j for each j ∈ 1, q. We study the spectral gaps of the Jacobi operator (Ju)(n) = u(n + 1) + u(n − 1) + b(n)u(n) acting on l²(Z). By [λ_2j , λ_2j−1] we denote the jth band of the spectrum of J counted from above for j ∈ 1, T. Suppose that p_m ≠ p_n for m ≠ n. We prove that the statements (i) and (ii) below are equivalent for λ ∈ R and i ∈ 1, T − 1.     

Topological sums and products in ZF-set theory

In ZF, i.e., Zermelo-Fraenkel set theory without the axiom of choice, the category Top of topological spaces and continuous maps is well-behaved. In particular, Top has sums (=coproducts) and products. However, it may happen that for families (Xi)_i∈I and (Yi)_i∈I with the property that each Xi is homeomorphic to the corresponding Yi neither their sums _⊕i∈IXi and _⊕i∈IYi nor their products _∏i∈IXi and _∏i∈IYi are homeomorphic. It will be shown that the axiom of choice is not only sufficient but also necessary to rectify this defect.     

Density of sets of natural numbers and the Lévy group

Let N denote the set of positive integers. The asymptotic density of the set A⊆N is d(A)=limn→∞|A∩[1,n]|/n, if this limit exists. Let AD denote the set of all sets of positive integers that have asymptotic density, and let SN denote the set of all permutations of the positive integers N. The group L^? consists of all permutations f∈SN such that A∈AD if and only if f(A)∈AD, and the group L^* consists of all permutations f∈L^? such that d(f(A))=d(A) for all A∈AD. Let be a one-to-one function such that d(f(N))=1 and, if A∈AD, then f(A)∈AD. It is proved that f must also preserve density, that is, d(f(A))=d(A) for all A∈AD. Thus, the groups L^? and L^* coincide.     

Composition-closed ?-groups of almost-piecewise-linear functions

In the present work, we shall construct some non-essential H-closed epireflections of W that are not comparable with any other known H-closed epireflections of W other than the divisible hull and the epicompletion. We show first that the free objects in any H-closed epireflective subcategory must be closed under composition (see Section 2 for a precise definition), and that any epic extension of a free W-object on n generators that is closed under composition is actually the free object on n generators in some H-closed epireflective subcategory of W. We then apply these results to certain ?-groups of almost-piecewise-linear Baire functions on R. By definition, a function f:R→R is almost-piecewise-linear if there is a finite point set S⊂R such that f is piecewise-linear on the complement of any neighborhood of S.     

k-Potence preserving maps without the linearity and surjectivity assumptions

Let M_n be the space of all n × n complex matrices, and let Γ_n be the subset of M_n consisting of all n × n k-potent matrices. We denote by Ψ_n the set of all maps on M_n satisfying A − λB ∈ Γ_n if and only if ?(A) − λ?(B) ∈ Γ_n for every A,B ∈ M_n and λ ∈ C. It was shown that ? ∈ Ψ_n if and only if there exist an invertible matrix P ∈ M_n and c ∈ C with c^k−1 = 1 such that either ?(A) = cPAP⁻¹ for every A ∈ M_n, or ?(A) = cPA^TP⁻¹ for every A ∈ M_n.     

Particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix

An essential part of Cegielski’s [Obtuse cones and Gram matrices with non-negative inverse, Linear Algebra Appl. 335 (2001) 167-181] considerations of some properties of Gram matrices with nonnegative inverses, which are pointed out to be crucial in constructing obtuse cones, consists in developing some particular formulae for the Moore-Penrose inverse of a columnwise partitioned matrix A = (A₁ : A₂) under the assumption that it is of full column rank. In the present paper, these results are generalized and extended. The generalization consists in weakening the assumption mentioned above to the requirement that the ranges of A₁ and A₂ are disjoint, while the extension consists in introducing the conditions referring to the class of all generalized inverses of A.     

On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them

A full-rank under-determined linear system of equations Ax = b has in general infinitely many possible solutions. In recent years there is a growing interest in the sparsest solution of this equation—the one with the fewest non-zero entries, measured by ∥x∥₀. Such solutions find applications in signal and image processing, where the topic is typically referred to as “sparse representation”. Considering the columns of A as atoms of a dictionary, it is assumed that a given signal b is a linear composition of few such atoms. Recent work established that if the desired solution x is sparse enough, uniqueness of such a result is guaranteed. Also, pursuit algorithms, approximation solvers for the above problem, are guaranteed to succeed in finding this solution.Armed with these recent results, the problem can be reversed, and formed as an implied matrix factorization problem: Given a set of vectors {b_i}, known to emerge from such sparse constructions, Ax_i = b_i, with sufficiently sparse representations x_i, we seek the matrix A. In this paper we present both theoretical and algorithmic studies of this problem. We establish the uniqueness of the dictionary A, depending on the quantity and nature of the set {b_i}, and the sparsity of {x_i}. We also describe a recently developed algorithm, the K-SVD, that practically find the matrix A, in a manner similar to the K-Means algorithm. Finally, we demonstrate this algorithm on several stylized applications in image processing.     

Distance-hereditary graphs and signpost systems

An ordered pair (U,R) is called a signpost system if U is a finite nonempty set, R⊆U×U×U, and the following axioms hold for all u,v,w∈U: (1) if (u,v,w)∈R, then (v,u,u)∈R; (2) if (u,v,w)∈R, then (v,u,w)∉R; (3) if u≠v, then there exists t∈U such that (u,t,v)∈R. (If F is a (finite) connected graph with vertex set U and distance function d, then U together with the set of all ordered triples (u,v,w) of vertices in F such that d(u,v)=1 and d(v,w)=d(u,w)−1 is an example of a signpost system). If (U,R) is a signpost system and G is a graph, then G is called the underlying graph of (U,R) if V(G)=U and xy∈E(G) if and only if (x,y,y)∈R (for all x,y∈U). It is possible to say that a signpost system shows a way how to travel in its underlying graph. The following result is proved: Let (U,R) be a signpost system and let G denote the underlying graph of (U,R). Then G is connected and every induced path in G is a geodesic in G if and only if (U,R) satisfies axioms (4)-(8) stated in this paper; note that axioms (4)-(8)-similarly as axioms (1)-(3)-can be formulated in the language of the first-order logic.     

The complexity of the weight problem for permutation and matrix groups

Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element π∈G such that d(π,e)=k, for some given value k. Here we show that this problem is NP-complete for many well-known metrics. An analogous problem in matrix groups, eigenvalue-free problem, and two related problems in permutation groups, the maximum and minimum weight problems, are also investigated in this paper.     

Quotient-reflective and bireflective subcategories of the category of preordered sets

In previous papers, the notions of “closedness” and “strong closedness” in set-based topological categories were introduced. In this paper, we give the characterization of closed and strongly closed subobjects of an object in the category Prord of preordered sets and show that they form appropriate closure operators which enjoy the basic properties like idempotency (weak) hereditariness, and productivity.We investigate the relationships between these closure operators and the well-known ones, the up- and down-closures. As a consequence, we characterize each of T₀, T₁, and T₂ preordered sets and show that each of the full subcategories of each of T₀, T₁, T₂ preordered sets is quotient-reflective in Prord. Furthermore, we give the characterization of each of pre-Hausdorff preordered sets and zero-dimensional preordered sets, and show that there is an isomorphism of the full subcategory of zero-dimensional preordered sets and the full subcategory of pre-Hausdorff preordered sets. Finally, we show that both of these subcategories are bireflective in Prord.     

Piecewise linear maps, Liapunov exponents and entropy

Let be a class of piecewise linear maps associated with a transition matrix A. In this paper, we prove that if fA,x∈LA, then the Liapunov exponent λ(x) of fA,x is equal to a measure theoretic entropy hmA,x of fA,x, where mA,x is a Markov measure associated with A and x. The Liapunov exponent and the entropy are computable by solving an eigenvalue problem and can be explicitly calculated when the transition matrix A is symmetric. Moreover, we also show that maxxλ(x)=maxxhmA,x=log(λ₁), where λ₁ is the maximal eigenvalue of A.