Related papers: Computable paradoxical decompositions
An alternative computational approach to the Collatz (3n+1) conjecture is presented that may be theoretically capable of confirming the conjecture.
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
A nonconstructive proof can be used to prove the existence of an object with some properties without providing an explicit example of such an object. A special case is a probabilistic proof where we show that an object with required…
We suggest an alternative proof of a theorem due to Lambek and Moser using a perceptible model.
We establish a factorisation theorem for invertible, cross-symmetric, totally nonnegative matrices, and illustrate the theory by verifying that certain cases of Holte's Amazing Matrix are totally nonnegative.
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We consider the issue of computability at the most fundamental level of physical reality: the Planck scale. To this aim, we consider the theoretical model of a quantum computer on a non commutative space background, which is a computational…
We present a local and constructive differential geometric description of finite-dimensional solvable and transitive Lie algebras of vector fields. We show that it implies a Lie's conjecture for such Lie algebras. Also infinite-dimensional…
We define a new type of Hall algebras associated e.g. with quivers with polynomial potentials. The main difference with the conventional definition is that we use cohomology of the stack of representations instead of constructible sheaves…
We translate the equivariant decomposition theorem (in the case of a proper morphism of toric varieties) in to the language of combinatorially defined ``shifted minimal complexes''.
As a corollary of nonabelian Hodge theory, Simpson proved a strong Lefschetz theorem for complex polarized variations of Hodge structure. We show an arithmetic analog. Our primary technique is $p$-adic nonabelian Hodge theory. Conditional…
In this paper, we introduce two new forms of the dual Hartwig-Spindelb{\"o}ck decomposition and employ them to derive explicit representations for several classes of dual generalized inverses. Building on these representations, we further…
The Borel-Weil-Bott theorem can be used to decompose the cohomology of twisted sheaves of holomorphic forms on the complex Grassmannian into irreducible representations of the general linear group. By analyzing this decomposition, we…
In a beautiful paper Deligne and Illusie proved the degeneration of the Hodge-to-de Rham spectral sequence using positive characteristic methods. In a recent paper Arinkin, C\u{a}ld\u{a}raru and the author of this paper gave a geometric…
We extend the decomposition theorem for numerically $K$-trivial varieties with log terminal singularities to the K\"ahler setting. Along the way we prove that all such varieties admit a strong locally trivial algebraic approximation, thus…
A classical probabilistic explanation for Hardy's quantum paradox is demonstrated.
We prove two theorems on the locally finite decompositions of the cones of divisors by the cones which correspond to canonical and minimal models. We introduce the concept of the numerical linear systems in order to simplify the argument on…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…