Related papers: Extraction Theorems With Small Extraction Numbers
Restriction is a natural quasi-order on $d$-way tensors. We establish a remarkable aspect of this quasi-order in the case of tensors over a fixed finite field -- namely, that it is a well-quasi-order: it admits no infinite antichains and no…
These are classified by the direction of approximation (from above or below), the set family types (partition or covering) of simple functions, the coefficient signature (non-negative or signed), and cardinal number of terms of simple…
In this paper we develop a theory for correctness of concurrent objects under weak memory models. Central to our definitions is the concept of observations which determine when effects of operations become visible, and hence determine the…
We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional…
The aim of this paper is to establish some metrical coincidence and common fixed point theorems with an arbitrary relation under an implicit contractive condition which is general enough to cover a multitude of well known contraction…
A separated $d$-interval is defined as a disjoint union of $d$ convex sets from the real line $\mathbb R$. In this paper, we establish a series of Helly-type theorems for convexity spaces derived from separated $d$-intervals. Our results…
This paper explores object detection in the small data regime, where only a limited number of annotated bounding boxes are available due to data rarity and annotation expense. This is a common challenge today with machine learning being…
We prove a new, efficient version of the hypergraph container theorems that is suited for hypergraphs with large uniformities. The main novelty is a refined approach to constructing containers that employs simple ideas from high-dimensional…
We apply a method developed by one of the authors, see \cite{Arl1}, to localize the numerical range of \textit{quasi-sectorial} contractions semigroups. Our main theorem establishes a relation between the numerical range of quasi-sectorial…
We study truncated objects using elementary methods. Concretely, we use universes and the resulting natural number object to define internal truncation levels and prove they behave similar to standard truncated objects. Moreover, we take an…
In this paper, we give the explicit bounds for the data of objects involved in some basic theorems of Singularity theory: the Inverse, Implicit and Rank Theorems for Lipschitz mappings, Splitting Lemma and Morse Lemma, the density and…
We introduce and study relatively divisible and relatively flat objects in exact categories in the sense of Quillen. For every relative cotorsion pair $(\mathcal{A},\mathcal{B})$ in an exact category $\mathcal{C}$, $\mathcal{A}$ coincides…
We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…
The article summarizes some developments about a singular versions of the Sturm Comparison and Separation theorems where the coefficients or the interval of definition may be unbounded.
The theory of limits of discrete combinatorial objects has been thriving for the last decade or so. The syntactic, algebraic approach to the subject is popularly known as "flag algebras", while the semantic, geometric one is often…
We study geometric variations of the discriminating code problem. In the \emph{discrete version} of the problem, a finite set of points $P$ and a finite set of objects $S$ are given in $\mathbb{R}^d$. The objective is to choose a subset…
We assume that the points in volumes smaller than an elementary volume (which may have a Planck size) are indistinguishable in any physical experiment. This naturally leads to a picture of a discrete space with a finite number of degrees of…
We apply general methods to generate upper and lower bounds for the essential minimum of a specific family of height functions. In particular, the results shown in this article apply to the case of the Zhang-Zagier height. Furthermore, we…
This chapter deals with the notion of the resolvent of a self-adjoint operator. We pay special attention to the convergence of unbounded self-adjoint operators in several resolvent senses, and how they are related to the convergence of…
We demonstrate that certain Johnson-type bounds are asymptotically exact for a variety of classes of codes, namely, constant-composition codes, nonbinary constant-weight codes and multiply constant-weight codes. This was achieved via an…