Related papers: Plane curves in boxes and equal sums of two powers
Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…
In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…
The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…
In this note, we shall give an improved lower bound for the argument of a power of a given algebraic number which has absolute value one but is not a root of unity.
Let $Y=\{f(x,y)=0\}$ be the germ of an irreducible plane curve. We present an algorithm to obtain polynomials, whose valuations coincide with the semigroup generators of $Y$. These polynomials are obtained sequentially, adding terms to the…
This paper deals with a class of singularly perturbed nonlinear elliptic problems $(P_\e)$ with subcritical nonlinearity. The coefficient of the linear part is assumed to concentrate in a point of the domain, as $\e\to 0$, and the domain is…
Our aim is to reprove the basic results of the theory of branches of plane algebraic curves over algebraically closed fields of arbitrary characteristic. We do not use the Hamburger-Noether expansions. Our basic tool is the logarithmic…
We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…
In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…
We prove essentially sharp bounds for the $L^p$ restriction of weighted Gauss sums to monomial curves. Getting the $L^2$ upper bound combines the $TT^*$ method for matrices with the first and second derivative test for exponential sums. The…
Let R be a commutative ring with 1. For every homogeneous polynomial f(X_0,X_1,X_2) in R[X_0,X_1,X_2] of degree d <= 25, we find a explicit linear Pfaffian R-representation of f. We describe an empirical method that leads us to find such…
An accurate approximation of solutions to elliptic problems in infinite domains is challenging from a computational point of view. This is due to the need to replace the infinite domain with a sufficiently large and bounded computational…
In this paper, we develop a new method for finding all perfect powers which can be expressed as the sum of two rational S-units, where S is a finite set of primes. Our approach is based upon the modularity of Galois representations and, for…
In this paper, we study the existence and regularity of solutions for a class of nonlinear singular elliptic equations involving unbounded coefficients and a singular right-hand side. Specifically, we are interested to problem whose…
We construct infinite classes of almost bent and almost perfect nonlinear polynomials, which are affinely inequivalent to any sum of a power function and an affine function.
We ask whether every polynomial function that is non-negative on a real algebraic curve can be expressed as a sum of squares in the coordinate ring. Scheiderer has classified all irreducible curves for which this is the case. For reducible…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
We prove that bounded solutions to an overdetermined fully nonlinear free boundary problem in the plane are one dimensional. Our proof relies on maximum principle techniques and convexity arguments.
The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…
The present work has two objectives. First, we prove that a weight\-ed superlinear elliptic problem has infinitely many nonradial solutions in the unit ball. Second, we obtain the same conclusion in annuli for a more general nonlinearity…