Results 11  20
of
9,131
On the counting function for the generalized Niven
"... Let q ≥ 2 be a fixed integer and let f be an arbitrary complexvalued function defined on the set of nonnegative integers. We say that f is completely qadditive if f(aq j + b) = f(a) + f(b) ..."
Abstract
 Add to MetaCart
Let q ≥ 2 be a fixed integer and let f be an arbitrary complexvalued function defined on the set of nonnegative integers. We say that f is completely qadditive if f(aq j + b) = f(a) + f(b)
Muscle: multiple sequence alignment with high accuracy and high throughput
 NUCLEIC ACIDS RES
, 2004
"... We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using treedependent r ..."
Abstract

Cited by 2509 (7 self)
 Add to MetaCart
We describe MUSCLE, a new computer program for creating multiple alignments of protein sequences. Elements of the algorithm include fast distance estimation using kmer counting, progressive alignment using a new profile function we call the logexpectation score, and refinement using tree
Amortized Efficiency of List Update and Paging Rules
, 1985
"... In this article we study the amortized efficiency of the “movetofront” and similar rules for dynamically maintaining a linear list. Under the assumption that accessing the ith element from the front of the list takes 0(i) time, we show that movetofront is within a constant factor of optimum amo ..."
Abstract

Cited by 824 (8 self)
 Add to MetaCart
among a wide class of list maintenance rules. Other natural heuristics, such as the transpose and frequency count rules, da not share this property. We generalize our results to show that movetofront is within a constant factor of optimum as long as the access cost is a convex function. We also study
On the asymptotic behavior of some counting functions
 Colloq. Math. ON SOME COUNTING FUNCTIONS, II
"... Abstract. The investigation of the counting function of the set of integral elements, in an algebraic number field, with factorizations of at most k different lengths gives rise to a combinatorial constant depending only on the class group of the number field and the integer k. In this paper the va ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
Abstract. The investigation of the counting function of the set of integral elements, in an algebraic number field, with factorizations of at most k different lengths gives rise to a combinatorial constant depending only on the class group of the number field and the integer k. In this paper
Nevanlinna counting function and Carleson function of analytic maps
 Math. Annalen
, 2011
"... Abstract. We show that the maximal Nevanlinna counting function and the Carleson function of analytic selfmaps of the unit disk are equivalent, up to constants. ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
Abstract. We show that the maximal Nevanlinna counting function and the Carleson function of analytic selfmaps of the unit disk are equivalent, up to constants.
A survey of factorization counting functions
 Inter. J. Number Th
"... The general field of additive number theory considers questions concerning representations of a given positive integer n as a sum of other integers. In particular, partitions treat the sums as unordered combinatorial objects, and compositions treat the sums as ordered. Sometimes the sums are restric ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
in the unrestricted case and in the case when the factors are required to be distinct, and both when the product representations are considered as ordered objects and when they are unordered. We offer some new identities and observations for these and related counting functions and derive some new recursive
GromovWitten classes, quantum cohomology, and enumerative geometry
 Commun. Math. Phys
, 1994
"... The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov–Witten classes, and a discussion of their properties for Fano varieties. Cohomological ..."
Abstract

Cited by 474 (3 self)
 Add to MetaCart
Field Theories are defined, and it is proved that tree level theories are determined by their correlation functions. Application to counting rational curves on del Pezzo surfaces and projective spaces are given. Let V be a projective algebraic manifold. Methods of quantum field theory recently led to a
The resonance counting function for Schrödinger operators with generic potentials
 Math. Research Letters
"... Abstract. We show that the resonance counting function for a Schrödinger operator has maximal order of growth for generic sets of realvalued, or complexvalued, L ∞compactly supported potentials. 1. ..."
Abstract

Cited by 13 (7 self)
 Add to MetaCart
Abstract. We show that the resonance counting function for a Schrödinger operator has maximal order of growth for generic sets of realvalued, or complexvalued, L ∞compactly supported potentials. 1.
GENERALIZED SUBDIFFERENTIALS OF THE SIGN CHANGE COUNTING FUNCTION
"... Abstract. The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for this sign change counting function is given where classical subdifferentials remain intractable. An attempt to p ..."
Abstract
 Add to MetaCart
Abstract. The counting function on binary values is extended to the signed case in order to count the number of transitions between contiguous locations. A generalized subdifferential for this sign change counting function is given where classical subdifferentials remain intractable. An attempt
Results 11  20
of
9,131