Lp Sobolev regularity of averaging operators over hypersurfaces and the Newton polyhedron

$L^p$ to $L_{\beta }^p$ boundedness results are proven for translation invariant averaging operators over hypersurfaces in Euclidean space. The operators can either be Radon transforms or averaging operators with multiparameter fractional integral kernel. In many cases, the amount $\beta >0$ of smoothing proven is optimal up to endpoints, and in such situations this amount of smoothing can be computed explicitly through the use of appropriate Newton polyhedra.     

Binary Hermitian forms over a cyclotomic field

Let ζ be a primitive fifth root of unity and let F be the cyclotomic field . Let be the ring of integers. We compute the Voronoï polyhedron of binary Hermitian forms over F and classify -conjugacy classes of perfect forms. The combinatorial data of this polyhedron can be used to compute the cohomology of the arithmetic group and Hecke eigenforms.     

On well-covered triangulations: Part II

A graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It was proved in an earlier paper [A. Finbow, B. Hartnell, R. Nowakowski, M. Plummer, On well-covered triangulations: Part I, Discrete Appl. Math., 132, 2004, 97-108] that there are no 5-connected planar well-covered triangulations. It is the aim of the present paper to completely determine the 4-connected well-covered triangulations containing two adjacent vertices of degree 4. In a subsequent paper [A. Finbow, B. Hartnell, R. Nowakowski, M. Plummer, On well-covered triangulations: Part III (submitted for publication)], we show that every 4-connected well-covered triangulation contains two adjacent vertices of degree 4 and hence complete the task of characterizing all 4-connected well-covered planar triangulations. There turn out to be only four such graphs. This stands in stark contrast to the fact that there are infinitely many 3-connected well-covered planar triangulations.     

On degenerate multi-row Gomory cuts

Borozan and Cornuéjols show that valid inequalities for an infinite relaxation for MIPs, relative to some vertex f of the linear relaxation, are determined by maximal lattice-free convex sets containing f. We show that cuts for the original MIP are given by such sets with f in the interior.     

Stability of associated primes of integral closures of monomial ideals

Let I be a monomial ideal of a polynomial ring R=K[X₁,…,Xr] and d(I) the maximal degree of minimal generators of I. In this paper, we explicitly determine a number n₀ in terms of r and d(I) such that for all n?n₀. Furthermore, our n₀ is almost sharp.     

On the sizes of Delaunay meshes

Let be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of with bounded vertex degree is within a factor of the size of any Delaunay mesh of with bounded radius-edge ratio. The term depends on the geometry of and it is likely a small constant when the boundaries of are fine triangular meshes. There are several consequences. First, among all Delaunay meshes with bounded radius-edge ratio, those returned by Delaunay refinement algorithms have asymptotically optimal sizes. This is another advantage of meshing with Delaunay refinement algorithms. Second, if no input angle is acute, the minimum Delaunay mesh with bounded radius-edge ratio is not much smaller than any minimum mesh with aspect ratio bounded by a particular constant.     

Free and nonfree Voronoi polyhedra

The Voronoi polyhedron of some point v of a translation lattice is the closure of the set of points in space that are closer to v than to any other lattice points. Voronoi polyhedra are a special case of parallelohedra, i.e., polyhedra whose parallel translates can fill the entire space without gaps and common interior points. The Minkowski sum of a parallelohedron with a segment is not always a parallelohedron. A parallelohedron P is said to be free along a vector e if the sum of P with a segment of the line spanned by e is a parallelohedron. We prove a theorem stating that if the Voronoi polyhedron P _v (f) of a quadratic form f is free along some vector, then the Voronoi polyhedron P _v (g) of each form g lying in the closure of the L-domain of f is also free along some vector. For the dual root lattice E ₆*, and the infinite series of lattices D _2m ⁺ , m ≥ 4, we prove that their Voronoi polyhedra are nonfree in all directions.     

Representing the sporadic Archimedean polyhedra as abstract polytopes

We present the results of an investigation into the representations of Archimedean polyhedra (those polyhedra containing only one type of vertex figure) as quotients of regular abstract polytopes. Two methods of generating these presentations are discussed, one of which may be applied in a general setting, and another which makes use of a regular polytope with the same automorphism group as the desired quotient. Representations of the 14 sporadic Archimedean polyhedra (including the pseudorhombicuboctahedron) as quotients of regular abstract polyhedra are obtained, and summarised in a table. The information is used to characterize which of these polyhedra have acoptic Petrie schemes (that is, have well-defined Petrie duals).     

Dominating sets in triangulations on surfaces

Let G be a graph and let S?V(G). We say that S is dominating in G if each vertex of G is in S or adjacent to a vertex in S. We show that every triangulation on the torus and the Klein bottle with n vertices has a dominating set of cardinality at most $\frac{n}{3}Let G be a graph and let S?V(G). We say that S is dominating in G if each vertex of G is in S or adjacent to a vertex in S. We show that every triangulation on the torus and the Klein bottle with n vertices has a dominating set of cardinality at most $\frac{n}{3}$. Moreover, we show that the same conclusion holds for a triangulation on any non‐spherical surface with sufficiently large representativity. These results generalize that for plane triangulations proved by Matheson and Tarjan (European J Combin 17 (1996), 565–568), and solve a conjecture by Plummer (Private Communication). © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 17–30, 2010     

��˹ͼģ�͵Ļ����������Ľ���IPSP�㷨

The IPSP algorithm is an efficient algorithm for computing maximum likelihood estimation of Gaussian graphical models. It first divides clique marginals of graphical models into several groups, and then it adjusts clique marginals in each group locally. This paper uses the IIPS algorithm on junction tree to replace local adjustment on each group in the IPSP algorithm and propose a resulting algorithm called IPSP-JT to reduce the complexity of the IPSP algorithm. Moreover, we give a graph with minimum edges used by IIPS to adjust locally, and we prove its existence and uniqueness and construct a local junction tree. Numerical experiments show that the IPSP-JT algorithm runs faster than the IPSP algorithm for large Gaussian graphical models.