Related papers: A note on lower bounds for arithmetic regularity p…

In the last decades, a lot of progress has been made on the subject of maximal regularity. The property of maximal $L^p$ regularity is an a priori estimate and reads as follows: For A the negative generator of an analytic semigroup on a…

In this article we investigate the higher regularity properties of the regular free boundary in the fractional thin obstacle problem. Relying on a Hodograph-Legendre transform, we show that for smooth or analytic obstacles the regular free…

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

We develop an optimal regularity theory for parabolic partial differential equations in weighted mixed norm Sobolev-Zygmund spaces. The results extend the classical Schauder estimates to coefficients that are merely measurable in time and…

Green and Tao's arithmetic regularity lemma and counting lemma together apply to systems of linear forms which satisfy a particular algebraic criterion known as the `flag condition'. We give an arithmetic regularity lemma and counting lemma…

In this short note, we prove several infinite family of congruences for some restricted partitions introduced by Pushpa and Vasuki (2022) (thereby, also proving a conjecture of Dasappa et. al. (2023)). We also prove some isolated…

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 show that once $\theta>17/30$, every sufficiently long interval $[x,x+x^\theta]$ contains many $k$-term arithmetic progressions of primes, uniformly in the starting point $x$. More precisely, for each fixed $k\ge3$ and $\theta>17/30$,…

Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…

A set partition $\sigma$ of $[n]=\{1,\cdots ,n\}$ contains another set partition $\omega$ if a standardized restriction of $\sigma$ to a subset $S\subseteq[n]$ is equivalent to $\omega$. Otherwise, $\sigma$ avoids $\omega$. Sagan and Goyt…

Let $\mathrm{rex}(n, F)$ denote the maximum number of edges in an $n$-vertex graph that is regular and does not contain $F$ as a subgraph. We give lower bounds on $\mathrm{rex}(n, F)$, that are best possible up to a constant factor, when…

We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…

We consider the large-scale regularity of solutions to second-order linear elliptic equations with random coefficient fields. In contrast to previous works on regularity theory for random elliptic operators, our interest is in the…

This paper is a continuation of the recent work of Guo-Xiang-Zheng \cite{Guo-Xiang-Zheng-2021-CV}. We deduce sharp Morrey regularity theory for weak solutions to the fourth order nonhomogeneous Lamm-Rivi\`ere equation \begin{equation*}…

We study a rather broad class of optimal partition problems with respect to monotone and coercive functional costs that involve the Dirichlet eigenvalues of the partitions. We show a sharp regularity result for the entire set of minimizers…

We study the growth of the local $L^2$-norms of the unitary Eisenstein series for reductive groups over number fields, in terms of their parameters. We derive a \emph{poly-logarithmic} bound on an average, for a large class of reductive…

Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…