Ordinal rankings on measures annihilating thin sets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ordinal Rankings on Measures Annihilating Thin Sets

We assign a countable ordinal number to each probability measure which annihilates all H-sets. The descriptive-set theoretic structure of this assignment allows us to show that this class of measures is coanalytic non-Borel. In addition, it allows us to quantify the failure of Rajchman's conjecture. Similar results are obtained for measures annihilating Dirichlet sets. A closet subset E of the ...

متن کامل

On sets of OT rankings

4 Partial rankings 11 4.1 Logic for partial rankings . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 4.2 Entailment between partial rankings . . . . . . . . . . . . . . . . . . . . . . . . 22 4.3 Correspondence between partial rankings and tableaux . . . . . . . . . . . . . 24 4.4 Duality between partial rankings and sets of tableaux . . . . . . . . . . . . . . 27 4.5 The domai...

متن کامل

Ordinal power relations and social rankings

Several real-life complex systems, like human societies or economic networks, are formed by interacting units characterized by patterns of relationships that may generate a group-based social hierarchy. In this paper, we address the problem of how to rank the individuals with respect to their ability to “influence” the relative strength of groups in a society. We also analyse the effect of basi...

متن کامل

Ordinal operations on graph representations of sets

Editorial Board Marat Arslanov, Kazan John T. Baldwin, Chicago, IL Douglas S. Bridges, Canterbury Armin Hemmerling, Greifswald Ramon Jansana, Barcelona Carl G. Jockusch, Urbana, IL Alexander Kechris, Pasadena, CA Ulrich Kohlenbach, Darmstadt H. Dugald Macpherson, Leeds Johann Makowsky, Haifa Andrzej Rosłanowski, Omaha, NE Jörg Rothe, Düsseldorf Wilfried Sieg, Pittsburgh, PA Stephen G. Simpson, ...

متن کامل

Using and Learning GAI-Decompositions for Representing Ordinal Rankings

We study the use of GAI-decomposable utility functions for representing ordinal rankings on combinatorial sets of objects. Considering only the relative order of objects leaves a lot of freedom for choosing a particular utility function, which allows one to get more compact representations. We focus on the problem of learning such representations, and give a polynomial PAC-learner for the case ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Transactions of the American Mathematical Society

سال: 1988

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1988-0951888-6