Results 141 to 150 of about 446 (186)
Closure of orbits of the pure mapping class group in the character variety. [PDF]
Golsefidy AS, Tamam N.
europepmc +1 more source
Chaos in Stochastic 2d Galerkin-Navier-Stokes. [PDF]
Bedrossian J, Punshon-Smith S.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Vietnam Journal of Mathematics, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Combinatorial Diophantine equations
Publicationes Mathematicae Debrecen, 2000For a positive integer \(k\) let \(P_k(x)=x(x+1)\ldots (x+k-1)\) and \(S_k(x)=1^k+2^k+\ldots +x^k\). In the paper the following Diophantine equations are solved (or resolved): \(P_6(x)=P_4(y)\), \(P_6(x)={y\choose 2}\), \(P_6(x)={y\choose 4}\), \({x\choose 3}=P_2(y)\), \({x\choose 3}=P_4(y)\), \({x\choose 6}=P_2(y)\), \({x\choose 6}=P_4(y)\), \({x ...
Hajdu, L., Pintér, Á.
openaire +2 more sources
Mathematical Notes, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A class of Diophantine equations
Publicationes Mathematicae Debrecen, 1992A method is given for the resolution of diophantine equations of type \(F(2^ a\cdot 3^ b)=\pm 2^ c\cdot 3^ d\), where \(F(x)\in\mathbb{Z}[x]\) has at least two distinct roots. The method is based on lower bounds for linear forms in logarithms of algebraic numbers and the LLL-lattice basis reduction algorithm.
openaire +2 more sources
Aggregating diophantine equations
Zeitschrift für Operations Research, 1972Mathews [1897] has given a theorem for aggregating two diophantine equations with positive integer coefficients into a single equation that has the same solution set as its parents over the nonnegative integers. Building on this result,Elmaghraby andWig [1970] show how to shrink the inequality constraints of a bounded variable integer program to a ...
Fred W. Glover, Robert E. D. Woolsey
openaire +2 more sources

