Jensen's functional equation on the symmetric group Sn\bold{S_n}

Two natural extensions of Jensen's functional equation on the real line are the equations $f(xy)+f(xy^{-1}) = 2f(x)$ and $f(xy)+f(y^{-1}x) = 2f(x)$, where $f$ is a map from a multiplicative group $G$ into an abelian additive group $H$. In a series of papers \cite{Ng1}, \cite{Ng2}, \cite{Ng3}, C. T. Ng has solved these functional equations for the case where $G$ is a free group and the linear group $GL_n(R)$, R=\z,\r, a quadratically closed field or a finite field. He has also mentioned, without detailed proof, in the above papers and in \cite{Ng4} that when $G$ is the symmetric group $S_n$ the group of all solutions of these functional equations coincides with the group of all homomorphisms from $(S_n,\cdot)$ to $(H,+)$. The aim of this paper is to give an elementary and direct proof of this fact.Comment: 8 pages, Abstract changed, the proof of Proposition 2.1 and Lemma 2.4 changed (minor), one reference added, final version, to be published in Aequationes Mathematicae (2011

Hopf algebras of dimension pq, II

Let H be a Hopf algebra of dimension pq over an algebraically closed field of characteristic zero, where p, q are odd primes with p < q < 4p+12. We prove that H is semisimple and thus isomorphic to a group algebra, or the dual of a group algebra.Comment: 14pp, Late

About quantum fluctuations and holographic principle in (4+n)-dimensional spacetime

In the article we present explicit expressions for quantum fluctuations of spacetime in the case of $(4+n)$-dimensional spacetimes, and consider their holographic properties and some implications for clocks, black holes and computation. We also consider quantum fluctuations and their holographic properties in ADD model and estimate the typical size and mass of the clock to be used in precise measurements of spacetime fluctuations. Numerical estimations of phase incoherence of light from extra-galactic sources in ADD model are also presented.Comment: 5 page

An O(n3 [square root of] log n) algorithm for the optimal stable marriage problem

We give an O(n^3 √logn) time algorithm for the optimal stable marriage problem. This algorithm finds a stable marriage that minimizes an objective function defined over all stable marriages in a given problem instance.Irving, Leather, and Gusfield have previously provided a solution to this problem that runs in O(n^4) time [ILG87]. In addition, Feder has claimed that an O(n^3 log n) time algorithm exists [F89]. Our result is an asymptotic improvement over both cases.As part of our solution, we solve a special blue-red matching problem, and illustrate a technique for simulating Hopcroft and Karp's maximum-matching algorithm [HK73] on the transitive closure of a graph