Error bounds for high-resolution quantization with Rényi-α-entropy constraints

We consider the problem of optimal quantization with norm exponent r > 0 for Borel probability measures on ? ^d under constrained Rényi-α-entropy of the quantizers. If the bound on the entropy becomes large, then sharp asymptotics for the optimal quantization error are well-known in the special cases α = 0 (memory-constrained quantization) and α = 1 (Shannon-entropy-constrained quantization). In this paper we determine sharp asymptotics for the optimal quantization error under large entropy bound with entropy parameter α ∈ [1+r/d,∞]. For α ∈ [0,1 + r/d] we specify the asymptotical order of the optimal quantization error under large entropy bound. The optimal quantization error is decreasing exponentially fast with the entropy bound and the exact rate is determined for all α ∈ [0, ∞].     

Some constructions of linearly optimal group codes

We continue here the research on (quasi)group codes over (quasi)group rings. We give some constructions of [n,n-3,3]_q-codes over F_q for n=2q and n=3q. These codes are linearly optimal, i.e. have maximal dimension among linear codes having a given length and distance. Although codes with such parameters are known, our main results state that we can construct such codes as (left) group codes. In the paper we use a construction of Reed-Solomon codes as ideals of the group ring F_qG where G is an elementary abelian group of order q.     

Some results concerning maximum Rényi entropy distributions

We consider the Student-t and Student-r distributions, which maximise Rényi entropy under a covariance condition. We show that they have information-theoretic properties which mirror those of the Gaussian distributions, which maximise Shannon entropy under the same condition. We introduce a convolution which preserves the Rényi maximising family, and show that the Rényi maximisers are the case of equality in a version of the Entropy Power Inequality. Further, we show that the Rényi maximisers satisfy a version of the heat equation, motivating the definition of a generalised Fisher information.     

On the geometry of generalized Gaussian distributions

In this paper we consider the space of those probability distributions which maximize the q-Rényi entropy. These distributions have the same parameter space for every q, and in the q=1 case these are the normal distributions. Some methods to endow this parameter space with a Riemannian metric is presented: the second derivative of the q-Rényi entropy, the Tsallis entropy, and the relative entropy give rise to a Riemannian metric, the Fisher information matrix is a natural Riemannian metric, and there are some geometrically motivated metrics which were studied by Siegel, Calvo and Oller, Lovri?, Min-Oo and Ruh. These metrics are different; therefore, our differential geometrical calculations are based on a new metric with parameters, which covers all the above-mentioned metrics for special values of the parameters, among others. We also compute the geometrical properties of this metric, the equation of the geodesic line with some special solutions, the Riemann and Ricci curvature tensors, and the scalar curvature. Using the correspondence between the volume of the geodesic ball and the scalar curvature we show how the parameter q modulates the statistical distinguishability of close points. We show that some frequently used metrics in quantum information geometry can be easily recovered from classical metrics.     

Sharp asymptotics of the Kolmogorov entropy for Gaussian measures

Let U denote the unit ball of the Cameron-Martin space of a Gaussian measure on a Hilbert space. The sharp asymptotics for the Kolmogorov (metric) entropy numbers of U is derived. The condition imposed is regular variation of the eigenvalues of the covariance operator. A consequence is a precise link including constants to the functional quantization problem.     

Asymptotic Optimality of Scalar Gersho Quantizers

In his famous paper (Gersho, IEEE Trans. Inf. Theory 25(4):373–380, 1979), Gersho stressed that the codecells of optimal quantizers asymptotically make an equal contribution to the distortion of the quantizer. Motivated by this fact, we investigate in this paper quantizers in the scalar case, where each codecell contributes with exactly the same portion to the quantization error. We show that such quantizers of Gersho type—or Gersho quantizers for short—exist for nonatomic scalar distributions. As a main result, we prove that Gersho quantizers are asymptotically optimal.     

On weakly unitarily invariant norm and the λ-Aluthge transformation for invertible operator

Let T∈B(H) be an invertible operator with polar decomposition T = UP and B∈B(H) commute with T. In this paper we prove that ∣∣∣P^λBUP^1−λ∣∣∣ ? ∣∣∣BT∣∣∣, where ∣∣∣ · ∣∣∣ is a weakly unitarily invariant norm on B(H) and 0 ? λ ? 1. As the consequence of this result, we have ∣∣∣f(P^λUP^1−λ)∣∣∣ ? ∣∣∣f(T)∣∣∣ for any polynomial f.     

Inequalities between ∥f(A + B)∥ and ∥f(A) + f(B)∥

The conjecture posed by Aujla and Silva [J.S. Aujla, F.C. Silva, Weak majorization inequalities and convex functions, Linear Algebra Appl. 369 (2003) 217-233] is proved. It is shown that for any m-tuple of positive-semidefinite n × n complex matrices A_j and for any non-negative convex function f on [0, ∞) with f(0) = 0 the inequality ?f(A₁) + f(A₂) + ? + f(A_m)? ? ? f(A₁ + A₂ + ? + A_m)? holds for any unitarily invariant norm ? · ?. It is also proved that ?f(A₁) + f(A₂) + ? + f(A_m)? ? f(?A₁ + A₂ + ? + A_m?), where f is a non-negative concave function on [0, ∞) and ? · ? is normalized.     

Generalized Jordan algebras

We study commutative algebras which are generalizations of Jordan algebras. The associator is defined as usual by (x, y, z) = (x y)z − x(y z). The Jordan identity is (x², y, x) = 0. In the three generalizations given below, t, β, and γare scalars. ((x x)y)x + t((x x)x)y = 0, ((x x)x)(y x) − (((x x)x)y)x = 0, β((x x)y)x + γ((x x)x)y − (β + γ)((y x)x)x = 0. We show that with the exception of a few values of the parameters, the first implies both the second and the third. The first is equivalent to the combination of ((x x)x)x = 0 and the third. We give examples to show that our results are in some reasonable sense, the best possible.     

Optimal algorithms for the α-neighbor p-center problem

Assigning multiple service facilities to demand points is important when demand points are required to withstand service facility failures. Such failures may result from a multitude of causes, ranging from technical difficulties to natural disasters. The α-neighbor p-center problem deals with locating p service facilities. Each demand point is assigned to its nearest α service facilities, thus it is able to withstand up to α − 1 service facility failures. The objective is to minimize the maximum distance between a demand point and its αth nearest service facility. We present two optimal algorithms for both the continuous and discrete α-neighbor p-center problem. We present experimental results comparing the performance of the two optimal algorithms for α = 2. We also present experimental results showing the performance of the relaxation algorithm for α = 1, 2, 3.     

A max version of the generalized spectral radius theorem

Let Ψ be a bounded set of n × n nonnegative matrices in max algebra. In this paper we propose the notions of the max algebra version of the generalized spectral radius μ(Ψ) of Ψ, and the max algebra version of the joint spectral radius η(Ψ) of Ψ. The max algebra version of the generalized spectral radius theorem μ(Ψ) = η(Ψ) is established. We propose the relationship between the generalized spectral radius ρ(Ψ) of Ψ (in the sense of Daubechies and Lagarias) and its max algebra version μ(Ψ). Moreover, a generalization of Elsner and van den Driessche’s lemma is presented as well.     

Diagonals and numerical ranges of direct sums of matrices

For any n-by-n matrix A  , we consider the maximum number k=k(A)$k=k(A)$ for which there is a k-by-k compression of A   with all its diagonal entries in the boundary ∂W(A)$\partial W(A)$ of the numerical range W(A)$W(A)$ of A. If A   is a normal or a quadratic matrix, then the exact value of k(A)$k(A)$ can be computed. For a matrix A   of the form B⊕C$B\oplus C$, we show that k(A)=2$k(A)=2$ if and only if the numerical range of one summand, say, B is contained in the interior of the numerical range of the other summand C   and k(C)=2$k(C)=2$. For an irreducible matrix A  , we can determine exactly when the value of k(A)$k(A)$ equals the size of A  . These are then applied to determine k(A)$k(A)$ for a reducible matrix A   of size 4 in terms of the shape of W(A)$W(A)$.     

On polyvectors of vector spaces and hyperplanes of projective Grassmannians

We investigate relationships between polyvectors of a vector space V, alternating multilinear forms on V, hyperplanes of projective Grassmannians and regular spreads of projective spaces. Suppose V is an n-dimensional vector space over a field F and that A_n-1,k(F) is the Grassmannian of the (k − 1)-dimensional subspaces of PG(V) (1  ? k ? n − 1). With each hyperplane H of A_n-1,k(F), we associate an (n − k)-vector of V (i.e., a vector of ∧^n−kV) which we will call a representative vector of H. One of the problems which we consider is the isomorphism problem of hyperplanes of A_n-1,k(F), i.e., how isomorphism of hyperplanes can be recognized in terms of their representative vectors. Special attention is paid here to the case n = 2k and to those isomorphisms which arise from dualities of PG(V). We also prove that with each regular spread of the projective space PG(2k-1,F), there is associated some class of isomorphic hyperplanes of the Grassmannian A_2k-1,k(F), and we study some properties of these hyperplanes. The above investigations allow us to obtain a new proof for the classification, up to equivalence, of the trivectors of a 6-dimensional vector space over an arbitrary field F, and to obtain a classification, up to isomorphism, of all hyperplanes of A_5,3(F).     

On the convergence of hybrid polynomial approximation to higher derivatives of rational curves

In this paper, we derive the bounds on the magnitude of l  th (l=2,3)$(l=2,3)$ order derivatives of rational Bézier curves, estimate the error, in the _L∞$L_{\infty }$ norm sense, for the hybrid polynomial approximation of the l  th (l=1,2,3)$(l=1,2,3)$ order derivatives of rational Bézier curves. We then prove that when the hybrid polynomial approximation converges to a given rational Bézier curve, the l  th (l=1,2,3)$(l=1,2,3)$ derivatives of the hybrid polynomial approximation curve also uniformly converge to the corresponding derivatives of the rational curve. These results are useful for designing simpler algorithms for computing tangent vector, curvature vector and torsion vector of rational Bézier curves.     

Asymptotic expansions for derivatives of stable laws

For the derivativesp ^(k)(x; α, γ) of the stable density of index α asymptotic formulae (of Plancherel Rotach type) are computed ask→∞ thereby exhibiting the detailed analytic structure for large orders of derivatives. Generalizing known results for the special case of the one-sided stable laws (O<α<1, γ=-α) the whole range for the index of stability and the asymmetry parameter γ is covered.     

Fluctuations of the empirical quantiles of independent Brownian motions

We consider iid Brownian motions, B_j(t), where B_j(0) has a rapidly decreasing, smooth density function f. The empirical quantiles, or pointwise order statistics, are denoted by B_j:n(t), and we consider a sequence Q_n(t)=B_j(n):n(t), where j(n)/n→α∈(0,1). This sequence converges in probability to q(t), the α-quantile of the law of B_j(t). We first show convergence in law in C[0,∞) of F_n=n^1/2(Q_n−q). We then investigate properties of the limit process F, including its local covariance structure, and Hölder-continuity and variations of its sample paths. In particular, we find that F has the same local properties as fBm with Hurst parameter H=1/4.     

Existence,uniqueness and asymptotic behavior of the solutions to the fully parabolic Keller–Segel system in the plane

In the present article we consider several issues concerning the doubly parabolic Keller–Segel system  and  in the plane, when the initial data belong to critical scaling-invariant Lebesgue spaces. More specifically, we analyze the global existence of integral solutions, their optimal time decay, uniqueness and positivity, together with the uniqueness of self-similar solutions. In particular, we prove that there exist integral solutions of any mass, provided that ε>0$\epsilon >0$ is sufficiently large. With those results at hand, we are then able to study the large time behavior of global solutions and prove that in the absence of the degradation term (α=0)$(\alpha =0)$ the solutions behave like self-similar solutions, while in the presence of the degradation term (α>0)$(\alpha >0)$ the global solutions behave like the heat kernel.