Related papers: Cracking the problem with 33

Let $a,b>0$ be coprime integers. Assuming a conjecture on Hecke eigenvalues along binary cubic forms, we prove an asymptotic formula for the number of primes of the form $ax^2+by^3$ with $x \leq X^{1/2}$ and $y \leq X^{1/3}$. The proof…

By using truncation technique, minimization method and Morse theory, we obtain three nontrivial solutions for a class of semilinear elliptic equations.

Let k be an algebraically closed field of characteristic 0, let K/k be a transcendental extension of arbitrary transcendence degree and let G be a multiplicative subgroup of (K^*)^n such that (k^*)^n is contained in G, and G/(k^*)^n has…

We deal with the existence of infinitely many solutions for a class of elliptic problems with non-symmetric nonlinearities. Our result, which is motivated by a well known conjecture formulated by A. Bahri and P.L. Lions, suggests a new…

We obtain uncountably many solutions of nonlinear Helmholtz and curl-curl equations on the entire space using a fixed point approach. As an auxiliary tool a Limiting Absorption Principle for the curl-curl operator is proved.

How many points can be placed in an $n\times n$ grid so that every (affine) line contains at most $k$ points? We prove that for $n \ge k \ge 10^{37}$ the maximum number of points is exactly $kn$. Our proof builds on the recent work of…

We resolve three long-standing open problems, namely the (algorithmic) decidability of network coding, the decidability of conditional information inequalities, and the decidability of conditional independence implication among random…

We provide an algorithm that verifies the optimal colored Tverberg problem for $10$ points in the plane: Every $10$ points in the plane in color classes of size at most $3$ can be partitioned in $4$ rainbow pieces such that their convex…

The purpose of this article is to make a graph representation of the Diophantine equation $X^3+Y^3+X^3=K$ using the theory of "imaginary cities" for its construction and to determine the modular combinations on its edges with the De Bruijn…

Detecting if a graph contains a $k$-Clique is one of the most fundamental problems in computer science. The asymptotically fastest algorithm runs in time $O(n^{\omega k/3})$, where $\omega$ is the exponent of Boolean matrix multiplication.…

We prove the existence of infinitely many solutions to an elliptic problem by borrowing the techniques from algebraic topology. The solution(s) thus obtained will also be proved to be bounded.

Consider a bin containing $n$ balls colored with two colors. In a $k$-query, $k$ balls are selected by a questioner and the oracle's reply is related (depending on the computation model being considered) to the distribution of colors of the…

Let $p$ be a prime greater than $3$ and let $a$ be a rational p-adic integer. In this paper we try to determine $\sum_{k=1}^{[p/3]}\binom{3k}ka^k\pmod p$, and real the connection between cubic congruences and the sum…

String matching is the problem of deciding whether a given $n$-bit string contains a given $k$-bit pattern. We study the complexity of this problem in three settings. Communication complexity. For small $k$, we provide near-optimal upper…

We classify triangles that can be tiled only into a square number of congruent triangles, settling Erd\H{o}s Problem 633.

Let $s(n)$ be the side length of the smallest square into which $n$ non-overlapping unit squares can be packed. In 2010, the author showed that $s(13)=4$ and $s(46)=7$. Together with the result $s(6)=3$ by Keaney and Shiu, these results…

Denote by $T_k$ the generalised triangle, a $k$-uniform hypergraph on vertex set $\{1,2,\dots,2k-1\}$ with three edges $\{1,\dots,k-1,k\}$,$\{1,\dots,k-1,k+1\}$ and $\{k,k+1,\dots,2k-1\}$. Recently, Bowtell, Kathapurkar, Morrison and…

We present a, hopefully, elementary mathematical treatment of the computational aspects of congruent numbers, such that an amateur could understand the problem and perform their own calculations.

We construct a two-parameter family of explicit solutions to the cubic wave equation on $\mathbb{R}^{1+3}$. Depending on the value of the parameters, these solutions either scatter to linear, blow-up in finite time, or exhibit a new type of…

We introduce a new variant of the $k$-deck problem, which in its traditional formulation asks for determining the smallest $k$ that allows one to reconstruct any binary sequence of length $n$ from the multiset of its $k$-length…