scientific article; zbMATH DE number 1206418
From MaRDI portal
Publication:4209232
algebraic coding theoryeffectivityGröbner basisinteger programmingmultivariate polynomial splinespolynomial equation solvingresultantsstandard basis
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to commutative algebra (13-01) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Computational aspects and applications of commutative rings (13Pxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to algebraic geometry (14-01) Effectivity, complexity and computational aspects of algebraic geometry (14Q20)
Recommendations
Cited in
(only showing first 100 items - show all)- The degree of the E-characteristic polynomial of an even order tensor
- Milne's volume function and vector symmetric polynomials
- Cayley-Dixon projection operator for multi-univariate composed polynomials
- A prolongation-projection algorithm for computing the finite real variety of an ideal
- On the complexity of counting components of algebraic varieties
- An efficient algorithm for range computation of polynomials using the Bernstein form
- Conditions for strong ellipticity of anisotropic elastic materials
- The moving line ideal basis of planar rational curves
- Null spaces of correlation matrices
- Some remarks on Fitzpatrick and Flynn's Gröbner basis technique for Padé approximation.
- Sparse resultant under vanishing coefficients
- Gröbner bases of certain zero-dimensional ideals arising in coding theory
- Solving the Selesnick-Burrus filter design equations using computational algebra and algebraic geometry
- A complete algorithm for counting real solutions of polynomial systems of equations and inequalities.
- System theory for system identification.
- Revisiting the -basis of a rational ruled surface.
- How tangents solve algebraic equations, or a remarkable geometry of discriminant varieties
- Dense resultant of composed polynomials: mixed-mixed case
- Corner edge cutting and Dixon \(\mathcal A\)-resultant quotients
- Toric Newton method for polynomial homotopies
- Computer algebra and algebraic geometry -- achievements and perspectives
- Symmetry, invariants, topology. Basic tools
- Symmetry, invariants, and topology in molecular models
- Fast computation of the Bézout and Dixon resultant matrices
- A family of sparse polynomial systems arising in chemical reaction systems
- Sparse resultant of composed polynomials. I: Mixed-unmixed case.
- Sparse resultant of composed polynomials. II: Unmixed-mixed case.
- Enumerating a subset of the integer points inside a Minkowski sum
- Implicitization of rational surfaces by means of polynomial interpolation
- Using moving planes to implicitize rational surfaces generated from a planar curve and a space curve
- Resolving decompositions for polynomial modules
- Gröbner bases and cocyclic Hadamard matrices
- Syzygies for translational surfaces
- General solution of the scattering equations
- Encoding algebraic power series
- Survey on the theory and applications of -bases for rational curves and surfaces
- The maximum number and its distribution of singular points for parametric piecewise algebraic curves
- Definitizability of normal operators on Krein spaces and their functional calculus
- Solving the perspective-three-point problem using comprehensive Gröbner systems
- Algebraic properties of the monopole formula
- Detection of special curves via the double resultant
- Sparse FGLM algorithms
- Binomial difference ideals
- Algorithm for computing \(\mu\)-bases of univariate polynomials
- Algebraic geometry and Bethe ansatz. I: The quotient ring for BAE
- Improved algorithms for computing determinants and resultants
- Recovering an algebraic curve using its projections from different points. Applications to static and dynamic computational vision
- Bernstein's second theorem and Viro's method for sparse polynomial systems in chemistry
- On the discriminant of Grunert's system of algebraic equations and related topics
- Simultaneous elimination by using several tools from real algebraic geometry
- Détermination des images d'un point de base d'une suarface rationnelle tensorielle définie par des vecteurs massiques.
- Computing the primary decomposition of zero-dimensional ideals
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- The resultant of an unmixed bivariate system
- Construction of the integral closure of an affine domain in a finite field extension of its quotient field
- Semismoothness of the maximum eigenvalue function of a symmetric tensor and its application
- Subresultants in multiple roots
- The Bézout number of piecewise algebraic curves
- Universal Gröbner basis associated with the maximum flow problem
- Superfast solution of Toeplitz systems based on syzygy reduction
- Algebraic methods in discrete analogs of the Kakeya problem
- On the validity of implicitization by moving quadrics for rational surfaces with no base points
- A connection between birational automorphisms of the plane and linear systems of curves
- Bifurcation diagram and stability for a one-parameter family of planar vector fields
- Riemannian Newton optimization methods for the symmetric tensor approximation problem
- Solution of polynomial equations
- \textsc{Azurite}: an algebraic geometry based package for finding bases of loop integrals
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems
- Analysis of normal-form algorithms for solving systems of polynomial equations
- A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions
- Optimal conditions for connectedness of discretized sets
- Certifying the global optimality of quartic minimization over the sphere
- Multigraded Sylvester forms, duality and elimination matrices
- On the identifiability of ternary forms
- Parameterization of rational translational surfaces
- Foliations on projective spaces associated to the affine Lie algebra
- Symmetry of eigenvalues of Sylvester matrices and tensors
- Chordal graphs in triangular decomposition in top-down style
- Invariance of a class of semi-algebraic sets for polynomial systems with dynamic compensators
- Computing the form of highest degree of the implicit equation of a rational surface
- Counting and enumerating feasible rotating schedules by means of Gröbner bases
- Flexibility of Bricard's linkages and other structures via resultants and computer algebra
- Computing strong regular characteristic pairs with Gröbner bases
- GKZ-hypergeometric systems for Feynman integrals
- Elimination for generic sparse polynomial systems
- Skeleton simplicial evaluation codes
- The Laplacian of a uniform hypergraph
- Irreducibility criteria for skew polynomials.
- Set-theoretic generators of rational space curves
- A perturbed differential resultant based implicitization algorithm for linear DPPEs
- A symbolic algorithm to compute immersions of polynomial systems into linear ones up to an output injection
- Control of intracellular molecular networks using algebraic methods
- On degree bounds for the sparse Nullstellensatz
- 2-colorability of \(r\)-uniform hypergraphs
- Implicitizing rational surfaces without base points by moving planes and moving quadrics
- On the multiplicity of isolated roots of sparse polynomial systems
- Generic regular decompositions for generic zero-dimensional systems
- The Rees algebra of a monomial plane parametrization
- Enumeration and classification of self-orthogonal partial Latin rectangles by using the polynomial method
- Nonsymmetric generic matrix equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4209232)
