Asymptotics for statistical functionals of long-memory sequences

We present two general results that can be used to obtain asymptotic properties for statistical functionals based on linear long-memory sequences. As examples for the first one we consider L- and V-statistics, in particular tail-dependent L-statistics as well as V-statistics with unbounded kernels. As an example for the second result we consider degenerate V-statistics. To prove these results we also establish a weak convergence result for empirical processes of linear long-memory sequences, which improves earlier ones.     

Positivity of Riesz functionals and solutions of quadratic and quartic moment problems

We employ positivity of Riesz functionals to establish representing measures (or approximate representing measures) for truncated multivariate moment sequences. For a truncated moment sequence y, we show that y lies in the closure of truncated moment sequences admitting representing measures supported in a prescribed closed set K⊆Rn if and only if the associated Riesz functional Ly is K-positive. For a determining set K, we prove that if Ly is strictly K-positive, then y admits a representing measure supported in K. As a consequence, we are able to solve the truncated K-moment problem of degree k in the cases: (i) (n,k)=(2,4) and K=R²; (ii) n?1, k=2, and K is defined by one quadratic equality or inequality. In particular, these results solve the truncated moment problem in the remaining open cases of Hilbert's theorem on sums of squares.     

New sequence spaces in multiple normed spaces

In this work, using lacunary sequences and the notion of ideal convergence we define and examine new sequence spaces with respect to a sequence of modulus functions in n-normed linear spaces. Further, the definition of I_θ-convergence in n-normed linear spaces and some related results are given.     

Polynomial sequential continuity on C(K,E) spaces

We show that, for bounded sequences in C(K,E), the polynomial sequential convergence is not equivalent to the pointwise polynomial sequential convergence. We introduce several conditions on E under which different versions of the result are true when K is a scattered compact space. These conditions are related with some others appeared in the literature and they seem to be of independent interest.     

On additive and multiplicative Hilbert cubes

Given subset E of natural numbers FS(E) is defined as the collection of all sums of elements of finite subsets of E and any translation of FS(E) is said to be Hilbert cube. We can define the multiplicative analog of Hilbert cube as well. E.G. Strauss proved that for every ε>0 there exists a sequence with density >1−ε which does not contain an infinite Hilbert cube. On the other hand, Nathanson showed that any set of density 1 contains an infinite Hilbert cube. In the present note we estimate the density of Hilbert cubes which can be found avoiding sufficiently sparse (in particular, zero density) sequences. As a consequence we derive a result in which we ensure a dense additive Hilbert cube which avoids a multiplicative one.     

Dual pairs of sequence spaces. III

In the previous papers [J. Boos, T. Leiger, Dual pairs of sequence spaces, Int. J. Math. Math. Sci. 28 (2001) 9-23; J. Boos, T. Leiger, Dual pairs of sequence spaces. II, Proc. Estonian Acad. Sci. Phys. Math. 51 (2002) 3-17], the authors defined and investigated dual pairs (E,ES), where E is a sequence space, S is a BK-space on which a sum s is defined in the sense of Ruckle [W.H. Ruckle, Sequence Spaces, Pitman Advanced Publishing Program, Boston, 1981], and ES is the space of all factor sequences from E into S. In generalization of the SAK-property (weak sectional convergence) in the case of the dual pair (E,Eβ), the SK-property was introduced and studied. In this note we consider factor sequence spaces E|S|, where |S| is the linear span of , the closure of the unit ball of S in the FK-space ω of all scalar sequences. An FK-space E such that E|S| includes the f-dual Ef is said to have the SB-property. Our aim is to demonstrate, that in the duality (E,ES), the SB-property plays the same role as the AB-property in the case ES=Eβ. In particular, we show for FK-spaces, in which the subspace of all finitely non-zero sequences is dense, that the SB-property implies the SK-property. Moreover, in the context of the SB-property, a generalization of the well-known factorization theorem due to Garling [D.J.H. Garling, On topological sequence spaces, Proc. Cambridge Philos. Soc. 63 (1967) 997-1019] is given.     

More on convexity and smoothness of operators

Let X and Y be Banach spaces and T:Y→X be a bounded operator. In this note, we show first some operator versions of the dual relation between q-convexity and p-smoothness of Banach spaces case. Making use of them, we prove then the main result of this note that the two notions of uniform q-convexity and uniform p-smoothness of an operator T introduced by J. Wenzel are actually equivalent to that the corresponding T-modulus δT of convexity and the T-modulus ρT of smoothness introduced by G. Pisier are of power type q and of power type p, respectively. This is also an operator version of a combination of a Hoffman's theorem and a Figiel-Pisier's theorem. As their application, we show finally that a recent theorem of J. Borwein, A.J. Guirao, P. Hajek and J. Vanderwerff about q-convexity of Banach spaces is again valid for q-convexity of operators.     

On a new system of nonlinear A-monotone multivalued variational inclusions

In this paper, we introduce and study a new system of nonlinear A-monotone multivalued variational inclusions in Hilbert spaces. By using the concept and properties of A-monotone mappings, and the resolvent operator technique associated with A-monotone mappings due to Verma, we construct a new iterative algorithm for solving this system of nonlinear multivalued variational inclusions associated with A-monotone mappings in Hilbert spaces. We also prove the existence of solutions for the nonlinear multivalued variational inclusions and the convergence of iterative sequences generated by the algorithm. Our results improve and generalize many known corresponding results.     

I2-convergence and I2-cauchy double sequences

In this article, we prove a decomposition theorem for I₂-convergent double sequences and introduce the notions of I₂-Cauchy and I^*₂)-Cauchy double sequence, and then study their certain properties. Finally, we introduce the notions of regularly (I₂,I)-convergence and (I₂,I)-Cauchy double sequence.     

p-adic valuations and k-regular sequences

A sequence is said to be k-automatic if the nth term of this sequence is generated by a finite state machine with n in base k as input. Regular sequences were first defined by Allouche and Shallit as a generalization of automatic sequences. Given a prime p and a polynomial f(x)∈Q_p[x], we consider the sequence , where v_p is the p-adic valuation. We show that this sequence is p-regular if and only if f(x) factors into a product of polynomials, one of which has no roots in Z_p, the other which factors into linear polynomials over Q. This answers a question of Allouche and Shallit.     

The fine structure of octahedron-free graphs

This paper is one of a series of papers in which, for a family L of graphs, we describe the typical structure of graphs not containing any L∈L. In this paper, we prove sharp results about the case L={O₆}, where O₆ is the graph with 6 vertices and 12 edges, given by the edges of an octahedron. Among others, we prove the following results.(a) The vertex set of almost every O₆-free graph can be partitioned into two classes of almost equal sizes, U₁ and U₂, where the graph spanned by U₁ is a C₄-free and that by U₂ is P₃-free.(b) Similar assertions hold when L is the family of all graphs with 6 vertices and 12 edges.(c) If H is a graph with a color-critical edge and χ(H)=p+1, then almost every sH-free graph becomes p-chromatic after the deletion of some s−1 vertices, where sH is the graph formed by s vertex disjoint copies of H.These results are natural extensions of theorems of classical extremal graph theory. To show that results like those above do not hold in great generality, we provide examples for which the analogs of our results do not hold.     

On the Krall-type discrete polynomials

In this paper we present a unified theory for studying the so-called Krall-type discrete orthogonal polynomials. In particular, the three-term recurrence relation, lowering and raising operators as well as the second order linear difference equation that the sequences of monic orthogonal polynomials satisfy are established. Some relevant examples of q-Krall polynomials are considered in detail.     

Matrix transformations on some sequence spaces related to strong Cesàro summability and boundedness

The spaces and introduced by Ayd?n and Ba?ar [C. Ayd?n, F. Ba?ar, Some new difference sequence spaces, Appl. Math. Comput. 157 (3) (2004) 677-693] can be considered as the matrix domains of a triangle in the sets of all sequences that are summable to zero, summable, and bounded by the Cesàro method of order 1. Here we define the sets of sequences which are the matrix domains of that triangle in the sets of all sequences that are summable, summable to zero, or bounded by the strong Cesàro method of order 1 with index p?1. We determine the β-duals of the new spaces and characterize matrix transformations on them into the sets of bounded, convergent and null sequences.     

Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem

The Multi-Commodity k-splittable Maximum Flow Problem consists in routing as much flow as possible through a capacitated network such that each commodity uses at most k paths and the capacities are satisfied. The problem appears in telecommunications, specifically when considering Multi-Protocol Label Switching. The problem has previously been solved to optimality through branch-and-price. In this paper we propose two exact solution methods both based on an alternative decomposition. The two methods differ in their branching strategy. The first method, which branches on forbidden edge sequences, shows some performance difficulty due to large search trees. The second method, which branches on forbidden and forced edge sequences, demonstrates much better performance. The latter also outperforms a leading exact solution method from the literature. Furthermore, a heuristic algorithm is presented. The heuristic is fast and yields good solution values.     

Noncommutative localization in algebraic L-theory

Given a noncommutative (Cohn) localization A→σ⁻¹A which is injective and stably flat we obtain a lifting theorem for induced f.g. projective σ⁻¹A-module chain complexes and localization exact sequences in algebraic L-theory, matching the algebraic K-theory localization exact sequence of Neeman-Ranicki [Amnon Neeman, Andrew Ranicki, Noncommutative localisation in algebraic K-theory I, Geom. Topol. 8 (2004) 1385-1425] and Neeman [Amnon Neeman, Noncommutative localisation in algebraic K-theory II, Adv. Math. 213 (2007) 785-819].     

Error bounds for linear complementarity problems of DB-matrices

Doubly B-matrices (DB-matrices), which properly contain B-matrices, are introduced by Peña (2003) [2]. In this paper we present error bounds for the linear complementarity problem when the matrix involved is a DB-matrix and a new bound for linear complementarity problem of a B-matrix. The numerical examples show that the bounds are sharp.     

The convex hull of degree sequences of signed graphs

As shown in [D. Hoffman, H. Jordon, Signed graph factors and degree sequences, J. Graph Theory 52 (2006) 27-36], the degree sequences of signed graphs can be characterized by a system of linear inequalities. The set of all n-tuples satisfying this system of linear inequalities is a polytope P_n. In this paper, we show that P_n is the convex hull of the set of degree sequences of signed graphs of order n. We also determine many properties of P_n, including a characterization of its vertices. The convex hull of imbalance sequences of digraphs is also investigated using the characterization given in [D. Mubayi, T.G. Will, D.B. West, Realizing degree imbalances of directed graphs, Discrete Math. 239 (2001) 147-153].