Related papers: Characterising SJT reducibility

Let $G$ be a simple algebraic group of type $E_n (n=6,7,8)$ defined over an algebraically closed field $k$ of characteristic $2$. We present examples of triples of closed reductive groups $H<M<G$ such that $H$ is $G$-completely reducible,…

In the last 20 years a whole hierarchy of notions of tractability was proposed and analyzed by several authors. These notions are used to classify the computational hardness of continuous numerical problems $S=(S_d)_{d\in\mathbb{N}}$ in…

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

Define $S_n^k(T)$ to be the set of permutations of $\{1,2,...,n\}$ with exactly $k$ fixed points which avoid all patterns in $T \subseteq S_m$. We enumerate $S_n^k(T)$, $T \subseteq S_3$, for all $|T| \geq 2$ and $0 \leq k \leq n$.

Let $(X, T)$ be a topological dynamical system (TDS), and $h (T, K)$ the topological entropy of a subset $K$ of $X$. $(X, T)$ is {\it lowerable} if for each $0\le h\le h (T, X)$ there is a non-empty compact subset with entropy $h$; is {\it…

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

Let $P_n^{\text{sep}}$ denote the uniform probability measure on the set of separable permutations in $S_n$. Let $\mathbb{N}^*=\mathbb{N}\cup\{\infty\}$ with an appropriate metric and denote by $S(\mathbb{N},\mathbb{N}^*)$ the compact…

We introduce a novel choice dataset, called joint choice, in which options and menus are multidimensional. In this general setting, we define a notion of choice separability, which requires that selections from some dimensions are never…

An $n$-by-$n$ ($n\ge 3$) weighted shift matrix $A$ is one of the form $$[{array}{cccc}0 & a_1 & & & 0 & \ddots & & & \ddots & a_{n-1} a_n & & & 0{array}],$$ where the $a_j$'s, called the weights of $A$, are complex numbers. Assume that all…

Let $S$ be a Scott set, or even an $\omega$-model of $\mathsf{WWKL}$. Then for each $A\in S$, either there is $X \in S$ that is weakly 2-random relative to $A$, or there is $X\in S$ that is 1-generic relative to $A$. It follows that if…

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…

The objective of this study is a better understanding of the relationships between reduction and continuity. Solovay reduction is a variation of Turing reduction based on the distance of two real numbers. We characterize Solovay reduction…

To expand a fundamental theory of context-free languages, we equip nondeterministic one-way pushdown automata with additional oracle mechanisms, which naturally induce various nondeterministic reducibilities among formal languages. As a…

This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…

In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…

We consider the problem of identifying a minimal subset of training data $\mathcal{S}_t$ such that if the instances comprising $\mathcal{S}_t$ had been removed prior to training, the categorization of a given test point $x_t$ would have…

The Hilbert scheme H^d_n of n points in A^d contains an irreducible component R^d_n which generically represents n distinct points in A^d. We show that when n is at most 8, the Hilbert scheme H^d_n is reducible if and only if n = 8 and d >=…

A subset $A$ of an abelian group $G$ is sequenceable if there is an ordering $(a_1, \ldots, a_k)$ of its elements such that the partial sums $(s_0, s_1, \ldots, s_k)$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i a_i$ for $1 \leq i \leq k$,…

Let G be a connected reductive algebraic group over an algebraically closed field k. In a recent paper, Bate, Martin, R\"ohrle and Tange show that every (smooth) subgroup of G is separable provided that the characteristic of k is very good…

We observe that some natural mathematical definitions are lifting properties relative to simplest counterexamples, namely the definitions of surjectivity and injectivity of maps, as well as of being connected, separation axioms $T_0$ and…