相关论文: On a question of Mordell

The $3x+1$ problem, also called the Collatz conjecture, is a very interesting unsolved mathematical problem related to computer science. This paper generalized this problem by relaxing the constraints, i.e., generalizing this deterministic…

Erdos asked in 1962 about the value of f(n,k,l), the minimum number of k-cliques in a graph of order n and independence number less than l. The case (k,l)=(3,3) was solved by Lorden. Here we solve the problem (for all large n) when (k,l) is…

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

We prove that the equation $(x-3r)^3+(x-2r)^3 + (x-r)^3 + x^3 + (x+r)^3 + (x+2r)^3+(x+3r)^3= y^p$ only has solutions which satisfy $xy=0$ for $1\leq r\leq 10^6$ and $p\geq 5$ prime. This article complements the work on the equations…

Counting the solutions to Boolean formulae defines the problem #SAT, which is complete for the complexity class #P. We use the ZH-calculus, a universal and complete graphical language for linear maps which naturally encodes counting…

This note is concerned with the set of integral solutions of the equation $x^2+3y^2=12n+4$, where $n$ is a positive integer. We will describe a parametrization of this set using the 3-core partitions of n. In particular we construct a crank…

For $m=3,4,\ldots$, the polygonal numbers of order $m$ are given by $p_m(n)=(m-2)\binom n2+n\ (n=0,1,2,\ldots)$. For positive integers $a,b,c$ and $i,j,k\ge3$ with $\max\{i,j,k\}\ge5$, we call the triple $(ap_i,bp_j,cp_k)$ universal if for…

We find all solutions to the parametrized family of norm-form equations $x^3-(t^3-1)y^3+3(t^3-1)xy+(t^3-1)^2 = \pm 1$ studied by Amoroso, Masser and Zannier. Our proof relies upon an appeal to lower bounds for linear forms in logarithms and…

The set of forks is a class of quivers introduced by M. Warkentin, where every connected mutation-infinite quiver is mutation equivalent to infinitely many forks. Let $Q$ be a fork with $n$ vertices, and $\boldsymbol{w}$ be a…

Let $\mathbb{Z}_n$ be the ring of residue classes modulo $n$, and let $\mathbb{Z}_n^{\ast}$ be the group of its units. 90 years ago, Brauer obtained a formula for the number of representations of $c\in \mathbb{Z}_n$ as the sum of $k$ units.…

We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support a tridiagonal matrix representation of the wave operator. Doing so results in exactly solvable problems with a…

The poset cover problem seeks a minimum set of partial orders whose linear extensions cover a given set of linear orders. Recognizing its NP-completeness, we devised a non-trivial reduction to the Boolean satisfiability problem using a…

A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The…

Let K = Q(t1,..,tk) and a,b,c in K. We give a simple algorithm to find, if it exists, X,Y,Z in K, not all zero, for which aX^2 + bY^2 + cZ^2 = 0.

Z3-Noodler is a fork of Z3 that replaces its string theory solver with a custom solver implementing the recently introduced stabilization-based algorithm for solving word equations with regular constraints. An extensive experimental…

We show that every $3$-dimensional convex body can be covered by $14$ smaller homothetic copies. The previous result was $16$ copies established by Papadoperakis in 1999, while a conjecture by Hadwiger is $8$. We modify Papadoperakis's…

We consider the following problem: given three sets of real numbers, output a word-RAM data structure from which we can efficiently recover the sign of the sum of any triple of numbers, one in each set. This is similar to a previous work by…

We study entire bounded solutions to the equation $\Delta u - u + u^3 = 0$ in $\mathbb R^2$. Our approach is purely variational and is based on concentration arguments and symmetry considerations. This method allows us to construct in a…

In 2015, Abatzoglou, Silverberg, Sutherland, and Wong presented a framework for primality proving algorithms for special sequences of integers using an elliptic curve with complex multiplication. They applied their framework to obtain…