Related papers: Sequences with increasing subsequence
Algebras on the natural numbers and their clones of term operations can be classified according to their descriptive complexity. We give an example of a closed algebra which has only unary operations and whose clone of term operations is…
The hyperbolicity statements for subvarieties and complements of hypersurfaces in abelian varieties admit arithmetic analogues, due to Faltings (and Vojta for the semi-abelian case). In Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 29…
We consider to learn a causal ordering of variables in a linear non-Gaussian acyclic model called LiNGAM. Several existing methods have been shown to consistently estimate a causal ordering assuming that all the model assumptions are…
We construct monoid algebras which satisfy the ascending chain condition on principal ideals and which have the property that every nonempty subset of $\mathbb{N}_{\ge 2}$ occurs as a length set.
Goodstein sequences are numerical sequences in which a natural number m, expressed as the complete normal form to a given base a, is modified by increasing the value of the base a by one unit and subtracting one unit from the resulting…
We show that the set of absolutely normal numbers is $\mathbf \Pi^0_3$-complete in the Borel hierarchy of subsets of real numbers. Similarly, the set of absolutely normal numbers is $\Pi^0_3$-complete in the effective Borel hierarchy.
We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…
Gabrielov's famous example for the failure of analytic Artin approximation in the presence of nested subring conditions is shown to be due to a growth phenomenon in standard basis computations for echelons, a generalization of the concept…
The monadic theory of $(\mathbb R,\le)$ with quantification restricted to Borel sets is decidable. The Boolean combinations of $F_\sigma$ sets form an elementary substructure of the Borel sets. Under determinacy hypotheses, the proof…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
Every beginning real analysis student learns the classic Heine-Borel theorem, that the interval [0,1] is compact. In this article, we present a proof of this result that doesn't involve the standard techniques such as constructing a…
A topological space is defined to be banalytic (resp. analytic) if it is the image of a Polish space under a Borel (resp. continuous) map. A regular topological space is analytic if and only if it is banalytic and cosmic. Each (regular)…
We give an alternative proof of a fact that a finite continuous non-decreasing submodular set function on a measurable space can be expressed as a supremum of measures dominated by the function, if there exists a class of sets which is…
Let $(u(n))_{n\in\mathbb{N}}$ be an arithmetic progression of natural integers in base $b\in\mathbb{N}\setminus \{0,1\}$. We consider the following sequences: $s(n)=\overline{u(0)u(1)\cdots u(n) }^b$ formed by concatenating the first $n+1$…
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…
Tasks that model the relation between pairs of tokens in a string are a vital part of understanding natural language. Such tasks, in general, require exhaustive pair-wise comparisons of tokens, thus having a quadratic runtime complexity in…
For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…
Let $(X,\le)$ be a {\em non-empty strictly inductive poset}, that is, a non-empty partially ordered set such that every non-empty chain $Y$ has a least upper bound lub$(Y)\in X$, a chain being a subset of $X$ totally ordered by $\le$. We…
In recent years, much work in descriptive set theory has been focused on the Borel complexity of naturally occurring classification problems, in particular, the study of countable Borel equivalence relations and their structure under the…
Let $K\subset R^n$ be a compact basic semi-algebraic set. We provide a necessary and sufficient condition (with no a priori bounding parameter) for a real sequence $y=(y_\alpha)$, $\alpha\in N^n$, to have a finite representing Borel measure…