Related papers: Arithmetic progressions in binary quadratic forms …

We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…

We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…

An extended formulation of a polytope is a linear description of this polytope using extra variables besides the variables in which the polytope is defined. The interest of extended formulations is due to the fact that many interesting…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

We present an alternative account of the problem of classifying and finding normal forms for arbitrary bilinear forms. Beginning from basic results developed by Riehm, our solution to this problem hinges on the classification of…

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

This is a survey article on the Hardy-Littlewood conjecture about primes in quadratic progressions. We recount the history and quote some results approximating this hitherto unresolved conjecture.

In this paper, we study the symmetric rank of products of linear forms and an irreducible quadratic form. The main result presents a new, non-trivial lower bound for the rank, and the arguments rely on the apolarity lemma. In the special…

We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.

We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…

We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…

We obtain series expansion formulas for the Hadamard fractional integral and fractional derivative of a smooth function. When considering finite sums only, an upper bound for the error is given. Numerical simulations show the efficiency of…

We derive a simple proof, based on information theoretic inequalities, of an upper bound on the largest rates of $q$-ary $\overline{2}$-separable codes that improves recent results of Wang for any $q\geq 13$. For the case $q=2$, we recover…

The interval numbers is the set of compact intervals of $\mathbb{R}$ with addition and multiplication operation, which are very useful for solving calculations where there are intervals of error or uncertainty, however, it lacks an…

We improve the quantitative estimate for Roth's theorem on three-term arithmetic progressions, showing that if $A\subset\{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert\ll N(\log\log N)^4/\log…

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

For two-dimensional Euler equation on the torus, we prove that the uniform norm of the gradient can grow superlinearly for some infinitely smooth initial data. We also show the exponential growth of the gradient for the finite time.

The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…