Related papers: Computing the exponent of a Lebesgue space

We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…

Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

In this note we address various algorithmic problems that arise in the computation of the operator norm in unitary representations of a group on Hilbert space. We show that the operator norm in the universal unitary representation is…

In this paper, we are mainly concerned with the well-posedness of the dissipative surface quasi-geostrophic equation in the framework of variable Lebesgue spaces. Based on some analytical results developed in the variable Lebesgue spaces…

Assume that $A_{1},...,A_{s}$ are complex $n\times n$ matrices. We give a computable criterion for existence of a common eigenvector of $A_{i}$ which generalize the result of D. Shemesh established for two matrices. We use this criterion to…

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

We consider an agent interacting with an unknown environment. The environment is a function which maps natural numbers to natural numbers; the agent's set of hypotheses about the environment contains all such functions which are computable…

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

A conjecture of Breuil, Buzzard, and Emerton says that the slopes of certain reducible $p$-adic Galois representations must be integers. In previous work we showed this conjecture for representations that lie over certain non-subtle…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…

This paper deals with two main topics related to Diophantine approximation. Firstly, we show that if a point on an algebraic variety is approximable by rational vectors to a sufficiently large degree, the approximating vectors must lie in…

We derive necessary and sufficient conditions for order-2 $CP$ ($CP2$) symmetry in $N$-Higgs-doublet potentials for $N>2$. The conditions, which are formulated as relations between vectors that transform under the adjoint representation of…

Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…

We study the moduli spaces of rational curves on cubic hypersurfaces in characteristic $\neq2,3$. As a result, we prove that for every integer $d\geq1$ the Kontsevich moduli space of stable maps on a smooth cubic hypersurface $X$ of degree…

We provide a Macaulay2 code for computing the dimension of the tangent space to $\mathcal{B}(e,c_2)$ in certain cases. Using this code, we identify components of $\mathcal{B}(e,c_2)$ containing singular points and compute the dimension of…

The additive square problem is a relatively famous open problem in the area of combinatorics on words: Does there exist an infinite word over a finite alphabet, such that no two consecutive blocks of the same length have the same sum? In…