Related papers: Generalized Tukey reducibility between $\sigma$-di…

Query-driven machine learning models have emerged as a promising estimation technique for query selectivities. Yet, surprisingly little is known about the efficacy of these techniques from a theoretical perspective, as there exist…

We show that the set of codes for Ramsey positive analytic sets is $\mathbf{\Sigma}^1_2$-complete. This is a one projective-step higher analogue of the Hurewicz theorem saying that the set of codes for uncountable analytic sets is…

We give a proof of the existence of generalized definable locally compact models for arbitrary approximate subgroups via an application of topological dynamics in model theory. Our construction is simpler and shorter than the original one…

We prove local and global inverse theorems for general $3$-wise correlations over pairwise-connected distributions. Let $\mu$ be a distribution over $\Sigma \times \Gamma \times \Phi$ such that the supports of $\mu_{xy}$, $\mu_{xz}$, and…

For a space $X$ let $\mathcal{K}(X)$ be the set of compact subsets of $X$ ordered by inclusion. A map $\phi:\mathcal{K}(X) \to \mathcal{K}(Y)$ is a relative Tukey quotient if it carries compact covers to compact covers. When there is such a…

A collectively $\sigma$-Levi set of operators is a generalization of the $\sigma$-Levi operator. By use of collective order convergence, we investigate relations between collectively $\sigma$-Levi and collectively compact sets of operators.

In this paper we present decomposable priors, a family of priors over structure and parameters of tree belief nets for which Bayesian learning with complete observations is tractable, in the sense that the posterior is also decomposable and…

We consider topological dynamical systems given by skew products $S\rtimes_{\tau} T$, where $S\colon Y\to Y$ is a subshift, $\tau\colon Y\to\mathbb{Z}$ is a continuous cocycle, and $T$ is an arbitrary invertible topological system. For…

In recent work by Khmaladze and Weil (2008) and by Einmahl and Khmaladze (2011), limit theorems were established for local empirical processes near the boundary of compact convex sets $K$ in $\R$. The limit processes were shown to live on…

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

For a set-valued map, we characterize, in terms of its (unconvexified or convexified) graphical derivatives near the point of interest, positively homogeneous maps that are generalized derivatives in the sense of [20]. This result…

We study a relative variant of Serre's notion of $G$-complete reducibility for a reductive algebraic group $G$. We let $K$ be a reductive subgroup of $G$, and consider subgroups of $G$ which normalise the identity component $K^{\circ}$. We…

Let $N$ be normal subgroup of a finite group $G$, $p$ be a prime, $P$ be a Sylow $p$-subgroup of $G$ and $\theta$ be a $P$-invariant irreducible character of $N$. Suppose that $G/N$ is a $p$-solvable group. In this note we show that,…

In transferring some results from universal Taylor series to the case of Pad\'e approximants we obtain stronger results, such as, universal approximation on compact sets of arbitrary connectivity and generic results on planar domains of any…

In the usual procedure for toroidal Kaluza-Klein reduction, all the higher-dimensional fields are taken to be independent of the coordinates on the internal space. It has recently been observed that a generalisation of this procedure is…

Let $G$ be a connected reductive group over a number field $F$, and let $S$ be a set (finite or infinite) of places of $F$. We give a necessary and sufficient condition for the surjectivity of the localization map from $H^1(F,G)$ to the…

We present a system of axioms motivated by a topological intuition: The set of subsets of any set is a topology on that set. On the one hand, this system is a common weakening of Zermelo-Fraenkel set theory ZF, the positive set theory GPK…

Constrained learning is prevalent in many statistical tasks. Recent work proposes distance-to-set penalties to derive estimators under general constraints that can be specified as sets, but focuses on obtaining point estimates that do not…

The notion of generic reducibility was introduced by A.Rybalov in his CiE 2018 paper: a set A is generically reducible to set B if there exists a total computable function f that m-reduces A to B such that the f-preimage of every set that…

This paper generalizes Kocay's lemma, with particular applications to graph reconstruction, as well as discussing and proving aspects around the power of these generalizations and Kocay's original lemma, with a result on the reconstruction…