Related papers: Using the Incompressibility Method to obtain Local…
In this note we establish a Ramsey-type result for certain subsets of the $n$-dimensional cube. This can then be applied to obtain reasonable bounds on various related structures, such as (partial) Hales-Jewett lines for alphabets of sized…
Different techniques have been used to prove several transference theorems of the form "nontrivial algorithms for a circuit class C yield circuit lower bounds against C". In this survey we revisit many of these results. We discuss how…
This article develops nonparametric inference procedures for estimation and testing problems for means on manifolds. A central limit theorem for Frechet sample means is derived leading to an asymptotic distribution theory of intrinsic…
This paper is concerned with the incompressible limit problem for strong solutions of compressible two-phase flow models under periodic boundary conditions, where the Navier-Stokes equations are nonlinearly coupled with either Cahn-Hilliard…
We study the well-posedness of the compressible boundary layer equations with data being analytic in the tangential variable of the boundary. The compressible boundary layer equations, a nonlinear coupled system of degenerate parabolic…
We develop a framework for the rigorous analysis of focused stochastic local search algorithms. These are algorithms that search a state space by repeatedly selecting some constraint that is violated in the current state and moving to a…
In this paper we solve two problems of Esperet, Kang and Thomasse as well as Li concerning (i) induced bipartite subgraphs in triangle-free graphs and (ii) van der Waerden numbers. Each time random greedy algorithms allow us to go beyond…
This paper deals with the approximation of the weak solutions of the incompressible Navier Stokes Fourier system. In particular it extends the artificial compressibility method for the Leray weak solutions of the Navier Stokes equation,…
Given a dataset we quantify how many patterns must always exist in the dataset. Formally this is done through the lens of Ramsey theory of graphs, and a quantitative bound known as Goodman's theorem. Combining statistical tools with Ramsey…
The knowledge of a series expansion of the equation of state provides a deep insight into the physical nature of a quantum system. Starting from a generic ``perturbative'' equation of state of a homogeneous ultracold gas we make predictions…
Topic modeling is traditionally applied to word counts without accounting for the context in which words appear. Recent advancements in large language models (LLMs) offer contextualized word embeddings, which capture deeper meaning and…
We first show local-in-time well-posedness of the compressible Navier-Stokes equations, assuming striated regularity while no other smoothness or smallness conditions on the initial density. With these local-in-time solutions served as…
It is a classical problem in fluid dynamics about the stability and instability of different hydrodynamic patterns in various physical settings, in particular in the high Reynolds number limit of laminar flow with boundary layer. However,…
Large language models (LLMs) with billions of parameters excel at predicting the next token in a sequence. Recent work computes non-vacuous compression-based generalization bounds for LLMs, but these bounds are vacuous for large models at…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
This paper studies a singular limit problem for a reduced model for compressible non-resistive MHD which was first introduced in \cite{Li-Sun_JDE, Li-Sun} in a two-dimensional setting. This system can also be related to a certain class of…
We present a technique that allows to obtain certain results in the compressible fluid theory: in particular, it is a nonexistence result for the highly decreasing at infinity solutions to the Navier-Stokes equations, the construction of…
The Robbins-Monro algorithm is a recursive, simulation-based stochastic procedure to approximate the zeros of a function that can be written as an expectation. It is known that under some technical assumptions, Gaussian limit distributions…
Asymptotic separation index is a parameter that measures how easily a Borel graph can be approximated by its subgraphs with finite components. In contrast to the more classical notion of hyperfiniteness, asymptotic separation index is…
The incompressibility method is an elementary yet powerful proof technique. It has been used successfully in many areas. To further demonstrate its power and elegance we exhibit new simple proofs using the incompressibility method.