Results 1  10
of
1,511
On the Random Character of Fundamental Constant Expansions
 EXPERIMENTAL MATHEMATICS
, 2001
"... We propose a theory to explain random behavior for the digits
in the expansions of fundamental mathematical constants. At
the core of our approach is a general hypothesis concerning the distribution of the iterates generated by dynamical maps. On this main hypothesis, one obtains proofs of base2 no ..."
Abstract

Cited by 56 (15 self)
 Add to MetaCart
We propose a theory to explain random behavior for the digits
in the expansions of fundamental mathematical constants. At
the core of our approach is a general hypothesis concerning the distribution of the iterates generated by dynamical maps. On this main hypothesis, one obtains proofs of base2
A likelihood approach to estimating phylogeny from discrete morphological character data
 Systematic Biology
, 2001
"... Abstract.—Evolutionary biologists have adopted simple likelihoodmodels for purposes of estimating ancestral states and evaluating character independence on specied phylogenies; however, for purposes of estimating phylogenies by using discrete morphological data, maximum parsimony remains the only o ..."
Abstract

Cited by 156 (0 self)
 Add to MetaCart
variable, because constant characters are absent in morphological data sets. Without this modication, branch lengths are often overestimated, resulting in potentially serious biases in tree topology selection. Several new avenues of research are opened by an explicitly modelbased approach to phylogenetic
Character Constants........................................................................... 15
"... www.LLHPublishing.com Programming Microcontrollers in C © 2001 by LLH Technology Publishing. All rights reserved. No part of this book may be reproduced, in any form or means whatsoever, without written permission from the publisher. While every precaution has been taken in the preparation of this ..."
Abstract
 Add to MetaCart
www.LLHPublishing.com Programming Microcontrollers in C © 2001 by LLH Technology Publishing. All rights reserved. No part of this book may be reproduced, in any form or means whatsoever, without written permission from the publisher. While every precaution has been taken in the preparation of this book, the publisher and author assume no responsibility for errors or omissions. Neither is any liability assumed for damages resulting from the use of the information contained herein. ISBN: 1878707574
Euler characters and submanifolds of constant positive curvature
 Trans. Amer. Math. Soc
"... Abstract. This article develops methods for studying the topology of submanifolds of constant positive curvature in Euclidean space. It proves that if M n is an ndimensional compact connected Riemannian submanifold of constant positive curvature in E 2n−1,thenM n must be simply connected. It also g ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract. This article develops methods for studying the topology of submanifolds of constant positive curvature in Euclidean space. It proves that if M n is an ndimensional compact connected Riemannian submanifold of constant positive curvature in E 2n−1,thenM n must be simply connected. It also
6.4.4.4 Character constants
"... character constant syntax escape sequence syntax characterconstant: ’ ccharsequence ’ L ’ ccharsequence ’ ccharsequence: cchar ccharsequence cchar cchar: any member of the source character set except the singlequote ’, backslash \, or newline character escapesequence escapesequence: ..."
Abstract
 Add to MetaCart
character constant syntax escape sequence syntax characterconstant: ’ ccharsequence ’ L ’ ccharsequence ’ ccharsequence: cchar ccharsequence cchar cchar: any member of the source character set except the singlequote ’, backslash \, or newline character escapesequence escape
6.4.4 Constants
"... constant syntax constant: integerconstant floatingconstant enumerationconstant characterconstant 822 constant expression syntax string literal syntax Commentary A constant differs from a constantexpression in that it consists of a single token. The term literal is often used by developers to re ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
constant syntax constant: integerconstant floatingconstant enumerationconstant characterconstant 822 constant expression syntax string literal syntax Commentary A constant differs from a constantexpression in that it consists of a single token. The term literal is often used by developers
SUPERCUSPIDAL CHARACTERS OF . . .
, 2004
"... Let F be a padic field of characteristic 0. For odd primes with certain tameness restrictions, techniques due to Assem allow us to write supercuspidal characters of SL (F) in terms of a family of distributions defined by Kazhdan. Following an argument of HarishChandra, we derive an integral fo ..."
Abstract
 Add to MetaCart
formula for these distributions. Results of DeBacker and Kazhdan allow us to evaluate this integral formula. This in turn gives supercuspidal character formulas for SL (F), explicit up to the constants appearing in the GL (F) local character expansion. Our result also describes the explicit local
Optimal Suffix Tree Construction with Large Alphabets
, 1997
"... The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner [Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building the suffix tree of an n character string drawn from a constant size alphabet. In the comparison model ..."
Abstract

Cited by 151 (0 self)
 Add to MetaCart
The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. Weiner [Wei73], who introduced the data structure, gave an O(n) time algorithm algorithm for building the suffix tree of an n character string drawn from a constant size alphabet. In the comparison
ON THE MAXIMUM NUMBER OF CONSECUTIVE INTEGERS ON WHICH A CHARACTER IS CONSTANT
"... Let χ be a nonprincipal Dirichlet character to the prime modulus p. In 1963, Burgess showed that the maximum number of consecutive integers H for which χ remains constant is O ( p1/4 log p). This is the best known asymptotic upper bound on this quantity. Recently, McGown proved an explicit version ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Let χ be a nonprincipal Dirichlet character to the prime modulus p. In 1963, Burgess showed that the maximum number of consecutive integers H for which χ remains constant is O ( p1/4 log p). This is the best known asymptotic upper bound on this quantity. Recently, McGown proved an explicit version
Results 1  10
of
1,511