Displaying 61 – 80 of 131

Showing per page

Heights of varieties in multiprojective spaces and arithmetic Nullstellensätze

Carlos D’Andrea, Teresa Krick, Martín Sombra (2013)

Annales scientifiques de l'École Normale Supérieure

We present bounds for the degree and the height of the polynomials arising in some problems in effective algebraic geometry including the implicitization of rational maps and the effective Nullstellensatz over a variety. Our treatment is based on arithmetic intersection theory in products of projective spaces and extends to the arithmetic setting constructions and results due to Jelonek. A key role is played by the notion of canonical mixed height of a multiprojective variety. We study this notion...

Hilbert-Poincaré series of bigraded algebras

Lorenzo Robbiano, Giuseppe Valla (1998)

Bollettino dell'Unione Matematica Italiana

Lo scopo di questo lavoro è la descrizione di alcune nuove tecniche per calcolare serie di Hilbert-Poincaré (HP-serie) di algebre standard, che possono essere viste come sottoalgebre di algebre bigraduate. In particolare mostriamo come calcolare in modo uniforme le HP-serie delle potenze di un idele omogeneo. Mostriamo anche come calcolare le HP-serie di prodotti di Segre e di alcune algebre di Blow-up, che sono di interesse in Geometria Algebrica. Per alcune classi siamo in grado di descrivere...

Ideal arithmetic and infrastructure in purely cubic function fields

Renate Scheidler (2001)

Journal de théorie des nombres de Bordeaux

This paper investigates the arithmetic of fractional ideals of a purely cubic function field and the infrastructure of the principal ideal class when the field has unit rank one. First, we describe how irreducible polynomials decompose into prime ideals in the maximal order of the field. We go on to compute so-called canonical bases of ideals; such bases are very suitable for computation. We state algorithms for ideal multiplication and, in the case of unit rank one and characteristic at least five,...

Ideal interpolation: Mourrain's condition vs. D-invariance

C. de Boor (2006)

Banach Center Publications

Mourrain [Mo] characterizes those linear projectors on a finite-dimensional polynomial space that can be extended to an ideal projector, i.e., a projector on polynomials whose kernel is an ideal. This is important in the construction of normal form algorithms for a polynomial ideal. Mourrain's characterization requires the polynomial space to be 'connected to 1', a condition that is implied by D-invariance in case the polynomial space is spanned by monomials. We give examples to show that, for more...

Integer Linear Programming applied to determining monic hyperbolic irreducible polynomials with integer coefficients and span less than 4

Souad El Otmani, Armand Maul, Georges Rhin, Jean-Marc Sac-Épée (2013)

Journal de Théorie des Nombres de Bordeaux

In this work, we propose a new method to find monic irreducible polynomials with integer coefficients, only real roots, and span less than 4. The main idea is to reduce the search of such polynomials to the solution of Integer Linear Programming problems. In this frame, the coefficients of the polynomials we are looking for are the integer unknowns. We give inequality constraints specified by the properties that the polynomials should have, such as the typical distribution of their roots. These...

Meandering of trajectories of polynomial vector fields in the affine n-space.

Dimitri Novikov, Sergei Yakovenko (1997)

Publicacions Matemàtiques

We give an explicit upper bound for the number of isolated intersections between an integral curve of a polynomial vector field in Rn and an affine hyperplane.The problem turns out to be closely related to finding an explicit upper bound for the length of ascending chains of polynomial ideals spanned by consecutive derivatives.This exposition constitutes an extended abstract of a forthcoming paper: only the basic steps are outlined here, with all technical details being either completely omitted...

Minimal resolutions of lattice ideals and integer linear programming.

Emilio Briales-Morales, Antonio Campillo-López, Pilar Pisón-Casares, Alberto Vigneron-Tenorio (2003)

Revista Matemática Iberoamericana

A combinatorial description of the minimal free resolution of a lattice ideal allows us to the connection of Integer Linear Programming and Al1gebra. The non null reduced homology spaces of some simplicial complexes are the key. The extremal rays of the associated cone reduce the number of variables.

Multivariate Sturm-Habicht sequences: real root counting on n-rectangles and triangles.

Laureano González-Vega, Guadalupe Trujillo (1997)

Revista Matemática de la Universidad Complutense de Madrid

The main purpose of this note is to show how Sturm-Habicht Sequence can be generalized to the multivariate case and used to compute the number of real solutions of a polynomial system of equations with a finite number of complex solutions. Using the same techniques, some formulae counting the number of real solutions of such polynomial systems of equations inside n-dimensional rectangles or triangles in the plane are presented.

Currently displaying 61 – 80 of 131