Infinite Series of Triangulations on Closed Surfaces with Vertex Covers of Given Degree

A triangulation on a closed surface is said to be d-covered if each of its edges is covered by a vertex of degree d. We shall give some infinite series of d-covered triangulations on each closed surface of non-positive (respectively positive) Euler characteristic for 5d12 (respectively 10).Final version received: April 25, 2003     

On defect-d matchings in graphs

A defect-d matching in a graph G is a matching which covers all but d vertices of G. G is d-covered if each edge of G belongs to a defect-d matching. Here we characterise d-covered graphs and d-covered connected bipartite graphs. We show that a regular graph G of degree r which is (r ? 1)-edge-connected is 0-covered or 1-covered depending on whether G has an even or odd number of vertices, but, given any non-negative integers r and d, there exists a graph regular of degree r with connectivity and edge-connectivity r ? 2 which does not even have a defect-d matching. Finally, we prove that a vertex-transitive graph is 0-covered or 1-covered depending on whether it has an even or odd number of vertices.     

Factorizations of complete multipartite graphs into generalized cubes

For a positive integer d, the usual d‐dimensional cube Q_d is defined to be the graph (K₂)^d, the Cartesian product of d copies of K₂. We define the generalized cube Q(K_k, d) to be the graph (K_k)^d for positive integers d and k. We investigate the decomposition of the complete multipartite graph K into factors that are vertex‐disjoint unions of generalized cubes Q(K_k, d_i), where k is a power of a prime, n and j are positive integers with j ≤ n, and the d_i may be different in different factors. We also use these results to partially settle a problem of Kotzig on Q_d‐factorizations of K_n. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 144–150, 2000     

Measurable Sets With Excluded Distances

For a set of distances D = {d ₁,..., d _k } a set A is called D-avoiding if no pair of points of A is at distance d _i for some i. We show that the density of A is exponentially small in k provided the ratios d ₁/d ₂, d ₂/d ₃, …, d _k-1/d _k are all small enough. This resolves a question of Székely, and generalizes a theorem of Furstenberg–Katznelson–Weiss, Falconer–Marstrand, and Bourgain. Several more results on D-avoiding sets are presented. Received: January 2007, Revision: February 2008, Accepted: February 2008     

On a conjecture on maximal planar sequences

Let d1 d2 dp denote the nonincreasing sequence d₁, …, d₁, d₂, …, d₂, …, d_p, …, d_p, where the term d_i appears k_i times (i = 1, 2, …, p). In this work the author proves that the maximal 2-sequences: 7³6¹5¹⁵, 7⁵6¹5¹⁷, 7⁷6¹5¹⁹ are planar graphical, in contrast to a conjecture by Schmeichel and Hakimi.     

A Note on Graph Pebbling

 We say that a graph G is Class 0 if its pebbling number is exactly equal to its number of vertices. For a positive integer d, let k(d) denote the least positive integer so that every graph G with diameter at most d and connectivity at least k(d) is Class 0. The existence of the function k was conjectured by Clarke, Hochberg and Hurlbert, who showed that if the function k exists, then it must satisfy k(d)=Ω(2 ^d /d). In this note, we show that k exists and satisfies k(d)=O(2 ^2d ). We also apply this result to improve the upper bound on the random graph threshold of the Class 0 property. Received: April 19, 1999 Final version received: February 15, 2000     

Decompositions and boundary coverings of non-convex fat polyhedra

We show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be decomposed into O(n) tetrahedra, where n is the number of vertices of the polyhedron. We also show that the restriction that the faces are fat is necessary: there are locally-fat polyhedra with non-fat faces that require Ω(n²) pieces in any convex decomposition. Furthermore, we show that if we want the tetrahedra in the decomposition to be fat themselves, then their number cannot be bounded as a function of n in the worst case. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior.     

On the Inverse to the Harmonic Oscillator

Let b _d be the Weyl symbol of the inverse to the harmonic oscillator on R ^d . We prove that b _d and its derivatives satisfy convenient bounds of Gevrey and Gelfand-Shilov type, and obtain explicit expressions for b _d . In the even-dimensional case we characterize b _d in terms of elementary functions.

In the analysis we use properties of radial symmetry and a combination of different techniques involving classical a priori estimates, commutator identities, power series and asymptotic expansions.     

Enumeration of graphs by degree sequence

The degree sequence (d₀, d₁, …, d_p-1) of a graph G of order p is defined by d_k = the number of points of G of degree k. Methods of Robinson are extended to produce a generating function F(x₀, x₁, x₂, …) where the coefficient of x…x is the number of graphs of order p having degree sequence (d₀, …, d_p-1).     

Stabbing Simplices by Points and Flats

The following result was proved by Bárány in 1982: For every d≥1, there exists c _d >0 such that for every n-point set S in ℝ ^d , there is a point p∈ℝ ^d contained in at least c _d n ^d+1−O(n ^d ) of the d-dimensional simplices spanned by S. We investigate the largest possible value of c _d . It was known that c _d ≤1/(2 ^d (d+1)!) (this estimate actually holds for every point set S). We construct sets showing that c _d ≤(d+1)^−(d+1), and we conjecture that this estimate is tight. The best known lower bound, due to Wagner, is c _d ≥γ _d :=(d ²+1)/((d+1)!(d+1) ^d+1); in his method, p can be chosen as any centerpoint of S. We construct n-point sets with a centerpoint that is contained in no more than γ _d n ^d+1+O(n ^d ) simplices spanned by S, thus showing that the approach using an arbitrary centerpoint cannot be further improved.     

On Automorphisms of Some d-Dimensional Dual Hyperovals in PG(d(d + 3)/2, 2)

In [3], a new d-dimensional dual hyperoval S in PG(d(d + 3)/2, 2) for d ≥ 3 was constructed based on Veronesean dual hyperoval. In this note, we determine the automorphism group of the dual hyperoval S. Received: January 26, 2007. Final Version received: January 7, 2008.     

Polynomial realization of pseudoline arrangements

An arrangement of pseudolines is called d-stretchable if it is isomorphic to an arrangement of graphs of polynomial functions, each of degree at most d; in particular, it is 1-stretchable (classically: “stretchable”) if and only if it is isomorphic to an arrangement of lines. We show that (i) if every arrangement of n pseudolines is d-stretchable, then d ≦ cn^1/2, and (ii) every arrangement of n pseudolines is d-stretchable with d = cn².     

How many cyclic subpolytopes can a non-cyclic polytope have?

Acyclic d-polytope is ad-polytope that is combinatorially equivalent to a polytope whose vertices lie on the moment curve {(t, t ², …,t ^d):t∈R}. Every subpolytope of an even-dimensional cyclic polytope is again cyclic. We show that a polytope [or neighborly polytope] withv vertices that is not cyclic has at mostd+1 [respectivelyd]d-dimensional cyclic subpolytopes withv−1 vertices, providedd is even andv≧d+5.     

On the Bethe-Sommerfeld conjecture for higher-order elliptic operators

 We consider the elliptic operator P(D)+V in ℝ ^d , d≥2 where P(D) is a constant coefficient elliptic pseudo-differential operator of order 2ℓ with a homogeneous convex symbol P(ξ), and V is a real periodic function in L ^∞(ℝ ^d ). We show that the number of gaps in the spectrum of P(D)+V is finite if 4ℓ>d+1. If in addition, V is smooth and the convex hypersurface {ξℝ ^d :P(ξ)=1} has positive Gaussian curvature everywhere, then the number of gaps in the spectrum of P(D)+V is finite, provided 8ℓ>d+3 and 9≥d≥2, or 4ℓ>d−3 and d≥10. Received: 10 October 2001 / Published online: 28 March 2003 Mathematics Subject Classification (1991): 35J10 Research supported in part by NSF Grant DMS-9732894.     

The Fefferman-Stein-Type Inequality for the Kakeya Maximal Operator II

Let K _δ, 0 < δ≪1, be the Kakeya maximal operator defined as the supremum of averages over tubes of the eccentricity δ. The (so-called) Fefferman-Stein-type inequality: is shown, where C _d and α _d are constants depending only on the dimension d and w is a weight. The result contains the exponent (d−2)/2d which is smaller than the exponent (d−2)(d−1)/d(2d−3) obtained in [7]. Received October 8, 2001, Accepted February 28, 2002     

An improved bound for the strong chromatic number

Let η > 0 be given. Then there exists d₀ = d₀(η) such that the following holds. Let G be a finite graph with maximum degree at most d ≥ d₀ whose vertex set is partitioned into classes of size α d, where α≥ 11/4 + η. Then there exists a proper coloring of G with αd colors in which each class receives all αd colors. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:148–158, 2008     

Orthogonal Polynomials on the Ball and the Simplex for Weight Functions with Reflection Symmetries

Generalized classical orthogonal polynomials on the unit ball B ^d and the standard simplex T ^d are orthogonal with respect to weight functions that are reflection-invariant on B ^d and, after a composition, on T ^d , respectively. They are also eigenfunctions of a second-order differential—difference operator that is closely related to Dunkl's h -Laplacian for the reflection groups. Under a proper limit, the generalized classical orthogonal polynomials on B ^d converge to the generalized Hermite polynomials on R ^d , and those on T ^d converge to the generalized Laguerre polynomials on R ^d ₊ . The latter two are related to the Calogero—Sutherland models associated to the Weyl groups of type A and type B . February 14, 2000. Date revised: July 26, 2000. Date accepted: August 4, 2000.     

Asymptotic Enumeration of Convex Polygons

A polygon is an elementary (self-avoiding) cycle in the hypercubic lattice ^dtaking at least one step in every dimension. A polygon on ^dis said to be convex if its length is exactly twice the sum of the side lengths of the smallest hypercube containing it. The number ofd-dimensional convex polygonsp_{n, d}of length 2nwithd(n)→∞ is asymptoticallywherer=r(n, d) is the unique solution ofr coth r=2n/d−1andb(r)=d(r coth r−r²/sinh² r). The convergence is uniform over alld?ω(n) for any functionω(n)→∞. Whendis constant the exponential is replaced with (1−d⁻¹)^2d. These results are proved by asymptotically enumerating a larger class of combinatorial objects calledconvex proto-polygonsby the saddle-point method and then finding the asymptotic probability a randomly chosen convex proto-polygon is a convex polygon.     

The Clique Numbers of Regular Graphs

 Let ω(G) be the clique number of a graph G. We prove that if G runs over the set of graphs with a fixed degree sequence d, then the values ω(G) completely cover a line segment [a,b] of positive integers. For an arbitrary graphic degree sequence d, we define min(ω,d) and max(ω,d) as follows: