Results 71 to 80 of about 146,061 (197)

IS THE JONES POLYNOMIAL OF A KNOT REALLY A POLYNOMIAL? [PDF]

Journal of Knot Theory and Its Ramifications, 2006
The Jones polynomial of a knot in 3-space is a Laurent polynomial in q, with integer coefficients. Many people have pondered why this is so, and what a proper generalization of the Jones polynomial for knots in other closed 3-manifolds is. Our paper centers around this question.
Garoufalidis, Stavros, Lê, Thang Tq
openaire   +3 more sources

Asymptotic behavior and zero distribution of polynomials orthogonal with respect to Bessel functions [PDF]

, 2015
We consider polynomials P_n orthogonal with respect to the weight J_? on [0,?), where J_? is the Bessel function of order ?. Asheim and Huybrechs considered these polynomials in connection with complex Gaussian quadrature for oscillatory integrals.
Deaño Cabrera, Alfredo, Kuijlaars, Arno, Kuijlaars, Arno B. J., Román, Pablo Manuel, Deaño, Alfredo, Román, Pablo   +5 more
core   +1 more source

A Multiple User Cryptography Approach Using a One-Time User Key Model and a (1, n) Threshold Polynomial Secret Sharing

Cryptography
Classical approaches to cryptography exhibit several limitations when applied to scenarios involving more than two users. The One-Time User Key (OTUK) meta-cryptographic model addresses these limitations by enabling multi-user encryption that is flexible,
Alessandro Caniglia, Felice Franchini, Stefano Galantucci, Giuseppe Pirlo, Gianfranco Semeraro   +4 more
doaj   +1 more source

Research on the method of fast inverse realisation of Vandermonde matrix based on FPGA

The Journal of Engineering, 2019
With the rapid development of science and technology, the operation and calculation in synthetic aperture radar (SAR) imaging systems require high throughput, and the system has high requirement for real-time performance.
Lei Chen, Liang Chen, BingY Li
doaj   +1 more source

BUILDING A POLYNOMIAL FUNCTION FROM FIXED POINTS GIVEN PREVIOUSLY

Selecciones Matemáticas, 2015
In this paper we show the construction of a polynomial function of degree n: f(x) given previously a set of n points , which will be fixed points of the function. This study addresses the inverse problem in polynomial case; in the classical sense because
Franco Rubio López, Orlando Hernandez Bracamonte   +1 more
doaj   +1 more source

The colored Jones polynomial and the A-polynomial of Knots

Advances in Mathematics, 2006
We study relationships between the colored Jones polynomial and the A-polynomial of a knot. We establish for a large class of 2-bridge knots the AJ conjecture (of Garoufalidis) that relates the colored Jones polynomial and the A-polynomial. Along the way we also calculate the Kauffman bracket skein module of all 2-bridge knots.
openaire   +2 more sources

Super-A-polynomial

String-Math 2012, 2013
We review a construction of a new class of algebraic curves, called super-A-polynomials, and their quantum generalizations. The super-A-polynomial is a two-parameter deformation of the A-polynomial known from knot theory or Chern-Simons theory with SL(2,C) gauge group. The two parameters of the super-A-polynomial encode, respectively, the t-deformation
Fuji, Hiroyuki, Sułkowski, Piotr
openaire   +4 more sources

On Eisenstein polynomials and zeta polynomials II [PDF]

International Journal of Number Theory, 2019
Eisenstein polynomials, which were defined by the second author, are analogues to the concept of an Eisenstein series. The second author conjectured that there exist some analogous properties between Eisenstein series and Eisenstein polynomials. In the previous paper, the first author provided new analogous properties of Eisenstein polynomials and ...
Miezaki, Tsuyoshi, Oura, Manabu
openaire   +3 more sources

Polynomials—Unifying or Fragmenting High School Mathematics?

Education Sciences
This paper presents research on the origin, scope, evolution, and rationale of knowledge about polynomials in high school mathematics. Within the framework of the Anthropological Theory of the Didactic, Croatian high school curricula and textbooks were ...
Jelena Pleština, Željka Milin Šipuš, Matija Bašić   +2 more
doaj   +1 more source

Polynomially Bounded Sequences and Polynomial Sequences [PDF]

Formalized Mathematics, 2015
Abstract In this article, we formalize polynomially bounded sequences that plays an important role in computational complexity theory. Class P is a fundamental computational complexity class that contains all polynomial-time decision problems [11], [12].
Hiroyuki Okazaki, Yuichi Futa
openaire   +2 more sources