Searching for authors named Claude Laflamme – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Combinatorial Aspects of Fσ Filters with an Application to N-Sets
- …. We discuss F oe filters and show that the minimum size of a filter base generating an undiagonalizable filter included in some F oe filter is the better known bounded evasion number e ubd . An application to N -sets from trigonometric series is given by showing that if A is an N -set and B has siz…
- Add To MetaCart
-
Equivalence of Families of Functions on the Natural Numbers
- …We present some consequences of the inequality u!g among cardinal invariants of the continuum, which has previously been shown to be consistent relative to ZFC. We are interested in its effect on two orderings of families of functions on the natural numbers; in particular we show that, under u!g…
- Cited by 4 (3 self) – Add To MetaCart
-
Zapping Small Filters
- …We show two methods for diagonalizing filters of the form F oe , first without adding an unbounded real, the other while preserving P-points; the interest lies in an attempt at destroying maximal almost disjoint families with least damage. 1 Introduction Our aim is to investigate how to diagonalize…
- Cited by 3 (3 self) – Add To MetaCart
-
Some Possible Covers of Measure Zero Sets
- …We study the rate of convergence of the series of lengths obtained from sequences of intervals covering a measure zero set. 1 Introduction Borel was interested in what he called the rarefaction of a measure zero set X (see [5]), that is the rate of convergence of the series P n jI n j, for vario…
- Cited by 2 (2 self) – Add To MetaCart
-
A Few sigma-Ideals of Measure Zero Sets Related to their Covers
- …: After extending Borel's classification of measure zero sets in previous papers, we now look at some collections of measure zero sets naturally defined from properties of their covers and prove they actually form oe-ideals; we also study the parameters involved in their definitions, using some meth…
- Add To MetaCart
-
Counting Simplexes in R³
- …A finite set of vectors S#R n is called a simplex i# S is linearly dependent but all its proper subsets are independent. This concept arises in particular from stoichiometry. We are interested in this paper in the number of simplexes contained in some H#R n , which we denote by simp(H). This inv…
- Add To MetaCart
-
Counting Simplexes in R^n
- …. A finite set of vectors S ae R n is called a simplex iff S is linearly dependent but all its proper subsets are independent. If we denote the number of simplexes contained in H ` R n by simp(H), then our main results can be formulated as: THEOREM: For any H ` R n of fixed size, simp(H) is m…
- Add To MetaCart
-
Automated Mobile Mapping for Asset Managers
- …Geo-3D Inc., a Montreal based company (Canada), offers software products and services for geomatics and GIS data collection using advanced terrestrial photogrammetric techniques. The company’s products provide a mobile mapping solution integrating different sensors such as digital camera(s), GPS-INS…
- Add To MetaCart
-
On The Refinement And Countable Refinement Numbers
- …. This short note presents the authors' contributions to Vojtas' unsolved problem of whether the refinement and countable refinement numbers are the same. We present evidence that the construction of a model where these numbers are different would require novel techniques. 1. Introduction In hi…
- Add To MetaCart
-
Partitions of k-Branching Trees
- …The reaping number rm;n (B) of a Boolean algebra B is defined as the minimum size of a subset A ` B n fOg such that for each m-partition P of unity, some member of A meets less than n elements of P.…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
