Supersaturated graphs and hypergraphs

We shall consider graphs (hypergraphs) without loops and multiple edges. Let ? be a family of so called prohibited graphs and ex (n, ?) denote the maximum number of edges (hyperedges) a graph (hypergraph) onn vertices can have without containing subgraphs from ?. A graph (hyper-graph) will be called supersaturated if it has more edges than ex (n, ?). IfG hasn vertices and ex (n, ?)+k edges (hyperedges), then it always contains prohibited subgraphs. The basic question investigated here is: At least how many copies ofL ε ? must occur in a graphG ⁿ onn vertices with ex (n, ?)+k edges (hyperedges)?     

Intersection theorems under dimension constraints

In Ahlswede et al. [Discrete Math. 273(1-3) (2003) 9-21] we posed a series of extremal (set system) problems under dimension constraints. In the present paper, we study one of them: the intersection problem. The geometrical formulation of our problem is as follows. Given integers 0?t, k?n determine or estimate the maximum number of (0,1)-vectors in a k-dimensional subspace of the Euclidean n-space Rⁿ, such that the inner product (“intersection”) of any two is at least t. Also we are interested in the restricted (or the uniform) case of the problem; namely, the problem considered for the (0,1)-vectors of the same weight ω.The paper consists of two parts, which concern similar questions but are essentially independent with respect to the methods used.In Part I, we consider the unrestricted case of the problem. Surprisingly, in this case the problem can be reduced to a weighted version of the intersection problem for systems of finite sets. A general conjecture for this problem is proved for the cases mentioned in Ahlswede et al. [Discrete Math. 273(1-3) (2003) 9-21]. We also consider a diametric problem under dimension constraint.In Part II, we study the restricted case and solve the problem for t=1 and k<2ω, and also for any fixed 1?t?ω and k large.     

A semidefinite programming approach to the hypergraph minimum bisection problem

The hypergraph minimum bisection (HMB) problem is the problem of partitioning the vertices of a hypergraph into two sets of equal size so that the total weight of hyperedges crossing the sets is minimized. HMB is an NP-hard problem that arises in numerous applications – for example, in digital circuit design. Although many heuristics have been proposed for HMB, there has been no known mathematical program that is equivalent to HMB. As a means of shedding light on HMB, we study the equivalent, complement problem of HMB (called CHMB), which attempts to maximize the total weight of non-crossing hyperedges. We formulate CHMB as a quadratically constrained quadratic program, considering its semidefinite programming relaxation and providing computational results on digital circuit partitioning benchmark problems. We also provide results towards an approximation guarantee for CHMB.     

Computing minimum multiway cuts in hypergraphs

The hypergraph $k$-cut problem is the problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into at least $k$ connected components. We present an algorithm for this problem, that runs in strongly polynomial time if both $k$ and the maximum size of the hyperedges are constants. Our algorithm extends the algorithm proposed by Thorup (2008) for computing minimum $k$-cuts of graphs from greedy packings of spanning trees.     

Lines in hypergraphs

One of the De Bruijn-Erd?s theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of simply described families, near-pencils and finite projective planes. Chen and Chvátal proposed to define the line uv in a 3-uniform hypergraph as the set of vertices that consists of u, v, and all w such that {u;v;w} is a hyperedge. With this definition, the De Bruijn-Erd?s theorem is easily seen to be equivalent to the following statement: If no four vertices in a 3-uniform hypergraph carry two or three hyperedges, then, except in the perverse case where one of the lines equals the whole vertex set, the number of lines is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of two simply described families. Our main result generalizes this statement by allowing any four vertices to carry three hyperedges (but keeping two forbidden): the conclusion remains the same except that a third simply described family, complements of Steiner triple systems, appears in the extremal case.     

On the well-posedness of a linearized plasma-vacuum interface problem in ideal compressible MHD

We study the initial-boundary value problem resulting from the linearization of the plasma-vacuum interface problem in ideal compressible magnetohydrodynamics (MHD). We suppose that the plasma and the vacuum regions are unbounded domains and the plasma density does not go to zero continuously, but jumps. For the basic state upon which we perform linearization we find two cases of well-posedness of the “frozen” coefficient problem: the “gas dynamical” case and the “purely MHD” case. In the “gas dynamical” case we assume that the jump of the normal derivative of the total pressure is always negative. In the “purely MHD” case this condition can be violated but the plasma and the vacuum magnetic fields are assumed to be non-zero and non-parallel to each other everywhere on the interface. For this case we prove a basic a priori estimate in the anisotropic weighted Sobolev space for the variable coefficient problem.     

Clustering by hypergraphs and dimensionality of cluster systems

In the present paper we discuss a new clustering procedure in the case where instead of a single metric we have a family of metrics. In this case we can obtain a partially ordered graph of clusters which is not necessarily a tree. We discuss a structure of a hypergraph above this graph. We propose two definitions of dimension for hyperedges of this hypergraph and show that for the multidimensional p-adic case both dimensions are reduced to the number of p-adic parameters.We discuss the application of the hypergraph clustering procedure to the construction of phylogenetic graphs in biology. In this case the dimension of a hyperedge will describe the number of sources of genetic diversity.     

On packing and coloring hyperedges in a cycle

Given a hypergraph and k different colors, we study the problem of packing and coloring a subset of the hyperedges of the hypergraph as paths in a cycle such that the total profit of the hyperedges selected is maximized, where each physical link e_j on the cycle is used at most c_j times, each hyperedge h_i has its profit p_i and any two paths, each spanning all nodes of its corresponding hyperedge, must be assigned different colors if they share a common physical link. This new problem arises in optical communication networks, and it is called the Maximizing Profits when Packing and Coloring Hyperedges in a Cycle problem (MPPCHC).In this paper, we prove that the MPPCHC problem is NP-hard and then present an algorithm with approximation ratio 2 for this problem. For the special case where each hyperedge has the same profit 1 and each link e_j has same capacity k, we propose an algorithm with approximation ratio .     

Some remarks on interval graphs

Using simplicial decompositions a new and simple proof of Lekkerkerker-Boland’s criterion for interval graphs is given. Also the infinite case is considered, and the problem is tackled to what extent the representation of a graph as an interval graph is unique. Dedicated to Tibor Gallai on his seventieth birthday     

On the integrability of Lie subalgebroids

Let G be a Lie groupoid with Lie algebroid g. It is known that, unlike in the case of Lie groups, not every subalgebroid of g can be integrated by a subgroupoid of G. In this paper we study conditions on the invariant foliation defined by a given subalgebroid under which such an integration is possible. We also consider the problem of integrability by closed subgroupoids, and we give conditions under which the closure of a subgroupoid is again a subgroupoid.     

OBSERVATIONAL COSMOLOGY AND NUMERICAL RELATIVITY

Abstract

This paper brings together the theory of observational cosmology and the null-cone characteristic initial value problem (CIVP) of numerical relativity. A computer code is constructed which calculates the past behaviour of the Universe from input data that is, in principle, measurable. For practical reasons the code is limited to the case of axisymmetry without rotation. The construction of the code brings to light an interesting general point about observational cosmology. In a big-bang universe it is impossible, even in principle, to determine the state of the universe at early times. For the Einstein-de Sitter model this limit is t ₀/27, where t ₀ means now.     

The proof on the conjecture of extremal graphs for the kth eigenvalues of trees

We consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue λ_k.of trees with n vertices. In this paper, the conjecture for this problem in [Shao Jia-yu, On the largest kth eignevalues of trees, Linear Algebra Appl. 221 (1995) 131] is proved and (from this) the complete solution to this problem, the best upper bound and the extremal trees of λ_k, is given in general cases above.     

Computing the minimum number of hybridization events for a consistent evolutionary history

It is now well-documented that the structure of evolutionary relationships between a set of present-day species is not necessarily tree-like. The reason for this is that reticulation events such as hybridizations mean that species are a mixture of genes from different ancestors. Since such events are relatively rare, a fundamental problem for biologists is to determine the smallest number of hybridization events required to explain a given (input) set of data in a single (hybrid) phylogeny. The main results of this paper show that computing this smallest number is APX-hard, and thus NP-hard, in the case the input is a collection of phylogenetic trees on sets of present-day species. This answers a problem which was raised at a recent conference (Phylogenetic Combinatorics and Applications, Uppsala University, 2004). As a consequence of these results, we also correct a previously published NP-hardness proof in the case the input is a collection of binary sequences, where each sequence represents the attributes of a particular present-day species. The APX-hardness of these problems means that it is unlikely that there is an efficient algorithm for either computing the result exactly or approximating it to any arbitrary degree of accuracy.     

The cover pebbling number of graphs

A pebbling move on a graph consists of taking two pebbles off of one vertex and placing one pebble on an adjacent vertex. In the traditional pebbling problem we try to reach a specified vertex of the graph by a sequence of pebbling moves. In this paper we investigate the case when every vertex of the graph must end up with at least one pebble after a series of pebbling moves. The cover pebbling number of a graph is the minimum number of pebbles such that however the pebbles are initially placed on the vertices of the graph we can eventually put a pebble on every vertex simultaneously. We find the cover pebbling numbers of trees and some other graphs. We also consider the more general problem where (possibly different) given numbers of pebbles are required for the vertices.     

Attractive cycles in the iteration of meromorphic functions

Summary The existence of attractive cycles constitutes a serious impediment to the solution of nonlinear equations by iterative methods. This problem is illustrated in the case of the solution of the equationz tanz=c, for complex values ofc, by Newton's method. Relevant results from the theory of the iteration of rational functions are cited and extended to the analysis of this case, in which a meromorphic function is iterated. Extensive numerical results, including many attractive cycles, are summarized.This work was supported in part by the Natural Sciences and Engineering Research Council of Canada under grants A3028 and A7691     

Existence of Gibbsian point processes with geometry-dependent interactions

We establish the existence of stationary Gibbsian point processes for interactions that act on hyperedges between the points. For example, such interactions can depend on Delaunay edges or triangles, cliques of Voronoi cells or clusters of k-nearest neighbors. The classical case of pair interactions is also included. The basic tools are an entropy bound and stationarity.     

Asymptotic values of clique partition numbers

The problem is considered of decomposing a given graph into the minimum number of complete subgraphs. Asymptotic results are obtained for the case where the graph is the complement of a graph with relatively few unisolated vertices. This research was carried out while the author was visting Queen’s University, Kingston, whose hospitality is gratefully acknowledged.     

Tight bounds for minimax grid matching with applications to the average case analysis of algorithms

The minimax grid matching problem is a fundamental combinatorial problem associated with the average case analysis of algorithms. The problem has arisen in a number of interesting and seemingly unrelated areas, including wafer-scale integration of systolic arrays, two-dimensional discrepancy problems, and testing pseudorandom number generators. However, the minimax grid matching problem is best known for its application to the maximum up-right matching problem. The maximum up-right matching problem was originally defined by Karp, Luby and Marchetti-Spaccamela in association with algorithms for 2-dimensional bin packing. More recently, the up-right matching problem has arisen in the average case analysis of on-line algorithms for 1-dimen-sional bin packing and dynamic allocation.In this paper, we solve both the minimax grid matching problem and the maximum up-right matching problem. As a direct result, we obtain tight upper bounds on the average case behavior of the best algorithms known for 2-dimensional bin packing, 1-dimensional on-line bin packing and on-line dynamic allocation. The results also solve a long-open question in mathematical statistics.This research was supported by Air Force Contracts AFOSR-82-0326 and AFOSR-86-0078, NSF Grant 8120790, and DARPA contract N00014-80-C-0326. In addition, Tom Leighton was supported by an NSF Presidential Young Investigator Award with matching funds from Xerox and IBM.     

Generic pole assignability,structurally constrained controllers and unimodular completion

In this paper we assume dynamical systems are represented by linear differential-algebraic equations (DAEs) of order possibly higher than one. We consider a structured system of DAEs for both the to-be-controlled plant and the controller. We model the structure of the plant and the controller as an undirected and bipartite graph and formulate necessary and sufficient conditions on this graph for the structured controller to generically achieve arbitrary pole placement. A special case of this problem also gives new equivalent conditions for structural controllability of a plant. Use of results in matching theory, and in particular, ‘admissibility’ of edges and ‘elementary bipartite graphs’, make the problem and the solution very intuitive. Further, our approach requires standard graph algorithms to check the required conditions for generic arbitrary pole placement, thus helping in easily obtaining running time estimates for checking this. When applied to the state space case, for which the literature has running time estimates, our algorithm is faster for sparse state space systems and comparable for general state space systems.