نتایج جستجو برای: shanks transorm

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

2013
Rosella Gennari Sara Tonelli Pierpaolo Vittorini

TERENCE is an FP7 ICT European project that is developing an adaptive learning system for supporting poor comprehenders and their educators. Its learning material are books of stories and games. The so-called smart games serve to stimulate the story comprehension. This paper focuses on the analysis of flat stories with a specific annotation language and the generation of smart games from the an...

2017
RICHARD GRATWICK

We investigate the properties of minimizers of one-dimensional variational problems when the Lagrangian has no higher smoothness than continuity. An elementary approximation result is proved, but it is shown that this cannot be in general of the form of a standard Lipschitz “variation”. Part of this investigation, but of interest in its own right, is an example of a nowhere locally Lipschitz mi...

2011
William Jimenez-Leal Christian Gaviria Miguel Uribe

There is not yet a clear agreement about the functional differences between the processing of mechanism versus covariation information in causal judgments. It has been shown recently that causal belief updating does not depend on the information’s origin but on the reliability of new information fed to the updating process (Perales, Catena, Maldonado, & Candido, 2007; Perales, Shanks, & Lagnado...

2008
William C. Jagy

has only three elements, written h(−23) = 3. There is an binary operation called composition that takes two primitive forms of the same discriminant to a third. Composition is commutative and associative, and makes the set of forms into a group, with identity 〈1, 0,−∆/4〉 for even discriminant and 〈1, 1, (1−∆)/4〉 for odd. From page 49 of Buell [1]: if a form 〈α, β, γ〉 represents a number r primi...

Journal: :Math. Comput. 1998
Anitha Srinivasan

In this paper an unconditional probabilistic algorithm to compute the class number of a real quadratic field Q( √ d) is presented, which computes the class number in expected time O(d1/5+ ). The algorithm is a random version of Shanks’ algorithm. One of the main steps in algorithms to compute the class number is the approximation of L(1, χ). Previous algorithms with the above running time O(d1/...

2008
MARCO MAZZUCCHELLI

We prove a Lagrangian analogue of the Conley conjecture: given a 1-periodic Tonelli Lagrangian with global flow on a closed configuration space, the associated EulerLagrange system has infinitely many periodic solutions. More precisely, we show that there exist infinitely many contractible periodic solutions with a priori bounded mean action and unbounded integer period.

Journal: :Journal für die reine und angewandte Mathematik (Crelles Journal) 2013

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

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