Decomposition of the completer-graph into completer-partiter-graphs

Forn ≥ r ≥ 1, letf _r (n) denote the minimum numberq, such that it is possible to partition all edges of the completer-graph onn vertices intoq completer-partiter-graphs. Graham and Pollak showed thatf ₂(n) =n ? 1. Here we observe thatf ₃(n) =n ? 2 and show that for every fixedr ≥ 2, there are positive constantsc ₁(r) andc ₂(r) such thatc ₁(r) ≤f _r (n)?n ^?[r/2] ≤n ₂(r) for alln ≥ r. This solves a problem of Aharoni and Linial. The proof uses some simple ideas of linear algebra.     

On the noise sensitivity of monotone functions

It is known that for all monotone functions f : {0, 1}ⁿ → {0, 1}, if x ∈ {0, 1}ⁿ is chosen uniformly at random and y is obtained from x by flipping each of the bits of x independently with probability ? = n^?α, then P[f(x) ≠ f(y)] < cn^?α+1/2, for some c > 0. Previously, the best construction of monotone functions satisfying P[f_n(x) ≠ f_n(y)] ≥ δ, where 0 < δ < 1/2, required ? ≥ c(δ)n^?α, where α = 1 ? ln 2/ln 3 = 0.36907 …, and c(δ) > 0. We improve this result by achieving for every 0 < δ < 1/2, P[f_n(x) ≠ f_n(y)] ≥ δ, with:

• ? = c(δ)n^?α for any α < 1/2, using the recursive majority function with arity k = k(α);
• ? = c(δ)n^?1/2log^tn for t = log₂ = .3257 …, using an explicit recursive majority function with increasing arities; and
• ? = c(δ)n^?1/2, nonconstructively, following a probabilistic CNF construction due to Talagrand.

We also study the problem of achieving the best dependence on δ in the case that the noise rate ? is at least a small constant; the results we obtain are tight to within logarithmic factors. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 23: 333–350, 2003     

Greedy colorings of uniform hypergraphs

We give a very short proof of an Erd?s conjecture that the number of edges in a non‐2‐colorable n‐uniform hypergraph is at least f(n)2ⁿ, where f(n) goes to infinity. Originally it was solved by József Beck in 1977, showing that f(n) at least clog n. With an ingenious recoloring idea he later proved that f(n) ≥ cn^1/3+o(1). Here we prove a weaker bound on f(n), namely f(n) ≥ cn^1/4. Instead of recoloring a random coloring, we take the ground set in random order and use a greedy algorithm to color. The same technique works for getting bounds on k‐colorability. It is also possible to combine this idea with the Lovász Local Lemma, reproving some known results for sparse hypergraphs (e.g., the n‐uniform, n‐regular hypergraphs are 2‐colorable if n ≥ 8). © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

On digraphs without antidirected cycles

Let t(n) denote the greatest number of arcs in a diagraph of orders n which does not contain any antidrected cycles. We show that [16/5(n ? 1)] ≤ t(n) ≤ 1/2 (n ? 1) for n ≥ 5. Let t_r (n) denote the corresponding quantity for r-colorable digraphs. We show that [16/5(n ? 1)] ≤ t₅(n) ≤ t₆(n) ≤ 10/3(n ? 1) for n ≥ 5 and that t₄(n) = 3(n ? 1) for n ≥ 3.     

The asymptotic number of labeled connected graphs with a given number of vertices and edges

Let c(n, q) be the number of connected labeled graphs with n vertices and q ≤ N = (2n ) edges. Let x = q/n and k = q ? n. We determine functions w_k ? 1. a(x) and φ(x) such that c(n, q) ? w_k(q^N)eⁿφ(x)+a(x) uniformly for all n and q ≥ n. If ? > 0 is fixed, n→ ∞ and 4q > (1 + ?)n log n, this formula simplifies to c(n, q) ? (N^q) exp(–ne^?2q/n). on the other hand, if k = o(n^1/2), this formula simplifies to c(n, n + k) ? 1/2 w_k (3/π)^1/2 (e/12k)^k/2nⁿ?^(3k?1)/2.     

On the Positive Definiteness of Certain Functions

For a coinmutative senugoup (S, +, *) with involution and a function f : S → [0, ∞), the set S(f) of those p ≥ 0 such that f^P is a positive definite function on S is a closed subsemigroup of [0, ∞) containing 0. For S = (IR, +, x* = -x) it may happen that S(f) = { kd : k ∈ N₀ } for some d > 0, and it may happen that S(f) = {0} ? [d, ∞) for some d > O. If α > 2 and if S = (?, +, n* = -n) and f(n) = e^?[n]α or S = (IN₀, +, n* = n) and f(n) = e^nα, then S(f) ∪ (0, c) = ? and [d, ∞) ? S(f) for some d ≥; c > 0. Although (with c maximal and d minimal) we have not been able to show c = d in all cases, this equality does hold if S = ? and α ≥ 3.4. In the last section we give sinipler proofs of previously known results concerning the positive definiteness of x → e^?||x||α on normed spaces.     

Graphs with unavoidable subgraphs with large degrees

Let ??(n, m) denote the class of simple graphs on n vertices and m edges and let G ∈ ?? (n, m). There are many results in graph theory giving conditions under which G contains certain types of subgraphs, such as cycles of given lengths, complete graphs, etc. For example, Turan's theorem gives a sufficient condition for G to contain a K_{k + 1} in terms of the number of edges in G. In this paper we prove that, for m = αn², α > (k - 1)/2k, G contains a K_{k + 1}, each vertex of which has degree at least f(α)n and determine the best possible f(α). For m = ?n²/4? + 1 we establish that G contains cycles whose vertices have certain minimum degrees. Further, for m = αn², α > 0 we establish that G contains a subgraph H with δ(H) ≥ f(α, n) and determine the best possible value of f(α, n).     

Disjoint bases in a polymatroid

Let f : 2^N → ⁺ be a polymatroid (an integer‐valued non‐decreasing submodular set function with f(??) = 0). We call S ? N a base if f(S) = f(N). We consider the problem of finding a maximum number of disjoint bases; we denote by m* be this base packing number. A simple upper bound on m* is given by k* = max{k : Σ_iεNf_A(i) ≥ kf_A(N),?A ? N} where f_A(S) = f(A ∪ S) ‐ f(A). This upper bound is a natural generalization of the bound for matroids where it is known that m* = k*. For polymatroids, we prove that m* ≥ (1 ? o(1))k*/lnf(N) and give a randomized polynomial time algorithm to find (1 ? o(1))k*/lnf(N) disjoint bases, assuming an oracle for f. We also derandomize the algorithm using minwise independent permutations and give a deterministic algorithm that finds (1 ? ε)k*/lnf(N) disjoint bases. The bound we obtain is almost tight because it is known there are polymatroids for which m* < (1 + o(1))k*/lnf(N). Moreover it is known that unless NP ? DTIME(n^{log log n}), for any ε > 0, there is no polynomial time algorithm to obtain a (1 + ε)/lnf(N)‐approximation to m*. Our result generalizes and unifies two results in the literature. © 2009 Wiley Periodicals, Inc. Random Struct. Alg., 2009     

Analytic Extension of Non Quasi - Analytic Whitney Jets of Beurling Type

Let (M_r)_r∈_?0 be a logarithmically convex sequence of positive numbers which verifies M₀ = 1 as well as M_r ≥ 1 for every r ∈ ? and defines a non quasi - analytic class. Let moreover F be a closed proper subset of ?ⁿ. Then for every function f on ?ⁿ belonging to the non quasi - analytic (M_r)-class of Beurling type, there is an element g of the same class which is analytic on ?,ⁿ F and such that D^αf(x) = D^αg(x) for every α ∈ ?ⁿ₀ and x ∈ F.     

Dual partially harmonic tensors and Brauer-Schur-Weyl duality

Let V be a 2m-dimensional symplectic vector space over an algebraically closed field K. Let $ \mathfrak{B}_n^{(f)} Let V be a 2m-dimensional symplectic vector space over an algebraically closed field K. Let \mathfrakB_n^(f) \mathfrak{B}_n^{(f)} be the two-sided ideal of the Brauer algebra \mathfrakB_n( - 2m ) {\mathfrak{B}_n}\left( { - 2m} \right) over K generated by e ₁ e _3⋯ e _2f-1 where 0 ≤ f ≤ [n/2]. Let HT_f ^?n \mathcal{H}\mathcal{T}_f^{ \otimes n} be the subspace of partial-harmonic tensors of valence f in V ^⊗n . In this paper we prove that dimHT_f ^?n \mathcal{H}\mathcal{T}_f^{ \otimes n} and dim \textEn\textd_K\textSp(V)( V ^?n \mathord

Decreasing the diameter of bounded degree graphs

Let f_d (G) denote the minimum number of edges that have to be added to a graph G to transform it into a graph of diameter at most d. We prove that for any graph G with maximum degree D and n > n₀ (D) vertices, f₂(G) = n − D − 1 and f₃(G) ≥ n − O(D³). For d ≥ 4, f_d (G) depends strongly on the actual structure of G, not only on the maximum degree of G. We prove that the maximum of f_d (G) over all connected graphs on n vertices is n/⌊d/2 ⌋ − O(1). As a byproduct, we show that for the n‐cycle C_n, f_d (C_n) = n/(2⌊d/2 ⌋ − 1) − O(1) for every d and n, improving earlier estimates of Chung and Garey in certain ranges. © 2000 John Wiley & Sons, Inc. J Graph Theory 35: 161–172, 2000     

Large induced forests in sparse graphs

For a graph G, let a(G) denote the maximum size of a subset of vertices that induces a forest. Suppose that G is connected with n vertices, e edges, and maximum degree Δ. Our results include: (a) if Δ ≤ 3, and G ≠ K₄, then a(G) ≥ n ? e/4 ? 1/4 and this is sharp for all permissible e ≡ 3 (mod 4); and (b) if Δ ≥ 3, then a(G) ≥ α(G) + (n ? α(G))/(Δ ? 1)². Several problems remain open. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 113–123, 2001     

Une Remarque sur une Formule Sommatoire liée à la Somme des Chiffres

Let g ≥ 2 be an integer, and let s(n) be the sum of the digits of n in basis g. Let f(n) be a complex valued function defined on positive integers, such that ?_{n ￡ x} f(n)=o(x)\sum_{n\le x} f(n)=o(x) . We propose sufficient conditions on the function f to deduce the equality ?_{n ￡ x} f(s(n))=o(x)\sum_{n\le x} f(s(n))=o(x) . Applications are given, for instance, on the equidistribution mod 1 of the sequence (s(n))^α, where α is a positive real number.     

On generalized shift bases for the wiener disc algebra

LetW(D) denote the set of functionsf(z)=Σ _n=0 ^∞ A _n Z ⁿ a _nzⁿ for which Σ_n=0 ^∞|a _n |<+∞. Given any finite set lcub;f _i (z)rcub; _i=1 ⁿ inW(D) the following are equivalent: (i) The generalized shift sequence lcub;f ₁(z)z ^kn ,f ₂(z)z ^kn+1, …,f _n (z)z ^(k+1)n−1rcub; _k=0 ^∞ is a basis forW(D) which is equivalent to the basis lcub;z ^m rcub; _m=0 ^∞ . (ii) The generalized shift sequence is complete inW(D), (iii) The function has no zero in |z|≦1, wherew=e ^2πiti /n.     

On the Greatest Common Divisor of u ? 1 and v ? 1 with u and v Near S{\cal S}-units

In [2], it was shown that if a and b are multiplicatively independent integers and ɛ > 0, then the inequality gcd (aⁿ − 1,bⁿ − 1) < exp(ɛn) holds for all but finitely many positive integers n. Here, we generalize the above result. In particular, we show that if f(x),f₁(x),g(x),g₁(x) are non-zero polynomials with integer coefficients, then for every ɛ > 0, the inequality gcd (f(n)aⁿ+g(n), f₁(n)bⁿ+g₁(n)) < exp(ne){\rm gcd}\, (f(n)a^n+g(n), f_1(n)b^n+g_1(n)) < \exp(n\varepsilon) holds for all but finitely many positive integers n.     

The number of K m,m -free graphs

A graph is called H-free if it contains no copy of H. Denote by f _n (H) the number of (labeled) H-free graphs on n vertices. Erdős conjectured that f _n (H) ≤ 2^{(1+o(1))ex(n,H)}. This was first shown to be true for cliques; then, Erdős, Frankl, and R?dl proved it for all graphs H with χ(H)≥3. For most bipartite H, the question is still wide open, and even the correct order of magnitude of log₂ f _n (H) is not known. We prove that f _n (K _m,m ) ≤ 2 ^O (n ^2−1/m ) for every m, extending the result of Kleitman and Winston and answering a question of Erdős. This bound is asymptotically sharp for m∈{2,3}, and possibly for all other values of m, for which the order of ex(n,K _m,m ) is conjectured to be Θ(n ^2−1/m ). Our method also yields a bound on the number of K _m,m -free graphs with fixed order and size, extending the result of Füredi. Using this bound, we prove a relaxed version of a conjecture due to Haxell, Kohayakawa, and Łuczak and show that almost all K _3,3-free graphs of order n have more than 1/20·ex(n,K _3,3) edges.     

Copositive pointwise approximation

We prove that if a functionf ∈C ⁽¹⁾ (I),I: = [?1, 1], changes its signs times (s ∈ ?) within the intervalI, then, for everyn > C, whereC is a constant which depends only on the set of points at which the function changes its sign, andk ∈ ?, there exists an algebraic polynomialP _n =P _n (x) of degree ≤n which locally inherits the sign off(x) and satisfies the inequality $$\left| {f\left( x \right) - P_n \left( x \right)} \right| \leqslant c\left( {s,k} \right)\left( {\frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right)\omega _k \left( {f'; \frac{1}{{n^2 }} + \frac{{\sqrt {1 - x^2 } }}{n}} \right), x \in I$$ , where ω _k (f′;t) is thekth modulus of continuity of the functionf’. It is also shown that iff ∈C (I) andf(x) ≥ 0,x ∈I then, for anyn ≥k ? 1, there exists a polynomialP _n =P _n (x) of degree ≤n such thatP _n (x) ≥ 0,x ∈I, and |f(x) ?P _n (x)| ≤c(k)ω _k (f;n ^?2 +n ^?1 √1 ?x ²),x ∈I.     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Inversion of the Radon transform with incomplete data

The Radon transform R(p, θ), θ∈S^n?1, p∈?¹, of a compactly supported function f(x) with support in a ball B_a of radius a centred at the origin is given for all $ \theta \in \mathop {S^{n - 1} }\limits^\tilde $, where $ \mathop {S^{n - 1} }\limits^\tilde $ is an open set on S^n?1, and all p∈(? ∞, ∞), n≥2. An approximate formula is given to calculate f(x) from the given data.     

On p-intersection representations

For a graph G = (V,E) and integer p, a p-intersection representation is a family F = {S_x: × E V} of subsets of a set S with the property that |S_u ∩ S_ν| ≥ p ∩ {u, ν} E E. It is conjectured in [1] that θ_p(G) ≤ θ (K_n/2,n/2) (1 + o(1)) holds for any graph with n vertices. This is known to be true for p = 1 by [4]. In [1], θ (K_n/2,n/2) ≥ (n² + (2p− 1n)n)/4p is proved for any n and p. Here, we show that this is asymptotically best possible. Further, we provide a bound on θp(G) for all graphs with bounded degree. In particular, we prove θp(G) ≤ O(n^1/p) for any graph Gwith the maximum degree bounded by a constant. Finally, we also investigate the value of θ_p for trees. Improving on an earlier result of M. Jacobson, A. Kézdy, and D. West, (The 2-intersection number of paths and bounded-degree trees, preprint), we show that θ₂(T) ≤ O(d√n) for any tree T with maximum-degree d and θ₂(T) ≤ O(n^3/4) for any tree on n vertices. We conjecture that our results can be further improved and that θ₂(T) ≤ O(d√n) as long as Δ(T) ≤ √n. If this conjecture is true, our method gives θ₂(T) ≤ O(n^3/4) for any tree T which would be the best possible. © 1996 John Wiley & Sons, Inc.