Characteristic of partition-circuit matroid through approximation number

Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence in vector spaces, and has a variety of applications in many fields. In this paper, we propose a new type of matroids, namely, partition-circuit matroids, which are induced by partitions. Firstly, a partition satisfies circuit axioms in matroid theory, then it can induce a matroid which is called a partition-circuit matroid. A partition and an equivalence relation on the same universe are one-to-one corresponding, then some characteristics of partition-circuit matroids are studied through rough sets. Secondly, similar to the upper approximation number which is proposed by Wang and Zhu, we define the lower approximation number. Some characteristics of partition-circuit matroids and the dual matroids of them are investigated through the lower approximation number and the upper approximation number.Comment: 12 page

Interior numerical approximation of boundary value problems with a distributional data

We study the approximation properties of a harmonic function u \in H\sp{1-k}(\Omega), $k > 0$, on relatively compact sub-domain $A$ of $\Omega$, using the Generalized Finite Element Method. For smooth, bounded domains $\Omega$, we obtain that the GFEM--approximation $u_S$ satisfies \|u - u_S\|_{H\sp{1}(A)} \le C h^{\gamma}\|u\|_{H\sp{1-k}(\Omega)}, where $h$ is the typical size of the ``elements'' defining the GFEM--space $S$ and $\gamma \ge 0$ is such that the local approximation spaces contain all polynomials of degree $k + \gamma + 1$. The main technical result is an extension of the classical super-approximation results of Nitsche and Schatz \cite{NitscheSchatz72} and, especially, \cite{NitscheSchatz74}. It turns out that, in addition to the usual ``energy'' Sobolev spaces $H^1$, one must use also the negative order Sobolev spaces H\sp{-l}, $l \ge 0$, which are defined by duality and contain the distributional boundary data.Comment: 23 page

Covering rough sets based on neighborhoods: An approach without using neighborhoods

Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have been applied to covering rough sets. In this paper, we further investigate the covering rough sets based on neighborhoods by approximation operations. We show that the upper approximation based on neighborhoods can be defined equivalently without using neighborhoods. To analyze the coverings themselves, we introduce unary and composition operations on coverings. A notion of homomorphismis provided to relate two covering approximation spaces. We also examine the properties of approximations preserved by the operations and homomorphisms, respectively.Comment: 13 pages; to appear in International Journal of Approximate Reasonin

New Dimensions for Wound Strings: The Modular Transformation of Geometry to Topology

We show, using a theorem of Milnor and Margulis, that string theory on compact negatively curved spaces grows new effective dimensions as the space shrinks, generalizing and contextualizing the results in hep-th/0510044. Milnor's theorem relates negative sectional curvature on a compact Riemannian manifold to exponential growth of its fundamental group, which translates in string theory to a higher effective central charge arising from winding strings. This exponential density of winding modes is related by modular invariance to the infrared small perturbation spectrum. Using self-consistent approximations valid at large radius, we analyze this correspondence explicitly in a broad set of time-dependent solutions, finding precise agreement between the effective central charge and the corresponding infrared small perturbation spectrum. This indicates a basic relation between geometry, topology, and dimensionality in string theory.Comment: 28 pages, harvmac big. v2: references and KITP preprint number added, minor change

Knowledge Engineering from Data Perspective: Granular Computing Approach

The concept of rough set theory is a mathematical approach to uncertainly and vagueness in data analysis, introduced by Zdzislaw Pawlak in 1980s. Rough set theory assumes the underlying structure of knowledge is a partition. We have extended Pawlak’s concept of knowledge to coverings. We have taken a soft approach regarding any generalized subset as a basic knowledge. We regard a covering as basic knowledge from which the theory of knowledge approximations and learning, knowledge dependency and reduct are developed

Dominant Topologies in Euclidean Quantum Gravity

The dominant topologies in the Euclidean path integral for quantum gravity differ sharply according on the sign of the cosmological constant. For $\Lambda>0$, saddle points can occur only for topologies with vanishing first Betti number and finite fundamental group. For $\Lambda<0$, on the other hand, the path integral is dominated by topologies with extremely complicated fundamental groups; while the contribution of each individual manifold is strongly suppressed, the ``density of topologies'' grows fast enough to overwhelm this suppression. The value $\Lambda=0$ is thus a sort of boundary between phases in the sum over topologies. I discuss some implications for the cosmological constant problem and the Hartle-Hawking wave function.Comment: 14 pages, LaTeX. Minor additions (computability, relation to ``minimal volume'' in topology); error in eqn (3.5) corrected; references added. To appear in Class. Quant. Gra