Related papers: Hyper-hyperfiniteness and complexity

Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

We describe representations of certain superconformal algebras in the semi-infinite Weil complex related to the loop algebra of a complex finite-dimensional Lie algebra and in the semi-infinite cohomology. We show that in the case where the…

For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…

We obtain sharp estimates on the connectivity of complex affine hypersurfaces in terms of the decomposition of the defining equation as a sum of weighted homogeneous components relative to some weight system.

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

This paper verifies a conjecture of Edelman and Reiner regarding the homology of the $h$-complex of a Boolean algebra. A discrete Morse function with no low-dimensional critical cells is constructed, implying a lower bound on connectivity.…

Generalized uncertainty relations may depend not only on the commutator relation of two observables considered, but also on mutual correlations, in particular, on entanglement. The equivalence between the uncertainty relation and Bohr's…

Supernilpotence is a generalization of nilpotence using a recently developed theory of higher-arity commutators for universal algebras. Many important structural properties have been shown to be associated with supernilpotence, and the…

Heisenberg-Robertson's uncertainty relation expresses a limitation in the possible preparations of the system by giving a lower bound to the product of the variances of two observables in terms of their commutator. Notably, it does not…

We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.

We generalise the notion of separable equivalence, originally presented by Linckelmann (2011), to an equivalence relation on additive categories. We use this generalisation to show that from an initial equivalence between two algebras we…

This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…

We locate the complexity of the set of closed sets of uniqueness U(G), for G locally compact Lie group and of the set of closed sets of extended uniqueness U_0(G), for G connected abelian Lie group. More concretely, we prove that with…

We give an affirmative answer to the following question: Is any Borel subset of a Cantor set $\textbf{ C}$ a sum of a countable number of pairwise disjoint $h$-homogeneous subspaces that are closed in $X$? It follows that every Borel set $X…

We show that, up to Morita equivalence, any finite-dimensional algebra with a suitable homological system, admits an exact Borel subalgebra. This generalizes a theorem by Koenig, K\"ulshammer and Ovsienko, which holds for quasi-hereditary…

We consider the complexity (in terms of the arithmetical hierarchy) of the various quantifier levels of the diagram of a computably presented metric structure. As the truth value of a sentence of continuous logic may be any real in $[0,1]$,…

We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…

We consider the complexities of substitutive sequences over a binary alphabet. By studying various types of special words, we show that, knowing some initial values, its complexity can be completely formulated via a recurrence formula…

An infinite magmatic bialgebra is a vector space endowed with an n-ary operation, and an n-ary cooperation, for each n, verifying some compatibility relations. We prove a rigidity theorem, analogue to the Hopf-Borel theorem for commutative…