A note on stable sets,groups, and theories with NIP

Let M be an arbitrary structure. Then we say that an M ‐formula φ (x) defines a stable set in M if every formula φ (x) ∧ α (x, y) is stable. We prove: If G is an M ‐definable group and every definable stable subset of G has U ‐rank at most n (the same n for all sets), then G has a maximal connected stable normal subgroup H such that G /H is purely unstable. The assumptions hold for example if M is interpretable in an o‐minimal structure. More generally, an M ‐definable set X is weakly stable if the M ‐induced structure on X is stable. We observe that, by results of Shelah, every weakly stable set in theories with NIP is stable. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Claw‐decompositions and tutte‐orientations

We conjecture that, for each tree T, there exists a natural number k_T such that the following holds: If G is a k_T‐edge‐connected graph such that |E(T)| divides |E(G)|, then the edges of G can be divided into parts, each of which is isomorphic to T. We prove that for T = K_1,3 (the claw), this holds if and only if there exists a (smallest) natural number k_t such that every k_t‐edge‐connected graph has an orientation for which the indegree of each vertex equals its outdegree modulo 3. Tutte's 3‐flow conjecture says that k_t = 4. We prove the weaker statement that every 4$\lceil$ log n$\rceil$ ‐edge‐connected graph with n vertices has an edge‐decomposition into claws provided its number of edges is divisible by 3. We also prove that every triangulation of a surface has an edge‐decomposition into claws. © 2006 Wiley Periodicals, Inc. J Graph Theory 52: 135–146, 2006     

Convex Sets in Acyclic Digraphs

A non-empty set X of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by X is connected and it is called convex if no two vertices of X are connected by a directed path in which some vertices are not in X. The set of convex sets (connected convex sets) of an acyclic digraph D is denoted by and its size by co(D) (cc(D)). Gutin et al. (2008) conjectured that the sum of the sizes of all convex sets (connected convex sets) in D equals Θ(n · co(D)) (Θ(n · cc(D))) where n is the order of D. In this paper we exhibit a family of connected acyclic digraphs with and . We also show that the number of connected convex sets of order k in any connected acyclic digraph of order n is at least n − k + 1. This is a strengthening of a theorem of Gutin and Yeo.     

On the Beck‐Fiala conjecture for random set systems

Motivated by the Beck‐Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems (X,Σ), where each element x ∈ X lies in t randomly selected sets of Σ, where t is an integer parameter. We provide new bounds in two regimes of parameters. We show that when |Σ| ≥ |X| the hereditary discrepancy of (X,Σ) is with high probability ; and when |X| ? |Σ|^t the hereditary discrepancy of (X,Σ) is with high probability O(1). The first bound combines the Lovász Local Lemma with a new argument based on partial matchings; the second follows from an analysis of the lattice spanned by sparse vectors.     

A hole‐size bound for incomplete t‐wise balanced designs

An incomplete t‐wise balanced design of index λ is a triple (X,H,??) where X is a υ–element set, H is a subset of X called the hole, and B is a collection of subsets of X called blocks, such that, every t‐element subset of X is either in H or in exactly λ blocks, but not both. If H is a hole in an incomplete t‐wise balanced design of order υ and index λ, then |H| ≤ υ/2 if t is odd and |H| ≤ (υ ? 1)/2 if t is even. In particular, this result establishes the validity of Kramer's conjecture that the maximal size of a block in a Steiner t‐wise balanced design is at most υ/2 if t is odd and at most (υ?1)/2 when t is even. © 2001 John Wiley & Sons, Inc. J Combin Designs 9: 269–284, 2001     

3‐Factor‐Criticality of Vertex‐Transitive Graphs

A graph of order n is p ‐factor‐critical, where p is an integer of the same parity as n, if the removal of any set of p vertices results in a graph with a perfect matching. 1‐factor‐critical graphs and 2‐factor‐critical graphs are factor‐critical graphs and bicritical graphs, respectively. It is well known that every connected vertex‐transitive graph of odd order is factor‐critical and every connected nonbipartite vertex‐transitive graph of even order is bicritical. In this article, we show that a simple connected vertex‐transitive graph of odd order at least five is 3‐factor‐critical if and only if it is not a cycle.     

Tetravalent half‐edge‐transitive graphs and non‐normal Cayley graphs

Let X be a vertex‐transitive graph, that is, the automorphism group Aut(X) of X is transitive on the vertex set of X. The graph X is said to be symmetric if Aut(X) is transitive on the arc set of X. suppose that Aut(X) has two orbits of the same length on the arc set of X. Then X is said to be half‐arc‐transitive or half‐edge‐transitive if Aut(X) has one or two orbits on the edge set of X, respectively. Stabilizers of symmetric and half‐arc‐transitive graphs have been investigated by many authors. For example, see Tutte [Canad J Math 11 (1959), 621–624] and Conder and Maru?i? [J Combin Theory Ser B 88 (2003), 67–76]. It is trivial to construct connected tetravalent symmetric graphs with arbitrarily large stabilizers, and by Maru?i? [Discrete Math 299 (2005), 180–193], connected tetravalent half‐arc‐transitive graphs can have arbitrarily large stabilizers. In this article, we show that connected tetravalent half‐edge‐transitive graphs can also have arbitrarily large stabilizers. A Cayley graph Cay(G, S) on a group G is said to be normal if the right regular representation R(G) of G is normal in Aut(Cay(G, S)). There are only a few known examples of connected tetravalent non‐normal Cayley graphs on non‐abelian simple groups. In this article, we give a sufficient condition for non‐normal Cayley graphs and by using the condition, infinitely many connected tetravalent non‐normal Cayley graphs are constructed. As an application, all connected tetravalent non‐normal Cayley graphs on the alternating group A₆ are determined. © 2011 Wiley Periodicals, Inc. J Graph Theory     

Bernstein–Nikolskii and Plancherel–Polya inequalities in Lp ‐norms on non‐compact symmetric spaces

By using Bernstein‐type inequality we define analogs of spaces of entire functions of exponential type in L_p (X), 1 ≤ p ≤ ∞, where X is a symmetric space of non‐compact. We give estimates of L_p ‐norms, 1 ≤ p ≤ ∞, of such functions (the Nikolskii‐type inequalities) and also prove the L_p ‐Plancherel–Polya inequalities which imply that our functions of exponential type are uniquely determined by their inner products with certain countable sets of measures with compact supports and can be reconstructed from such sets of “measurements” in a stable way (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

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     

On Countable Products of Finite Hausdorff Spaces

We investigate in ZF (i.e., Zermelo‐Fraenke set theory without the axiom of choice) conditions that are necessary and sufficient for countable products ∏_m∈ℕX_m of (a) finite Hausdorff spaces X_m resp. (b) Hausdorff spaces X_m with at most n points to be compact resp. Baire. Typica results: (i) Countable products of finite Hausdorff spaces are compact (resp. Baire) if and only if countable products of non‐empty finite sets are non‐empty. (ii) Countable products of discrete spaces with at most n + 1 points are compact (resp. Baire) if and only if countable products of non‐empty sets with at most n points are non‐empty.     

On the complexity of branch‐and‐bound search for random trees

Let T_n be a b‐ary tree of height n, which has independent, non‐negative, identically distributed random variables associated with each of its edges, a model previously considered by Karp, Pearl, McDiarmid, and Provan. The value of a node is the sum of all the edge values on its path to the root. Consider the problem of finding the minimum leaf value of T_n. Assume that the edge random variable X is nondegenerate, has E {X^θ}<∞ for some θ>2, and satisfies bP{X=c}<1 where c is the leftmost point of the support of X. We analyze the performance of the standard branch‐and‐bound algorithm for this problem and prove that the number of nodes visited is in probability (β+o(1))ⁿ, where β∈(1, b) is a constant depending only on the distribution of the edge random variables. Explicit expressions for β are derived. We also show that any search algorithm must visit (β+o(1))ⁿ nodes with probability tending to 1, so branch‐and‐bound is asymptotically optimal where first‐order asymptotics are concerned. ©1999 John Wiley & Sons, Inc. Random Struct. Alg., 14: 309–327, 1999     

The symmetric (2k,k)‐graphs

A noncomplete graph G is called an (n, k)‐graph if it is n‐connected and G − X is not (n − |X| + 1)‐connected for any X ⊆ V(G) with |X| ≤ k. Mader conjectured that for k ≥ 3 the graph K_{2k + 2} − (1‐factor) is the unique (2k, k)‐graph. We settle this conjecture for strongly regular graphs, for edge transitive graphs, and for vertex transitive graphs. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 35–51, 2001     

A class of symmetric graphs with 2‐arc transitive quotients

Let Γ be an X‐symmetric graph admitting an X‐invariant partition ?? on V(Γ) such that Γ_?? is connected and (X, 2)‐arc transitive. A characterization of (Γ, X, ??) was given in [S. Zhou Eur J Comb 23 (2002), 741–760] for the case where |B|>|Γ(C)∩B|=2 for an arc (B, C) of Γ_??.We con‐sider in this article the case where |B|>|Γ(C)∩B|=3, and prove that Γ can be constructed from a 2‐arc transitive graph of valency 4 or 7 unless its connected components are isomorphic to 3 K ₂, C ₆ or K _{3, 3}. As a byproduct, we prove that each connected tetravalent (X, 2)‐transitive graph is either the complete graph K ₅ or a near n‐gonal graph for some n?4. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 232–245, 2010     

Low sets without subsets of higher many‐one degree

Given a reducibility ?_r, we say that an infinite set A is r‐introimmune if A is not r‐reducible to any of its subsets B with |A\B| = ∞. We consider the many‐one reducibility ?_m and we prove the existence of a low₁ m‐introimmune set in Π⁰₁ and the existence of a low₁ bi‐m‐introimmune set.     

Certain classes of potentials for p ‐Laplacian to be non‐degenerate

Given a positive integer n and an exponent 1 ≤ α ≤ ∞. We will find explicitly the optimal bound r_n such that if the L^α norm of a potential q (t ) satisfies ‖q ‖equation/tex2gif-inf-2.gif < r_n then the n ^th Dirichlet eigenvalue of the onedimensional p ‐Laplacian with the potential q (t ): (|u ′|^{p –2} u ′)′ + (λ + q (t )) |u |^{p –2}u = 0 (1 < p < ∞) will be positive. Using these bounds, we will construct, for the Dirichlet, the Neumann, the periodic or the antiperiodic boundary conditions, certain classes of potentials q (t ) so that the p ‐Laplacian with the potential q (t ) is non‐degenerate, which means that the above equation with λ = 0 has only the trivial solution verifying the corresponding boundary condition. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Indivisible plexes in latin squares

In this paper, we present two constructions of divisible difference sets based on skew Hadamard difference sets. A special class of Hadamard difference sets, which can be derived from a skew Hadamard difference set and a Paley type regular partial difference set respectively in two groups of orders v ₁ and v ₂ with |v ₁ − v ₂| = 2, is contained in these constructions. Some result on inequivalence of skew Hadamard difference sets is also given in the paper. As a consequence of Delsarte’s theorem, the dual set of skew Hadamard difference set is also a skew Hadamard difference set in an abelian group. We show that there are seven pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 3⁵ or 3⁷, and also at least four pairwisely inequivalent skew Hadamard difference sets in the elementary abelian group of order 3⁹. Furthermore, the skew Hadamard difference sets deduced by Ree-Tits slice symplectic spreads are the dual sets of each other when q ≤ 3¹¹.      

Characterization of set‐valued conditional expectation

For an essentially bounded closed‐convex‐nonempty set‐valued random variable, it is shown that the conditional expectation is characterized by its integrals over the sets of the associated σ ‐field. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Geometric Models for Quasicrystals I. Delone Sets of Finite Type

This paper studies three classes of discrete sets X in ⁿ which have a weak translational order imposed by increasingly strong restrictions on their sets of interpoint vectors X-X . A finitely generated Delone set is one such that the abelian group [X-X] generated by X-X is finitely generated, so that [X-X] is a lattice or a quasilattice. For such sets the abelian group [X] is finitely generated, and by choosing a basis of [X] one obtains a homomorphism . A Delone set of finite type is a Delone set X such that X-X is a discrete closed set. A Meyer set is a Delone set X such that X-X is a Delone set. Delone sets of finite type form a natural class for modeling quasicrystalline structures, because the property of being a Delone set of finite type is determined by ``local rules.' That is, a Delone set X is of finite type if and only if it has a finite number of neighborhoods of radius 2R , up to translation, where R is the relative denseness constant of X . Delone sets of finite type are also characterized as those finitely generated Delone sets such that the map ϕ satisfies the Lipschitz-type condition ||ϕ (x) - ϕ (x')|| < C ||x - x'|| for x, x' ∈X , where the norms || . . . || are Euclidean norms on ^s and ⁿ , respectively. Meyer sets are characterized as the subclass of Delone sets of finite type for which there is a linear map and a constant C such that ||ϕ (x) - (x)|| for all x∈X . Suppose that X is a Delone set with an inflation symmetry, which is a real number η > 1 such that . If X is a finitely generated Delone set, then η must be an algebraic integer; if X is a Delone set of finite type, then in addition all algebraic conjugates | η ' | η; and if X is a Meyer set, then all algebraic conjugates | η ' | 1. Received May 9, 1997, and in revised form March 5, 1998.     

n ‐fold filters in BL‐algebras

In this paper we introduce n ‐fold (positive) implicative basis logic and the related algebras called n ‐fold (positive) implicative BL‐algebras. Also we define n ‐fold (positive) implicative filters and we prove some relations between these filters and construct quotient algebras via these filters. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new infinite class of S(3, {4, 5, 7}, v)

A t‐wise balanced design ( at BD) of order v and block sizes from K , denoted by S ( t , K , v ), is a pair ( X , ??), where X is a v ‐element set and ?? is a set of subsets of X , called blocks , with the property that | B |∈ K for any B ∈?? and every t ‐element subset of X is contained in a unique block. In this article, we shall show that there is an S ( 3 , { 4 , 5 , 7 }, v ) for any positive integer v ≡ 7 ( mod12 ) with v ≠ 19 . Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 20:68–80, 2012