相关论文: A note on lower bounds for arithmetic regularity p…

In this short note, we establish a sharp Morrey regularity theory for an even order elliptic system of Rivi\`ere type: \begin{equation*} \Delta^{m}u=\sum_{l=0}^{m-1}\Delta^{l}\left\langle V_{l},du\right\rangle…

We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…

Szemeredi's regularity lemma is one instance in a family of regularity lemmas, replacing the definition of density of a graph by a more general coefficient. Recently, Fan Chung proved another instance, a regularity lemma for clustering…

Recently, Brandt et al. [STOC'16] proved a lower bound for the distributed Lov\'asz Local Lemma, which has been conjectured to be tight for sufficiently relaxed LLL criteria by Chang and Pettie [FOCS'17]. At the heart of their result lies a…

We revisit the partial $\mathrm{C}^{1,\alpha}$ regularity theory for minimizers of non-parametric integrals with emphasis on sharp dependence of the H\"older exponent $\alpha$ on structural assumptions for general zero-order terms. A…

Given a graph, a barrier is a set of vertices determined by the Berge formula---the min-max theorem characterizing the size of maximum matchings. The notion of barriers plays important roles in numerous contexts of matching theory, since…

The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…

$f,g_1,...,g_m$ be elements of the polynomial ring $\mathbb{R}[x_1,...,x_n]$. The paper deals with the general problem of computing a lower bound for $f$ on the subset of $\mathbb{R}^n$ defined by the inequalities $g_i\ge 0$, $i=1,...,m$.…

We give a lower bound on the growth of a subshift based on a simple condition on the set of forbidden patterns defining that subshift. Aubrun et Al. showed a similar result based on the Lov\'asz Local Lemma for subshift over any countable…

We prove partial regularity for minimizers of vectorial integrals of the Calculus of Variations, with general growth condition, imposing quasiconvexity assumptions only in an asymptotic sense.

It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…

It is shown--within a mathematical framework based on the suitably defined scale of sparseness of the super-level sets of the positive and negative parts of the vorticity components, and in the context of a blow-up-type argument--that the…

We study the regularity of solutions of elliptic fractional systems of order 2s, $s \in (0, 1)$, where the right hand side f depends on a nonlocal gradient and has the same scaling properties as the nonlocal operator. Under some structural…

We study Rado functionals and the maximal condition (first introduced by J. M. Barret et al.) in terms of the partition regularity of mixed systems of linear equations and inequalities. By strengthening the maximal Rado condition, we…

Given a filter $\Delta$ in the poset of compositions of $n$, we form the filter $\Pi^{*}_{\Delta}$ in the partition lattice. We determine all the reduced homology groups of the order complex of $\Pi^{*}_{\Delta}$ as ${\mathfrak…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…

Size-Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erd\H{o}s, Faudree, Rousseau and Schelp in 1978. Research has mainly focused on the size-Ramsey numbers of $n$-vertex graphs…

We show existence of solutions to the least gradient problem on the plane for boundary data in $BV(\partial\Omega)$. We also provide an example of a function $f \in L^1(\partial\Omega) \backslash (C(\partial\Omega) \cup…

A common theme in many extremal problems in graph theory is the relation between local and global properties of graphs. One of the most celebrated results of this type is the Ruzsa-Szemer\'edi triangle removal lemma, which states that if a…