Related papers: Upper bound on some hightness notions
In this paper, we prove a general result computing the number of rational points of bounded height on a projective variety $V$ which is covered by lines. The main technical result used to achieve this is an upper bound on the number of…
The hierarchical and recursive expressive capability of rooted trees is applicable to represent statistical models in various areas, such as data compression, image processing, and machine learning. On the other hand, such hierarchical…
A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a…
The Rabin tree theorem yields an algorithm to solve the satisfiability problem for monadic second-order logic over infinite trees. Here we solve the probabilistic variant of this problem. Namely, we show how to compute the probability that…
Let $\mathbf{G}$ be a reductive group defined over $\mathbb{Q}$ and let $\mathfrak{S}$ be a Siegel set in $\mathbf{G}(\mathbb{R})$. The Siegel property tells us that there are only finitely many $\gamma \in \mathbf{G}(\mathbb{Q})$ of…
We answer three questions posed by Bubeck and Linial on the limit densities of subtrees in trees. We prove there exist positive $\varepsilon_1$ and $\varepsilon_2$ such that every tree that is neither a path nor a star has inducibility at…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
This paper investigates $\exists\mathbb{R}(r^{\mathbb{Z}})$, that is the extension of the existential theory of the reals by an additional unary predicate $r^{\mathbb{Z}}$ for the integer powers of a fixed computable real number $r > 0$. If…
We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…
We present a new approach to the following meta-problem: given a quantitative property of trees, design a type system such that the desired property for the tree generated by an infinitary ground $\lambda$-term corresponds to some property…
We show that $m$-APR tilting preserves $n$-representation infiniteness for $1\leq m\leq n$. Moreover, we show that these tilting modules provide different tilting modules for the corresponding higher preprojective algebras, which is…
We discuss the continuum field theory limit of the physical scenario described in Ref. [1], the universe arising from the interpretation of the most general collection of logical codes in terms of distributions of units of energy along…
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational…
Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of stability. Examples can be found in areas as diverse as voting theory,…
The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…
In this paper, we investigate the problem of synthesizing computable functions of infinite words over an infinite alphabet (data $\omega$-words). The notion of computability is defined through Turing machines with infinite inputs which can…
HMC sets are hereditarily at most countable sets. We rework a substantial part of univariate real analysis in a form in which only HMC real functions are used. In such countable real analysis we carry out Hilbert's proof of transcendence of…
We prove that each finite chain in the two-branching countable ultrahomogeneous pseudotree has finite big Ramsey degrees. This is in contrast to the recent result of Chodounsk\'{y}, Eskew, and Weinert that antichains of size two have…
A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to…
We extend a result by Huneke and Watanabe bounding the multiplicity of $F$-pure local rings of prime characteristic in terms of their dimension and embedding dimensions to the case of $F$-injective, generalized Cohen-Macaulay rings. We then…