Szego polynomials: some relations to L-orthogonal and orthogonal polynomials

We consider the real Szego polynomials and obtain some relations to certain self inversive orthogonal L-polynomials defined on the unit circle and corresponding symmetric orthogonal polynomials on real intervals. We also consider the polynomials obtained when the coefficients in the recurrence relations satisfied by the self inversive orthogonal L-polynomials are rotated. (C) 2002 Elsevier B.V. B.V. All rights reserved.

Polinômios ortogonais de Laurent na reta real e no círculo unitário

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

On the Complex Dimensions of Nonlattice Fractal Strings in Connection with Dirichlet Polynomials

In this paper we give a new characterization of the closure of the set of the real parts of the zeros of a particular class of Dirichlet polynomials that is associated with the set of dimensions of fractality of certain fractal strings. We show, for some representative cases of nonlattice Dirichlet polynomials, that the real parts of their zeros are dense in their associated critical intervals, confirming the conjecture and the numerical experiments made by M. Lapidus and M. van Frankenhuysen in several papers.

The impact of exchanges rates on international real estate portfolio allocation

This paper, examines whether the asset holdings and weights of an international real estate portfolio using exchange rate adjusted returns are essentially the same or radically different from those based on unadjusted returns. The results indicate that the portfolio compositions produced by exchange rate adjusted returns are markedly different from those based on unadjusted returns. However following the introduction of the single currency the differences in portfolio composition are much less pronounced. The findings have a practical consequence for the investor because they suggest that following the introduction of the single currency international investors can concentrate on the real estate fundamentals when making their portfolio choices, rather than worry about the implications of exchange rate risk.

Connection coefficients and zeros of orthogonal polynomials

We discuss an old theorem of Obrechkoff and some of its applications. Some curious historical facts around this theorem are presented. We make an attempt to look at some known results on connection coefficients, zeros and Wronskians of orthogonal polynomials from the perspective of Obrechkoff's theorem. Necessary conditions for the positivity of the connection coefficients of two families of orthogonal polynomials are provided. Inequalities between the kth zero of an orthogonal polynomial p(n)(x) and the largest (smallest) zero of another orthogonal polynomial q(n)(x) are given in terms of the signs of the connection coefficients of the families {p(n)(x)} and {q(n)(x)}, An inequality between the largest zeros of the Jacobi polynomials P-n((a,b)) (x) and P-n((alpha,beta)) (x) is also established. (C) 2001 Elsevier B.V. B.V. All rights reserved.

Monotonicity of the zeros of orthogonal polynomials through related measures

Relation between two sequences of orthogonal polynomials, where the associated measures are related to each other by a first degree polynomial multiplication (or division), is well known. We use this relation to study the monotonicity properties of the zeros of generalized orthogonal polynomials. As examples, the Jacobi, Laguerre and Charlier polynomials are considered. (c) 2005 Elsevier B.V. All rights reserved.

On the number of limit cycles in discontinuous piecewise linear differential systems with two pieces separated by a straight line

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

The Two-Interval Line-Segment Problem

In this paper, the NPMLE in the one-dimensional line segment problem is defined and studied, where line segments on the real line through two non-overlapping intervals are observed. The self-consistency equations for the NPMLE are defined and a quick algorithm for solving them is provided. Supnorm weak convergence to a Gaussian process and efficiency of the NPMLE is proved. The problem has a strong geological application in the study of the lifespan of species.

On the Asymptotic Behavior of the Ratio between the Numbers of Binary Primitive and Irreducible Polynomials

This work was presented in part at the 8th International Conference on Finite Fields and Applications Fq^8 , Melbourne, Australia, 9-13 July, 2007.

Mean-Periodic Functions Associated with the Jacobi-Dunkl Operator on R

2000 Mathematics Subject Classification: 34K99, 44A15, 44A35, 42A75, 42A63

Multivariate orthogonal polynomials and integrable systems

Multivariate orthogonal polynomials in D real dimensions are considered from the perspective of the Cholesky factorization of a moment matrix. The approach allows for the construction of corresponding multivariate orthogonal polynomials, associated second kind functions, Jacobi type matrices and associated three term relations and also Christoffel-Darboux formulae. The multivariate orthogonal polynomials, their second kind functions and the corresponding Christoffel-Darboux kernels are shown to be quasi-determinants as well as Schur complements of bordered truncations of the moment matrix; quasi-tau functions are introduced. It is proven that the second kind functions are multivariate Cauchy transforms of the multivariate orthogonal polynomials. Discrete and continuous deformations of the measure lead to Toda type integrable hierarchy, being the corresponding flows described through Lax and Zakharov-Shabat equations; bilinear equations are found. Varying size matrix nonlinear partial difference and differential equations of the 2D Toda lattice type are shown to be solved by matrix coefficients of the multivariate orthogonal polynomials. The discrete flows, which are shown to be connected with a Gauss-Borel factorization of the Jacobi type matrices and its quasi-determinants, lead to expressions for the multivariate orthogonal polynomials and their second kind functions in terms of shifted quasi-tau matrices, which generalize to the multidimensional realm, those that relate the Baker and adjoint Baker functions to ratios of Miwa shifted tau-functions in the 1D scenario. In this context, the multivariate extension of the elementary Darboux transformation is given in terms of quasi-determinants of matrices built up by the evaluation, at a poised set of nodes lying in an appropriate hyperplane in R^D, of the multivariate orthogonal polynomials. The multivariate Christoffel formula for the iteration of m elementary Darboux transformations is given as a quasi-determinant. It is shown, using congruences in the space of semi-infinite matrices, that the discrete and continuous flows are intimately connected and determine nonlinear partial difference-differential equations that involve only one site in the integrable lattice behaving as a Kadomstev-Petviashvili type system. Finally, a brief discussion of measures with a particular linear isometry invariance and some of its consequences for the corresponding multivariate polynomials is given. In particular, it is shown that the Toda times that preserve the invariance condition lay in a secant variety of the Veronese variety of the fixed point set of the linear isometry.

Providing a law degree for the “real world” : perspective of an Australian law school

The Queensland University of Technology badges itself as “a university for the real world”. For the last decade the Law Faculty has aimed to provide its students with a ‘real world’ degree, that is, a practical law degree. This has seen skills such as research, advocacy and negotiation incorporated into the undergraduate degree under a University Teaching & Learning grant, a project that gained international recognition and praise. In 2007–2008 the Law Faculty undertook another curriculum review of its undergraduate law degree. As a result of the two year review, QUT’s undergraduate lawdegree has fewer core units, a focus on first year student transition, scaffolding of law graduate capabilities throughout the degree,work integrated learning and transition to the workplace. The revised degree commenced implementation in 2009. This paper focuses on the “real world” approach to the degree achieved through the first year programme, embedding and scaffolding law graduate capabilities through authentic and valid assessment and work integrated learning.

Providing a law degree for the 'real world' : perspective of an Australian law school

This paper focuses on the ‘real world’ approach to the degree achieved through the first year program, embedding and scaffolding law graduate capabilities through authentic and valid assessment and work integrated learning to assist graduates with transition into the workplace.

Providing a law degree for the real world : perspective of an Australian law school

As a result of a two year curriculum review, QUT’s undergraduate law degree has a focus on first year student transition, integration of law graduate capabilities throughout the degree and work integrated learning. A ‘whole-degree’ approach was adopted to ensure that capabilities were appropriately embedded and scaffolded throughout the degree, that teaching and learning approaches met the needs of students as they transitioned from first year through to final year, and that students in final year were provided with a capstone experience to assist them with transition into the work place. The revised degree commenced implementation in 2009. This paper focuses on the ‘real world’ approach to the degree achieved through the first year program, embedding and scaffolding law graduate capabilities through authentic and valid assessment and work integrated learning to assist graduates with transition into the workplace.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space or a k-cube is defined as the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.