Related papers: Cutting lemma and Zarankiewicz's problem in distal…

We revisit one of Zilber's early results in model-theoretic algebra, viz. definability in Schur's lemma. This takes place in a broader context than the original version from the seventies. The present exposition contains results extracted…

For a general family of graphs on $\mathbb{Z}^n$, we translate the edge-isoperimetric problem into a continuous isoperimetric problem in $\mathbb{R}^n$. We then solve the continuous isoperimetric problem using the Brunn-Minkowski inequality…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

We consider Kazhdan-Lusztig cells of the symmetric group $S_n$ containing the longest element of a standard parabolic subgroup of $S_n$. Extending some of the ideas in [Beitr{\"a}ge zur Algebra und Geometrie, 59 (2018), no. 3, 523-547] and…

Many natural decision problems can be formulated as constraint satisfaction problems for reducts $\mathbb{A}$ of finitely bounded homogeneous structures. This class of problems is a large generalisation of the class of CSPs over finite…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

The Carath\'eodory's Extension Theorem is a powerful tool that allows us to generate a measure, over a sigma-algebra, from a pre-measure defined over an algebra of sets. However, although this result reduces our work to define a measure by…

This paper is concerned with a class of generalized slice Fueter-regular functions on arbitrary domains in O with local stem functions. Some classical theorems such as the maximum modulus principle will be generalized to our setting. Some…

We construct an example of an infinite planar embedded self-similar binary tree $\Sigma$ which is the essentially unique solution to the Steiner problem of finding the shortest connection of a given planar self-similar fractal set $C$ of…

We prove a lower bound on the first eigenvalue of the fractional Dirichlet-Laplacian of order $s$ on planar open sets, in terms of their inradius and topology. The result is optimal, in many respects. In particular, we recover a classical…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

We investigate a generalization of the {\L}o\'s-Tarski preservation theorem via the semantic notion of \emph{preservation under substructures modulo $k$-sized cores}. It was shown earlier that over arbitrary structures, this semantic notion…

A new formulation of field theory is presented, based on a pseudo-complex description. An extended group structure is introduced, implying a minimal scalar length, rendering the theory regularized a la Pauli-Villars. Cross sections are…

The Pila-Wilkie theorem states that if a set $X\subseteq \mathbb R^n$ is definable in an o-minimal structure $\mathcal R$ and contains `many' rational points, then it contains an infinite semialgebraic set. In this paper, we extend this…

The paper deals with Henselian valued field with analytic structure. Actually, we are focused on separated analytic structures, but the results remain valid for strictly convergent analytic ones as well. A classical example of the latter is…

Since 1989, the best known lower bound on static data structures was Siegel's classical cell sampling lower bound. Siegel showed an explicit problem with $n$ inputs and $m$ possible queries such that every data structure that answers…

The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…

We present some new sharp constructions for the Szemer\'{e}di-Trotter theorem. These constructions generalize previous work of Erd\H{o}s, Elekes, Sheffer and Silier, Guth and Silier, and the author. In the past, arguments showing the…

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms…