Related papers: Computable paradoxical decompositions
Notions of sesquiconstructible complexes and odd iterated stellar subdivisions are introduced, and some of their basic properties are verified. The Charney-Davis conjecture is then proven for odd iterated stellar subdivisions of…
Building on the nonabelian Hodge theory in positive characteristic developed by Ogus, Vologodsky, and Schepler, we propose a generalization of the decomposition theorem of Deligne and Illusie from the perspective of mixed Hodge modules.…
We classify and construct irreducible completely splittable representations of affine and finite Hecke-Clifford algebras over an algebraically closed field of characteristic not equal to 2.
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in…
This paper shows how to use Computational Algebra techniques, namely the decomposition of rational functions in one variable, to explore a certain set of modular functions, called replicable functions, that arise in Monstrous Moonshine. In…
We demonstrate that the topological Helly theorem and the algebraic Auslander-Buchsbaum may be viewed as different versions of the same phenomenon. Using this correspondence we show how the colorful Helly theorem of I.Barany and its…
In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…
We present a proof of Hadamard Inverse Function Theorem by the methods of Variational Analysis, adapting an idea of I. Ekeland and E. Sere.
We prove a comparison formula for the Donaldson-Thomas curve-counting invariants of two smooth and projective Calabi-Yau threefolds related by a flop. By results of Bridgeland any two such varieties are derived equivalent. Furthermore there…
Let $A$ be a tame hereditary algebra over a finite field $k$ with $q$ elements, and ${\bar{A}}$ be the duplicated algebra of $A$. In this paper, we investigate the structure of Ringel-Hall algebra $\mathscr{H} (\bar{A})$ and of the…
We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…
In this paper we report on an application of computer algebra in which mathematical puzzles are generated of a type that had been widely used in mathematics contests by a large number of participants worldwide. The algorithmic aspect of our…
We show that a single special separation theorem (namely, a consequence of the geometric form of the Hahn-Banach theorem) can be used to prove Farkas type theorems, existence theorems for numerical quadrature with positive coefficients, and…
We prove relative versions of many earlier results about almost invariant sets and splittings of groups. In particular, we prove a relative version of the algebraic torus theorem, and we prove the existence and uniqueness of relative…
We give a reformulation of the Lehmer conjecture about algebraic integers in terms of a simple counting problem modulo p.
We generalize a result of Araki (1985) on indecomposable group representations with invariant (necessarily indefinite) inner product and irreducible subrepresentation to Hopf $*$-algebras. Moreover, we characterize invariant inner products…
We introduce a formalism for derived moduli functors on differential graded associative algebras, which leads to non-commutative enhancements of derived moduli stacks and naturally gives rise to structures such as Hall algebras. Descent…
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
Every finite graph $G$ can be decomposed in a canonical way that displays its local connectivity-structure [DJKK26]. These decompositions are defined via a suitable more tree-like covering of $G$, whose tangle-tree structure is projected…