نتایج جستجو برای: elimination

تعداد نتایج: 56069  

2013
STEVEN P. LALLEY

1.1. Stirling’s formula. Laplace’s approach to Stirling’s formula is noteworthy first, because it makes a direct connection with the Gaussian (normal) distribution (whereas in other approaches the Gaussian distribution enters indirectly, or not at all), and second, because it provides a general strategy for the asymptotic approximation of a large class of integrals with a large parameter. Stirl...

2007
Sergei Kerov

Let C(n; N) = R H N tr Z 2n (dZ) denote a matrix integral by a U(N)-invariant gaussian measure on the space H N of hermitian N N matrices. The integral is known to be always a positive integer. We derive a simple combinatorial interpretation of this integral in terms of rook conngurations on Ferrers boards. The formula C(n; N) = (2n ? 1)!! n X k=0 N k + 1 n k 2 k found by J. Harer and D. Zagier...

Journal: :SIAM J. Discrete Math. 2012
Tomoki Nakamigawa Norihide Tokushige

Let α, β,m, n be positive integers. Fix a line L : y = αx + β, and a lattice point Q = (m,n) on L. It is well known that the number of lattice paths from the origin to Q which touches L only at Q is given by β m+ n “m+ n m ” . We extend the above formula in various ways, in particular, we consider the case when α and β are arbitrary positive reals. The key ingredient of our proof is a new varia...

1997
L. Astrachan D. W. Loveland

When the Model Elimination (ME) procedure was rst proposed, a notion of lemma was put forth as a promising augmentation to the basic complete proof procedure. Here the lemmas that are used are also discovered by the procedure in the same proof run. Several implementations of ME now exist but only a 1970's implementation explicitly examined this lemma mechanism, with indiierent results. We repor...

1994
Hyuk-Chul Kwon Lauri Karttunen

The paper describes the construction of a lexical transducer for Korean tha t can be used for s temming a n d generation. The method contains two innovations: (1) two h.'vel rules ms well-formedness constraints in the initial phase; (2) the combinat ion of intersection and composit ion of rule t ransducers in a dee[) cascade ['or the final re.suit.

1998
Hung-Liang Lai

We show that the Sudakov factor from the resummation of double logarithms ln(s/k T ) contained in the distribution functions is responsible for the kT smearing mechanism employed in the next-to-leading-order QCD (αα 2 s) calculations of direct photon production. s is the center-of-mass energy, and kT the transverse momentum carried by a parton in a colliding hadron. This factor exhibits the app...

2008
BRIAN C. HALL

This paper gives necessary conditions and slightly stronger sufficient conditions for a holomorphic function to be the Segal-Bargmann transform of a function in L(R, ρ), where ρ is a Gaussian measure. The proof relies on a family of inversion formulas for the Segal-Bargmann transform, which can be “tuned” to give the best estimates for a given value of p. I also give a single necessary-and-suff...

Journal: :J. Symb. Comput. 1998
Thomas Breuer Götz Pfeiffer

We describe three different methods to compute all those characters of a finite group that have certain properties of transitive permutation characters. First, a combinatorial approach can be used to enumerate vectors of multiplicities. Secondly, these characters can be found as certain integral solutions of a system of inequalities. Thirdly, they are calculated via Gaussian elimination. The me...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید