Yang-Lee zeros of the two- and three-state Potts model defined on π3 Feynman diagrams

We present both analytical and numerical results on the position of partition function zeros on the complex magnetic field plane of the q=2 state (Ising) and the q=3 state Potts model defined on phi(3) Feynman diagrams (thin random graphs). Our analytic results are based on the ideas of destructive interference of coexisting phases and low temperature expansions. For the case of the Ising model, an argument based on a symmetry of the saddle point equations leads us to a nonperturbative proof that the Yang-Lee zeros are located on the unit circle, although no circle theorem is known in this case of random graphs. For the q=3 state Potts model, our perturbative results indicate that the Yang-Lee zeros lie outside the unit circle. Both analytic results are confirmed by finite lattice numerical calculations.

Generators of supersymmetric polynomials in positive characteristic

In Kantor and Trishin (1997) [3], Kantor and Trishin described the algebra of polynomial invariants of the adjoint representation of the Lie superalgebra gl(m vertical bar n) and a related algebra A, of what they called pseudosymmetric polynomials over an algebraically closed field K of characteristic zero. The algebra A(s) was investigated earlier by Stembridge (1985) who in [9] called the elements of A(s) supersymmetric polynomials and determined generators of A(s). The case of positive characteristic p of the ground field K has been recently investigated by La Scala and Zubkov (in press) in [6]. We extend their work and give a complete description of generators of polynomial invariants of the adjoint action of the general linear supergroup GL(m vertical bar n) and generators of A(s).

Zeros of Weakly Holomorphic Modular Forms of Levels 2 and 3

Let M-k(#)(N) be the space of weakly holomorphic modular forms for Gamma(0)(N) that are holomorphic at all cusps except possibly at infinity. We study a canonical basis for M-k(#)(2) and M-k(#)(3) and prove that almost all modular forms in this basis have the property that the majority of their zeros in a fundamental domain lie on a lower boundary arc of the fundamental domain.

Direct and Inverse Results on Row Sequences of Hermite-Pad, Approximants

We give necessary and sufficient conditions for the convergence with geometric rate of the common denominators of simultaneous rational interpolants with a bounded number of poles. The conditions are expressed in terms of intrinsic properties of the system of functions used to build the approximants. Exact rates of convergence for these denominators and the simultaneous rational approximants are provided.

A positivity result in the theory of Macdonald polynomials

We outline here a proof that a certain rational function Cn(q, t), which has come to be known as the “q, t-Catalan,” is in fact a polynomial with positive integer coefficients. This has been an open problem since 1994. Because Cn(q, t) evaluates to the Catalan number at t = q = 1, it has also been an open problem to find a pair of statistics a, b on the collection

Robust fitting of Zernike polynomials to noisy point clouds defined over connected domains of arbitrary shape

A new method for fitting a series of Zernike polynomials to point clouds defined over connected domains of arbitrary shape defined within the unit circle is presented in this work. The method is based on the application of machine learning fitting techniques by constructing an extended training set in order to ensure the smooth variation of local curvature over the whole domain. Therefore this technique is best suited for fitting points corresponding to ophthalmic lenses surfaces, particularly progressive power ones, in non-regular domains. We have tested our method by fitting numerical and real surfaces reaching an accuracy of 1 micron in elevation and 0.1 D in local curvature in agreement with the customary tolerances in the ophthalmic manufacturing industry.

The Zeros of Riemann Zeta Partial Sums Yield Solutions to f(x) + f(2x) + · · · + f(nx) = 0

This paper proves that every zero of any n th , n ≥ 2, partial sum of the Riemann zeta function provides a vector space of basic solutions of the functional equation f(x)+f(2x)+⋯+f(nx)=0,x∈R . The continuity of the solutions depends on the sign of the real part of each zero.

Line and area orthogonality of Jacobi polynomials,

"Supported in part by contract U.S. AEC AT(11-1) 1469 and grant NSF-6J-217".

Parallel methods and bounds of evaluating polynomials.

Bibliography: p. 24.

Discriminant Sets of Families of Hyperbolic Polynomials of Degree 4 and 5

∗ Research partially supported by INTAS grant 97-1644

On Representations of Algebraic Polynomials by Superpositions of Plane Waves

* The author was supported by NSF Grant No. DMS 9706883.

Fractional Extensions of Jacobi Polynomials and Gauss Hypergeometric Function

2000 Mathematics Subject Classification: 26A33, 33C45

Estimate for the Number of Zeros of Abelian Integrals on Elliptic Curves

2000 Mathematics Subject Classification: Primary 34C07, secondary 34C08.

On the Zeros of the Solutions to Nonlinear Hyperbolic Equations with Delays

2002 Mathematics Subject Classification: Primary 35В05; Secondary 35L15

On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials

In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of 1853, to compute(2) the coefficients of a Sturmian remainder — obtained in applying in Q[x], Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of the determinants (3) of the corresponding submatrices of sylvester2. Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853, and E. B. Van Vleck, in 1900. (4) In this paper we extend the work by Pell and Gordon and show how to compute (2) the coefficients of an Euclidean remainder — obtained in finding in Q[x], the greatest common divisor of f, g ∈ Z[x] of degree n — in terms of the determinants (5) of the corresponding submatrices of sylvester1, Sylvester’s widely known and used matrix of 1840. (1) See the link http://en.wikipedia.org/wiki/Anna_Johnson_Pell_Wheeler for her biography (2) Both for complete and incomplete sequences, as defined in the sequel. (3) Also known as modified subresultants. (4) Using determinants Sylvester and Van Vleck were able to compute the coefficients of Sturmian remainders only for the case of complete sequences. (5) Also known as (proper) subresultants.