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

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

We characterize mixed-level orthogonal arrays in terms of algebraic designs in a special multigraph. We prove a mixed-level analog of the Bierbrauer-Friedman (BF) bound for pure-level orthogonal arrays and show that arrays attaining it are…

We obtain regularity conditions of a new type of problems of the calculus of variations with second-order derivatives. As a corollary, we get non-occurrence of the Lavrentiev phenomenon. Our main result asserts that autonomous integral…

A set partition $\sigma$ of $[n]=\{1,\dots,n\}$ contains another set partition $\pi$ if restricting $\sigma$ to some $S\subseteq[n]$ and then standardizing the result gives $\pi$. Otherwise we say $\sigma$ avoids $\pi$. For all sets of…

In this paper we study partitions whose successive ranks belong to a given set. We enumerate such partitions while keeping track of the number of parts, the largest part, the side of the Durfee square, and the height of the Durfee…

We study estimates of the Green's function in $\mathbb{R}^d$ with $d \ge 2$, for the linear second order elliptic equation in divergence form with variable uniformly elliptic coefficients. In the case $d \ge 3$, we obtain estimates on the…

We establish an $\varepsilon$-regularity result for the derivative of a map of bounded variation that minimizes a strongly quasiconvex variational integral of linear growth, and, as a consequence, the partial regularity of such BV…

Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the…

Let $n > m\ge 2$ be integers and let $\mathcal{A}=\{A_1,\dots,A_m\}$ be a partition of $[n]=\{1,\dots,n\}$. For $X \subseteq [n]$, its $\mathcal{A}$-boundary region $\mathcal{A}(X)$ is defined to be the union of those blocks $A_i$ of…

By building on a method introduced by Kashiwara and refined by Lichtin, we give upper bounds for the roots of certain b-functions associated to a regular function f in terms of a log resolution of singularities. As applications, we recover…

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…

In previous work, the authors established various bounds for the dimensions of degree $n$ cohomology and $\Ext$-groups, for irreducible modules of semisimple algebraic groups $G$ (in positive characteristic $p$) and (Lusztig) quantum groups…

In this paper, we propose new lower and upper bounds on the linear extension complexity of regular $n$-gons. Our bounds are based on the equivalence between the computation of (i) an extended formulation of size $r$ of a polytope $P$, and…

We give dimension-free regularity conditions for a class of possibly degenerate sub-elliptic equations in the Heisenberg group exhibiting super-quadratic growth in the horizontal gradient; this solves an issue raised by Manfredi & Mingione…

Small regularizers can preserve linear programming solutions exactly. This paper provides the first average-case analysis of exact regularization: with a standard Gaussian cost vector and fixed constraint set, bounds are established for the…

Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

The Lov\'{a}sz theta number is a semidefinite programming bound on the clique number of (the complement of) a given graph. Given a vertex-transitive graph, every vertex belongs to a maximal clique, and so one can instead apply this…

A second-order regularity theory is developed for solutions to a class of quasilinear elliptic equations in divergence form, including the $p$-Laplace equation, with merely square-integrable right-hand side. Our results amount to the…

We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…