Related papers: Definable Combinatorics of Some Borel Equivalence …

The Mycielski ideal M_k is defined to consist of all sets A subseteq k^omega such that {f restriction X: f in A} not= k^X for all X in [omega]^{aleph_0}. It will be shown that the covering numbers for these ideals are all equal. However,…

We introduce the notion of groupoid pre-equivalences and prove that they give rise to groupoid equivalences by taking certain quotients. Then, given an equivalence of Fell bundles $\mathscr{B}$ and $\mathscr{C}$ and another equivalence…

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

A relational structure ${\mathbb X}$ is said to be reversible iff every bijective endomorphism $f:X\rightarrow X$ is an automorphism. We define a sequence of non-zero cardinals $\langle \kappa_i :i\in I\rangle$ to be reversible iff each…

Let $\mathcal{I}$ be an ideal on $\omega$ and $X$ be a topological space. A sequence $(x_n)_{n\in \omega}$ in $X$ is $\mathcal{I}$-convergent if there is $x\in X$ such that $\{n\in \omega:x_n\notin U\}\in\mathcal{I}$ for every open…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

We prove that there is a one to one correspondence between the following three sets: idempotent functions on a set of size $n$, complete exceptional sequences of linear radical square zero Nakayama algebras of rank $n$ and rooted labeled…

There are presented certain results on extending continuous linear operators defined on spaces of E-valued continuous functions (defined on a compact Hausdorff space X) to linear operators defined on spaces of E-valued measurable functions…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

We develop new tools to analyze the complexity of the conjugacy equivalence relation $E_\mathsf{lo}(G)$, whenever $G$ is a left-orderable group. Our methods are used to demonstrate non-smoothness of $E_\mathsf{lo}(G)$ for certain groups $G$…

Let $X_n=\sum_{i=1}^{\infty}a_i\epsilon_{n-i}$, where the $\epsilon_i$ are i.i.d. with mean 0 and at least finite second moment, and the $a_i$ are assumed to satisfy $|a_i|=O(i^{-\beta})$ with $\beta >1/2$. When $1/2<\beta<1$, $X_n$ is…

Let A be a connected graded algebra and let E denote its Ext-algebra. There is a natural A-infinity algebra structure on E, and we prove that this structure is mainly determined by the relations of A. In particular, the coefficients of the…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…

A set of all symmetric Banach function spaces defined on [0,1] is equipped with the partial order by the relation of continuous inclusion. Properties of symmetric spaces, which do not depend of their position in the ordered structure, are…

A subset $E$ of a discrete abelian group is called $\epsilon $-Kronecker if all $E$-functions of modulus one can be approximated to within $\epsilon$ by characters. $E$ is called a Sidon set if all bounded $E$-functions can be interpolated…

Let $x(n):=\alpha n^d \mod 1$ for integer $d >1$ and non-zero real $\alpha$. We show that $\{x(n)\}_{n>0}$ has Poissonian $\ell$-point correlations for almost all choices of $\alpha$ when $d$ is large (depending on $\ell$). This falls in…

Let $\mathcal{P}$ be a poset on $[n]$, $\mathcal{I}(\mathcal{P})$ the set of order ideals of $\mathcal{P}$ and $E$ an equivalence relation on $\mathcal{I}(\mathcal{P})$. The concepts of the dual relation $E^*$ of an equivalence relation…

We define the Born group as the group of transformations that leave invariant the line element of Minkowski's spacetime written in terms of Fermi coordinates of a Born congruence. This group depends on three arbitrary functions of a single…

The Solecki dichotomy in descriptive set theory and the Posner-Robinson theorem in computability theory bear a superficial resemblance to each other and can sometimes be used to prove the same results, but do not have any obvious direct…