Towards Mixed Gr{\"o}bner Basis Algorithms: the Multihomogeneous and Sparse Case

One of the biggest open problems in computational algebra is the design of efficient algorithms for Gr{\"o}bner basis computations that take into account the sparsity of the input polynomials. We can perform such computations in the case of unmixed polynomial systems, that is systems with polynomials having the same support, using the approach of Faug{\`e}re, Spaenlehauer, and Svartz [ISSAC'14]. We present two algorithms for sparse Gr{\"o}bner bases computations for mixed systems. The first one computes with mixed sparse systems and exploits the supports of the polynomials. Under regularity assumptions, it performs no reductions to zero. For mixed, square, and 0-dimensional multihomogeneous polynomial systems, we present a dedicated, and potentially more efficient, algorithm that exploits different algebraic properties that performs no reduction to zero. We give an explicit bound for the maximal degree appearing in the computations

Hyperdeterminants as integrable discrete systems

We give the basic definitions and some theoretical results about hyperdeterminants, introduced by A. Cayley in 1845. We prove integrability (understood as 4d-consistency) of a nonlinear difference equation defined by the 2x2x2-hyperdeterminant. This result gives rise to the following hypothesis: the difference equations defined by hyperdeterminants of any size are integrable. We show that this hypothesis already fails in the case of the 2x2x2x2-hyperdeterminant.Comment: Standard LaTeX, 11 pages. v2: corrected a small misprint in the abstrac

Invariant and polynomial identities for higher rank matrices

We exhibit explicit expressions, in terms of components, of discriminants, determinants, characteristic polynomials and polynomial identities for matrices of higher rank. We define permutation tensors and in term of them we construct discriminants and the determinant as the discriminant of order $d$, where $d$ is the dimension of the matrix. The characteristic polynomials and the Cayley--Hamilton theorem for higher rank matrices are obtained there from

Formative evaluation of electricity distribution utilities using data envelopment analysis

The use of Data Envelopment Analysis (DEA) in the electricity distribution sector has been prolific in the number of papers published in research journals. However, while numerous studies have been documented, they have mostly been summative. Their aim has been predominantly descriptive and classificatory. This paper argues that evaluations of a formative nature are more effective than summative studies in promoting a better understanding of the structures and processes of electricity distribution utilities and, consequently, are more appropriate to contribute to performance improvement. To illustrate the use of DEA for formative evaluation, and highlight some of the difficulties of using DEA in practice, this paper compares the cost-efficiency of the Portuguese electricity distribution companies from 2002 to 2006. A dynamic analysis using Malmquist Indices is also conducted in order to evaluate the changes in productivity over this period. Our analysis shows that the application of DEA for formative purposes meets some difficulties. In particular it shows that while the modelling of productivity/efficiency scores using DEA is relatively straightforward, it is comparatively more difficult to develop models that are economically valid and that produce results with face validity. On the basis of the insights derived from this analysis, the paper provides some recommendations regarding the successful application of DEA for performance improvement

Triangulations and Severi varieties

We consider the problem of constructing triangulations of projective planes over Hurwitz algebras with minimal numbers of vertices. We observe that the numbers of faces of each dimension must be equal to the dimensions of certain representations of the automorphism groups of the corresponding Severi varieties. We construct a complex involving these representations, which should be considered as a geometric version of the (putative) triangulations

Compact Formulae in Sparse Elimination

International audienceIt has by now become a standard approach to use the theory of sparse (or toric) elimination, based on the Newton polytope of a polynomial, in order to reveal and exploit the structure of algebraic systems. This talk surveys compact formulae, including older and recent results, in sparse elimination. We start with root bounds and juxtapose two recent formulae: a generating function of the m-Bézout bound and a closed-form expression for the mixed volume by means of a matrix permanent. For the sparse resultant, a bevy of results have established determinantal or rational formulae for a large class of systems, starting with Macaulay. The discriminant is closely related to the resultant but admits no compact formula except for very simple cases. We offer a new determinantal formula for the discriminant of a sparse multilinear system arising in computing Nash equilibria. We introduce an alternative notion of compact formula, namely the Newton polytope of the unknown polynomial. It is possible to compute it efficiently for sparse resultants, discriminants, as well as the implicit equation of a parameterized variety. This leads us to consider implicit matrix representations of geometric objects

Four lectures on secant varieties

This paper is based on the first author's lectures at the 2012 University of Regina Workshop "Connections Between Algebra and Geometry". Its aim is to provide an introduction to the theory of higher secant varieties and their applications. Several references and solved exercises are also included.Comment: Lectures notes to appear in PROMS (Springer Proceedings in Mathematics & Statistics), Springer/Birkhause