Results 1  10
of
8,914
Derangements and eigenvaluefree elements in finite classical groups
 J. London Math. Soc
, 1998
"... Permutations that have no fixed points have been known for a very long time as ‘derangements ’. Under that heading RouseBall [10, p. 46] puts the matter in the following charming way: ‘Suppose you have written a letter to each of n different friends, and addressed the n corresponding envelopes. In ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Permutations that have no fixed points have been known for a very long time as ‘derangements ’. Under that heading RouseBall [10, p. 46] puts the matter in the following charming way: ‘Suppose you have written a letter to each of n different friends, and addressed the n corresponding envelopes. In how many ways can you
Quasiprimitive groups with no fixed point free elements of prime order
 J. London Math. Soc
"... Abstract The paper determines all permutation groups with a transitive minimal normal subgroup that have no fixed point free elements of prime order. All such groups are primitive and are wreath products in a product action involving M 11 in its action on 12 points. These groups are not 2closed an ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract The paper determines all permutation groups with a transitive minimal normal subgroup that have no fixed point free elements of prime order. All such groups are primitive and are wreath products in a product action involving M 11 in its action on 12 points. These groups are not 2closed
FIXEDPOINTFREE ELEMENTS OF ITERATED MONODROMY GROUPS
"... Abstract. The iterated monodromy group of a postcritically finite complex polynomial of degree d ≥ 2 acts naturally on the complete dary rooted tree T of preimages of a generic point. This group, as well as its profinite completion, act on the boundary of T, which is given by extending the bran ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the branches to their “ends ” at infinity. We show that in most cases, elements that have fixed points on the boundary are rare, in that they belong to a set of Haar measure 0. The exceptions are those polynomials linearly conjugate to multiples of Chebyshev polynomials and a case that remains unresolved
FIXEDPOINTFREE /^ELEMENTS IN TRANSITIVE PERMUTATION GROUPS
"... We give sufficient conditions for a finite permutation group to contain a fixedpointfree permutation of/>power order for a given prime p. ..."
Abstract
 Add to MetaCart
We give sufficient conditions for a finite permutation group to contain a fixedpointfree permutation of/>power order for a given prime p.
The Penn Treebank: Annotating Predicate Argument Structure
 In ARPA Human Language Technology Workshop
, 1994
"... The Penn Treebank has recently implemented a new syntactic annotation scheme, designed to highlight aspects of predicateargument structure. This paper discusses the implementation of crucial aspects of this new annotation scheme. It incorporates a more consistent treatment of a wide range of gramma ..."
Abstract

Cited by 349 (4 self)
 Add to MetaCart
of grammatical phenomena, provides a set of coindexed null elements in what can be thought of as "underlying " position for phenomena such as whmovement, passive, and the subjects of infinitival constructions, provides some noncontext free annotational mechanism to allow the structure
Obstructionfree synchronization: Doubleended queues as an example
 In preparation
, 2003
"... We introduce obstructionfreedom, a new nonblocking property for shared data structure implementations. This property is strong enough to avoid the problems associated with locks, but it is weaker than previous nonblocking properties—specifically lockfreedom and waitfreedom— allowing greater flexi ..."
Abstract

Cited by 211 (18 self)
 Add to MetaCart
operations that interfere with operations at the opposite end of the deque even when the deque has many elements in it. Our obstructionfree implementations have none of these drawbacks, and thus suggest that it is much easier to design obstructionfree implementations than lockfree and waitfree ones. We
ZooKeeper: Waitfree Coordination for Internetscale Systems
 In USENIX Annual Technical Conference
"... In this paper, we describe ZooKeeper, a service for coordinating processes of distributed applications. Since ZooKeeper is part of critical infrastructure, ZooKeeper aims to provide a simple and high performance kernel for building more complex coordination primitives at the client. It incorporates ..."
Abstract

Cited by 222 (9 self)
 Add to MetaCart
elements from group messaging, shared registers, and distributed lock services in a replicated, centralized service. The interface exposed by ZooKeeper has the waitfree aspects of shared registers with an eventdriven mechanism similar to cache invalidations of distributed file systems to provide a
Bounds For Fixed Point Free Elements In A Transitive Group and Applications to Curves over Finite Fields
 255–287, MR 1484879 (98j:12002), Zbl 0910.11053
, 1997
"... this paper, we are interested in upper bounds for V f . It is clear that V f q with equality holding if and only if f(T ) is a permutation polynomial over F q . If V f ! q, then ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
this paper, we are interested in upper bounds for V f . It is clear that V f q with equality holding if and only if f(T ) is a permutation polynomial over F q . If V f ! q, then
Full Abstraction for PCF
 INFORMATION AND COMPUTATION
, 1996
"... An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "historyfree" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable i ..."
Abstract

Cited by 254 (16 self)
 Add to MetaCart
An intensional model for the programming language PCF is described, in which the types of PCF are interpreted by games, and the terms by certain "historyfree" strategies. This model is shown to capture definability in PCF. More precisely, every compact strategy in the model is definable
Results 1  10
of
8,914