English
Related papers

Related papers: Computable paradoxical decompositions

200 papers

Karush's proof of McMillan's theorem is recast as an argument involving polynomials with non-commuting indeterminates certain evaluations of which yield the Kraft sums of codes, proving a strengthened version of McMillan's theorem.

Combinatorics · Mathematics 2008-06-23 Stephan Foldes

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

Logic in Computer Science · Computer Science 2020-10-05 Keng Meng Ng , Nazanin R. Tavana , Yue Yang

The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…

Logic · Mathematics 2026-02-03 Roman Feller , Michael Pinsker

Let $A$ be the path algebra of a finite acyclic quiver $Q$ over a finite field. We realize the quantum cluster algebra with principal coefficients associated to $Q$ as a sub-quotient of a certain Hall algebra involving the category of…

Representation Theory · Mathematics 2019-11-25 Ming Ding , Fan Xu , Haicheng Zhang

We describe recent work on preprojective algebras and moduli spaces of their representations. We give an analogue of Kac's Theorem, characterizing the dimension types of indecomposable coherent sheaves over weighted projective lines in…

Rings and Algebras · Mathematics 2007-05-23 William Crawley-Boevey

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

Symbolic Computation · Computer Science 2024-09-17 James H. Davenport

The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…

Logic · Mathematics 2023-07-19 Russell Miller

We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…

Logic in Computer Science · Computer Science 2017-03-16 Marcelo A. Aguilar , Rodolfo Conde

The aim of this work is to show how we can decompose a module (if decomposable) into an indecomposable module with the help of the minimization process.

Symbolic Computation · Computer Science 2016-08-31 Gerard Duchamp , Hatem Hadj Kacem , Eric Laugerotte

We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…

Combinatorics · Mathematics 2015-03-18 Edinah K. Gnang

We propose the notion of countable decomposability of maps on C*-algebras: a bounded linear map $\varphi : \mathscr{A}\to B(\mathcal{H})$, where $\mathscr{A}$ is a C*-algebra and $\mathcal{H}$ a Hilbert space, will be called countably…

Operator Algebras · Mathematics 2026-02-12 Krzysztof Szczygielski

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

Logic in Computer Science · Computer Science 2007-05-23 Yves Bertot

We prove a formula conjectured by the third author expressing certain Hodge integrals in terms of certain Chern-Simons link invariants. Such invariants also arise in the representation theory of Kac-Moody algebras.

Algebraic Geometry · Mathematics 2007-10-22 Chiu-Chu Melissa Liu , Kefeng Liu , Jian Zhou

Inspired by Quantum Mechanics, we reformulate Hilbert's tenth problem in the domain of integer arithmetics into problems involving either a set of infinitely-coupled non-linear differential equations or a class of linear Schr\"odinger…

General Mathematics · Mathematics 2007-05-23 Tien D. Kieu

We study two different one-parameter generalizations of Littlewood--Richardson coefficients, namely Hall polynomials and generalized inverse Kostka polynomials, and derive new combinatorial formulae for them. Our combinatorial expressions…

Mathematical Physics · Physics 2016-03-08 Michael Wheeler , Paul Zinn-Justin

We describe a method to compute the inverse Mellin transform of holonomic sequences, that is based on a method to compute the Mellin transform of holonomic functions. Both methods are implemented in the computer algebra package…

Symbolic Computation · Computer Science 2016-06-10 Jakob Ablinger

For a finitary hereditary abelian category $\mathcal{A}$, we define a derived Hall algebra of its root category by counting the triangles and using the octahedral axiom, which is proved to be isomorphic to the Drinfeld double of Hall…

Representation Theory · Mathematics 2024-01-09 Jiayi Chen , Ming Lu , Shiquan Ruan

We prove the Invariant Subspace Conjecture for separable Hilbert spaces.

Functional Analysis · Mathematics 2023-07-24 Charles W. Neville

In this note, we present a simple non-directed graph proof of Sharkovsky's theorem which is different from the one given in [2].

Dynamical Systems · Mathematics 2007-05-23 Bau-Sen Du

In this paper, we construct derived equivalences between matrix subrings. As applications, we calculate the global dimensions and the finitistic dimensions of some matrix subrings. And we show that the finitistic dimension conjecture holds…

Representation Theory · Mathematics 2011-08-02 Yiping Chen
‹ Prev 1 8 9 10 Next ›