Results 1  10
of
18
Mathematics by Experiment: Plausible Reasoning in the 21st Century, extended second edition, A K
 2008. EXPERIMENTATION AND COMPUTATION 19
, 2008
"... If mathematics describes an objective world just like physics, there is no reason why inductive methods should not be applied in mathematics just the same as in physics. (Kurt Gödel, 1951) Paper Revised 09–09–04 This paper is an extended version of a presentation made at ICME10, related work is elab ..."
Abstract

Cited by 56 (21 self)
 Add to MetaCart
If mathematics describes an objective world just like physics, there is no reason why inductive methods should not be applied in mathematics just the same as in physics. (Kurt Gödel, 1951) Paper Revised 09–09–04 This paper is an extended version of a presentation made at ICME10, related work is elaborated in references [1–7]. 1 I shall generally explore experimental and heuristic mathematics and give (mostly) accessible, primarily visual and symbolic, examples. The emergence of powerful mathematical computing environments like Maple and Matlab, the growing
Convolution polynomials
 The Mathematica Journal 2,4 (Fall
, 1992
"... Abstract. The polynomials that arise as coefficients when a power series is raised to the power x include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such properties, and it closes with a general result about ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
(Show Context)
Abstract. The polynomials that arise as coefficients when a power series is raised to the power x include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such properties, and it closes with a general result about approximating such polynomials asymptotically. A family of polynomials F0(x),F1(x),F2(x),... forms a convolution family if Fn(x) has degree ≤ n and if the convolution condition Fn(x + y) = Fn(x)F0(y) + Fn−1(x)F1(y) + · · · + F1(x)Fn−1(y) + F0(x)Fn(y) holds for all x and y and for all n ≥ 0. Many such families are known, and they appear frequently in applications. For example, we can let Fn(x) = x n /n!; the condition (x + y) n n! n∑ k=0 x k k! y n−k (n − k)! is equivalent to the binomial theorem for integer exponents. Or we can let Fn(x) be the binomial coefficient () x n; the corresponding identity ( ) n∑ x + y x y n k n − k is commonly called Vandermonde’s convolution. k=0 How special is the convolution condition? Mathematica will readily find all sequences of polynomials that work for, say, 0 ≤ n ≤ 4: F[n_,x_]:=Sum[f[n,j]x^j,{j,0,n}]/n! conv[n_]:=LogicalExpand[Series[F[n,x+y],{x,0,n},{y,0,n}]
Evolving Hierarchical and Recursive Teleoreactive Programs through Genetic Programming
 Programming, EuroGP 2003, LNCS 2610
, 2003
"... Teleoreactive programs and the triple tower architecture have been proposed as a framework for linking perception and action in agents. The triple tower architecture continually updates the agents knowledge of the world and evokes actions according to teleoreactive control structures. This paper ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
(Show Context)
Teleoreactive programs and the triple tower architecture have been proposed as a framework for linking perception and action in agents. The triple tower architecture continually updates the agents knowledge of the world and evokes actions according to teleoreactive control structures. This paper uses block stacking problems to demonstrate how genetic programming may be used to evolve hierarchical and recursive teleoreactive programs.
On the integrality of nth roots of generating functions
 J. COMBINATORIAL
, 2006
"... Motivated by the discovery that the eighth root of the theta series of the E8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f ∈ R (where R = 1 + xZ[[x]]) can be written as f = g n for g ∈ R, ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
(Show Context)
Motivated by the discovery that the eighth root of the theta series of the E8 lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f ∈ R (where R = 1 + xZ[[x]]) can be written as f = g n for g ∈ R, n ≥ 2. Let Pn: = {g n  g ∈ R} and let µn: = n ∏ pn p. We show among other things that (i) for f ∈ R, f ∈ Pn ⇔ f (mod µn) ∈ Pn, and (ii) if f ∈ Pn, there is a unique g ∈ Pn with coefficients mod µn/n such that f ≡ gn (mod µn). In particular, if f ≡ 1 (mod µn) then f ∈ Pn. The latter assertion implies that the theta series of any extremal even unimodular lattice in Rn (e.g. E8 in R8) is in Pn if n is of the form 2i3j5k (i ≥ 3). There do not seem to be any exact analogues for codes, although we show that the weight enumerator of the rth order ReedMuller code of length 2m is in P2r (and similarly that the theta series of the BarnesWall lattice BW2m is in P2m). We give a number of other results and conjectures, and establish a conjecture of Paul D. Hanna that there is a unique element f ∈ Pn (n ≥ 2) with coefficients restricted to the set {1, 2,..., n}.
Parity theorems for statistics on lattice paths and Laguerre configurations
, 2004
"... We examine the parity of some statistics on lattice paths and Laguerre configurations, giving both algebraic and combinatorial treatments. For the former, we evaluate qgenerating functions at q = −1; for the latter, we define appropriate paritychanging involutions on the associated structures. In ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
We examine the parity of some statistics on lattice paths and Laguerre configurations, giving both algebraic and combinatorial treatments. For the former, we evaluate qgenerating functions at q = −1; for the latter, we define appropriate paritychanging involutions on the associated structures. In addition, we furnish combinatorial proofs for a couple of related recurrences. 1
The generalized Stirling and Bell numbers revisited
 J. Integer Seq
"... The generalized Stirling numbers Ss;h(n,k) introduced recently by the authors are shown to be a special case of the three parameter family of generalized Stirling numbers S(n,k;α,β,r) considered by Hsu and Shiue. From this relation, several properties of Ss;h(n,k) and the associated Bell numbers Bs; ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
The generalized Stirling numbers Ss;h(n,k) introduced recently by the authors are shown to be a special case of the three parameter family of generalized Stirling numbers S(n,k;α,β,r) considered by Hsu and Shiue. From this relation, several properties of Ss;h(n,k) and the associated Bell numbers Bs;h(n) and Bell polynomials B s;hn(x) are derived. The particular case s = 2 and h = −1 corresponding to the meromorphic Weyl algebra is treated explicitly and its connection to Bessel numbers and Bessel 1 polynomials is shown. The dual case s = −1 and h = 1 is connected to Hermite polynomials. For the general case, a close connection to the Touchard polynomials of higher order recently introduced by Dattoli et al. is established, and Touchard polynomials of negative order are introduced and studied. Finally, a qanalogue Ss;h(n,kq) is introduced and first properties are established, e.g., the recursion relation and an explicit expression. It is shown that the qdeformed numbers Ss;h(n,kq) are special cases of the typeII p,qanalogue of generalized Stirling numbers introduced by Remmel and Wachs, providing the analogue to the undeformed case (q = 1). Furthermore, several special cases are discussed explicitly, in particular, the case s = 2 and h = −1 corresponding to the qmeromorphic Weyl algebra considered by Diaz and Pariguan. 1
Evolving TeleoReactive Programs for Block Stacking using Indexicals through Genetic Programming
, 2002
"... This paper demonstrates how stronglytyped genetic programming may be used to evolve valid teleoreactive programs that solve the general blockstacking problem using indexicals. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
This paper demonstrates how stronglytyped genetic programming may be used to evolve valid teleoreactive programs that solve the general blockstacking problem using indexicals.
On a new family of generalized Stirling and Bell numbers
"... A new family of generalized Stirling and Bell numbers is introduced by considering powers (V U) n of the noncommuting variables U,V satisfying UV = V U + hV s. The case s = 0 (and h = 1) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
A new family of generalized Stirling and Bell numbers is introduced by considering powers (V U) n of the noncommuting variables U,V satisfying UV = V U + hV s. The case s = 0 (and h = 1) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as srook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski’s formula is given for these Bell numbers. 1