On structural decompositions of finite frames

A frame in an n-dimensional Hilbert space H _n is a possibly redundant collection of vectors {f _i } _i∈I that span the space. A tight frame is a generalization of an orthonormal basis. A frame {f _i } _i∈I is said to be scalable if there exist nonnegative scalars {c _i } _i∈I such that {c _i f _i } _i∈I is a tight frame. In this paper we study the combinatorial structure of frames and their decomposition into tight or scalable subsets by using partially-ordered sets (posets). We define the factor poset of a frame {f _i } _i∈I to be a collection of subsets of I ordered by inclusion so that nonempty J?I is in the factor poset iff {f _j } _j∈J is a tight frame for H _n . We study various properties of factor posets and address the inverse factor poset problem, which inquires when there exists a frame whose factor poset is some given poset P. We then turn our attention to scalable frames and present partial results regarding when a frame can be scaled to have a given factor poset; in doing so we present a bridge between erasure resilience (as studied via prime tight frames) and scalability.     

Kolmogorov type inequalities for norms of Riesz derivatives of multivariate functions and some applications

Let L _∞,s ¹ (? ^m ) be the space of functions f ∈ L _∞(? ^m ) such that ?f/?x _i ∈ L _s (? ^{m) for each i = 1, ...,m} . New sharp Kolmogorov type inequalities are obtained for the norms of the Riesz derivatives ∥D ^α f∥_∞ of functions f ∈ L _∞,s ¹ (? ^m ). Stechkin’s problem on approximation of unbounded operators D ^α by bounded operators on the class of functions f ∈ L _∞,s ¹ (? ^m ) such that ∥?f∥ _s ≤ 1 and the problem of optimal recovery of the operator D ^α on elements from this class given with error δ are solved.     

Equivariant cohomology distinguishes the geometric structures of toric hyperkähler manifolds

Toric hyperkähler manifolds are the hyperkähler analogue of symplectic toric manifolds. The theory of Bielawski and Dancer tells us that, while a symplectic toric manifold is determined by a Delzant polytope, a toric hyperkähler manifold is determined by a smooth hyperplane arrangement. The purpose of this paper is to show that a toric hyperkähler manifold up to weak hyperhamiltonian T -isometry is determined not only by a smooth hyperplane arrangement up to weak linear equivalence but also by its equivariant cohomology H* _T (M; ?) with a point â in H ²(M;?) \ {0} up to weak H*(BT; ?)-algebra isomorphism preserving â.     

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.     

The degree of biholomorphic mappings between special domains in ℂ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> preserving 0

Let G _i be a closed Lie subgroup of U(n), Ω _i be a bounded G _i -invariant domain in C ⁿ which contains 0, and \(O{\left( {{\mathbb{C}^n}} \right)^{{G_i}}} = \mathbb{C}\), for i = 1; 2. If f: Ω₁ → Ω₂ is a biholomorphism, and f(0) = 0, then f is a polynomial mapping (see Ning et al. (2017)). In this paper, we provide an upper bound for the degree of such polynomial mappings. It is a natural generalization of the well-known Cartan’s theorem.     

Extracting outer function part from Hardy space function

Any analytic signal fa(e~(it)) can be written as a product of its minimum-phase signal part(the outer function part) and its all-phase signal part(the inner function part). Due to the importance of such decomposition, Kumarasan and Rao(1999), implementing the idea of the Szeg?o limit theorem(see below),proposed an algorithm to obtain approximations of the minimum-phase signal of a polynomial analytic signal fa(e~(it)) = e~(iN0t)M∑k=0a_k~(eikt),(0.1)where a_0≠ 0, a_M≠ 0. Their method involves minimizing the energy E(f_a, h_1, h_2,..., h_H) =1/(2π)∫_0~(2π)|1+H∑k=1h_k~(eikt)|~2|fa(e~(it))|~2dt(0.2) with the undetermined complex numbers hk's by the least mean square error method. In the limiting procedure H →∞, one obtains approximate solutions of the minimum-phase signal. What is achieved in the present paper is two-fold. On one hand, we rigorously prove that, if fa(e~(it)) is a polynomial analytic signal as given in(0.1),then for any integer H≥M, and with |fa(e~(it))|~2 in the integrand part of(0.2) being replaced with 1/|fa(e~(it))|~2,the exact solution of the minimum-phase signal of fa(e~(it)) can be extracted out. On the other hand, we show that the Fourier system e~(ikt) used in the above process may be replaced with the Takenaka-Malmquist(TM) system, r_k(e~(it)) :=((1-|α_k|~2e~(it))/(1-α_ke~(it))~(1/2)∏_(j=1)~(k-1)(e~(it)-α_j/(1-α_je~(it))~(1/2), k = 1, 2,..., r_0(e~(it)) = 1, i.e., the least mean square error method based on the TM system can also be used to extract out approximate solutions of minimum-phase signals for any functions f_a in the Hardy space. The advantage of the TM system method is that the parameters α_1,..., α_n,...determining the system can be adaptively selected in order to increase computational efficiency. In particular,adopting the n-best rational(Blaschke form) approximation selection for the n-tuple {α_1,..., α_n}, n≥N, where N is the degree of the given rational analytic signal, the minimum-phase part of a rational analytic signal can be accurately and efficiently extracted out.     

On an Extremal Problem for Poset Dimension

Let f(n) be the largest integer such that every poset on n elements has a 2-dimensional subposet on f(n) elements. What is the asymptotics of f(n)? It is easy to see that f(n) = n ^1/2. We improve the best known upper bound and show f(n) = O (n ^2/3). For higher dimensions, we show \(f_{d}(n)=\O \left (n^{\frac {d}{d + 1}}\right )\), where f _d (n) is the largest integer such that every poset on n elements has a d-dimensional subposet on f _d (n) elements.     

An additive cohomological equation and typical behavior of Birkhoff sums over a translation of the multidimensional torus

For a periodic function f with a given decrease of the moduli of its Fourier coefficients, we analyze the solvability of the equation \(w(T_\alpha x) - w(x) = f(x) - \smallint _{\mathbb{T}^d } f(t) dt\) and the asymptotic behavior of the Birkhoff sums Σ _s=0 ^n?1 f(T _α ^s x) for almost every α. The results obtained are applied to the study of ergodic properties of a cylindrical cascade and of a special flow on the torus.     

Szasz Analytic Functions and Noncompact Kähler Toric Manifolds

We show that the classical Szasz analytic function S _N (f)(x) is obtained by applying the pseudo-differential operator f(N ^?1 D _θ ) to the Bergman kernels for the Bargmann–Fock space. The expression generalizes immediately to any smooth polarized noncompact complete toric Kähler manifold, defining the generalized Szasz analytic function \(S_{h^{N}}(f)(x)\). About \(S_{h^{N}}(f)(x)\), we prove that it admits complete asymptotics and there exists a universal scaling limit. As an example, we will further compute \(S_{h^{N}}(f)(x)\) for the Bergman metric on the unit ball.     

Detecting fixed points of nonexpansive maps by illuminating the unit ball

We give necessary and sufficient conditions for a nonexpansive map on a finite-dimensional normed space to have a nonempty, bounded set of fixed points. Among other results we show that if f: V → V is a nonexpansive map on a finite-dimensional normed space V, then the fixed point set of f is nonempty and bounded if and only if there exist w₁,..., w _m in V such that {f(w _i ) ? w _i : i = 1,..., m} illuminates the unit ball. This yields a numerical procedure for detecting fixed points of nonexpansive maps on finite-dimensional spaces. We also discuss applications of this procedure to certain nonlinear eigenvalue problems arising in game theory and mathematical biology.     

An improved approximation algorithm for the <Emphasis Type="Italic">k</Emphasis>-level facility location problem with soft capacities

We consider the k-level facility location problem with soft capacities (k-LFLPSC). In the k-LFLPSC, each facility i has a soft capacity u _i along with an initial opening cost f _i ≥ 0, i.e., the capacity of facility i is an integer multiple of u _i incurring a cost equals to the corresponding multiple of f _i . We firstly propose a new bifactor (ln(1/β)/(1 ?β),1+2/(1 ?β))-approximation algorithm for the k-level facility location problem (k-LFLP), where β ∈ (0, 1) is a fixed constant. Then, we give a reduction from the k-LFLPSC to the k-LFLP. The reduction together with the above bifactor approximation algorithm for the k-LFLP imply a 5.5053-approximation algorithm for the k-LFLPSC which improves the previous 6-approximation.     

Asymptotic behavior of the spectrum of one-dimensional vibrations in a layered medium consisting of elastic and Kelvin–Voigt viscoelastic materials

For every algebraically closed field k of characteristic different from 2, we prove the following: (1) Finite-dimensional (not necessarily associative) k-algebras of general type of a fixed dimension, considered up to isomorphism, are parametrized by the values of a tuple of algebraically independent (over k) rational functions of the structure constants. (2) There exists an “algebraic normal form” to which the set of structure constants of every such algebra can be uniquely transformed by means of passing to its new basis—namely, there are two finite systems of nonconstant polynomials on the space of structure constants, {f_i}i∈I and {b_j}j∈J, such that the ideal generated by the set {f_i}i∈I is prime and, for every tuple c of structure constants satisfying the property b_j(c) ≠ 0 for all j ∈ J, there exists a unique new basis of this algebra in which the tuple c′ of its structure constants satisfies the property f_i(c′) = 0 for all i ∈ I.     

On criteria of estimation of the errors of cubature formulas

The paper considers cubature formulas for calculating integrals of functions f(X), X = (x ₁, …, x _n ) which are defined on the n-dimensional unit hypercube K ⁿ = [0, 1] ⁿ and have integrable mixed derivatives of the kind \(\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)\), 0 ≤ α _j ≤ 2. We estimate the errors R[f] = \(\smallint _{K^n } \) f(X)dX ? Σ _{k = 1} ^N c _k f(X(k)) of cubature formulas (c _k > 0) as functions of the weights c _k of nodes X(k) and properties of integrable functions. The error is estimated in terms of the integrals of the derivatives of f over r-dimensional faces (r≤n) of the hypercube K ⁿ : |R(f)| ≤ \(\sum _{\alpha _j } \) G(α _j )\(\int_{K^r } {\left| {\partial _{\begin{array}{*{20}c} {\alpha _1 \alpha _n } \\ {x_1 , \ldots , x_n } \\ \end{array} } f(X)} \right|} \) dX _r , where coefficients G(α _j ) are criteria which depend only on parameters c _k and X(k). We present an algorithm to calculate these criteria in the two- and n-dimensional cases. Examples are given. A particular case of the criteria is the discrepancy, and the algorithm proposed is a generalization of those used to compute the discrepancy. The results obtained can be used for optimization of cubature formulas as functions of c _k and X(k).     

Well-Quasi-Order of Relabel Functions

We define NLC\(_k^{\mathcal{F}}\) to be the restriction of the class of graphs NLC _k , where relabelling functions are exclusively taken from a set \(\mathcal{F}\) of functions from {1,...,k} into {1,...,k}. We characterize the sets of functions \(\mathcal{F}\) for which NLC\(_k^{\mathcal{F}}\) is well-quasi-ordered by the induced subgraph relation ≤? _i . Precisely, these sets \(\mathcal{F}\) are those which satisfy that for every \(f,g\in \mathcal{F}\), we have Im(f?°?g)?=?Im(f) or Im(g?°?f)?=?Im(g). To obtain this, we show that words (or trees) on \(\mathcal{F}\) are well-quasi-ordered by a relation slightly more constrained than the usual subword (or subtree) relation. A class of graphs is n-well-quasi-ordered if the collection of its vertex-labellings into n colors forms a well-quasi-order under ≤? _i , where ≤? _i respects labels. Pouzet (C R Acad Sci, Paris Sér A–B 274:1677–1680, 1972) conjectured that a 2-well-quasi-ordered class closed under induced subgraph is in fact n-well-quasi-ordered for every n. A possible approach would be to characterize the 2-well-quasi-ordered classes of graphs. In this respect, we conjecture that such a class is always included in some well-quasi-ordered NLC\(_k^{\mathcal{F}}\) for some family \(\mathcal{F}\). This would imply Pouzet’s conjecture.     

Minimal and maximal unconditional bases with respect to framings

This paper studies framings in Banach spaces, a concept raised by Casazza, Han and Larson, which is a natural generalization of traditional frames in Hilbert spaces and unconditional bases in Banach spaces. The minimal unconditional bases and the maximal unconditional bases with respect to framings are introduced. Our main result states that, if （xi, fi） is a framing of a Banach space X, and （eimin） and （eimax） are the minimal unconditional basis and the maximal unconditional basis with respect to （xi, fi）, respectively, then for any unconditional basis （ei） associated with （xi, fi）, there are A,B 〉 0 such that A｜｜i=1∑∞aieimin｜｜≤｜｜i=1∑∞aiei｜｜≤B｜｜i=1∑∞aieimax｜｜ for all （ai） ∈ c00.
It means that for any framing, the corresponding associated unconditional bases have common upper and lower bounds.     

A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function

Consider the resource allocation problem:minimize ∑ⁿ_i=1 f_i(x_i) subject to ∑ⁿ_i=1 x_i = N and x_i's being nonnegative integers, where each f_i is a convex function. The well-known algorithm based on the incremental method requires O(N log n + n) time to solve this problem. We propose here a new algorithm based on the Lagrange multiplier method, requiring O[n²(log N)²] time. The latter is faster if N is much larger than n. Such a situation occurs, for example, when the optimal sample size problem related to monitoring the urban air pollution is treated.     

Quantization causes waves: Smooth finitely computable functions are affine

Every automaton (a letter-to-letter transducer) A whose both input and output alphabets are F _p = {0, 1,..., p - 1} produces a 1-Lipschitz map f _A from the space Z _p of p-adic integers to Z _p . The map fA can naturally be plotted in a unit real square I² ? R²: To an m-letter non-empty word v = γ _m-1γ _m-2... γ0 there corresponds a number 0.v ∈ R with base-p expansion 0.γ _m-1γ _m-2... γ0; so to every m-letter input word w = α _m-1α _m-2 ··· α0 of A and to the respective m-letter output word a(w) = β _m-1β _m-2 ··· β0 of A there corresponds a point (0.w; 0.a(w)) ∈ R². Denote P(A) a closure of the point set (0.w; 0.a(w)) where w ranges over all non-empty words.We prove that once some points of P(A) constitute a C ²-smooth curve in R², the curve is a segment of a straight line with a rational slope. Moreover, when identifying P(A) with a subset of a 2-dimensional torus T² ∈ R³, the smooth curves from P(A) constitute a collection of torus windings which can be ascribed to complex-valued functions ψ(x, t) = e ^i(Ax-2πBt) (x, t ∈ R), i.e., to matter waves. As automata are causal discrete systems, the main result may serve a mathematical reasoning why wave phenomena are inherent in quantum systems: This is just because of causality principle and discreteness of matter.     

Order of magnitude of multiple Fourier coefficients of functions of bounded <Emphasis Type="Italic">p</Emphasis>-variation

For a Lebesgue integrable complex-valued function f defined over the n-dimensional torus \(\mathbb{T}^n \):= [0, 2π) ⁿ , let \(\hat f\)(k) denote the Fourier coefficient of f, where k = (k ₁, … k _n ) ∈ ? ⁿ . In this paper, defining the notion of bounded p-variation (p ≧ 1) for a function from [0, 2π] ⁿ to ? in two diffierent ways, the order of magnitude of Fourier coefficients of such functions is studied. As far as the order of magnitude is concerned, our results with p = 1 give the results of Móricz [5] and Fülöp and Móricz [3].     

Solvability of vector integro-differential equations of convolution type on the semiaxis

The paper deals with vector integro-differential equation of convolution type that have the form

$ - \frac{{d^2 f_i }}{{dx^2 }} + a_i f_i (x) = g_i (x) + \sum\limits_{j = 1}^N {\int\limits_0^\infty {K_{ij} (x - t)f_j (t)dt, } i = 1,2, \ldots ,N,} $

where \(\vec f\) = (f ₁, f ₂, ..., f _N ) ^T is the unknown vector-function, a _i are nonnegative numbers, \(\vec g\) = (g ₁, g ₂, ..., g _N ) ^T ? L ₁ ^×N (0,+∞) ≡ L ₁ (0,+∞) × ... × L (0,+∞) is the independent term of the equation with nonnegative components and 0 ≤ K _ij ? L ₁ (?∞,+∞), i, j = 1, 2, …,N are the kernel-functions. These equations have significant applications in the wave non-local interaction theory. Using some special factorization methods, solvability of the system is proved in different functional spaces.

     

A pure smoothness condition for radó’s theorem for α-analytic functions

Let \(\Omega \subset {{\Bbb C}^n}\) be a bounded, simply connected ?-convex domain. Let α ∈ ?₊ⁿ and let f be a function on Ω which is separately \({C^{2{\alpha _j} - 1}}\)-smooth with respect to z_j (by which we mean jointly \({C^{2{\alpha _j} - 1}}\)-smooth with respect to Rez_j, Imz_j). If f is α-analytic on Ω\f^?1(0), then f is α-analytic on Ω. The result is well-known for the case α_i = 1, 1 ? i ? n, even when f a priori is only known to be continuous.