نتایج جستجو برای: maximal open set
تعداد نتایج: 1090976 فیلتر نتایج به سال:
Let s denote a compact convex object in IR. The f-width of s is the perpendicular distance between two distinct parallel lines of support of s with direction f . A set of disjoint convex compact objects in IR is of equal f -width if there exists a direction f such that every pair of objects have equal f -width. A visibility matching, for a set of equal f -width objects is a matching using non-c...
Rational numbers are used to classify maximal almost disjoint (MAD) families of subsets of the integers. Combinatorial characterization of indestructibility of MAD families by the likes of Cohen, Miller and Sacks forcings are presented. Using these it is shown that Sacks indestructible MAD family exists in ZFC and that b = c implies that there is a Cohen indestructible MAD family. It follows th...
We consider a model that arises in integer programming, and show that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace. We also show that these sets are polyhedra. The latter result extends a theorem of Lovász characterizing maximal lattice-free convex sets in R.
In 1966 [1], Auslander introduced a class of finitely generated modules having a certain complete resolution by projective modules. Then using these modules, he defined the G-dimension (G ostensibly for Gorenstein) of finitely generated modules. It seems appropriate then to call the modules of G-dimension 0 the Gorenstein projective modules. In [4], Gorenstein projective modules (whether finite...
Planning for a successful MIS implementation requires understanding the effects of the introduction of a new system on the work lives of potential adopters. The effects can be assessed by the MIS practitioner/ change agent ff the agent will first obtain a thorough and specific understanding of the task activities performed by potential adopters, the interactions they engage in as they perform t...
We discuss the possible structures for and mutual relationships between a finite distributive lattice L, a maximal sublattice M of L and the corresponding ‘remainder’ R = L\M with the aid of Birkhoff duality, and contrast the results with the analogous situations for a general finite lattice L. @ 1999 Elsevier Science B.V. All rights reserved
In this paper we provide constructive proofs that the following three statistics are equidistributed: the number of ascent plateaus of Stirling permutations of order n, a weighted variant of the number of excedances in permutations of length n and the number of blocks with even maximal elements in perfect matchings of the set {1, 2, 3, . . . , 2n}.
We study the weighted boundedness of the Cauchy singular integral operator SΓ in Morrey spaces L(Γ) on curves satisfying the arc-chord condition, for a class of ”radial type” almost monotonic weights. The non-weighted boundedness is shown to hold on an arbitrary Carleson curve. We show that the weighted boundedness is reduced to the boundedness of weighted Hardy operators in Morrey spaces L(0, ...
Cameron and Erdős [6] raised the question of how many maximal sum-free sets there are in {1, . . . , n}, giving a lower bound of 2bn/4c. In this paper we prove that there are in fact at most 2(1/4+o(1))n maximal sum-free sets in {1, . . . , n}. Our proof makes use of container and removal lemmas of Green [8, 9] as well as a result of Deshouillers, Freiman, Sós and Temkin [7] on the structure of...
We prove a basic result about tensor products of a II j factor with a finite von Neumann algebra and use it to answer, affirmatively, a question asked by S. Popa about maximal injective factors.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید