$B$-sets and fine-cyclic elements

نویسندگان

چکیده

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

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

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

منابع مشابه

Combining Sets with Elements

We address the problem of combining decision procedures for sets with decision procedures for objects that are not (necessarily) sets. We present Nelson-Oppen-based and tableau-based combination methods, we prove their correctness, analyze their complexity, and we describe heuristics that aim for efficiency.

متن کامل

Mining Fine-grained Argument Elements

The paper discusses the architecture and development of an Argument Workbench, which supports an analyst in reconstructing arguments from across textual sources. The workbench takes a semi-automated, interactive approach searching in a corpus for fine-grained argument elements, which are concepts and conceptual patterns in expressions that are associated with argumentation schemes. The expressi...

متن کامل

Descent sets of cyclic permutations

We present a bijection between cyclic permutations of {1, 2, . . . , n+1} and permutations of {1, 2, . . . , n} that preserves the descent set of the first n entries and the set of weak excedances. This non-trivial bijection involves a Foata-like transformation on the cyclic notation of the permutation, followed by certain conjugations. We also give an alternate derivation of the consequent res...

متن کامل

Cyclic affine planes and Paley difference sets

Arasu, K.T. and A. Pott, Cyclic affine planes and Paley difference sets, Discrete Mathematics 106/107 (1992) 19-23. The existence of a cyclic affine plane implies the existence of a Paley type difference set. We use the existence of this difference set to give the following condition on the existence of cyclic affine planes of order n: If n 8 mod 16 then n 1 must be a prime. We discuss the stru...

متن کامل

Garside Categories, Periodic Loops and Cyclic Sets

Garside groupoids, as recently introduced by Krammer, generalise Garside groups. A weak Garside group is a group that is equivalent as a category to a Garside groupoid. We show that any periodic loop in a Garside groupoid G may be viewed as a Garside element for a certain Garside structure on another Garside groupoid Gm, which is equivalent as a category to G. As a consequence, the centraliser ...

متن کامل

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


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

ژورنال

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

سال: 1958

ISSN: 0002-9947

DOI: 10.1090/s0002-9947-1958-0095457-2