Related papers: Short Rational Functions for Toric Algebra and App…
Let $\mathcal{O}(U)$ denote the algebra of holomorphic functions on an open subset $U\subset\mathbb{C}^n$ and $Z\subset\mathcal{O}(U)$ its finite-dimensional vector subspace. By the theory of least space of de Boor and Ron, there exists a…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
Our aim in this paper is two-fold: First, for computing zeros of a linear time-invariant (LTI) system $\Sigma$ in {\em state-space form}, we introduce a "trimmed structured linearization", which we refer to as {\em Rosenbrock…
Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…
We study intermediate sums, interpolating between integrals and discrete sums, which were introduced by A. Barvinok [Computing the Ehrhart quasi-polynomial of a rational simplex, Math. Comp. 75 (2006), 1449--1466]. For a given semi-rational…
After the language of module and theirs morphisms, this short course presents matricial calculus and determinants in a commutative ring as appliction of ``remarquable identities'' in the ring of polynomials with integer coefficients with…
In this article we determine a generating set of rational invariants of minimal cardinality for the action of the orthogonal group $\mathrm{O}_3$ on the space $\mathbb{R}[x,y,z]_{2d}$ of ternary forms of even degree $2d$. The construction…
We propose a new polynomial-time algorithm for linear programming. We further extend the ideas used in this new linear programming algorithm for nonlinear programming problems. The new algorithm is based on the idea of treating the…
Matrix Lie groups provide a language for describing motion in such fields as robotics, computer vision, and graphics. When using these tools, we are often faced with turning infinite-series expressions into more compact finite series (e.g.,…
Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas. In this paper, we begin the study of how to exploit chordal structure in…
We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum…
We classify the finite-dimensional rational representations $V$ of the exceptional algebraic groups $G$ with $\mathfrak g={\sf Lie}(G)$ such that the symmetric invariants of the semi-direct product $\mathfrak g\ltimes V$, where $V$ is an…
We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…
We introduce and study equivariant Hilbert series of ideals in polynomial rings in countably many variables that are invariant under a suitable action of a symmetric group or the monoid $Inc(\mathbb{N})$ of strictly increasing functions.…
We study the general integer programming problem where the number of variables $n$ is a variable part of the input. We consider two natural parameters of the constraint matrix $A$: its numeric measure $a$ and its sparsity measure $d$. We…
In the present paper, we characterize all possible Hilbert functions of graded ideals in a polynomial ring whose regularity is smaller than or equal to $d$, where $d$ is a positive integer. In addition, we prove the following result which…
We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…
We discuss the use of matrices for providing sequences of rationals that approximate algebraic irrationalities. In particular, we study the regular representation of algebraic extensions, proving that ratios between two entries of the…
It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…