搜索结果: 1-15 共查到“数学 Sequences”相关记录100条 . 查询时间(0.087 秒)
STABLE GROTHENDIECK POLYNOMIALS AND K-THEORETIC FACTOR SEQUENCES
STABLE GROTHENDIECK POLYNOMIALS K-THEORETIC FACTOR
2015/12/17
We formulate a nonrecursive combinatorial rule for the expansion
of the stable Grothendieck polynomials of [Fomin-Kirillov '94] in the basis of
stable Grothendieck polynomials for partitions. This g...
Statistical Mo dels for Image Sequences.
NEEDLES AND STRAW IN HAYSTACKS: EMPIRICAL BAYES ESTIMATES OF POSSIBLY SPARSE SEQUENCES
HAYSTACKS NEEDLES AND STRAW
2015/8/20
An empirical Bayes approach to the estimation of possibly sparse
sequences observed in Gaussian white noise is set out and investigated. The
prior considered is a mixture of an atom of probability a...
FORCING AXIOMS AND THE CONTINUUM HYPOTHESIS,PART II:TRANSCENDING ω1-SEQUENCES OF REAL NUMBERS
FORCING AXIOMS CONTINUUM HYPOTHESIS TRANSCENDING ω1-SEQUENCES OF REAL NUMBERS
2015/8/17
The purpose of this article is to prove that the forcing axiom for completely proper forcings is inconsistent with the Continuum Hypothesis. This answers a longstanding problem of Shelah.
The Grundy number of an impartial game G is the size of the unique Nim heap equal to G. We introduce a new variant of Nim,Restricted Nim, which restricts the number of stones a player may remove from ...
FINITE EXCHANGEABLE SEQUENCES.
Zeta Functions and the Log-behavior of Combinatorial Sequences
log-convexity Riemann zeta function Bernoulli number Bell number Bessel zeta function Narayana number Hö lder's inequality
2014/6/3
In this paper, we use the Riemann zeta function ζ(x) and the Bessel zeta function ζμ(x) to study the log-behavior of combinatorial sequences. We prove that ζ(x) is log-convex for x>1. As a consequence...
Infinitely Log-monotonic Combinatorial Sequences
logarithmically completely monotonic function infinitely logmonotonic sequence ratio log-concave Riemann zeta function
2014/6/3
We introduce the notion of infinitely log-monotonic sequences. By establishing a connection between completely monotonic functions and infinitely log-monotonic sequences, we show that the sequences of...
AVERAGES ALONG POLYNOMIAL SEQUENCES IN DISCRETE NILPOTENT GROUPS: SINGULAR RADON TRANSFORMS
AVERAGES ALONG POLYNOMIAL SEQUENCES DISCRETE NILPOTENT GROUPS SINGULAR RADON TRANSFORMS
2014/4/3
We consider a class of operators defined by taking averages along polynomial sequences in discrete nilpotent groups. As in the continuous case, one can consider discrete maximal Radon transforms...
On 021-Avoiding Ascent Sequences
021-avoiding ascent sequence 132-avoiding permutation right-to-left minimum number of ascents bijection
2014/6/3
Ascent sequences were introduced by Bousquet-Mélou, Claesson, Dukes and Kitaev in their study of (2 + 2)-free posets. An ascent sequence of length n is a nonnegative integer sequence x = x1 x2... xn s...
Precise large deviations for dependent regularly varying sequences
stationary sequence large deviation principle regular variation Markov processes stochastic volatility model GARCH
2012/6/27
We study a precise large deviation principle for a stationary regularly varying sequence of random variables. This principle extends the classical results of A.V. Nagaev (1969) and S.V. Nagaev (1979) ...
Characterizing sequences for precompact group topologies
precompact group topology T -sequence TB-sequence characterizing sequence characterized subgroup Bembedded subgroup finest precompact extension
2012/6/19
A precompact group topology $\tau$ on an abelian group $G$ is called {\em single sequence characterized} (for short, {\em ss-characterized}) if there is a sequence $\mathbf{u}= (u_n)$ in $G$ such that...
Aperiodic Sequences and Aperiodic Geodesics
Recurrence Bernoulli-shift Geodesic Flow Flow-invariant Sets Symbolic Dynamics
2012/6/19
We introduce a quantitative condition on orbits of dynamical systems which measures their aperiodicity. We show the existence of sequences in the Bernoulli-shift and geodesics on closed hyperbolic man...
Cover times for sequences of Markov chains on random graphs
Random walk Cover time Maximal hitting time Random graph
2012/6/15
We provide conditions that classify cover times for sequences of random walks on random graphs into two types: One type (type 1) is the class of cover times approximated by the maximal hitting times s...
C-sortable words as green mutation sequences
Coxeter group quiver mutation cluster theory exchange graph
2012/5/9
Let Q be an acyclic quiver and s be a sequence s with elements in the vertex set Q_0. We describe a sequence of simple (backward) tilting in the bounded derived category D(Q), starting from the standa...