Related papers: Counting monochromatic solutions to diagonal Dioph…
Counting problems, determining the number of possible states of a large system under certain constraints, play an important role in many areas of science. They naturally arise for complex disordered systems in physics and chemistry, in…
We solve the Diophantine equation $Y^2=X^3+k$ for all nonzero integers $k$ with $|k| \leq 10^7$. Our approach uses a classical connection between these equations and cubic Thue equations. The latter can be treated algorithmically via lower…
In this paper, we develop a sliding method for the fractional Laplacian. We first obtain the key ingredients needed in the sliding method either in a bounded domain or in the whole space, such as narrow region principles and maximum…
We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…
We obtain asymptotic upper bounds for the number of natural solutions of the following diagonal Diophantine equations in a hypercube with side - $N$ in the paper: $x_1 = x_2^k+...+x_s^k$, $x_1^k = x_2^k+...+x_s^k$, $x_1 = \sum_{j=2}^s…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…
We propose and analyze a discontinuous least squares finite element method for solving the indefinite time-harmonic Maxwell equations. The scheme is based on the $L^2$ norm least squares functional with the weak imposition of the continuity…
A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations $E$ there is a threshold value $R_k(E)$ (the Rado number of $E$) such that for any $k$-coloring of the integers in the interval $[1,n]$, with $n \ge…
In this paper, we explore algebraic approaches to $d$-improper and $t$-clustered colourings, where the colouring constraints are relaxed to allow some monochromatic edges. Bilu [J. Comb. Theory Ser. B, 96(4):608-613, 2006] proved a…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
Numerical homogenization methods aim at providing appropriate coarse-scale approximations of solutions to (elliptic) partial differential equations that involve highly oscillatory coefficients. The localized orthogonal decomposition (LOD)…
In this work we introduce and analyze a new multiscale method for strongly nonlinear monotone equations in the spirit of the Localized Orthogonal Decomposition. A problem-adapted multiscale space is constructed by solving linear local…
A non-linear Black-Scholes-type equation is studied within counterparty risk models. The classical hypothesis on the uniform Lipschitz-continuity of the non-linear reaction function allows for an equivalent transformation of the semi-linear…
In this paper we study the positive solutions of sub linear elliptic equations with a Hardy potential which is singular at the boundary. By means of ODE techniques a fairly complete picture of the class of radial solutions is given. Local…
In this paper, we propose a procedure for constructing an infinite number of families of solutions of given linear differential equations with partial derivatives with constant coefficients. We use monogenic functions that are defined on…
This study introduces a recursive method for computing asymptotic solutions of the Laplace equation in corner domains with the homogeneous Dirichlet boundary condition on one side and the Robin boundary condition with a power-law…
Let $\mathfrak{p}=(\mathfrak{p}_1,...,\mathfrak{p}_r)$ be a system of $r$ polynomials with integer coefficients of degree $d$ in $n$ variables $\mathbf{x}=(x_1,...,x_n)$. For a given $r$-tuple of integers, say $\mathbf{s}$, a general local…
In this paper, we present a numerical method for rigorously finding the monodromy of linear differential equations. Beginning at a base point where certain particular solutions are explicitly given by series expansions, we first compute the…
In this extended abstract we deal with the relations between the numerical/diophantine approximation and the symbolic/algebraic geometry approachs to solving of multivariate diophentine polynomial systems, obtaining several consecuences…
In this paper we obtain quite general and definitive forms for Hardy-Littlewood type inequalities. Moreover, when restricted to the original particular cases, our approach provides much simpler and straightforward proofs and we are able to…