Multiplication Operators on Invariant Subspaces of Function Spaces

Let M_φ be the operator of multiplication by φ on a Hilbert space of functions analytic on the open unit disk. For an invariant subspace F for the multiplication operator M_z, we derive some spectral properties of the multiplication operator M_φ : F → F. We characterize norm, spectrum, essential norm and essential spectrum of such operators when F has the codimension n property with n ∈ {1, 2, …, + ∞}.     

Parisi measures

In the Parisi theory of spin glasses, the limiting free energy of the system is computed by optimizing over a “functional order parameter”. In mathematical terms this amounts to construct certain functions F(μ) of a probability measure μ on [0,1] and to compute the infimum over μ. The study of the maps μ?F(μ) is a challenging problem of functional analysis. Progress on this problem seems required for further advances in the theory of spin glasses. The main objective of this paper is to explain the functional analysis part of the problems to the reader with no background (or interest) in spin glasses. As a first step in the study of these functions F(μ), we prove certain differentiability properties, that allow in certain cases to interpret (as conjectured by physicists) the Parisi measure (i.e. the probability μ at which F(μ) is minimum) in terms of spin glasses.     

Newtonian and Schinzel sequences in a domain

A Schinzel or F sequence in a domain is such that, for every ideal I with norm q, its first q terms form a system of representatives modulo I, and a Newton or N sequence such that the first q terms serve as a test set for integer-valued polynomials of degree less than q. Strong F and strong N sequences are such that one can use any set of q consecutive terms, not only the first ones, finally a very well F ordered sequence, for short, a V.W.F sequence, is such that, for each ideal I with norm q, and each integer s,{u_sq,…,u_(s+1)q−1} is a complete set of representatives modulo I. In a quasilocal domain, V.W.F sequences and N sequences are the same, so are strong F and strong N sequences. Our main result is that a strong N sequence is a sequence which is locally a strong F sequence, and an N sequence a sequence which is locally a V.W.F. sequence. We show that, for F sequences there is a bound on the number of ideals of a given norm. In particular, a sequence is a strong F sequence if and only if it is a strong N sequence and for each prime p, there is at most one prime ideal with finite residue field of characteristic p. All results are refined to sequences of finite length.     

On the regularity and stability of Pritchard-Salamon systems

Let Σ(S(⋅),B,−) be a Pritchard-Salamon system for (W,V), where W and V are Hilbert spaces. Suppose U is a Hilbert space and F∈L(W,U) is an admissible output operator, SBF(⋅) is the corresponding admissible perturbation C₀-semigroup. We show that the C₀-semigroup SBF(⋅) persists norm continuity, compactness and analyticity of C₀-semigroup S(⋅) on W and V, respectively. We also characterize the compactness and norm continuity of ΔBF(t)=SBF(t)−S(t) for t>0. In particular, we unexpectedly find that ΔBF(t) is norm continuous for t>0 on W and V if the embedding from W into V is compact. Moreover, from this we give some relations between the spectral bounds and growth bounds of SBF(⋅) and S(⋅), so we obtain some new stability results.     

How to Obtain Non-Flexible Quadratic Algebras as Mutation Algebras of Hurwitz Algebras

We present an elementary way to obtain new families of division algebras of degree n out of division algebras with a multiplicative norm. Families of four- and eight-dimensional non-flexible quadratic division algebras over a field F of characteristic not 2 are easily constructed as a-mutation algebras of Hurwitz division algebras A over F, choosing ${a \in A \setminus F}$ suitable. In particular, we thus obtain real eight-dimensional division algebras with large derivation algebras.     

A symmetric Roos bound for linear codes

The van Lint-Wilson AB-method yields a short proof of the Roos bound for the minimum distance of a cyclic code. We use the AB-method to obtain a different bound for the weights of a linear code. In contrast to the Roos bound, the role of the codes A and B in our bound is symmetric. We use the bound to prove the actual minimum distance for a class of dual BCH codes of length q²−1 over Fq. We give cyclic codes [63,38,16] and [65,40,16] over F₈ that are better than the known [63,38,15] and [65,40,15] codes.     

Multilinear enumerative techniques

When S is a finite set and G a finite group acting on S, we consider the problem of rejecting isomorphs in a G-stable subset of S. In previous work we developed a linear algebraic context for this problem by constructing the finite dimensional vector spaceF ^s whereF is a field of characteristic zero. When S is a finite function space, or a finite direct product of finite function spacesF ^s acquires a multilinear structure By various specializations ofG and S and by applications of results which have appeared elsewhere, identities of Sheehan, deBruijn and P61ya are obtained. Furthermore, these same techniques are applied to examples which do not have a clear resolution using the more common formulas     

Multigrid algorithms for symmetric discontinuous Galerkin methods on graded meshes

We study a class of symmetric discontinuous Galerkin methods on graded meshes. Optimal order error estimates are derived in both the energy norm and the L ₂ norm, and we establish the uniform convergence of V-cycle, F-cycle and W-cycle multigrid algorithms for the resulting discrete problems. Numerical results that confirm the theoretical results are also presented.     

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees

An approach for factoring general boolean functions was described in Golumbic and Mintz [Factoring logic functions using graph partitioning, in: Proceedings of IEEE/ACM International Conference on Computer Aided Design, November 1999, pp. 195-198] and Mintz and Golumbic [Factoring Boolean functions using graph partitioning, Discrete Appl. Math. 149 (2005) 131-153] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for recognizing and factoring read-once functions which is needed as a dedicated factoring subroutine to handle the lower levels of that factoring process. The algorithm is based on algorithms for cograph recognition and on checking normality.For non-read-once functions, we investigate their factoring based on their corresponding graph classes. In particular, we show that if a function F is normal and its corresponding graph is a partial k-tree, then F is a read 2^k function and a read 2^k formula for F can be obtained in polynomial time.     

Norm Principles for Forms of Higher Degree Permitting Composition

Let F be a field of characteristic 0 or greater than d. Scharlau's norm principle holds for finite field extensions K over F, for certain forms ? of degree d over F which permit composition.     

A simplified proof for the limit of a tower over a cubic finite field

Recently Bezerra, Garcia and Stichtenoth constructed an explicit tower F=(Fn)_n?0 of function fields over a finite field Fq³, whose limit λ(F)=limn→∞N(Fn)/g(Fn) attains the Zink bound λ(F)?2(q²−1)/(q+2). Their proof is rather long and very technical. In this paper we replace the complex calculations in their work by structural arguments, thus giving a much simpler and shorter proof for the limit of the Bezerra, Garcia and Stichtenoth tower.     

New semifields, PN and APN functions

We describe a method of proving that certain functions ${f:F\longrightarrow F}$ defined on a finite field F are either PN-functions (in odd characteristic) or APN-functions (in characteristic 2). This method is illustrated by giving short proofs of the APN-respectively the PN-property for various families of functions. The main new contribution is the construction of a family of PN-functions and their corresponding commutative semifields of dimension 4s in arbitrary odd characteristic. It is shown that a subfamily of order p ^4s for odd s > 1 is not isotopic to previously known examples.     

On n-term approximations with respect to frames bounded in L p (0, 1), 2 < p < ∞

In this paper, best canonical n-term approximations in the norm of the spaces L ²(0, 1) of the family I of characteristic functions of intervals are studied.     

An extremal problem for operators

Let A be a Banach algebra, F a compact set in the complex plane, and h a function holomorphic in some neighborhood of the set F. Thus h(a) is meaningful for each element a ε A whose spectrum σ(a) is contained in F, and it is possible to evaluate the norm |h(a)|. Problem: Compute the supremum of the norms |h(a) as a ranges over all elements of A with spectrum contained in F and whose norm does not exceed one; that is, compute sup{|h(a)|; a ε A, σ(a) ⊂ F, |a| ⩽ 1}. This problem was first formulated and treated by the author in the particular case where A is the algebra of all linear operators on a finite-dimensional Hilbert space and F is the disc {z; |z| ⩽ r} for a given positive number r<1. The paper discusses motivation, connections with complex function theory, convergence of iterative processes, critical exponents, and the infinite companion matrix.     

On the number of square classes of a field with finite stufe

Let F be a field of characteristic different from 2 and which is not formally real. Let q and s denote the number of square classes of F and the stufe of F respectively. In this paper, we give a new lower bound of q in terms of s, which greatly improves a result of I. Kaplansky and A. Pfister.     

On the Monte carlo boolean decision tree complexity of read-once formulae

In the boolean decision tree model there is at least a linear gap between the Monte Carlo and the Las Vegas complexity of a function depending on the error probability. We prove for a large class of read-once formulae that this trivial speed-up is the best that a Monte Carlo algorithm can achieve. For every formula F belonging to that class we show that the Monte Carlo complexity of F with two-sided error p is (1 ? 2p)R(F), and with one-sided error p is (1 ? p)R(F), where R(F) denotes the Las Vegas complexity of F. The result follows from a general lower bound that we derive on the Monte Carlo complexity of these formulae. This bound is analogous to the lower bound due to Saks and Wigderson on their Las Vegas complexity.     

On convergence of moment generating functions

Mukherjea et al. [Mukherjea, A., Rao, M., Suen, S., 2006. A note on moment generating functions. Statist. Probab. Lett. 76, 1185-1189] proved that if a sequence of moment generating functions M_n(t) converges pointwise to a moment generating function M(t) for all t in some open interval of the real line, not necessarily containing the origin, then the distribution functions F_n (corresponding to M_n) converge weakly to the distribution function F (corresponding to M). In this note, we improve this result and obtain conditions of the convergence which seem to be sharp: F_n converge weakly to F if M_n(t_k) converge to M(t_k), k=1,2,…, for some sequence {t₁,t₂,…} having the minimal and the maximal points. A similar result holds for characteristic functions.     

Continued fractions for certain algebraic power series

Let F be an arbitrary field and let K = F((x⁻¹)) be the field of formal Laurent series in x⁻¹ over F. The usual theory of continued fractions carries over to K, with the polynomials in x playing the role of the integers. We study the continued fraction expansions of elements of K which are algebraic over F(x), the field of rational functions of x.We give the first explicit expansions of algebraic elements of degree greater than 2 for which the degrees of the partial quotients are bounded. In particular we give explicitly the continued fraction expansion for the solution f in K of the cubic equation xf³ + f + x = 0 when F = GF(2). This cubic was studied by Baum and Sweet. We give examples, for every field F of characteristic greater than 2, of algebraic elements of degree greater than 2 whose partial quotients are all linear, and we give these expansions explicitly. These are the first known examples with partial quotients of bounded degree when F has characteristic greater than 2.     

On the gowers norms of certain functions

We consider functions f(x, y) whose smallness condition for the rectangular norm implies the smallness of the rectangular norm for f(x, x + y). We also study families of functions with a similar property for the higher Gowers norms. The method of proof is based on a transfer principle for sums between special systems of linear equations.     

Linear extensions,projections, and split faces

The main result is essentially: Let F be a closed split face of a compact convex set K such that A(F) is separable and has the (positive) metric approximation property. Then there is a (positive) linear extension operator from A(F) into A(K) of norm one.This is applied to C¹-algebras thus giving sufficient conditions for the existence of right inverses to surjective ¹-homomorphisms.