Martin boundary of unlimited covering surfaces

LetW be an open Riemann surface and ap-sheeted (1<p<∞) unlimited covering surface ofW. Denote by Δ¹ (resp., ) the minimal Martin boundary ofW (resp., ). For ζ ∈ Δ, let ζ be the (cardinal) number of the set of pionts which lie over ζ and the class of open connected subsetsM ofW such thatM∪{ζ} is a minimal fine neighborhood of ζ. Our main result is the following: , where is the number of components of π^-1 M and π is the projection of ontoW. Moreover, some applications of the above results are discussed whenW is the unit disc.     

Natural bounded concentrators

We give the first known direct construction for linear families of bounded concentrators. The construction is explicit and the results are simple natural bounded concentrators. Let be the field withq elements,g(x)∈F _q [x] of degree greater than or equal to 2, and . LetI _nputs=H/A,O _utputs=H/B, and draw an edge betweenaA andbB iffaA∩bB≠ϕ. We prove that for everyq≥5 this graph is an concentrator. Part of this research was done while the author was at the department of Computer Science, The University of British Columbia, Vancouver, B.C., Canada.     

The non-orientable genus of some metacyclic groups

We describe non-orientable, octagonal embeddings for certain 4-valent, bipartite Cayley graphs of finite metacyclic groups, and give a class of examples for which this embedding realizes the non-orientable genus of the group. This yields a construction of Cayley graphs for which is arbitrarily large, where and are the orientable genus and the non-orientable genus of the Cayley graph.Work supported in part by the Research Council of Slovenia, Yugoslavia and NSF Contract DMS-8717441.Supported by NSF Contract DMS-8601760.     

Unit-distance graphs,graphs on the integer lattice and a Ramsey type result

Summary Let (R ², 1) denote the graph withR ² as the vertex set and two vertices adjacent if and only if their Euclidean distance is 1. The problem of determining the chromatic number(R ², 1) is still open; however,(R ², 1) is known to be between 4 and 7. By a theorem of de Bruijn and Erdös, it is enough to consider only finite subgraphs of (R ², 1). By a recent theorem of Chilakamarri, it is enough to consider certain graphs on the integer lattice. More precisely, forr > 0, let (Z ²,r, ) denote a graph with vertex setZ ² and two vertices adjacent if and only if their Euclidean distance is in the closed interval [r – ,r + ]. A simple graph is faithfully -recurring inZ ² if there exists a real numberd > 0 such that, for arbitrarily larger, G is isomorphic to a subgraph of (Z ²,r, ) in which every pair of vertices are at least distancedr apart. Chilakamarri has shown that, ifG is a finite simple graph, thenG is isomorphic to a subgraph of (R ², 1) if and only ifG is faithfully -recurring inZ ². In this paper we prove that(Z ²,r, ) 5 for integersr 1. We also prove a Ramsey type result which states that for any integerr > 1, and any coloring ofZ ² either there exists a monochromatic pair of vertices with their distance in the closed interval [r – ,r + ] or there exists a set of three vertices closest to each other with three distinct colors.     

On the structure ofp-zero-sum free sequences and its application to a variant of Erdös-Ginzburg-Ziv theorem

Letp be any odd prime number. Letk be any positive integer such that . LetS = (a ₁,a ₂,...,a _2p−k ) be any sequence in ℤ_p such that there is no subsequence of lengthp of S whose sum is zero in ℤ_p. Then we prove that we can arrange the sequence S as follows:

On matroid intersections

This paper exploits and extends results of Edmonds, Cunningham, Cruse and McDiarmid on matroid intersections. Letr ₁ andr ₂ be rank functions of two matroids defined on the same setE. For everyS ⊂E, letr ₁₂(S) be the largest cardinality of a subset ofS independent in both matroids, 0≦k≦r ₁₂(E)−1. It is shown that, ifc is nonnegative and integral, there is ay: 2 ^E →Z ⁺ which maximizes and , subject toy≧0, ∀j∈E, .     

Maximum set of edges no two covered by a clique

Leth(G) be the largest number of edges of the graphG. no two of which are contained in the same clique. ForG without isolated vertices it is proved that ifh(G)≦5, thenχ( )≦h(G), but ifh(G)=6 thenχ( ) can be arbitrarily large.     

Pseudo algebraically closed fields over rings

We prove that for almost allσ ∈G ℚ the field has the following property: For each absolutely irreducible affine varietyV of dimensionr and each dominating separable rational mapϕ:V→ there exists a point a ∈ such thatϕ(a) ∈ ℤ^r. We then say that is PAC over ℤ. This is a stronger property then being PAC. Indeed we show that beside the fields other fields which are algebraic over ℤ and are known in the literature to be PAC are not PAC over ℤ.     

On the vector space of 0-configurations

Let α be a rational-valued set-function on then-element sexX i.e. α(B) εQ for everyB ⫅X. We say that α defines a 0-configuration with respect toA⫅2 ^x if for everyA εA we have α(B)=0. The 0-configurations form a vector space of dimension 2 ⁿ − |A| (Theorem 1). Let 0 ≦t<k ≦n and letA={A ⫅X: |A| ≦t}. We show that in this case the 0-configurations satisfying α(B)=0 for |B|>k form a vector space of dimension , we exhibit a basis for this space (Theorem 4). Also a result of Frankl, Wilson [3] is strengthened (Theorem 6).     

Degree and local connectivity in digraphs

It is shown that there is a digraphD of minimum outdegree 12m and μ(x, y; D)=11m, but every digraphD of minimum outdegreen contains verticesx ≠y withλ(x, y; D)≧n−1, whereμ(x, y; D) andλ(x, y; D) denote the maximum number of openly disjoint and edge-disjoint paths, respectively.     

Lifts, Discrepancy and Nearly Optimal Spectral Gap*

We present a new explicit construction for expander graphs with nearly optimal spectral gap. The construction is based on a series of 2-lift operations. Let G be a graph on n vertices. A 2-lift of G is a graph H on 2n vertices, with a covering map π :H →G. It is not hard to see that all eigenvalues of G are also eigenvalues of H. In addition, H has n “new” eigenvalues. We conjecture that every d-regular graph has a 2-lift such that all new eigenvalues are in the range (if true, this is tight, e.g. by the Alon–Boppana bound). Here we show that every graph of maximal degree d has a 2-lift such that all “new” eigenvalues are in the range for some constant c. This leads to a deterministic polynomial time algorithm for constructing arbitrarily large d-regular graphs, with second eigenvalue . The proof uses the following lemma (Lemma 3.3): Let A be a real symmetric matrix with zeros on the diagonal. Let d be such that the l₁ norm of each row in A is at most d. Suppose that for every x,y ∈{0,1}ⁿ with ‹x,y›=0. Then the spectral radius of A is O(α(log(d/α)+1)). An interesting consequence of this lemma is a converse to the Expander Mixing Lemma. * This research is supported by the Israeli Ministry of Science and the Israel Science Foundation.     

On A Hypergraph Turán Problem Of Frankl

Let be the 2k-uniform hypergraph obtained by letting P₁, . . .,P_r be pairwise disjoint sets of size k and taking as edges all sets P_i∪P_j with i ≠ j. This can be thought of as the ‘k-expansion’ of the complete graph K_r: each vertex has been replaced with a set of size k. An example of a hypergraph with vertex set V that does not contain can be obtained by partitioning V = V1 ∪V₂ and taking as edges all sets of size 2k that intersect each of V₁ and V₂ in an odd number of elements. Let denote a hypergraph on n vertices obtained by this construction that has as many edges as possible. For n sufficiently large we prove a conjecture of Frankl, which states that any hypergraph on n vertices that contains no has at most as many edges as . Sidorenko has given an upper bound of for the Tur′an density of for any r, and a construction establishing a matching lower bound when r is of the form 2^p+1. In this paper we also show that when r=2^p+1, any -free hypergraph of density looks approximately like Sidorenko’s construction. On the other hand, when r is not of this form, we show that corresponding constructions do not exist and improve the upper bound on the Turán density of to , where c(r) is a constant depending only on r. The backbone of our arguments is a strategy of first proving approximate structure theorems, and then showing that any imperfections in the structure must lead to a suboptimal configuration. The tools for its realisation draw on extremal graph theory, linear algebra, the Kruskal–Katona theorem and properties of Krawtchouck polynomials. * Research supported in part by NSF grants DMS-0355497, DMS-0106589, and by an Alfred P. Sloan fellowship.     

Addendum To Schrijver's Work On Minimum Permanents

Let denote the set of n×n binary matrices which have each row and column sum equal to k. For 2≤k≤n→∞ we show that is asymptotically equal to (k−1)^k−1k^2−k. This confirms Conjecture 23 in Minc's catalogue of open problems. * Written while the author was employed by the Department of Computer Science at the Australian National University.     

Hypergraphs in which all disjoint pairs have distinct unions

Let ℓ be a set-system ofr-element subsets on ann-element set,r≧3. It is proved that if |ℓ|>3.5 then ℓ contains four distinct membersA, B, C, D such thatA∪B=C∪D andA∩B=C∩D=0.     

On estimation of a density and its derivatives

Summary Letf _n ^(p) be a recursive kernel estimate off ^(p) thepth order derivative of the probability density functionf, based on a random sample of sizen. In this paper, we provide bounds for the moments of and show that the rate of almost sure convergence of to zero isO(n ^−α), α<(r−p)/(2r+1), iff ^(r),r>p≧0, is a continuousL ₂(−∞, ∞) function. Similar rate-factor is also obtained for the almost sure convergence of to zero under different conditions onf. This work was supported in part by the Research Foundation of SUNY.     

On well-quasi-ordering-finite graphs by immersion

It has been conjectured by Nash-Williams that the class of all graphs is well-quasi-ordered under the quasi-order ≦ defined by immersion. Two partial results are proved which support this conjecture. (i) The class of finite simple graphsG with K _2,3 is well-quasi-ordered by ≦, (ii) it is shown that a class of finite graphs is well-quasi-ordered by ≦ provided that the blocks of its members satisfy certain restrictive conditions. (In particular, this second result implies that ≦ is a well-quasi-order on the class of graphs for which each block is either complete or a cycle.)     

Computation of the number representations of the elements of the ringℤ/dℤ as a sum of squares

The number of representations of the elements of the ringℤ/dℤ as a sum of invertible squares is computed, provided that each square occurs in the sum no more tha a fized number of times. For prime d an exhaustive answer is given in term of the class number and the fundamental unit of the real quadratic field . Biblography: 5 titles. Translted fromZapiski Nauchnykh Seminarov POMI, Vol. 227, 1995, pp. 5–8.     

Supersaturation For Ramsey-Turán Problems

For an l-graph , the Turán number is the maximum number of edges in an n-vertex l-graph containing no copy of . The limit is known to exist [8]. The Ramsey–Turán density is defined similarly to except that we restrict to only those with independence number o(n). A result of Erdős and Sós [3] states that as long as for every edge E of there is another edge E′of for which |E∩E′|≥2. Therefore a natural question is whether there exists for which . Another variant proposed in [3] requires the stronger condition that every set of vertices of of size at least εn (0<ε<1) has density bounded below by some threshold. By definition, for every . However, even is not known for very many l-graphs when l>2. We prove the existence of a phenomenon similar to supersaturation for Turán problems for hypergraphs. As a consequence, we construct, for each l≥3, infinitely many l-graphs for which . We also prove that the 3-graph with triples 12a, 12b, 12c, 13a, 13b, 13c, 23a, 23b, 23c, abc, satisfies . The existence of a hypergraph satisfying was conjectured by Erdős and Sós [3], proved by Frankl and R?dl [6], and later by Sidorenko [14]. Our short proof is based on different ideas and is simpler than these earlier proofs. * Research supported in part by the National Science Foundation under grants DMS-9970325 and DMS-0400812, and an Alfred P. Sloan Research Fellowship. † Research supported in part by the National Science Foundation under grants DMS-0071261 and DMS-0300529.     

Maximum degree and fractional matchings in uniform hypergraphs

Let ℋ be a family ofr-subsets of a finite setX. SetD(ℋ)= |{E:x∈E∈ℋ}|, (maximum degree). We say that ℋ is intersecting if for anyH,H′ ∈ ℋ we haveH ∩H′ ≠ 0. In this case, obviously,D(ℋ)≧|ℋ|/r. According to a well-known conjectureD(ℋ)≧|ℋ|/(r−1+1/r). We prove a slightly stronger result. Let ℋ be anr-uniform, intersecting hypergraph. Then either it is a projective plane of orderr−1, consequentlyD(ℋ)=|ℋ|/(r−1+1/r), orD(ℋ)≧|ℋ|/(r−1). This is a corollary to a more general theorem on not necessarily intersecting hypergraphs.     

Explicit Bounded-Degree Unique-Neighbor Concentrators

Here we solve an open problem considered by various researchers by presenting the first explicit constructions of an infinite family of bounded-degree ‘unique-neighbor’ concentrators Γ; i.e., there are strictly positive constants α and ε, such that all Γ = (X,Y,E(Γ)) ∈ satisfy the following properties. The output-set Y has cardinality times that of the input-set X, and for each subset S of X with no more than α|X| vertices, there are at least ε|S| vertices in Y that are adjacent in Γ to exactly one vertex in S. Also, the construction of is simple to specify, and each has fewer than edges. We then modify to obtain explicit unique-neighbor concentrators of maximum degree 3. * Supported by NSF grant CCR98210-58 and ARO grant DAAH04-96-1-0013.