Results 21 to 30 of about 2,297,129 (216)
Polynomiality properties of tropical refined invariants [PDF]
, 2022 Tropical refined invariants of toric surfaces constitute a fascinating interpolation between real and complex enumerative geometries via tropical geometry.
Brugallé, Erwan +1 more
core +1 more source
Polynomial decomposition algorithms
Journal of Symbolic Computation, 1985 \textit{M. Fried} and \textit{R. MacRae} [Math. Ann. 180, 220--226 (1969; Zbl 0185.28803)] proved the following theorem: Let \(f,g,p,q\) be univariate polynomials over an arbitrary field \(k\). Then \(p(x)-q(z)\) divides \(f(x)-g(z)\) if and only if there exists a polynomial \(F(t)\) over \(k\) such that \(f(t)=F(p(t))\) and \(g(t)=F(q(t)).\) The ...
David R. Barton, Richard Zippel
openaire +2 more sources
Polynomiality properties of tropical refined invariants
24 Figures, 44 pages. V2: minor revisionsTropical refined invariants of toric surfaces constitute a fascinating interpolation between real and complex enumerative geometries via tropical geometry.
Brugallé, Erwan +1 more
core +7 more sources
Division algorithms for Bernstein polynomials [PDF]
Computer Aided Geometric Design, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Busé, Laurent, Goldman, Ron
openaire +1 more source
Convergence analysis of an Inexact Infeasible Interior Point method for Semidefinite Programming [PDF]
, 2004 In this paper we present an extension to SDP of the well known infeasible Interior Point method for linear programming of Kojima,Megiddo and Mizuno (A primal-dual infeasible-interior-point algorithm for Linear Programming, Math. Progr., 1993).
Pieraccini, Sandra, Bellavia, S
core +1 more source
Polynomial decomposition algorithms
Journal of Symbolic Computation, 1989 A polynomial \(f\) over a commutative ring is said to be decomposable if it has a non-trivial functional decomposition \(f=g\circ h\). Previous algorithms to check decomposability were exponential-time in the worst case and only worked over fields of characteristic 0.
Dexter Kozen, Susan Landau 0001
openaire +3 more sources
Algorithmic Computation of Polynomial Amoebas [PDF]
, 2016 We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide method and an algorithm for the computation of~polynomials whose amoebas exhibit the most complicated topology among all polynomials with a fixed Newton polytope ...
D. V. Bogdanov +2 more
openaire +5 more sources
Interpolation by lattice polynomial functions: A polynomial time algorithm [PDF]
Fuzzy Sets and Systems, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Quentin Brabant +2 more
openaire +3 more sources
Quasi-polynomiality of monotone orbifold Hurwitz numbers and Grothendieck's dessins d'enfants [PDF]
, 2019 We prove quasi-polynomiality for monotone and strictly monotone orbifold Hurwitz numbers. The second enumerative problem is also known as enumeration of a special kind of Grothendieck's dessins d'enfants or $r$-hypermaps.
R.Kramer +6 more
core +1 more source
Quantum algorithms for the Jones polynomial [PDF]
SPIE Proceedings, 2010 This paper gives a generalization of the AJL algorithm and unitary braid group representation for quantum computation of the Jones polynomial to continuous ranges of values on the unit circle of the Jones parameter. We show that our 3-strand algorithm for the Jones polynomial is a special case of this generalization of the AJL algorithm.
Kauffman, Louis H. +1 more
openaire +2 more sources