Related papers: Counting solutions to invariant equations in dense…

For a fixed finite solvable group $G$ and number field $K$, we prove an upper bound for the number of $G$-extensions $L/K$ with restricted local behavior (at infinitely many places) and ${\rm inv}(L/K)<X$ for a general invariant $"{\rm…

We introduce a family of maps generating continued fractions where the digit $1$ in the numerator is replaced cyclically by some given non-negative integers $(N_1,\ldots,N_m)$. We prove the convergence of the given algorithm, and study the…

We consider a translation and dilation invariant system consisting of k diagonal equations of degrees 1,2,...,k with integer coefficients in s variables, where s is sufficiently large in terms of k. We show via the Hardy-Littlewood circle…

In this work, first we prove that for any compact set $K\subset\mathbb{R}^{n}$ and any continuous function $\phi$ defined on $\partial K$, there exists a bounded weak solution in $C(\bar{\mathbb{R}^{n}\backslash K}) \cap…

We construct new families of two-ended $O(m)\times O(n)$-invariant solutions to the Allen- Cahn equation \Delta u+u-u3=0 in $\mathbb{R}^{N+1}$, with $N\ge 7$, whose zero level sets diverge logarithmically from the Lawson cone at infinity.…

We introduce some new classes of words and permutations characterized by the second difference condition $\pi(i-1) + \pi(i+1) - 2\pi(i) \leq k$, which we call the $k$-convexity condition. We demonstrate that for any sized alphabet and…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we obtain an inequality for the sequence $\Delta^{2}\log \ \sqrt[n-1]{\overline{p}(n-1)/(n-1)^{\alpha}}$ which states that \begin{equation*} \log…

We consider an elliptic equation with unbounded drift in an exterior domain, and obtain quantitative uniqueness estimates at infinity, i.e. the non-trivial solution of $-\triangle u+W\cdot\nabla u=0$ decays in the form of…

In recent literature concerning integer partitions one can find many results related to both the Bessenrodt-Ono type inequalities and log-concavity property. In this note we offer some general approach to this type of problems. More…

We will prove several expanders with exponent strictly greater than $2$. For any finite set $A \subset \mathbb R$, we prove the following six-variable expander results: \begin{align*} |(A-A)(A-A)(A-A)| &\gg…

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

We prove the global-in-time existence of weak solutions to the Navier-Stokes equations of compressible isentropic flow in three space dimensions with adiabatic exponent $\gamma\ge1$. Initial data and solutions are small in $L^2$ around a…

We prove the existence of solutions for a class of quasilinear problems involving variable exponents and with nonlinearity having critical growth. The main tool used is the variational method, more precisely, Ekeland's Variational Principle…

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

In this paper, we introduce a decomposition lemma that allows error terms to be expressed using fewer rank-one symmetric matrices than $\frac{n(n+1)}{2}$ within the convex integration scheme of constructing flexible $C^{1,\alpha}$ solutions…