Results 1  10
of
24
New infinite families of exact sums of squares formulas, Jacobi elliptic functions, and Ramanujan’s tau function
, 1996
"... Dedicated to the memory of GianCarlo Rota who encouraged me to write this paper in the present style Abstract. In this paper we derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which generalize Jacobi’s 4 and 8 squares identities to 4n ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
Dedicated to the memory of GianCarlo Rota who encouraged me to write this paper in the present style Abstract. In this paper we derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which generalize Jacobi’s 4 and 8 squares identities to 4n 2 or 4n(n + 1) squares, respectively, without using cusp forms. In fact, we similarly generalize to infinite families all of Jacobi’s explicitly stated degree 2, 4, 6, 8 Lambert series expansions of classical theta functions. In addition, we extend Jacobi’s special analysis of 2 squares, 2 triangles, 6 squares, 6 triangles to 12 squares, 12 triangles, 20 squares, 20 triangles, respectively. Our 24 squares identity leads to a different formula for Ramanujan’s tau function τ(n), when n is odd. These results, depending on new expansions for powers of various products of classical theta functions, arise in the setting of Jacobi elliptic functions, associated continued fractions, regular Cfractions, Hankel or Turánian determinants, Fourier series, Lambert series, inclusion/exclusion, Laplace expansion formula for determinants, and Schur functions. The Schur function form of these infinite families of identities are analogous to the ηfunction identities of Macdonald. Moreover, the powers 4n(n + 1), 2n 2 + n, 2n 2 − n that appear in Macdonald’s work also arise at appropriate places in our analysis. A special case of our general methods yields a proof of the two Kac–Wakimoto conjectured identities involving representing
Number theory and elementary arithmetic
 Philosophia Mathematica
, 2003
"... Elementary arithmetic (also known as “elementary function arithmetic”) is a fragment of firstorder arithmetic so weak that it cannot prove the totality of an iterated exponential function. Surprisingly, however, the theory turns out to be remarkably robust. I will discuss formal results that show t ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
Elementary arithmetic (also known as “elementary function arithmetic”) is a fragment of firstorder arithmetic so weak that it cannot prove the totality of an iterated exponential function. Surprisingly, however, the theory turns out to be remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context. 1
Formalizing O Notation in Isabelle/HOL
, 2004
"... We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant. ..."
Abstract

Cited by 12 (4 self)
 Add to MetaCart
We describe a formalization of asymptotic O notation using the Isabelle/HOL proof assistant.
Order computations in generic groups
 PHD THESIS MIT, SUBMITTED JUNE 2007. RESOURCES
, 2007
"... ..."
EQUATIONS AND INEQUALITIES INVOLVING vp(n!)
, 2005
"... Dedicated to Professor Bahman Mehri on the occasion of his 70th birthday ABSTRACT. In this paper we study vp(n!), the greatest power of prime p in factorization of n!. We find some lower and upper bounds for vp(n!), and we show that vp(n!) = n p−1 + O(ln n). By using the afore mentioned bounds, we s ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Dedicated to Professor Bahman Mehri on the occasion of his 70th birthday ABSTRACT. In this paper we study vp(n!), the greatest power of prime p in factorization of n!. We find some lower and upper bounds for vp(n!), and we show that vp(n!) = n p−1 + O(ln n). By using the afore mentioned bounds, we study the equation vp(n!) = v for a fixed positive integer v. Also, we study the triangle inequality about vp(n!), and show that the inequality pvp(n!)> qvq(n!) holds for primes p < q and sufficiently large values of n.
MOD (2p + 1)ORIENTATIONS AND K1,2p+1DECOMPOSITIONS
, 2007
"... In this paper, we establish an equivalence between the contractible graphs with respect to the mod (2p + 1)orientability and the graphs with K1,2p+1decompositions. This is applied to disprove a conjecture proposed by Barat and Thomassen that every 4edgeconnected simple planar graph G with E(G) ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper, we establish an equivalence between the contractible graphs with respect to the mod (2p + 1)orientability and the graphs with K1,2p+1decompositions. This is applied to disprove a conjecture proposed by Barat and Thomassen that every 4edgeconnected simple planar graph G with E(G) ≡ 0 (mod 3) has a claw decomposition.
J.H.: An Enhanced Genetic Algorithm with Orthogonal Design
 In: 2006 IEEE Congress on Evolutionary Computation
, 2006
"... AbstractThis paper presents an enhanced Latin Square Genetic Algorithm (LSGA). It makes the chromosomes to be more sensible to their surrounding regions. The algorithm applies orthogonal design method to every chromosome in the population to detect chromosomes with high fitness values in the surro ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
AbstractThis paper presents an enhanced Latin Square Genetic Algorithm (LSGA). It makes the chromosomes to be more sensible to their surrounding regions. The algorithm applies orthogonal design method to every chromosome in the population to detect chromosomes with high fitness values in the surrounding regions. Orthogonal design method makes it more concise and direct to find the delegate to represent the situation of the surrounding regions. We execute the proposed algorithm to solve 15 test functions and compare it with traditional algorithm without using orthogonal design method. The results show that the proposed algorithm can find optimal or closetooptimal solutions with higher speed and more accuracy.
ALGEBRAS GENERATED BY TWO BOUNDED HOLOMORPHIC FUNCTIONS
, 2002
"... Abstract. We study the closure in the Hardy space or the disk algebra of algebras generated by two bounded functions, of which one is a finite Blaschke product. We give necessary and sufficient conditions for density or finite codimension (of the closure) of such algebras. The conditions are express ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We study the closure in the Hardy space or the disk algebra of algebras generated by two bounded functions, of which one is a finite Blaschke product. We give necessary and sufficient conditions for density or finite codimension (of the closure) of such algebras. The conditions are expressed in terms of the inner part of some function which is explicitly derived from each pair of generators. Our results are based on identifying zinvariant subspaces included in the closure of the algebra. 1.