Related papers: Arithmetic progressions in binary quadratic forms …

Consider the set of those binary words with no non-empty factors of the form $xxx^R$. Du, Mousavi, Schaeffer, and Shallit asked whether this set of words grows polynomially or exponentially with length. In this paper, we demonstrate the…

We obtain estimates for the number of integral solutions in large balls, of inequalities of the form $|Q(x, y)| < \epsilon$, where $Q$ is an indefinite binary quadratic form, in terms of the Hurwitz continued fraction expansions of the…

We show that the set defined by digit restrictions contains arbitrarily long arithmetic progressions if and only if its Assouad dimension is one. Moreover, we show that for any $0\le s\le 1$, there exists some set on $\mathbb{R}$ with…

Let $B$ be a set of natural numbers of size $n$. We prove that the length of the longest arithmetic progression contained in the product set $B.B = \{bb'| \, b, b' \in B\}$ cannot be greater than $O(n \log n)$ which matches the lower bound…

We analyze different ways of constructing binary extended formulations of mixed-integer problems with bounded integer variables and compare their relative strength with respect to split cuts. We show that among all binary extended…

We consider the size of the nodal set of the solution of the second order parabolic-type equation with Gevrey regular coefficients. We provide an upper bound as a function of time. The dependence agrees with a sharp upper bound when the…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…

In this article, we provide upper and lower bounds for the growth rate of irreducible meanders. The obtained upper bound implies that the proportion of irreducible meanders among all of the prime meanders of order $n$ approaches $0$ as $n$…

We introduce an effective algorithmic method for the computation of a lower bound for uniform expansion in one-dimensional dynamics. The approach employs interval arithmetic and thus provides a rigorous numerical result (computer-assisted…

In this paper, we describe the structure of finite groups whose element orders or proper (abelian) subgroup orders form an arithmetic progression of ratio $r\geq 2$. This extends the case $r=1$ studied in previous papers \cite{1,8,4}.

Approximating solutions of ordinary and partial differential equations constitutes a significant challenge. Based on functional expressions that inherently depend on neural networks, neural forms are specifically designed to precisely…

In the first paper of this series we established new upper bounds for multi-variable exponential sums associated with a quadratic form. The present study shows that if one adds a linear term in the exponent, the estimates can be further…

We show that there exists a bounded pattern of m consecutive primes for any m>0, that means a tuple H_m of m distinct non-negative integers h_i (i=1,2,...m) such that its translations contain arbitrarily long (finite) arithmetic…

We prove that the primes of the form $x^2+y^2+1$ contain arbitrarily long non-trivial arithmetic progressions.

This is the first of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…

Let d be a squarefree integer. Does there exist four squares in arithmetic progression over Q(sqrt{d})? We shall give a partial answer to this question, depending on the value of d. In the affirmative case, we construct explicit arithmetic…

We verify the Hardy-Littlewood conjecture on primes in quadratic progressions on average. The results in the present paper significantly improve those of a previous paper of the authors(arXiv:math.NT/0605563).

We show that if besides the primes some other sequences (involving the Liouville function and the primes) have a common distribution level exceeding 0.7231 then for any positive even integer $h$ there are arbitrarily long arithmetic…

Based on BONGs theory, we prove the norm principle for integral and relative integral spinor norms of quadratic forms over general dyadic local fields, respectively. By virtue of these results, we further establish the arithmetic version of…