Eigenvalue extensions of Bohr’s inequality

We present a weak majorization inequality and apply it to prove eigenvalue and unitarily invariant norm extensions of a version of the Bohr’s inequality due to Vasi? and Ke?ki?.     

Operator Aczél inequality

We establish several operator versions of the classical Aczél inequality. One of operator versions deals with the weighted operator geometric mean and another is related to the positive sesquilinear forms. Some applications including the unital positive linear maps on C^*-algebras and the unitarily invariant norms on matrices are presented.     

The bias of three pseudo-random shuffles

Three schemes for shuffling a deck ofn cards are studied, each involving a random choice from [n] ⁿ . The shuffles favor some permutations over others sincen! does not dividen ⁿ . The probabilities that the shuffles lead to some simple permutations, for instance cycles left and right and the identity, are calculated. Some inequalities are obtained which lead to information about the least and most likely permutations. Numbers of combinatorial interest occur, notably the Catalan numbers and the Bell numbers.     

Order properties of attractive spin systems

Methods of constructing semigroups of operators describing interacting particle systems are reviewed. A simple proof is given showing the existence of semigroups of operators on the space of bounded Borel measurable functions for nonnegative continuous attractive spin rates along with a proof of the existence of invariant measures for the semigroups so constructed.     

An inequality for means with applications

We show that an almost trivial inequality between the first and second moment and the maximal value of a random variable can be used to slightly improve deep theorems. Received: 25 November 2006     

Quadrature rule-based bounds for functions of adjacency matrices

Bounds for entries of matrix functions based on Gauss-type quadrature rules are applied to adjacency matrices associated with graphs. This technique allows to develop inexpensive and accurate upper and lower bounds for certain quantities (Estrada index, subgraph centrality, communicability) that describe properties of networks.     

Twisted dendriform algebras and the pre-Lie Magnus expansion

In this paper an application of the recently introduced pre-Lie Magnus expansion to Jackson’s q-integral and q-exponentials is presented. Twisted dendriform algebras, which are the natural algebraic framework for Jackson’s q-analogs, are introduced for that purpose. It is shown how the pre-Lie Magnus expansion is used to solve linear q-differential equations. We also briefly outline the theory of linear equations in twisted dendriform algebras.     

A process of runs and its convergence to the brownian motion

Let X₁,X₂,… be i.i.d. random variables with a continuous distribution function. Let R₀=0, R_k=min{j>R_k?1, such that X_j>X_j+1}, k?1. We prove that all finite-dimensional distributions of a process $\text{W}{}^{\mathrm{(n)}}\text{(t)=}\text{(R}{}_{\mathrm{[nt]}}\text{?2[nt])}\text{2}\text{3}\text{n}\text{, t ? [0,1]}$, converge to those of the standard Brownian motion.     

The existence of Room squares

The authors give a condensed proof of the existence of Room squares for positive odd sides except 3 and 5. Some areas of current research on Room squares are also discussed.Aequationes Mathematicae launches a systematic program of expository papers. We will endeavour to publish at least one in every volume.     

An extremal problem related to probability

Summary We consider a walk from a stateA ₁ to a stateA _n+1 in which the probability of remaining atA _i isp _i , and the probability of progressing fromA _i toA _i+1 is 1 –p _i . The probabilityW _nk of reachingA _n+1 fromA ₁ in exactlyn + k steps can then be expressed as a polynomial of degreen + k in then variablesp ₁,,p _n . We determine the maximum value ofW _nk and the (unique) choice (p ₁,,p _n ) for which this extremum occurs.Dedicated to Professor Otto Haupt with best wishes on his 100th birthday     

A family of variable metric proximal methods

We consider conceptual optimization methods combining two ideas: the Moreau—Yosida regularization in convex analysis, and quasi-Newton approximations of smooth functions. We outline several approaches based on this combination, and establish their global convergence. Then we study theoretically the local convergence properties of one of these approaches, which uses quasi-Newton updates of the objective function itself. Also, we obtain a globally and superlinearly convergent BFGS proximal method. At each step of our study, we single out the assumptions that are useful to derive the result concerned.     

Ona-Wright convexity and the converse of Minkowski's inequality

Summary Leta (0, 1/2] be fixed. A functionf satisfying the inequalityf(ax + (1 – a)y) + f((1 – a)x + ay) f(x) + f(y), called herea-Wright convexity, appears in connection with the converse of Minkowski's inequality. We prove that every lower semicontinuousa-Wright convex function is Jensen convex and we pose an open problem. Moreover, using the fact that 1/2-Wright convexity coincides with Jensen convexity, we prove a converse of Minkowski's inequality without any regularity conditions.     

Alexandrov’s inequality and conjectures on some Toeplitz matrices

We study determinant inequalities for certain Toeplitz-like matrices over C. For fixed n and N ? 1, let Q be the n × (n + N − 1) zero-one Toeplitz matrix with Q_ij = 1 for 0 ? j − i ? N − 1 and Q_ij = 0 otherwise. We prove that det(QQ^∗) is the minimum of det(RR^∗) over all complex matrices R with the same dimensions as Q satisfying ∣R_ij∣ ? 1 whenever Q_ij = 1 and R_ij = 0 otherwise. Although R has a Toeplitz-like band structure, it is not required to be actually Toeplitz. Our proof involves Alexandrov’s inequality for polarized determinants and its generalizations. This problem is motivated by Littlewood’s conjecture on the minimum 1-norm of N-term exponential sums on the unit circle. We also discuss polarized Bazin-Reiss-Picquet identities, some connections with k-tree enumeration, and analogous conjectured inequalities for the elementary symmetric functions of QQ^∗.     

On distance preserving transformations of Euclidean-like planes over the rational field

Aequationes mathematicae -     

Counting subsets of the random partition and the ‘Brownian Bridge’ process

Let Ω_m be the set of partitions, ω, of a finite m-element set; induce a uniform probability distribution on Ω_m, and define X_ms(ω) as the number of s-element subsets in ω. We alow the existence of an integer-valued function n=n^(m)(t), t?[0, 1], and centering constants b_ms, 0?s? m, such that

$\text{Z}{}^{\mathrm{(m)}}\text{(t)=}\text{∑}\text{s=0}\text{n(m)(t)}\text{(X}{}_{\mathrm{ms}}\text{?b}{}_{\mathrm{ms}}\text{)}\text{√}\text{∑}\text{s=0}\text{m}\text{b}{}_{\mathrm{ms}}$

converges to the ‘Brownian Bridge’ process in terms of its finite-dimensional distributions.     

On the number of representations of certain integers as sums of 11 or 13 squares

Let r_k(n) denote the number of representations of an integer n as a sum of k squares. We prove that for odd primes p,