N–Dimensional Orthogonal Tile Sizing Problem

AMS subject classification: 68Q22, 90C90

On Optimal Quadratic Lagrange Interpolation: Extremal Node Systems with Minimal Lebesgue Constant via Symbolic Computation

ACM Computing Classification System (1998): G.1.1, G.1.2.

Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small Lengths

Dedicated to the memory of the late professor Stefan Dodunekov on the occasion of his 70th anniversary. We classify up to multiplier equivalence maximal (v, 3, 1) optical orthogonal codes (OOCs) with v ≤ 61 and maximal (v, 3, 2, 1) OOCs with v ≤ 99. There is a one-to-one correspondence between maximal (v, 3, 1) OOCs, maximal cyclic binary constant weight codes of weight 3 and minimum dis tance 4, (v, 3; ⌊(v − 1)/6⌋) difference packings, and maximal (v, 3, 1) binary cyclically permutable constant weight codes. Therefore the classification of (v, 3, 1) OOCs holds for them too. Some of the classified (v, 3, 1) OOCs are perfect and they are equivalent to cyclic Steiner triple systems of order v and (v, 3, 1) cyclic difference families.

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.

Approximation Properties of Schurer-Stancu Type Polynomials

MSC 2010: 41A25, 41A35

Fekete-Szegoe problem for certain subclasses of analytic functions with respect to symmetric points

MSC 2010: 30C45

On Thom Polynomials for A4(−) via Schur Functions

2000 Mathematics Subject Classification: 05E05, 14N10, 57R45.

Smale's Conjecture on Mean Values of Polynomials and Electrostatics

2000 Mathematics Subject Classification: Primary 30C10, 30C15, 31B35.

Some Coefficient Estimates for Polynomials on the Unit Interval

2000 Mathematics Subject Classification: 26C05, 26C10, 30A12, 30D15, 42A05, 42C05.

Generalized D-Symmetric Operators I

2000 Mathematics Subject Classification: Primary: 47B47, 47B10; secondary 47A30.

Predegree Polynomials of Plane Configurations in Projective Space

2000 Mathematics Subject Classification: 14N10, 14C17.

Letter to the Editor. Remarks on Some Inequalities for Polynomials

MSC 2010: 30A10, 30C10, 30C80, 30D15, 41A17.

Even and Old Overdetermined Strata for Degree 6 Hyperbolic Polynomials

2000 Mathematics Subject Classification: 12D10.

Hyperbolic Fourth-R Quadratic Equation and Holomorphic Fourth-R Polynomials

MSC 2010: 30C10, 32A30, 30G35

Integral Representations of Functional Series with Members Containing Jacobi Polynomials

MSC 2010: Primary 33C45, 40A30; Secondary 26D07, 40C10