Results 21 to 30 of about 107 (79)

Feasibility of primality in bounded arithmetic

open access: yesForum of Mathematics, Sigma
We prove the correctness of the AKS algorithm [1] within the bounded arithmetic theory $T^{\text {count}}_2$ or, equivalently, the first-order consequences of the theory $\text {VTC}^0$ expanded by the smash function, which we denote by
Raheleh Jalali, Ondřej Ježil
doaj   +1 more source

Improvements on dimension growth results and effective Hilbert’s irreducibility theorem

open access: yesForum of Mathematics, Sigma
We sharpen and generalize the dimension growth bounds for the number of points of bounded height lying on an irreducible algebraic variety of degree d, over any global field.
Raf Cluckers   +4 more
doaj   +1 more source

Classification and irreducibility of a class of integer polynomials

open access: yesOpen Mathematics
We find all integer polynomials of degree dd that take the values ±1\pm 1 at exactly dd integer arguments, and determine the irreducibility of these polynomials by means of an elementary approach.
Chen Yizhi, Zhao Xiangui, Zhou Xuan
doaj   +1 more source

Is there a polynomial D(2X + 1)-quadruple?

open access: yesAnalele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
In this paper, we show that there does not exist a polynomial D(2X+ 1)-quadruple {a, b, c, d}, such that 0 < a < b < c < d and deg d = deg b.
Franušić Zrinka, Jurasić Ana
doaj   +1 more source

_09_kitayama.dvi

open access: yes, 2011
. We will give an explicit polynomial over Q with 3 parameters of degree 40 as a result of the inverse Galois problem. Its Galois group over Q (resp. Q( √ −3)) is isomorphic to P GSp 4 (3) (resp. P Sp 4 (3)) and it is a regular P Sp 4 (3)-polynomial over
Hidetaka Kitayama
core  

Sequences in overpartitions. [PDF]

open access: yesRamanujan J, 2023
Andrews GE, Uncu AK.
europepmc   +1 more source

Smoothness Parameter of Power of Euclidean Norm. [PDF]

open access: yesJ Optim Theory Appl, 2020
Rodomanov A, Nesterov Y.
europepmc   +1 more source

Home - About - Disclaimer - Privacy