A covering lemma for L(ℝ)

Jensen's celebrated Covering Lemma states that if 0^# does not exist, then for any uncountable set of ordinals X, there is a Y∈L such that X⊆Y and |X| = |Y|. Working in ZF + AD alone, we establish the following analog: If ℝ^# does not exist, then L(ℝ) and V have exactly the same sets of reals and for any set of ordinals X with |X| ≥Θ ^{L (ℝ)}, there is a Y∈L(ℝ) such that X⊆Y and |X| = |Y|. Here ℝ is the set of reals and Θ is the supremum of the ordinals which are the surjective image of ℝ. Received: 29 October 1999 / Published online: 12 December 2001     

Distance sets of well-distributed planar sets for polygonal norms

LetX be a two-dimensional normed space, and letBX be the unit ball inX. We discuss the question of how large the set of extremal points ofBX may be ifX contains a well-distributed set whose distance set Δ satisfies the estimate |Δ∩[0,N]|≤CN ^3/2-ε. We also give a necessary and sufficient condition for the existence of a well-distributed set with |Δ∩[0,N]|≤CN.     

Bounds on a graph's security number

Let G=(V,E) be a graph. A set S⊆V is a defensive alliance if |N[x]∩S|?|N[x]-S| for every x∈S. Thus, each vertex of a defensive alliance can, with the aid of its neighbors in S, be defended from attack by its neighbors outside of S. An entire set S is secure if any subset X⊆S, not just singletons, can be defended from an attack from outside of S, under an appropriate definition of what such a defense implies. The security number s(G) of G is the cardinality of a smallest secure set. Bounds on s(G) are presented.     

Global secure sets of grid-like graphs

Let G=(V,E) be a graph and S⊆V. The set S is a secure set if ∀X⊆S,|N[X]∩S|≥|N[X]−S|, and S is a global secure set if S is a secure set and a dominating set. The cardinality of a minimum global secure set of G is the global security number of G, denoted γ_s(G). The sets studied in this paper are different from secure dominating sets studied in Cockayne et al. (2003) [3], Grobler and Mynhardt (2009) [8], or Klostermeyer and Mynhardt (2008) [13], which are also denoted by γ_s.In this paper, we provide results on the global security numbers of paths, cycles and their Cartesian products.     

Lower bounds for weak epsilon-nets and stair-convexity

A set N ⊂ ℝ ^d is called a weak ɛ-net (with respect to convex sets) for a finite X ⊂ ℝ ^d if N intersects every convex set C with |X ∩ C| ≥ ɛ|X|. For every fixed d ≥ 2 and every r ≥ 1 we construct sets X ⊂ ℝ ^d for which every weak 1/r -net has at least Ω(r log ^d−1 r) points; this is the first superlinear lower bound for weak ɛ-nets in a fixed dimension.     

On the Structure of Graphs with Bounded Asteroidal Number

 A set A⊆V of the vertices of a graph G=(V,E) is an asteroidal set if for each vertex a∈A, the set A\{a} is contained in one component of G−N[a]. The maximum cardinality of an asteroidal set of G, denoted by an (G), is said to be the asteroidal number of G. We investigate structural properties of graphs of bounded asteroidal number. For every k≥1, an (G)≤k if and only if an (H)≤k for every minimal triangulation H of G. A dominating target is a set D of vertices such that D∪S is a dominating set of G for every set S such that G[D∪S] is connected. We show that every graph G has a dominating target with at most an (G) vertices. Finally, a connected graph G has a spanning tree T such that d _T (x,y)−d _G (x,y)≤3·|D|−1 for every pair x,y of vertices and every dominating target D of G. Received: July 3, 1998 Final version received: August 10, 1999     

Security in graphs

Let G=(V,E) be a graph. A set S⊆V is a defensive alliance if |N[x]∩S|?|N[x]-S| for every x∈S. Thus, each vertex of a defensive alliance can, with the aid of its neighbors in S, be defended from attack by its neighbors outside of S. An entire set S is secure if any subset X⊆S can be defended from an attack from outside of S, under an appropriate definition of what such a defense implies. Necessary and sufficient conditions for a set to be secure are determined.     

On the number of popular differences

We prove that there exists an absolute constant c > 0 such that for any finite set A ⊆ ℤ with |A| ≥ 2 and any positive integer m < c|A|/ ln |A| there are at most m integers b > 0 satisfying |(A + b) \ A| ≤ m; equivalently, there are at most m positive integers possessing |A| −m (or more) representations as a difference of two elements of A.     

The security number of lexicographic products

A subset S of vertices of a graph G is a secure set if |N [X] ∩ S| ≥ |N [X] ? S| holds for any subset X of S, where N [X] denotes the closed neighborhood of X. The minimum cardinality s(G) of a secure set in G is called the security number of G. We investigate the security number of lexicographic product graphs by defining a new concept of tightly-securable graphs. In particular we derive several exact results for different families of graphs which yield some general results.     

Distance-Dominating Cycles in Quasi Claw-Free Graphs

We say that a graph G is quasi claw-free if every pair (a ₁, a ₂) of vertices at distance 2 satisfies {u∈N (a ₁)∩N (a ₂) | N[u]⊆N[a ₁]∪N [a ₂]}≠∅. A cycle C is m-dominating if every vertex of G is of distance at most m from C. We prove that if G is a κ-connected (κ≥2) quasi claw-free graph then either G has an m-dominating cycle or G has a set of at least κ+1 vertices such that the distance between every pair of them is at least 2m+3. Received: June 12, 1996 Revised: November 9, 1998     

On a graph’s security number

A secure set S⊆V of graph G=(V,E) is a set whose every nonempty subset can be successfully defended from an attack, under appropriate definitions of “attack” and “defended.” The set S is secure when |N[X]∩S|≥|N[X]−S| for every X⊆S. The smallest cardinality of a secure set in G is the security number of G. New bounds for the security number are established, the effect of some graph modifications on the security number is investigated, and the exact value of the security number for some families of graphs is given.     

The density of rational points on non-singular hypersurfaces

LetF(x) =F[x₁,…,x_n]∈ℤ[x₁,…,x_n] be a non-singular form of degree d≥2, and letN(F, X)=#{xεℤ ⁿ ;F(x)=0, |x|⩽X}, where . It was shown by Fujiwara [4] [Upper bounds for the number of lattice points on hypersurfaces,Number theory and combinatorics, Japan, 1984, (World Scientific Publishing Co., Singapore, 1985)] thatN(F, X)≪X ^n−2+2/n for any fixed formF. It is shown here that the exponent may be reduced ton - 2 + 2/(n + 1), forn ≥ 4, and ton - 3 + 15/(n + 5) forn ≥ 8 andd ≥ 3. It is conjectured that the exponentn - 2 + ε is admissable as soon asn ≥ 3. Thus the conjecture is established forn ≥ 10. The proof uses Deligne’s bounds for exponential sums and for the number of points on hypersurfaces over finite fields. However a composite modulus is used so that one can apply the ‘q-analogue’ of van der Corput’s AB process. Dedicated to the memory of Professor K G Ramanathan     

Relative ranks of Lipschitz mappings on countable discrete metric spaces

Let X be a countable discrete metric space and let XX denote the family of all functions on X. In this article, we consider the problem of finding the least cardinality of a subset A of XX such that every element of XX is a finite composition of elements of A and Lipschitz functions on X. It follows from a classical theorem of Sierpiński that such an A either has size at most 2 or is uncountable.We show that if X contains a Cauchy sequence or a sufficiently separated, in some sense, subspace, then |A|≤1. On the other hand, we give several results relating |A| to the cardinal d; defined as the minimum cardinality of a dominating family for NN. In particular, we give a condition on the metric of X under which |A|≥d holds and a further condition that implies |A|≤d. Examples satisfying both of these conditions include all subsets of Nk and the sequence of partial sums of the harmonic series with the usual euclidean metric.To conclude, we show that if X is any countable discrete subset of the real numbers R with the usual euclidean metric, then |A|=1 or almost always, in the sense of Baire category, |A|=d.     

Cycles in Partially Square Graphs

. In this work we consider finite undirected simple graphs. If G=(V,E) is a graph we denote by α(G) the stability number of G. For any vertex x let N[x] be the union of x and the neighborhood N(x). For each pair of vertices ab of G we associate the set J(a,b) as follows. J(a,b)={u∈N[a]∩N[b]∣N(u)⊆N[a]∪N[b]}. Given a graph G, its partially squareG ^* is the graph obtained by adding an edge uv for each pair u,v of vertices of G at distance 2 whenever J(u,v) is not empty. In the case G is a claw-free graph, G ^* is equal to G ². If G is k-connected, we cover the vertices of G by at most ⌈α(G ^*)/k⌉ cycles, where α(G ^*) is the stability number of the partially square graph of G. On the other hand we consider in G ^* conditions on the sum of the degrees. Let G be any 2-connected graph and t be any integer (t≥2). If ∑ _{x ∈ S} deg _G (x)≥|G|, for every t-stable set S⊆V(G) of G ^* then the vertex set of G can be covered with t−1 cycles. Different corollaries on covering by paths are given. Received: January 22, 1997 Final version received: February 15, 2000     

There Exist Highly Critically Connected Graphs of Diameter Three

Let κ(G) denote the (vertex) connectivity of a graph G. For ℓ≥0, a noncomplete graph of finite connectivity is called ℓ-critical if κ(G−X)=κ(G)−|X| for every X⊆V(G) with |X|≤ℓ. Mader proved that every 3-critical graph has diameter at most 4 and asked for 3-critical graphs having diameter exceeding 2. Here we give an affirmative answer by constructing an ℓ-critical graph of diameter 3 for every ℓ≥3.     

Alliance free and alliance cover sets

A defensive (offensive) k-alliance in Γ = (V,E) is a set S ⊆ V such that every υ in S (in the boundary of S) has at least k more neighbors in S than it has in V / S. A set X ⊆ V is defensive (offensive) k-alliance free, if for all defensive (offensive) k-alliance S, S/X ≠ ∅, i.e., X does not contain any defensive (offensive) k-alliance as a subset. A set Y ⊆ V is a defensive (offensive) k-alliance cover, if for all defensive (offensive) k-alliance S, S ∩ Y ≠ ∅, i.e., Y contains at least one vertex from each defensive (offensive) k-alliance of Γ. In this paper we show several mathematical properties of defensive (offensive) k-alliance free sets and defensive (offensive) k-alliance cover sets, including tight bounds on their cardinality.     

Superstability of the generalized orthogonality equation on restricted domains

Chmielinski has proved in the paper [4] the superstability of the generalized orthogonality equation |〈f(x), f(y)〉| = |〈x,y〉|. In this paper, we will extend the result of Chmielinski by proving a theorem: LetD _n be a suitable subset of ℝⁿ. If a function f:D _n → ℝⁿ satisfies the inequality ∥〈f(x), f(y)〉| |〈x,y〉∥ ≤ φ(x,y) for an appropriate control function φ(x, y) and for allx, y ∈ D _n, thenf satisfies the generalized orthogonality equation for anyx, y ∈ D _n.     

Random weighting,asymptotic counting,and inverse isoperimetry

For a family X of k-subsets of the set {1, …, n}, let |X| be the cardinality of X and let Γ(X, μ) be the expected maximum weight of a subset from X when the weights of 1, …, n are chosen independently at random from a symmetric probability distribution μ on ℝ. We consider the inverse isoperimetric problem of finding μ for which Γ(X, μ) gives the best estimate of ln |X|. We prove that the optimal choice of μ is the logistic distribution, in which case Γ(X, μ) provides an asymptotically tight estimate of ln |X| as k ⁻¹ ln |X} grows. Since in many important cases Γ(X, μ) can be easily computed, we obtain computationally efficient approximation algorithms for a variety of counting problems. Given μ, we describe families X of a given cardinality with the minimum value of Γ(X, μ), thus extending and sharpening various isoperimetric inequalities in the Boolean cube. The research of the first author was partially supported by NSF Grants DMS 9734138 and DMS 0400617. The research of the second author was partially supported by ISF Grant 039-7165 and by GIF grant I-2052.     

The subalgebra systems of direct powers

A simple characterization of the subalgebra systems of direct powers of finitary universal algebras on a fixed infinite setA is given. For |I|≥|A| such subalgebra system of anI-power is precisely an algebraic closure systemS onA ^I closed under mutations ofI (which encompass both the precomposition by permutations ofI and allowing the values at specified elements ofI to become unrestricted) and such that each function in the intersection ofS is constant. For |I|<|A| the subalgebra systems ofI-powers are obtained as the restrictions toI of such closure systems on someA ^J withJ⊇I and |J|=|A|. Presented by J. D. Monk.     

NON-EMPTY CROSS-2-INTERSECTING FAMILIES OF SUBSETS

Let Cdenote the set of all k-subests of an n-set.Assume Alohtain in Ca,and A lohtain in (A,B) is called a cross-2-intersecting family if |A B≥2 for and A∈A,B∈B.In this paper,the best upper bounds of the cardinalities for non-empty cross-2-intersecting familles of a-and b-subsets are obtained for some a and b,A new proof for a Frankl-Tokushige theorem[6] is also given.