Results 1 to 10 of about 248,977 (280)
Algebraic tangles and Jones polynomial [PDF]
Heliyon, 2020 We develop a method for computing Kauffman bracket and Jones polynomial for algebraic tangles and their numerator closures. We also introduce the notion of connectivity type of pretzel tangles and give a way of computing it. Several examples are given.
Khaled Bataineh, Nabil Al Asmer
doaj +3 more sources
Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one ...
Christian Herrmann +2 more
doaj +4 more sources
Necessary and sufficient conditions for the existence of invariant algebraic curves
Electronic Journal of Qualitative Theory of Differential Equations, 2021 We present a set of conditions enabling a polynomial system of ordinary differential equations in the plane to have invariant algebraic curves. These conditions are necessary and sufficient. Our main tools include factorizations over the field of Puiseux
Maria Demina
doaj +1 more source
Numerical solution to Volterra integro-differential equations using collocation approximation [PDF]
Mathematics and Computational Sciences, 2023 This paper considers the collocation method for the numerical solution of the Volterra integro- differential equation using polynomial basis functions.
Ganiyu Ajileye, Sikiru Amoo
doaj +1 more source
Proposing a New Theorem to Determine If an Algebraic Polynomial Is Nonnegative in an Interval
Mathematics, 2021 We face the problem to determine whether an algebraic polynomial is nonnegative in an interval the Yau Number Theoretic Conjecture and Yau Geometric Conjecture is proved.
Ke-Pao Lin +3 more
doaj +1 more source
Basic Polynomial Algebra Subprograms [PDF]
ACM Communications in Computer Algebra, 2015 The Basic Polynomial Algebra Subprograms (BPAS) provides arithmetic operations (multiplication, division, root isolation, etc.) for univariate and multivariate polynomials over prime fields or with integer coefficients. The code is mainly written in CilkPlus [11] targeting multicore processors.
Chen, Changbo +5 more
openaire +3 more sources
An Algebraic Approach to Identifiability
Algorithms, 2021 This paper addresses the problem of identifiability of nonlinear polynomial state-space systems. Such systems have already been studied via the input-output equations, a description that, in general, requires differential algebra.
Daniel Gerbet, Klaus Röbenack
doaj +1 more source
Construction of Complex Lattice Codes via Cyclotomic Fields
Trends in Computational and Applied Mathematics, 2022 Through algebraic number theory and Construction $A$ we extend an algebraic procedure which generates complex lattice codes from the polynomial ring \mathbb{F}_{2}[x]/(x^{n}-1), where \mathbb{F}_{2}=\{0,1\}, by using ideals from the generalized ...
E. D. Carvalho +3 more
doaj +1 more source
Algebraic and differential properties of polynomial Fourier transformation
Математичні Студії, 2020 Methods of integral transformations of (generalized) functions are widely used in the solution of initial and boundary value problems for partial differential equations.
S.V. Sharyn
doaj +1 more source
Algebraic Solution of Tropical Polynomial Optimization Problems
Mathematics, 2021 We consider constrained optimization problems defined in the tropical algebra setting on a linearly ordered, algebraically complete (radicable) idempotent semifield (a semiring with idempotent addition and invertible multiplication).
Nikolai Krivulin
doaj +1 more source