نتایج جستجو برای: generalized open sets

تعداد نتایج: 747461  

2009
Javier Cilleruelo Imre Ruzsa Carlos Vinuesa Charles Fefferman

We give asymptotic sharp estimates for the cardinality of a set of residue classes with the property that the representation function is bounded by a prescribed number. We then use this to obtain an analogous result for sets of integers, answering an old question of Simon Sidon. © 2010 Elsevier Inc. All rights reserved. MSC: 11B

Journal: :Int. J. Math. Mathematical Sciences 2006
Fumie Nakaoka Nobuyuki Oda

Some properties of minimal open sets and maximal open sets are studied in [1, 2]. In this paper, we define dual concepts of them, namely, maximal closed set and minimal closed set. These four types of subsets appear in finite spaces, for example. More generally, minimal open sets and maximal closed sets appear in locally finite spaces such as the digital line. Minimal closed sets and maximal op...

2013
Joshua Cooper Anna Kirkpatrick

We discuss the problem of finding critical sets in graphs, a concept which has appeared in a number of guises in the combinatorics and graph theory literature. The case of the Sudoku graph receives particular attention, because critical sets correspond to minimal fair puzzles. We define four parameters associated with the sizes of extremal critical sets and (a) prove several general results abo...

Journal: :Discrete Mathematics 2014
Joshua Cooper Anna Kirkpatrick

We discuss the problem of finding critical sets in graphs, a concept which has appeared in a number of guises in the combinatorics and graph theory literature. The case of the Sudoku graph receives particular attention, because critical sets correspond to minimal fair puzzles. We define four parameters associated with the sizes of extremal critical sets and (a) prove several general results abo...

2013
Andrea Burgess Karen Meagher Bruce Reed

In 2009, Peter Cameron introduced a common generalization of various classes of combinatorial designs such as balanced incomplete block designs, resolvable designs and orthogonal arrays. Generalized covering and packing designs can be defined in analogous way. These objects bring into this framework further classes of designs, including covering and packing arrays, Howell designs, monogamous cy...

2011
K. Chandrasekhara Rao

The aim of this paper is to continue the study of (τ1, τ2) ∗-semi star generalized closed sets by introducing the concepts of (τ1, τ2) ∗-semi star generalized locally closed sets and study their basic properties in bitopological spaces. Keywords—(τ1, τ2) ∗-semi star generalized locally closed sets, τ1τ2-semi star generalized closed sets, (τ1, τ2) ∗-semi generalized locally closed sets, (τ1, τ2)...

Journal: :Theor. Comput. Sci. 2012
Chris J. Conidis

We answer a recent question of Bienvenu, Muchnik, Shen, and Vereshchagin. In particular, we prove an effective version of the standard fact from analysis which says that, for any ε > 0 and any Lebesgue-measurable subset of Cantor space, X ⊆ 2, there is an open set Uε ⊆ 2, Uε ⊇ X, such that μ(Uε) ≤ μ(X) + ε, where μ(Z) denotes the Lebesgue measure of Z ⊆ 2. More specifically, our main result sho...

In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices,  topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید