Related papers: Closures and generating sets related to combinatio…
Induction is the process by which we obtain predictive laws or theories or models of the world. We consider the structural aspect of induction. We answer the question as to whether we can find a finite and minmalistic set of operations on…
Consider finitely many nets of multivariate c\`adl\`ag stochastic processes. We show that the vectors consisting of the respective minimizing points converge in distribution to a random closed set. This set is given as a cartesian product…
We take the first step toward a structure theory that includes both operations of a ring $\mathcal{R}$. More precisely, we prove a series of inverse results for the structure of sets $A\subseteq \mathbf{F}_p$ such that, under certain…
Gromov asked what a typical (finitely presented) group looks like, and he suggested a way to make the question precise in terms of limiting density. The typical finitely generated group is known to share some important properties with the…
The theory of recursive functions is related in a well-known way to the notion of *least fixed points*, by endowing a set of partial functions with an ordering in terms of their domain of definition. When terms in the pure lambda-calculus…
We show that an analogue of the Hilbert's Thirteenth Problem fails in the real subanalytic setting.Namely we prove that, for any integer $n$, the o-minimal structure generated by restricted analytic functions in $n$ variables is strictly…
Through careful analysis of types inspired by [AGTW21] we characterize a notion of definable compactness for definable topologies in general o-minimal structures, generalizing results from [PP07] about closed and bounded definable sets in…
We provide several perturbation theorems regarding closable operators on a real or complex Hilbert space. In particular we extend some classical results due to Hess--Kato, Kato--Rellich and W\"ust. Our approach involves ranges of matrix…
We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.
In this paper, we present intriguing findings that characterize both the closed (unbounded) and bounded EP operators on Hilbert spaces. Additionally, we demonstrate the result $\gamma(T) \leq r(T)$, where $T$ is a bounded EP operator, and…
In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…
We apply the local removable singularity theorem for minimal laminations and the local picture theorem on the scale of topology to obtain two descriptive results for certain possibly singular minimal laminations of $\mathbb{R}^3$. These two…
We provide a complete classification, in the language of weak-combinatorics, of minimal plus-one generated line arrangements in the complex projective plane with double and triple intersection points.
A quite flourishing research thread in the recent literature on component-based systems is concerned with the algebraic properties of different classes of connectors. In a recent paper, an algebra of stateless connectors was presented that…
We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in…
Given a semisimple group over a local field of residual characteristic p, its topological group of rational points admits maximal pro-p-subgroups. Quasi-split simply-connected semisimple groups can be described in the combinatorial terms of…
We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…
We show some basic facts about dp-minimal ordered structures. The main results are : dp-minimal groups are abelian-by-finite-exponent, in a divisible ordered dp-minimal group, any infinite set has non-empty interior, and any theory of pure…
For a weakly mixing bounded rank-one construction the disjointness of its powers is proved. For non-rigid constructions we get minimal self-joinings. Examples of non-mixing rank one actions with explicit weak closure are proposed.