On Partial Covering For Geometric Set Systems

We study a generalization of the Set Cover problem called the Partial Set Cover in the context of geometric set systems. The input to this problem is a set system (X, R), where X is a set of elements and R is a collection of subsets of X, and an integer k <= |X|. Each set in R has a non-negative weight associated with it. The goal is to cover at least k elements of X by using a minimum-weight collection of sets from R. The main result of this article is an LP rounding scheme which shows that the integrality gap of the Partial Set Cover LP is at most a constant times that of the Set Cover LP for a certain projection of the set system (X, R). As a corollary of this result, we get improved approximation guarantees for the Partial Set Cover problem for a large class of geometric set systems

Geometric lattice structure of covering and its application to attribute reduction through matroids

The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially greedy algorithm design which plays an important role in the reduction problems. Therefore, it is meaningful to combine coverings with geometric lattices to solve the optimization problems. In this paper, we obtain geometric lattices from coverings through matroids and then apply them to the issue of attribute reduction. First, a geometric lattice structure of a covering is constructed through transversal matroids. Then its atoms are studied and used to describe the lattice. Second, considering that all the closed sets of a finite matroid form a geometric lattice, we propose a dependence space through matroids and study the attribute reduction issues of the space, which realizes the application of geometric lattices to attribute reduction. Furthermore, a special type of information system is taken as an example to illustrate the application. In a word, this work points out an interesting view, namely, geometric lattice to study the attribute reduction issues of information systems

Combinatorial models of expanding dynamical systems

We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally defined "Julia set" of the generalized dynamical systems depends only on the associated iterated monodromy group. We show then that the Julia set of every expanding dynamical system is an inverse limit of simplicial complexes constructed by inductive cut-and-paste rules.Comment: The new version differs substantially from the first one. Many parts are moved to other (mostly future) papers, the main open question of the first version is solve

Geometric lattice structure of covering-based rough sets through matroids

Covering-based rough set theory is a useful tool to deal with inexact, uncertain or vague knowledge in information systems. Geometric lattice has widely used in diverse fields, especially search algorithm design which plays important role in covering reductions. In this paper, we construct four geometric lattice structures of covering-based rough sets through matroids, and compare their relationships. First, a geometric lattice structure of covering-based rough sets is established through the transversal matroid induced by the covering, and its characteristics including atoms, modular elements and modular pairs are studied. We also construct a one-to-one correspondence between this type of geometric lattices and transversal matroids in the context of covering-based rough sets. Second, sufficient and necessary conditions for three types of covering upper approximation operators to be closure operators of matroids are presented. We exhibit three types of matroids through closure axioms, and then obtain three geometric lattice structures of covering-based rough sets. Third, these four geometric lattice structures are compared. Some core concepts such as reducible elements in covering-based rough sets are investigated with geometric lattices. In a word, this work points out an interesting view, namely geometric lattice, to study covering-based rough sets

Few Cuts Meet Many Point Sets

We study the problem of how to breakup many point sets in $\mathbb{R}^d$ into smaller parts using a few splitting (shared) hyperplanes. This problem is related to the classical Ham-Sandwich Theorem. We provide a logarithmic approximation to the optimal solution using the greedy algorithm for submodular optimization

Geometry of jet spaces and integrable systems

An overview of some recent results on the geometry of partial differential equations in application to integrable systems is given. Lagrangian and Hamiltonian formalism both in the free case (on the space of infinite jets) and with constraints (on a PDE) are discussed. Analogs of tangent and cotangent bundles to a differential equation are introduced and the variational Schouten bracket is defined. General theoretical constructions are illustrated by a series of examples.Comment: 54 pages; v2-v6 : minor correction

Finitary Topos for Locally Finite, Causal and Quantal Vacuum Einstein Gravity

Previous work on applications of Abstract Differential Geometry (ADG) to discrete Lorentzian quantum gravity is brought to its categorical climax by organizing the curved finitary spacetime sheaves of quantum causal sets involved therein, on which a finitary (:locally finite), singularity-free, background manifold independent and geometrically prequantized version of the gravitational vacuum Einstein field equations were seen to hold, into a topos structure. This topos is seen to be a finitary instance of both an elementary and a Grothendieck topos, generalizing in a differential geometric setting, as befits ADG, Sorkin's finitary substitutes of continuous spacetime topologies. The paper closes with a thorough discussion of four future routes we could take in order to further develop our topos-theoretic perspective on ADG-gravity along certain categorical trends in current quantum gravity research.Comment: 49 pages, latest updated version (errata corrected, references polished) Submitted to the International Journal of Theoretical Physic