Generalized characters of the symmetric group

Normalized irreducible characters of the symmetric group S(n) can be understood as zonal spherical functions of the Gelfand pair (S(n)×S(n),diagS(n)). They form an orthogonal basis in the space of the functions on the group S(n) invariant with respect to conjugations by S(n). In this paper we consider a different Gelfand pair connected with the symmetric group, that is an “unbalanced” Gelfand pair (S(n)×S(n−1),diagS(n−1)). Zonal spherical functions of this Gelfand pair form an orthogonal basis in a larger space of functions on S(n), namely in the space of functions invariant with respect to conjugations by S(n−1). We refer to these zonal spherical functions as normalized generalized characters of S(n). The main discovery of the present paper is that these generalized characters can be computed on the same level as the irreducible characters of the symmetric group. The paper gives a Murnaghan-Nakayama type rule, a Frobenius type formula, and an analogue of the determinantal formula for the generalized characters of S(n).     

Zonal Functions for the Unitary Groups and Applications to Hermitian Lattices

We study the decomposition of the space L²(Sⁿ⁻¹) under the actions of the complex and quaternionic unitary groups. We give an explicit basis for the space of zonal functions, which in the second case takes account of the action of the group of quaternions of norm 1. We derive applications to hermitian lattices.     

Computing ECT-B-splines recursively

ECT-spline curves for sequences of multiple knots are generated from different local ECT-systems via connection matrices. Under appropriate assumptions there is a basis of the space of ECT-splines consisting of functions having minimal compact supports, normalized to form a nonnegative partition of unity. The basic functions can be defined by generalized divided differences [24]. This definition reduces to the classical one in case of a Schoenberg space. Under suitable assumptions it leads to a recursive method for computing the ECT-B-splines that reduces to the de Boor–Mansion–Cox recursion in case of ordinary polynomial splines and to Lyche's recursion in case of Tchebycheff splines. For sequences of simple knots and connection matrices that are nonsingular, lower triangular and totally positive the spline weights are identified as Neville–Aitken weights of certain generalized interpolation problems. For multiple knots they are limits of Neville–Aitken weights. In many cases the spline weights can be computed easily by recurrence. Our approach covers the case of Bézier-ECT-splines as well. They are defined by different local ECT-systems on knot intervals of a finite partition of a compact interval [a,b] connected at inner knots all of multiplicities zero by full connection matrices A ^[i] that are nonsingular, lower triangular and totally positive. In case of ordinary polynomials of order n they reduce to the classical Bézier polynomials. We also present a recursive algorithm of de Boor type computing ECT-spline curves pointwise. Examples of polynomial and rational B-splines constructed from given knot sequences and given connection matrices are added. For some of them we give explicit formulas of the spline weights, for others we display the B-splines or the B-spline curves. *Supported in part by INTAS 03-51-6637.     

Optimal smoothing and interpolating splines with constraints

This paper considers the problem for designing optimal smoothing and interpolating splines with equality and/or inequality constraints. The splines are constituted by employing normalized uniform B-splines as the basis functions, namely as weighted sum of shifted B-splines of degree k. Then a central issue is to determine an optimal vector of the so-called control points. By employing such an approach, it is shown that various types of constraints are formulated as linear function of the control points, and the problems reduce to quadratic programming problems. We demonstrate the effectiveness and usefulness by numerical examples including approximation of probability density functions, approximation of discontinuous functions, and trajectory planning.     

Orthogonal Zonal, Tesseral and Sectorial Wavelets on the Sphere for the Analysis of Satellite Data

The spherical harmonics Y _n,k } _{n=0,1,...;k=?n,...,n} represent a standard complete orthonormal system in ?²(Ω), where Ω is the unit sphere. In view of present and future satellite missions (e.g., for the determination of the Earth's gravity field) it is of particular importance to treat the different accuracies and sizes of data in dependence of the index pairs (n,k). It is, e.g., known that the GOCE mission yields essentially less accurate data in the zonal (k=0) case. Therefore, this paper presents new ways of constructing multiresolutions for a Sobolev space of functions on Ω allowing the separate treatment of certain classes of pairs (n,k) and, in particular, the separate treatment of different orders k. Orthogonal bandlimited as well as non-bandlimited detail and scale spaces adapted to certain (geo)scientific problems and to the character of the given data can now be used. Finally, an explicit representation of a non-bandlimited wavelet on Ω yielding an orthogonal decomposition of the function space is calculated for the first time.     

Two-scale symbol and autocorrelation symbol for B-splines with multiple knots

The Fourier transforms of B-splines with multiple integer knots are shown to satisfy a simple recursion relation. This recursion formula is applied to derive a generalized two-scale relation for B-splines with multiple knots. Furthermore, the structure of the corresponding autocorrelation symbol is investigated. In particular, it can be observed that the solvability of the cardinal Hermite spline interpolation problem for spline functions of degree 2m+1 and defectr, first considered by Lipow and Schoenberg [9], is equivalent to the Riesz basis property of our B-splines with degreem and defectr. In this way we obtain a new, simple proof for the assertion that the cardinal Hermite spline interpolation problem in [9] has a unique solution.     

Extensions of some fixed point theorems of Rhoades

The classical Radon transform, R, maps an integrable function in Rⁿ to its integrals over all n ? 1 dimensional hyperplanes, and the exterior Radon transform is the transform R restricted to hyperplanes that do not intersect a given disc. A singular value decomposition for the exterior transform is given for spaces of square integrable functions on the exterior of the disc. This decomposition in orthogonal functions explicitly produces the null space and range of the exterior transform and gives a new method for inverting the transform modulo the null space. A modification of this method is given that will exactly invert functions of compact support. These results generalize theorems of R. M. Perry and the author. A singular value decomposition for the Radon transform that integrates over spheres in Rⁿ containing the origin is also given. This follows from the singular value decomposition for R and yields the null space and a new inversion method for this transform.     

Rudin orthogonality problem on the Bergman space

In this paper, we study the Rudin orthogonality problem on the Bergman space, which is to characterize those functions bounded analytic on the unit disk whose powers form an orthogonal set in the Bergman space of the unit disk. We completely solve the problem if those functions are univalent in the unit disk or analytic in a neighborhood of the closed unit disk. As a consequence, it is shown that an analytic multiplication operator on the Bergman space is unitarily equivalent to a weighted unilateral shift of finite multiplicity n if and only if its symbol is a constant multiple of the n-th power of a Möbius transform, which was obtained via the Hardy space theory of the bidisk in Sun et al. (2008) [10].     

A Basis of Bideterminants for the Coordinate Ring of the Orthogonal Group

We give a basis of bideterminants for the coordinate ring K[O(n)] of the orthogonal group O(n,K), where K is an infinite field of characteristic not 2. The bideterminants are indexed by pairs of Young tableaux which are O(n)-standard in the sense of King–Welsh. We also give an explicit filtration of K[O(n)] as an O(n,K)-bimodule, whose factors are isomorphic to the tensor product of orthogonal analogs of left and right Schur modules.     

Sometimes effective Thue-Siegel-Roth-Schmidt-Nevanlinna bounds,or better

This paper will do the following: (1) Establish a (better than) Thue-Siegel-Roth-Schmidt theorem bounding the approximation of solutions of linear differential equations over valued differential fields; (2) establish an effective better than Thue-Siegel-Roth-Schmidt theorem bounding the approximation of irrational algebraic functions (of one variable over a constant field of characteristic zero) by rational functions; (3) extend Nevanlinna's Three Small Function Theorem to an n small function theorem (for each positve integer n), by removing Chuang's dependence of the bound upon the relative “number” of poles and zeros of an auxiliary function; (4) extend this n Small Function Theorem to the case in which the n small functions are algebroid (a case which has applications in functional equations); (5) solidly connect Thue-Siegel-Roth-Schmidt approximation theory for functions with many of the Nevanlinna theories. The method of proof is (ultimately) based upon using a Thue-Siegel-Roth-Schmidt type auxiliary polynomial to construct an auxiliary differential polynomial.     

Hardy-type inequalities on planar and spatial open sets

Several Hardy-type inequalities with explicit constants are proved for compactly supported smooth functions on open sets in the Euclidean space ? ⁿ .     

On the n-dimensional Dirichlet problem for isometric maps

We exhibit explicit Lipschitz maps from Rn to Rn which have almost everywhere orthogonal gradient and are equal to zero on the boundary of a cube. We solve the problem by induction on the dimension n.     

Curved Koszul duality of algebras over unital versions of binary operads

We develop a curved Koszul duality theory for algebras presented by quadratic-linear-constant relations over unital versions of binary quadratic operads. As an application, we study Poisson n-algebras given by polynomial functions on a standard shifted symplectic space. We compute explicit resolutions of these algebras using curved Koszul duality. We use these resolutions to compute derived enveloping algebras and factorization homology on parallelized simply connected closed manifolds with coefficients in these Poisson n-algebras.     

Tensor invariants for certain subgroups of the orthogonal group

Let V be an n-dimensional vector space, and let O _n be the orthogonal group. Motivated by a question of B. Szegedy (J. Am. Math. Soc. 20(4), 2007), about the rank of edge connection matrices of partition functions of vertex models, we give a combinatorial parameterization of tensors in V ^?k invariant under certain subgroups of the orthogonal group. This allows us to give an answer to this question for vertex models with values in an algebraically closed field of characteristic zero.     

Embedding constants for periodic Sobolev spaces of fractional order

We obtain an explicit expression for the norms of the embedding operators of the periodic Sobolev spaces into the space of continuous functions (the norms of this type are usually called embedding constants). The corresponding formulas for the embedding constants express them in terms of the values of the well-known Epstein zeta function which depends on the smoothness exponent s of the spaces under study and the dimension n of the space of independent variables. We establish that the embeddings under consideration have the embedding functions coinciding up to an additive constant and a scalar factor with the values of the corresponding Epstein zeta function. We find the asymptotics of the embedding constants as s → n/2.     

On stochastic generation of ultrametrics in high-dimensional Euclidean spaces

We present a proof of the theorem which states that a matrix of Euclidean distances on a set of specially distributed random points in the n-dimensional Euclidean space R ⁿ converges in probability to an ultrametric matrix as n → ∞. Values of the elements of an ultrametric distance matrix are completely determined by variances of coordinates of random points. Also we present a probabilistic algorithm for generation of finite ultrametric structures of any topology in high-dimensional Euclidean space. Validity of the algorithm is demonstrated by explicit calculations of distance matrices and ultrametricity indexes for various dimensions n.     

Spherical functions on Euclidean space

We study spherical functions on Euclidean spaces from the viewpoint of Riemannian symmetric spaces. Here the Euclidean space En=G/K where G is the semidirect product Rn⋅K of the translation group with a closed subgroup K of the orthogonal group O(n). We give exact parameterizations of the space of (G,K)—spherical functions by a certain affine algebraic variety, and of the positive definite ones by a real form of that variety. We give exact formulae for the spherical functions in the case where K is transitive on the unit sphere in En.     

Model recovery for Hammerstein systems using the auxiliary model based orthogonal matching pursuit method

This article investigates parameter and order identification of a block-oriented Hammerstein system by using the orthogonal matching pursuit method in the compressive sensing theory which deals with how to recover a sparse signal in a known basis with a linear measurement model and a small set of linear measurements. The idea is to parameterize the Hammerstein system into the linear measurement model containing a measurement matrix with some unknown variables and a sparse parameter vector by using the key variable separation principle, then an auxiliary model based orthogonal matching pursuit algorithm is presented to recover the sparse vector.The standard orthogonal matching pursuit algorithm with a known measurement matrix is a popular recovery strategy by picking the supporting basis and the corresponding non-zero element of a sparse signal in a greedy fashion. In contrast to this, the auxiliary model based orthogonal matching pursuit algorithm has unknown variables in the measurement matrix. For a K-sparse signal, the standard orthogonal matching pursuit algorithm takes a fixed number of K stages to pick K columns (atoms) in the measurement matrix, while the auxiliary model based orthogonal matching pursuit algorithm takes steps larger than K to pick K atoms in the measurement matrix with the process of picking and deleting atoms, due to the gradually accurate estimates of the unknown variables step by step.The auxiliary model based orthogonal matching pursuit algorithm can simultaneously identify parameters and orders of the Hammerstein system, and has a high efficient identification performance.     

Projective pseudodifferential analysis and harmonic analysis

We consider pseudodifferential operators on functions on Rn+1 which commute with the Euler operator, and can thus be restricted to spaces of functions homogeneous of some given degree. The symbols of such restrictions can be regarded as functions on a reduced phase space, isomorphic to the homogeneous space Gn/Hn=SL(n+1,R)/GL(n,R), and the resulting calculus is a pseudodifferential analysis of operators acting on spaces of appropriate sections of line bundles over the projective space Pn(R): these spaces are the representation spaces of the maximal degenerate series (πiλ,ε) of Gn. This new approach to the quantization of Gn/Hn, already considered by other authors, has several advantages: as an example, it makes it possible to give a very explicit version of the continuous part from the decomposition of L²(Gn/Hn) under the quasiregular action of Gn. We also consider interesting special symbols, which arise from the consideration of the resolvents of certain infinitesimal operators of the representation πiλ,ε.     

An approximation problem of noisy data by cubic and bicubic splines

Smoothing of noisy data has always been a topic of interest in many areas where computer simulations have been performed, including natural sciences as well as economics and social sciences. In this paper we present an approximation method of explicit curves or surfaces from exact and noisy data by fairness cubic or bicubic splines. A variational problem of explicit curves or surfaces is obtained by minimizing a quadratic functional in a space of cubic or bicubic splines from noisy data. We show the existence and uniqueness of this problem as long as a convergence result especially for noisy data is carefully established. We analyze some numerical and graphical examples using fictional noisy data in order to prove the validity of our method.