Relations between some basic results derived from two kinds of topologies for a random locally convex module

The purpose of this paper is to exhibit the relations between some basic results derived from the two kinds of topologies (namely the (ε,λ)-topology and the stronger locally L⁰-convex topology) for a random locally convex module. First, we give an extremely simple proof of the known Hahn-Banach extension theorem for L⁰-linear functions as well as its continuous variant. Then we give the relations between the hyperplane separation theorems in [D. Filipovi?, M. Kupper, N. Vogelpoth, Separation and duality in locally L⁰-convex modules, J. Funct. Anal. 256 (2009) 3996-4029] and a basic strict separation theorem in [T.X. Guo, H.X. Xiao, X.X. Chen, A basic strict separation theorem in random locally convex modules, Nonlinear Anal. 71 (2009) 3794-3804]: in the process we also obtain a very useful fact that a random locally convex module with the countable concatenation property must have the same completeness under the two topologies. As applications of the fact, we prove that most of the previously established principal results of random conjugate spaces of random normed modules under the (ε,λ)-topology are still valid under the locally L⁰-convex topology, which considerably enriches financial applications of random normed modules.     

A counterexample to Wood's conjecture

We prove that if the one-point compactification of a locally compact, noncompact Hausdorff space L is the topological space called pseudoarc, then C₀(L,C) is almost transitive. We also obtain two necessary conditions on a metrizable locally compact Hausdorff space L for C₀(L) being almost transitive.     

On (s,t)-supereulerian graphs in locally highly connected graphs

Given two nonnegative integers s and t, a graph G is (s,t)-supereulerian if for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y|≤t, there is a spanning eulerian subgraph H of G that contains X and avoids Y. We prove that if G is connected and locally k-edge-connected, then G is (s,t)-supereulerian, for any pair of nonnegative integers s and t with s+t≤k−1. We further show that if s+t≤k and G is a connected, locally k-edge-connected graph, then for any disjoint sets X,Y⊂E(G) with |X|≤s and |Y≤t, there is a spanning eulerian subgraph H that contains X and avoids Y, if and only if G−Y is not contractible to K₂ or to K_2,l with l odd.     

Means in metric spaces and the center of mass

In this article k-convex metric spaces are considered where a several variable mapping is provided as a limit point of an iteration scheme based on the midpoint map in the metric space itself. This mapping, considered as a mean of its variables, has some properties which relates it to the center of mass of these variables in the metric space. Sufficient conditions are given here for the two points to be identical, as well as upper bounds on their distances from one another. The asymptotic rate of convergence of the iterative process defining the mean is also determined here. The case of the symmetric space on the convex cone of positive definite matrices related to the geometric mean and the special orthogonal group are also studied here as examples of k-convex metric spaces.     

Moduli of convexity and smoothness of reflexive subspaces of L

We show that for any probability measure μ there exists an equivalent norm on the space L¹(μ) whose restriction to each reflexive subspace is uniformly smooth and uniformly convex, with modulus of convexity of power type 2. This renorming provides also an estimate for the corresponding modulus of smoothness of such subspaces.     

Saturated packings and reduced coverings obtained by perturbing tilings

Let a normed space X possess a tiling T consisting of unit balls. We show that any packing P of X obtained by a small perturbation of T is completely translatively saturated; that is, one cannot replace finitely many elements of P by a larger number of unit balls such that the resulting arrangement is still a packing.In contrast with that, given a tiling T of Rⁿ with images of a convex body C under Euclidean isometries, there may exist packings P consisting of isometric images of C obtained from T by arbitrarily small perturbations which are no longer completely saturated. This means that there exists some positive integer k such that one can replace k−1 members of P by k isometric copies of C without violating the packing property. However, we quantify a tradeoff between the size of the perturbation and the minimal k such that the above phenomenon occurs.Analogous results are obtained for coverings.     

On distance-3 matchings and induced matchings

For a finite undirected graph G=(V,E) and positive integer k≥1, an edge set M⊆E is a distance-k matching if the pairwise distance of edges in M is at least k in G. For k=1, this gives the usual notion of matching in graphs, and for general k≥1, distance-k matchings were called k-separated matchings by Stockmeyer and Vazirani. The special case k=2 has been studied under the names induced matching (i.e., a matching which forms an induced subgraph in G) by Cameron and strong matching by Golumbic and Laskar in various papers.Finding a maximum induced matching is NP-complete even on very restricted bipartite graphs and on claw-free graphs but it can be done efficiently on various classes of graphs such as chordal graphs, based on the fact that an induced matching in G corresponds to an independent vertex set in the square L(G)² of the line graph L(G) of G which, by a result of Cameron, is chordal for any chordal graph G.We show that, unlike for k=2, for a chordal graph G, L(G)³ is not necessarily chordal, and finding a maximum distance-3 matching, and more generally, finding a maximum distance-(2k+1) matching for k≥1, remains NP-complete on chordal graphs. For strongly chordal graphs and interval graphs, however, the maximum distance-k matching problem can be solved in polynomial time for every k≥1. Moreover, we obtain various new results for maximum induced matchings on subclasses of claw-free graphs.     

A superlinear space decomposition algorithm for constrained nonsmooth convex program

A class of constrained nonsmooth convex optimization problems, that is, piecewise C² convex objectives with smooth convex inequality constraints are transformed into unconstrained nonsmooth convex programs with the help of exact penalty function. The objective functions of these unconstrained programs are particular cases of functions with primal-dual gradient structure which has connection with VU space decomposition. Then a VU space decomposition method for solving this unconstrained program is presented. This method is proved to converge with local superlinear rate under certain assumptions. An illustrative example is given to show how this method works.     

Pruning processes and a new characterization of convex geometries

We provide a new characterization of convex geometries via a multivariate version of an identity that was originally proved, in a special case arising from the k-SAT problem, by Maneva, Mossel and Wainwright. We thus highlight the connection between various characterizations of convex geometries and a family of removal processes studied in the literature on random structures.     

Multiple positive solutions for a critical quasilinear elliptic system

The existence of cat_Ω(Ω) positive solutions for the p-Laplacian system with convex and Sobolev critical nonlinearities is obtained by some standard variational methods, whose key is to construct homotopies between Ω and levels of the functional J_λ,μ, and some analytical techniques.     

Graphs with the maximum or minimum number of 1-factors

Recently Alon and Friedland have shown that graphs which are the union of complete regular bipartite graphs have the maximum number of 1-factors over all graphs with the same degree sequence. We identify two families of graphs that have the maximum number of 1-factors over all graphs with the same number of vertices and edges: the almost regular graphs which are unions of complete regular bipartite graphs, and complete graphs with a matching removed. The first family is determined using the Alon and Friedland bound. For the second family, we show that a graph transformation which is known to increase network reliability also increases the number of 1-factors. In fact, more is true: this graph transformation increases the number of k-factors for all k≥1, and “in reverse” also shows that in general, threshold graphs have the fewest k-factors. We are then able to determine precisely which threshold graphs have the fewest 1-factors. We conjecture that the same graphs have the fewest k-factors for all k≥2 as well.     

Constructions for cyclic Moebius ladder systems

J.A. Gallian has proved [J.A. Gallian, Labeling prisms and prism related graphs, Congr. Numer. 59 (1987) 89-100] that every cubic graph M_2k obtainable from a 2k-cycle by adding its k diameters (the so-called Moebius Ladder of order 2k) is graceful. Here, in the case of k even, we propose a new graceful labeling that besides being simpler than Gallian’s one is able to give, at the same time, a graceful labeling of the prism of order 2k. Most importantly in the case of k odd, namely in the bipartite case, we prove that M_2k also admits an α-labeling. This implies that there exists a cyclic decomposition of the complete graph K_6kt+1 into copies of M_2k for every pair of positive integers k and t with k odd.In some cases we are able to give such decompositions also when k is even. Apart from the case of t=1 that is an obvious consequence of the gracefulness of M_2k, this happens, for instance, when k≡2 (mod 4) and 6kt+1 is a prime.     

Fixed point theorems for better admissible multimaps on almost convex sets

We obtain new fixed point theorems on multimaps in the class Bp defined on almost convex subsets of topological vector spaces. Our main results are applied to deduce various fixed point theorems, coincidence theorems, almost fixed point theorems, intersection theorems, and minimax theorems. Consequently, our new results generalize well-known works of Kakutani, Fan, Browder, Himmelberg, Lassonde, and others.     

Generalization of matching extensions in graphs (III)

Proposing them as a general framework, Liu and Yu (2001) [6] introduced (n,k,d)-graphs to unify the concepts of deficiency of matchings, n-factor-criticality and k-extendability. Let G be a graph and let n,k and d be non-negative integers such that n+2k+d+2?|V(G)| and |V(G)|−n−d is even. If on deleting any n vertices from G the remaining subgraph H of G contains a k-matching and each k-matching can be extended to a defect-d matching in H, then G is called an (n,k,d)-graph. In this paper, we obtain more properties of (n,k,d)-graphs, in particular the recursive relations of (n,k,d)-graphs for distinct parameters n,k and d. Moreover, we provide a characterization for maximal non-(n,k,d)-graphs.     

On the 3-restricted edge connectivity of permutation graphs

An edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and every component of G−W has at least k vertices. The k-restricted edge connectivity is defined as the minimum cardinality over all k-restricted edge cuts. A permutation graph is obtained by taking two disjoint copies of a graph and adding a perfect matching between the two copies. The k-restricted edge connectivity of a permutation graph is upper bounded by the so-called minimum k-edge degree. In this paper some sufficient conditions guaranteeing optimal k-restricted edge connectivity and super k-restricted edge connectivity for permutation graphs are presented for k=2,3.     

Edge-deletable IM-extendable graphs with minimum number of edges

A graph G is induced matching extendable, shortly IM-extendable, if every induced matching of G is included in a perfect matching of G. For a nonnegative integer k, a graph G is called a k-edge-deletable IM-extendable graph, if, for every F⊆E(G) with |F|=k, G−F is IM-extendable. In this paper, we characterize the k-edge-deletable IM-extendable graphs with minimum number of edges. We show that, for a positive integer k, if G is ak-edge-deletable IM-extendable graph on 2n vertices, then |E(G)|≥(k+2)n; furthermore, the equality holds if and only if either G≅K_k+2,k+2, or k=4r−2 for some integer r≥3 and G≅C₅[N_2r], where N_2r is the empty graph on 2r vertices and C₅[N_2r] is the graph obtained from C₅ by replacing each vertex with a graph isomorphic to N_2r.     

On constants in the Füredi-Hajnal and the Stanley-Wilf conjecture

For a given permutation matrix P, let fP(n) be the maximum number of 1-entries in an n×n(0,1)-matrix avoiding P and let SP(n) be the set of all n×n permutation matrices avoiding P. The Füredi-Hajnal conjecture asserts that cP:=limn→∞fP(n)/n is finite, while the Stanley-Wilf conjecture asserts that is finite.In 2004, Marcus and Tardos proved the Füredi-Hajnal conjecture, which together with the reduction introduced by Klazar in 2000 proves the Stanley-Wilf conjecture.We focus on the values of the Stanley-Wilf limit (sP) and the Füredi-Hajnal limit (cP). We improve the reduction and obtain which decreases the general upper bound on sP from sP?constconstO(klog(k)) to sP?constO(klog(k)) for any k×k permutation matrix P. In the opposite direction, we show .For a lower bound, we present for each k a k×k permutation matrix satisfying cP=Ω(k²).     

Conservation laws for some compacton equations using the multiplier approach

This paper is an application of the variational derivative method to the derivation of the conservation laws for partial differential equations. The conservation laws for (1+1) dimensional compacton k(2,2) and compacton k(3,3) equations are studied via multiplier approach. Also the conservation laws for (2+1) dimensional compacton Zk(2,2) equation are established by first computing the multipliers.     

Bidual renormings of Banach spaces

Given a separable Banach space X with no isomorphic copies of ℓ₁ and a separable subspace Y of its bidual, we provide a sufficient condition on Y to ensure that X admits an equivalent norm such that the restriction to Y of the corresponding bidual norm is midpoint locally uniformly rotund. This result applies to the separable subspaces of the bidual of a Banach space with a shrinking unconditional Schauder basis and to the bidual of the James space.     

On localization properties of Fourier transforms of hyperfunctions

In [A.G. Smirnov, Fourier transformation of Sato's hyperfunctions, Adv. Math. 196 (2005) 310-345] the author introduced a new generalized function space U(Rk) which can be naturally interpreted as the Fourier transform of the space of Sato's hyperfunctions on Rk. It was shown that all Gelfand-Shilov spaces (α>1) of analytic functionals are canonically embedded in U(Rk). While the usual definition of support of a generalized function is inapplicable to elements of and U(Rk), their localization properties can be consistently described using the concept of carrier cone introduced by Soloviev [M.A. Soloviev, Towards a generalized distribution formalism for gauge quantum fields, Lett. Math. Phys. 33 (1995) 49-59; M.A. Soloviev, An extension of distribution theory and of the Paley-Wiener-Schwartz theorem related to quantum gauge theory, Comm. Math. Phys. 184 (1997) 579-596]. In this paper, the relation between carrier cones of elements of and U(Rk) is studied. It is proved that an analytic functional is carried by a cone K⊂Rk if and only if its canonical image in U(Rk) is carried by K.