Results 261 to 270 of about 2,319,892 (295)

A selection lemma

open access: yesJournal of Combinatorial Theory - Series A, 1971
Richard Rado
exaly   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Some consequences of Rado’s selection lemma

Archive for Mathematical Logic, 2012
no ...
Marianne Morillon
exaly   +2 more sources

A Functional Analytic Proof of a Selection Lemma

Canadian Journal of Mathematics, 1980
If r is a mapping of a set X onto a set Y, then a selection for r is a mapping S of Y into X for which r o s is the identity. Analogously, if F is a mapping of a set Y into the power set 2Z of a set Z, then a selection for F is a mapping f of Y into Z such that ƒ(y) is an element of F(y) for all y in Y.
Baggett, L. W., Ramsay, Arlan
openaire   +2 more sources

On a variant of Rado’s selection lemma and its equivalence with the Boolean prime ideal theorem

Archive for Mathematical Logic, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Paul Howard, Eleftherios C. Tachtsis
exaly   +4 more sources

Improving the first selection lemma in R 3

Proceedings of the twenty-sixth annual symposium on Computational geometry, 2010
We present new bounds on the first selection lemma in ℜ3. This makes progress on the open problems of Bukh, Matouaek and Nivash [6] and Boros-Furedi [4] for the three-dimensional case, improving the previously best result of Wagner [8]. While our results narrow the gap between the current best lower and upper bounds, they do not settle this question ...
Abdul Basit 0001   +3 more
openaire   +2 more sources

From Theory to Practice: The Selection of Spanish Lemmas in the Accounting Dictionaries

Fachsprache, 2017
Interest in specialized lexicography has been propelled both by the development of LSP communication in academic circles and by the consolidation of function-based approaches to le- xicography that have identified the existence of several user types, e. g. experts, semi-experts and interested laypersons, and use situations, typically cognitive-oriented
Fuertes-Olivera, Pedro A.   +7 more
openaire   +2 more sources

Frequency-Selective KYP Lemma, IIR Filter, and Filter Bank Design

IEEE Transactions on Signal Processing, 2009
For a transfer function F(ejomega) of order n , Kalman-Yakubovich-Popov (KYP) lemma characterizes a general intractable semi-infinite programming (SIP) condition by a tractable semidefinite programming (SDP) for the entire frequency range. Some recent results generalize this lemma for a certain frequency interval.
Hung Gia Hoang   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy