Related papers: Generic Expansions by a Reduct

Most machine learning models for structured data encode the structural knowledge of a node by leveraging simple aggregation functions (in neural models, typically a weighted sum) of the information in the node's neighbourhood. Nevertheless,…

We develop multisummability, in the positive real direction, for generalized power series with natural support, and we prove o-minimality of the expansion of the real field by all multisums of these series. This resulting structure expands…

Let $G$ be a multiplicative subgroup of the prime field $\mathbb F_p$ of size $|G|> p^{1-\kappa}$ and $r$ an arbitrarily fixed positive integer. Assuming $\kappa=\kappa(r)>0$ and $p$ large enough, it is shown that any proportional subset…

The purpose of this article is to connect the notion of the amenability of a discrete group with a new form of structural Ramsey theory. The Ramsey theoretic reformulation of amenability constitutes a considerable weakening of the Folner…

We study the continuous reducibility of isomorphism relations in the space of regresive functions in $\kappa^\kappa$. We show for inaccessible $\kappa$, that if $\mathcal{T}$ is a theory with less than $\kappa$ non-isomorphic models of size…

We prove a generalization of Thom's transversality theorem. It gives conditions under which the jet map $f_*|_Y:Y\subseteq J^r(D,M)\ra J^r(D,N)$ is generically (for $f:M\ra N$) transverse to a submanifold $Z\subseteq J^r(D,N)$. We apply…

We consider a family $\{T_N:N \geq 1 \}$ of interval maps as generalizations of the Gauss transformation. For the continued fraction expansion arising from $T_N$, we solve its Gauss-Kuzmin-type problem by applying the theory of random…

We prove that for an o-minimal expansion of the real additive group $\cal R$ and a set $P\subseteq \mathbb{R}$ of dimension $0$ such that $\langle\mathcal{R},P\rangle$ is sparse, has definable choice and every definable set has interior or…

We study interpolative fusion, a method of combining theories $T_1$ and $T_2$ in distinct languages in a "generic" way over a common reduct $T_\cap$, to obtain a theory $T_\cup^*$. When each $T_i$ is model-complete, $T_\cup^*$ is the model…

We extend the results of the general small-gain theorem proposed by Z.P Jiang. The significance of this extension is two fold. First, it allows one to use general vector norm to characterize the input-to-output property of two…

Let $T$ be an o-minimal theory expanding $\mathrm{RCF}$ and $T_\mathrm{convex}$ be the common theory of its models expanded by predicate for a non-trivial $T$-convex valuation ring. We call an elementary extension $(\mathbb{E}, \mathcal{O})…

The paper is the second of two and shows that (assuming large cardinals) set theory is a tractable (and we dare to say tame) first order theory when formalized in a first order signature with natural predicate symbols for the basic…

Parahoric group schemes are certain possibly non-reductive, smooth, affine integral models of reductive group schemes defined over a henselian discretely valued field $K$ whose residue field is perfect. We show that any such group scheme…

We explore the use of generalized t priors on regression coefficients to help understand the nature of association signal within "hit regions" of genome-wide association studies. The particular generalized t distribution we adopt is a…

Let $\mathbb{T}$ be the differential field of logarithmic-exponential transseries. We consider the expansion of $\mathbb{T}$ by the binary map that sends a real number $r$ and a positive transseries $f$ to the transseries $f^r$. Building on…

Random matrix models encode a theory of random two dimensional surfaces with applications to string theory, conformal field theory, statistical physics in random geometry and quantum gravity in two dimensions. The key to their success lies…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P. We devise a combinatorial method…

Suppose that $G$ is a topological group and $ C $ a compact subset of $G$. In this paper we define group nonexpansive mappings and then we consider $\sc = \{T_{i} : i \in I \}$ as a family of the group nonexpansive mappings on $C$. Also we…

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…