Chowla’s cosine problem

A continuous linear map T from a Banach algebra A into another B approximately preserves the zero products if ‖T(a)T(b)‖ ≤ α‖a‖‖b‖ (a,b ∈ A, ab = 0) for some small positive α. This paper is mainly concerned with the question of whether any continuous linear surjective map T: A → B that approximately preserves the zero products is close to a continuous homomorphism from A onto B with respect to the operator norm. We show that this is indeed the case for amenable group algebras.     

Sumsets of dense sets and sparse sets

R. Jin showed that whenever A and B are sets of integers having positive upper Banach density, the sumset A+B:= «a+b: a ∈ A, b ∈ B» is piecewise syndetic. This result was strengthened by Bergelson, Furstenberg, and Weiss to conclude that A+B must be piecewise Bohr. We generalize the latter result to cases where A has Banach density 0, giving a new proof of the previous results in the process.     

Effects of Inspection Errors on Dorfman Screening Procedures with Random Group-Size: A Note on Kemp and Kemp's ‘Simple Inspection Scheme for Two Types of Defect’

Kemp and Kemp have proposed a scheme of inspection for two types (A and B) of non-conformity. There is serial inspection for type A, continuing until a sequence of k successive As is observed. These k items are discarded, and all previous items (since the last inspection for A) are subject to a Dorfman group-screening inspection procedure for B. We develop formulae for the properties of this scheme, when inspection (for both A and B) may not be perfect, allowing for both false negatives and false positives. Some numerical values given by the formulae are presented, with a view to assessing the robustness of Kemp and Kemp's scheme.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

Special issue: recent progress on iterative methods for large systems of equations

Let A x = b be a large and sparse system of linear equations where A is a nonsingular matrix. An approximate solution is frequently obtained by applying preconditioned iterations. Consider the matrix B = A + P Q ^T where \(P, Q \in \mathbb {R}^{n \times k}\) are full rank matrices. In this work, we study the problem of updating a previously computed preconditioner for A in order to solve the updated linear system B x = b by preconditioned iterations. In particular, we propose a method for updating a Balanced Incomplete Factorization preconditioner. The strategy is based on the computation of an approximate Inverse Sherman-Morrison decomposition for an equivalent augmented linear system. Approximation properties of the preconditioned matrix and an analysis of the computational cost of the algorithm are studied. Moreover, the results of the numerical experiments with different types of problems show that the proposed method contributes to accelerate the convergence.     

Equations in finite fields with restricted solution sets. I (Character sums)

In earlier papers, for “large” (but otherwise unspecified) subsets A, B of Z _p and for h(x) ∈ Z _p [x], Gyarmati studied the solvability of the equations a + b = h(x), resp. ab = h(x) with a ∈ A, b ∈ B, x ∈ Z _p , and for large subsets A, B, C, D of Z _p Sárközy showed the solvability of the equations a + b = cd, resp. ab + 1 = cd with a ∈ A, b ∈ B, c ∈ C, d ∈ D. In this series of papers equations of this type will be studied in finite fields. In particular, in Part I of the series we will prove the necessary character sum estimates of independent interest some of which generalize earlier results.     

Two Bilinear (3 × 3)-Matrix Multiplication Algorithms of Complexity 25

As is known, a bilinear algorithm for multiplying 3 × 3 matrices can be constructed by using ordered triples of 3 × 3 matrices A _ρ , B _ρ , C _ρ , \(\rho = \overline {1,r} ,\) where r is the complexity of the algorithm. Algorithms with various symmetries are being extensively studied. This paper presents two algorithms of complexity 25 possessing the following two properties (symmetries): (1) the matricesA₁,B₁, and C1 are identity, (2) if the algorithm involves a tripleA, B, C, then it also involves the triples B, C, A and C, A, B. For example, these properties are inherent in the well-known Strassen algorithm for multiplying 2 × 2 matrices. Many existing (3 × 3)-matrix multiplication algorithms have property (2). Methods for finding new algorithms are proposed. It is shown that the found algorithms are different and new.     

Factorization of cp-rank-3 completely positive matrices

A symmetric positive semi-definite matrix A is called completely positive if there exists a matrix B with nonnegative entries such that A = BB^?. If B is such a matrix with a minimal number p of columns, then p is called the cp-rank of A. In this paper we develop a finite and exact algorithm to factorize any matrix A of cp-rank 3. Failure of this algorithm implies that A does not have cp-rank 3. Our motivation stems from the question if there exist three nonnegative polynomials of degree at most four that vanish at the boundary of an interval and are orthonormal with respect to a certain inner product.     

On a question of Sárközy on gaps of product sequences

Motivated by a question of Sárközy, we study the gaps in the product sequence B = A · A = {b ₁ < b ₂ < …} of all products a _i a _j with a _i , a _j ∈ A when A has upper Banach density α > 0. We prove that there are infinitely many gaps b _n+1 ? b _n ? α ^?3 and that for t ≥ 2 there are infinitely many t-gaps b _n+t ? b _n ? t ² α ^?4. Furthermore, we prove that these estimates are best possible.We also discuss a related question about the cardinality of the quotient set A/A = {a _i /a _j , a _i , a _j ∈ A} when A ? {1, …, N} and |A| = αN.     

On Generalized Derivations and Centralizers of Operator Algebras with Involution

Let B(H) be the algebra of all bounded linear operators on a complex Hilbert space H and A(H) ? B(H) be a standard operator algebra which is closed under the adjoint operation. Let F: A(H)→ B(H) be a linear mapping satisfying F(AA*A) = F(A)A*A + Ad(A*)A + AA*d(A) for all A ∈ A(H), where the associated linear mapping d: A(H) → B(H) satisfies the relation d(AA*A) = d(A)A*A + Ad(A*)A + AA*d(A) for all A ∈ A(H). Then F is of the form F(A) = SA ? AT for all A ∈ A(H) and some S, T ∈ B(H), that is, F is a generalized derivation. We also prove some results concerning centralizers on A(H) and semisimple H^*-algebras.     

Inversion and subspaces of a finite field

Consider two F _q -subspaces A and B of a finite field, of the same size, and let A ^?1 denote the set of inverses of the nonzero elements of A. The author proved that A ^?1 can only be contained in A if either A is a subfield, or A is the set of trace zero elements in a quadratic extension of a field. Csajbók refined this to the following quantitative statement: if A ^?1 ? B, then the bound |A ^?1∩B| ≤ 2|B|/q ? 2 holds. He also gave examples showing that his bound is sharp for |B| ≤ q ³. Our main result is a proof of the stronger bound |A ^?1 ∩ B| ≤ |B|/q · (1 + O _d (q ^?1/2)), for |B| = q ^d with d > 3. We also classify all examples with |B| ≤ q ³ which attain equality or near-equality in Csajbók’s bound.     

Twisted Frobenius Extensions of Graded Superrings

We define twisted Frobenius extensions of graded superrings. We develop equivalent definitions in terms of bimodule isomorphisms, trace maps, bilinear forms, and dual sets of generators. The motivation for our study comes from categorification, where one is often interested in the adjointness properties of induction and restriction functors. We show that A is a twisted Frobenius extension of B if and only if induction of B-modules to A-modules is twisted shifted right adjoint to restriction of A-modules to B-modules. A large (non-exhaustive) class of examples is given by the fact that any time A is a Frobenius graded superalgebra, B is a graded subalgebra that is also a Frobenius graded superalgebra, and A is projective as a left B-module, then A is a twisted Frobenius extension of B.     

Filter factors of truncated tls regularization with multiple observations

The total least squares (TLS) and truncated TLS (T-TLS) methods are widely known linear data fitting approaches, often used also in the context of very ill-conditioned, rank-deficient, or ill-posed problems. Regularization properties of T-TLS applied to linear approximation problems Ax ≈ b were analyzed by Fierro, Golub, Hansen, and O’Leary (1997) through the so-called filter factors allowing to represent the solution in terms of a filtered pseudoinverse of A applied to b. This paper focuses on the situation when multiple observations b ₁,..., b _d are available, i.e., the T-TLS method is applied to the problem AX ≈ B, where B = [b ₁,..., b _d ] is a matrix. It is proved that the filtering representation of the T-TLS solution can be generalized to this case. The corresponding filter factors are explicitly derived.     

An Optimal Heuristic For Coordinated Multi-Item Inventory Replenishments

The inventory control problem can be vastly simplified if the replenishments of inventory items are coordinated with one another. That is, whenever an item is replenished, n other items, where n is a decision variable, are also replenished. One way to ensure this would be to classify the inventory items into several groups with a common order interval for each group. In this paper we establish that the optimal groups will be consecutive by hD/A, where h, D and A are the holding cost, demand rate and set-up cost of an item respectively. Using this property of consecutiveness, we develop a fast converging heuristic to create m groups optimally, m = 2, 3,..., M. The heuristic is a substitute for the dynamic programme which would otherwise be necessary and it has the potential for nomographic applications.     

A note on the perturbations of compact quantum metric spaces

In this short note,we consider the perturbation of compact quantum metric spaces.We first show that for two compact quantum metric spaces(A,P) and(B,Q) for which A and B are subspaces of an order-unit space C and P and Q are Lip-norms on A and B respectively,the quantum Gromov–Hausdorff distance between(A,P) and(B,Q) is small under certain conditions.Then some other perturbation results on compact quantum metric spaces derived from spectral triples are also given.     

Categorical resolutions of a class of derived categories

We clarify the relation between the subcategory D_(hf)~b(A) of homological finite objects in D~b(A)and the subcategory K~b(P) of perfect complexes in D~b(A), by giving two classes of abelian categories A with enough projective objects such that D_(hf)~b(A) = K~b(P), and finding an example such that D_(hf)~b(A)≠K~b(P). We realize the bounded derived category D~b(A) as a Verdier quotient of the relative derived category D_C~b(A), where C is an arbitrary resolving contravariantly finite subcategory of A. Using this relative derived categories, we get categorical resolutions of a class of bounded derived categories of module categories of infinite global dimension.We prove that if an Artin algebra A of infinite global dimension has a module T with inj.dimT ∞ such that ~⊥T is finite, then D~b(modA) admits a categorical resolution; and that for a CM(Cohen-Macaulay)-finite Gorenstein algebra, such a categorical resolution is weakly crepant.     

A modified large-scale structure-preserving doubling algorithm for a large-scale Riccati equation from transport theory

A large scale nonsymmetric algebraic Riccati equation XCX ? XE ? AX + B = 0 arising in transport theory is considered, where the n × n coefficient matrices B,C are symmetric and low-ranked and A, E are rank one updates of nonsingular diagonal matrices. By introducing a balancing strategy and setting appropriate initial matrices carefully, we can simplify the large-scale structure-preserving doubling algorithm (SDA_ls) for this special equation. We give modified large-scale structure-preserving doubling algorithm, which can reduce the flop count of original SDA_ls by half. Numerical experiments illustrate the effectiveness of our method.     

Secondary Hochschild Cohomology

For a B-algebra A we introduce a Hochschild-like cohomology and use it to describe simultaneous deformations of the product and of the B-algebra structure on A[[t]]. These deformations have the property that the natural projection A[[t]]→A is a morphism of B-algebras.     

A Mayer–Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions

In algebraic topology it is well known that, using the Mayer–Vietoris sequence, the homology of a space X can be studied by splitting X into subspaces A and B and computing the homology of A, B, and A∩B. A natural question is: To what extent does persistent homology benefit from a similar property? In this paper we show that persistent homology has a Mayer–Vietoris sequence that is generally not exact but only of order 2. However, we obtain a Mayer–Vietoris formula involving the ranks of the persistent homology groups of X, A, B, and A∩B plus three extra terms. This implies that persistent homological features of A and B can be found either as persistent homological features of X or of A∩B. As an application of this result, we show that persistence diagrams are able to recognize an occluded shape by showing a common subset of points.     

Translation Invariant Asymptotic Homomorphisms and Extensions of <Emphasis Type="Italic">C</Emphasis>*-Algebras

Let A and B be C*-algebras, let A be separable, and let B be σ-unital and stable. We introduce the notion of translation invariance for asymptotic homomorphisms from S A = C₀(?) ? A to B and show that the Connes—Higson construction applied to any extension of A by B is homotopic to a translation invariant asymptotic homomorphism. In the other direction we give a construction which produces extensions of A by B from a translation invariant asymptotic homomorphism. This leads to our main result that the homotopy classes of extensions coincide with the homotopy classes of translation invariant asymptotic homomorphisms.