相关论文: Szemer\'edi's regularity lemma revisited

The arithmetic regularity lemma for $\mathbb{F}_p^n$, proved by Green in 2005, states that given a subset $A\subseteq \mathbb{F}_p^n$, there exists a subspace $H\leq \mathbb{F}_p^n$ of bounded codimension such that $A$ is Fourier-uniform…

Chv\'atal, R\"odl, Szemer\'edi and Trotter proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an…

Our work builds on known results for k-uniform hypergraphs including the existence of limits, a Regularity Lemma and a Removal Lemma. Our main tool here is a theory of measures on ultraproduct spaces which establishes a correspondence…

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

In this paper we relate a fundamental parameter of a random graph, its degree sequence, to a simple model of nearly independent binomial random variables. This confirms a conjecture made in 1997. As a result, many interesting functions of…

We introduce a novel regularization approach for deep learning that incorporates and respects the underlying graphical structure of the neural network. Existing regularization methods often focus on dropping/penalizing weights in a global…

Regular variation is a continuous-parameter theory; we work in a general setting, containing the existing Karamata, Bojanic-Karamata/de Haan and Beurling theories as special cases. We give sequential versions of the main theorems, that is,…

Over the past several years, numerous authors have explored model theoretically motivated combinatorial conditions that ensure that a graph has an efficient regular decomposition in the sense of Szemer\'edi. In this paper we set out a…

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

Ioffe's criterion and various reformulations of it have become a~standard tool in proving theorems guaranteeing metric regularity of a (set-valued) mapping. First, we demonstrate that one should always use directly the so-called general…

Gowers norms have been studied extensively both in the direct sense, starting with a function and understanding the associated norm, and in the inverse sense, starting with the norm and deducing properties of the function. Instead of…

We establish a so-called counting lemma that allows embeddings of certain linear uniform hypergraphs into sparse pseudorandom hypergraphs, generalizing a result for graphs [Embedding graphs with bounded degree in sparse pseudorandom graphs,…

A regularized version of Mixture Models is proposed to learn a principal graph from a distribution of $D$-dimensional data points. In the particular case of manifold learning for ridge detection, we assume that the underlying manifold can…

We consider the two problems of predicting links in a dynamic graph sequence and predicting functions defined at each node of the graph. In many applications, the solution of one problem is useful for solving the other. Indeed, if these…

Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…

We completely characterize point--line configurations with $\Theta(n^{4/3})$ incidences when the point set is a section of the integer lattice. This can be seen as the main special case of the structural Szemer\'edi-Trotter problem. We also…

Formula retrieval is an important topic in Mathematical Information Retrieval. We propose SSEmb, a novel embedding framework capable of capturing both structural and semantic features of mathematical formulas. Structurally, we employ Graph…

We extend Stein's lemma for averages that explicitly contain the Gaussian random variable at a power. We present two proofs for this extension of Stein's lemma, with the first being a rigorous proof by mathematical induction. The…

We prove some novel multi-parameter point-line incidence estimates in vector spaces over finite fields. While these could be seen as special cases of higher-dimensional incidence results, they outperform their more general counterparts in…

We investigate the use of models from the theory of regularity structures as features in machine learning tasks. A model is a polynomial function of a space-time signal designed to well-approximate solutions to partial differential…