Extension problem of subset-controlled quasimorphisms
نویسندگان
چکیده
منابع مشابه
Extension Problem of Subset-controlled Quasimorphisms
Let (G,H) be (Ham(R2n),Ham(B2n)) or (B∞, Bn). We conjecture that any semi-homogeneous subset-controlled quasimorphism on [G,G] can be extended to a homogeneous subset-controlled quasimorphism on G and also give a theorem supporting this conjecture by using a Bavard-type duality theorem on conjugation invariant norms. 1. Problems and results To state our conjecture, we introduce the notion of su...
متن کاملthe problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولMultidimensional Subset Sum Problem
This thesis explores new modifications to the successful LLL approach to solving the Subset Sum problem. This work is an optimization of the matrix representation of an instance. Traditionally, the basis matrix contained only one column with set elements and the sum. In this thesis we suggest having several data columns (thus introducing multidimensionality). This allows us to reduce the size o...
متن کاملSubset Seed Extension to Protein BLAST
A bstract: The seeding technique became central in the theory of sequence alignment and there are several efficient tools applying seeds to D N A homology search. Recently, a concept of subset seeds has been proposed for similarity search in protein sequences. We experimentally evaluate the applicability of subset seeds to protein homology search. We advocate the use of multiple subset seeds de...
متن کاملThe Coupon Subset Collection Problem
The coupon subset collection problem is a generalization of the classical coupon collecting problem, in that rather than collecting individual coupons we obtain, at each time point, a random subset of coupons. The problem of interest is to determine the expected number of subsets needed until each coupon is contained in at least one of these subsets. We provide bounds on this number, give effic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society, Series B
سال: 2018
ISSN: 2330-1511
DOI: 10.1090/bproc/31