A note on Herglotz’s theorem for time series on function spaces

In this article, we prove Herglotz’s theorem for Hilbert-valued time series. This requires the notion of an operator-valued measure, which we shall make precise for our setting. Herglotz’s theorem for functional time series allows to generalize existing results that are central to frequency domain analysis on the function space. In particular, we use this result to prove the existence of a functional Cramér representation of a large class of processes, including those with jumps in the spectral distribution and long-memory processes. We furthermore obtain an optimal finite dimensional reduction of the time series under weaker assumptions than available in the literature. The results of this paper therefore enable Fourier analysis for processes of which the spectral density operator does not necessarily exist.     

A note on a new variant of Murty’s ranking assignments algorithm

In this paper a variant of Murtys algorithm for ranking assignments according to cost is presented. It is shown that the worst-case computational complexity is better in this variant than in the original form of the algorithm. Computational results comparing three methods for ranking assignments are reported. They show that the behaviour of the new variant is also better in practice.Received: March 2003, Revised: March 2003, AMS classification: 90C27, 05C85Marta Pascoal: The research of Marta Pascoal was developed within CISUC and partially supported by the Portuguese Ministry of Science and Technology (MCT), under PRAXIS XXI Project of JNICT.     

A note on Barnette’s conjecture

A well-known conjecture of Barnette states that every 3-connected cubic bipartite planar graph has a Hamiltonian cycle, which is equivalent to the statement that every 3-connected even plane triangulation admits a 2-tree coloring, meaning that the vertices of the graph have a 2-coloring such that each color class induces a tree. In this paper we present a new approach to Barnette’s conjecture by using 2-tree coloring.A Barnette triangulation is a 3-connected even plane triangulation, and a B-graph is a smallest Barnette triangulation without a 2-tree coloring. A configuration is reducible if it cannot be a configuration of a B-graph. We prove that certain configurations are reducible. We also define extendable, non-extendable and compatible graphs; and discuss their connection with Barnette’s conjecture.     

A note on Gekeler’s h-function

For a subgroup L of the symmetric group \({S_{\ell}}\), we determine the minimal base size of \({GL_d(q) \wr L}\) acting on \({V_d(q)^{\ell}}\) as an imprimitive linear group. This is achieved by computing the number of orbits of GL_d(q) on spanning m-tuples, which turns out to be the number of d-dimensional subspaces of V_m(q). We then use these results to prove that for certain families of subgroups L, the affine groups whose stabilisers are large subgroups of \({GL_{d}(q) \wr L}\) satisfy a conjecture of Pyber concerning bases.     

A note on Burgess’s estimate

By introducing the Rademacher-Menchov device, we prove “maximal” analogs of principal bounds of character sums. This allows us to present the Burgess method so as to separate the main idea of this method from the technical issues.     

A note on Furstenberg’s filtering problem

This note gives a positive answer to an old question in elementary probability theory that arose in Furstenberg’s seminal article “Disjointness in Ergodic Theory.” As a consequence, Furstenberg’s filtering theorem holds without any integrability assumption.     

A note on Wilson’s functional equation

Let S be a semigroup, and \(\mathbb {F}\) a field of characteristic \(\ne 2\). If the pair \(f,g:S \rightarrow \mathbb {F}\) is a solution of Wilson’s \(\mu \)-functional equation such that \(f \ne 0\), then g satisfies d’Alembert’s \(\mu \)-functional equation.     

A note on Peano’s Theorem on time scales

In this paper we investigate the dynamic Cauchy problem in Banach spaces. We check how dense a time scale must be in such a way that Peano’s Theorem holds and we present a counterexample to Peano’s Theorem on a time scale with only one right dense point.     

A note on Linnik’s theorem on quadratic non-residues

Archiv der Mathematik - We present a short and purely combinatorial proof of Linnik’s theorem: for any $$varepsilon >0$$ there exists a constant $$C_varepsilon $$ such that for any...     

A note on Abel’s partial summation formula

Several applications of Abel’s partial summation formula to the convergence of series of positive vectors are presented. For example, when the norm of the ambient ordered Banach space is associated with a strong order unit, it is shown that the convergence of the series \(\sum x_{n}\) implies the convergence in density of the sequence \((nx_{n})_{n}\) to 0. This is done by extending the Koopman–von Neumann characterization of convergence in density. Also included is a new proof of the Jensen–Steffensen inequality based on Abel’s partial summation formula and a trace analogue of the Tomi?–Weyl inequality of submajorization.     

A note on Jensen’s inequality for BSDEs

Under the Lipschitz assumption and square integrable assumption on g, Jiang proved that Jensen＇s inequality for BSDEs with generator g holds in general if and only if g is independent of y, g is super homogenous in z and g（t, 0） = 0, a.s., a.e.. In this paper, based on Jiang＇s results, under the same assumptions as Jiang＇s, we investigate the necessary and sufficient condition on g under which Jensen＇s inequality for BSDEs with generator g holds for some specific convex functions, which generalizes some known results on Jensen＇s inequality for BSDEs.     

A note on Hardy’s theorem and rotations

Semigroup Forum - We give a very short proof, using the Hermite semigroup, to a generalized version of Hardy’s theorem due to Hogan and Lakey. We characterize $$fin L^2({mathbb {R}}^n)$$...     

A note on Boiteux’ surplus function and dual Pareto efficiency

The purpose of this note is to study first a notion of a surplus function that originates in the work of [Boiteux, M., 1951. Le Revenu Distribuable et les Pertes Économiques. Econometrica 112–133] and to rely upon this notion to study dual Pareto efficiency in an exchange economy. This function, which we call the Boiteux’ surplus function, measures how many units of income an individual must be given to move from a reference utility level, to another utility level. We prove several properties of the Boiteux’ surplus function, and study in particular its links with the expenditure and the indirect utility functions. With regard to dual Pareto efficiency and the Boiteux’ surplus function our results are as follows. A feasible reference price–income pair is dual Pareto efficient if and only if it zero-maximizes the sum of individual Boiteux’ surplus functions among all feasible price–income pairs. We use these results to give a new proof (for the case of an exchange economy with positive prices) of the characterization by Luenberger of dual Pareto optima.     

Dijkstra’s algorithm and L-concave function maximization

Dijkstra’s algorithm is a well-known algorithm for the single-source shortest path problem in a directed graph with nonnegative edge length. We discuss Dijkstra’s algorithm from the viewpoint of discrete convex analysis, where the concept of discrete convexity called L-convexity plays a central role. We observe first that the dual of the linear programming (LP) formulation of the shortest path problem can be seen as a special case of L-concave function maximization. We then point out that the steepest ascent algorithm for L-concave function maximization, when applied to the LP dual of the shortest path problem and implemented with some auxiliary variables, coincides exactly with Dijkstra’s algorithm.     

A note on Alberti’s Luzin-type theorem for gradients

Ricerche di Matematica - We give a “soft” proof of Alberti’s Luzin-type theorem in Alberti (J Funct Anal 100:110–118, 1991), using elementary geometric measure theory and...