On the ratios between packing and domination parameters of a graph

The relationship ρ_L(G)≤ρ(G)≤γ(G) between the lower packing number ρ_L(G), the packing number ρ(G) and the domination number γ(G) of a graph G is well known. In this paper we establish best possible bounds on the ratios of the packing numbers of any (connected) graph to its six domination-related parameters (the lower and upper irredundance numbers ir and IR, the lower and upper independence numbers i and β, and the lower and upper domination numbers γ and Γ). In particular, best possible constants a_θ, b_θ, c_θ and d_θ are found for which the inequalities and hold for any connected graph G and all θ∈{ir,γ,i,β,Γ,IR}. From our work it follows, for example, that and for any connected graph G, and that these inequalities are best possible.     

On a problem of Rolewicz about Banach spaces that admit support sets

We construct an example of a nonseparable Banach space which does not admit a support set.² It is a consistent (and necessarily independent from the axioms of ZFC) example of a space C(K) of continuous functions on a compact Hausdorff K with the supremum norm. The construction depends on a construction of a Boolean algebra with some combinatorial properties. The space is also hereditarily Lindelöf in the weak topology but it doesn't have any nonseparable subspace nor any nonseparable quotient which is a C(K) space for K dispersed.     

Independence for knights on hexagon and triangle boards

For three kinds of chess-like knights, one on triangle and two on hexagon boards, the independence numbers for their knight graphs are considered. We determine these numbers completely for two kinds of these knights, and for one residue class modulo 4 in the case of the third kind.     

On αrγs(k)-perfect graphs

For some integer k0 and two graph parameters π and τ, a graph G is called πτ(k)-perfect, if π(H)−τ(H)k for every induced subgraph H of G. For r1 let α_r and γ_r denote the r-(distance)-independence and r-(distance)-domination number, respectively. In (J. Graph Theory 32 (1999) 303–310), I. Zverovich gave an ingenious complete characterization of α₁γ₁(k)-perfect graphs in terms of forbidden induced subgraphs. In this paper we study α_rγ_s(k)-perfect graphs for r,s1. We prove several properties of minimal α_rγ_s(k)-imperfect graphs. Generalizing Zverovich's main result in (J. Graph Theory 32 (1999) 303–310), we completely characterize α_2r−1γ_r(k)-perfect graphs for r1. Furthermore, we characterize claw-free α₂γ₂(k)-perfect graphs.     

Karp complexity and classes with the independence property

A class K of structures is controlled if for all cardinals λ, the relation of L_∞,λ-equivalence partitions K into a set of equivalence classes (as opposed to a proper class). We prove that no pseudo-elementary class with the independence property is controlled. By contrast, there is a pseudo-elementary class with the strict order property that is controlled (see Arch. Math. Logic 40 (2001) 69–88).     

Multidimensional dependency measures

The problem of dependency between two random variables has been studied throughly in the literature. Many dependency measures have been proposed according to concepts such as concordance, quadrant dependency, etc. More recently, the development of the Theory of Copulas has had a great impact in the study of dependence of random variables specially in the case of continuous random variables. In the case of the multivariate setting, the study of the strong mixing conditions has lead to interesting results that extend some results like the central limit theorem to the case of dependent random variables.In this paper, we study the behavior of a multidimensional extension of two well-known dependency measures, finding their basic properties as well as several examples. The main difference between these measures and others previously proposed is that these ones are based on the definition of independence among n random elements or variables, therefore they provide a nice way to measure dependency.The main purpose of this paper is to present a sample version of one of these measures, find its properties, and based on this sample version to propose a test of independence of multivariate observations. We include several references of applications in Statistics.     

On the geometric structure of independence systems

A bouquet of matroids is a combinatorial structure that generalizes the properties of matroids. Given an independence system, there exist several bouquets of matroids having the same family of independent sets. We show that the collection of these geometries forms in general a meet semi-lattice and, in some cases, a lattice (for instance, when is the family of the stable sets in a graph). Moreover, one of the bouquets that correspond to the highest elements in the meet semi-lattice provides the smallest decomposition of into matroidal families, such that the rank functions of the different matroids have the same values for common sets. In the last section, we give sharp bounds on the performance of the greedy algorithm, using parameters of some special bouquets in the semi-lattice.     

Regular (2, 2)-systems

Let (E,I) be an independence system over the finite setE = {e ₁, ,e _n }, whose elements are orderede ₁ e _n . (E,I) is called regular, if the independence of {e _l , ,e _{l k} },l ₁ < <l _k , implies that of {e _{m l} , ,e _{m k} }, wherem _l < ··· <m _k andl ₁ m ₁, ,l _k m _k . (E,I) is called a 2-system, if for anyI I,e E I the setI {e } contains at most 2 distinct circuitsC, C I and the number 2 is minimal with respect to this property. If, in addition, for any two independent setsI andJ the family (C J, C C (J, I)), whereC(J, I) denotes {C C:e J I C {e}}, can be partitioned into 2 subfamilies each of which possesses a transversal, then (E,I) is called a (2, 2)-system. In this paper we characterize regular 2-systems and we show that the classes of regular 2-systems resp. regular (2, 2)-systems are identical.     

On distance local connectivity and the hamiltonian index

In this paper we introduce the concept of distance local connectivity of a graph. We give several sufficient conditions in terms of the independence number and of the vertex degrees, and we show a relation between the distance local connectivity and the hamiltonian index of a graph.     

Strong Laws of Large Numbers for Sublinear Expectation under Controlled 1st Moment Condition

This paper deals with strong laws of large numbers for sublinear expectation under controlled 1st moment condition. For a sequence of independent random variables, the author obtains a strong law of large numbers under conditions that there is a control random variable whose 1st moment for sublinear expectation is finite. By discussing the relation between sublinear expectation and Choquet expectation, for a sequence of i.i.d random variables, the author illustrates that only the finiteness of uniform 1st moment for sublinear expectation cannot ensure the validity of the strong law of large numbers which in turn reveals that our result does make sense.