相关论文: Computability properties of hyperbolic complex H\'…

It is shown that any finite-dimensional homomorphic image of an inverse limit of nilpotent not-necessarily-associative algebras over a field is nilpotent. More generally, this is true of algebras over a general commutative ring k, with…

In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…

We give a formalism of arithmetic mixed sheaves including the case of arithmetic mixed Hodge structures, and show the nonvanishing of certain higher extension groups, and also the nontriviality of the second Abel-Jacobi map for zero cycles…

We consider finite-dimensional Hopf algebras $u$ which admit a smooth deformation $U\to u$ by a Noetherian Hopf algebra $U$ of finite global dimension. Examples of such Hopf algebras include small quantum groups over the complex numbers,…

We present a hardware-accelerated computation of Hasse-Weil invariants of all hyperelliptic curves of given genus over a fixed finite field. Our main motivation is the determination of traces of Frobenius on cohomology corresponding moduli…

We consider the trace map associated with the Fibonacci Hamiltonian as a diffeomorphism on the invariant surface associated with a given coupling constant and prove that the non-wandering set of this map is hyperbolic if the coupling is…

We prove John Hubbard's conjecture on the topological complexity of the hyperbolic horseshoe locus of the complex H\'enon map. Indeed, we show that there exist several non-trivial loops in the locus which generate infinitely many mutually…

An extension of the finite and infinite Lie groups properties of complex numbers and functions of complex variable is proposed. This extension is performed exploiting hypercomplex number systems that follow the elementary algebra rules. In…

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

We study a certain polytope depending on a graph $G$ and a parameter $\beta\in(0,1)$ which arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Eshragh \emph{et al.} conjectured a lower bound on the…

For a post-critically finite hyperbolic rational map $f$, we show that its Julia set $\mathcal{J}_f$ has Ahlfors-regular conformal dimension one if and only if $f$ is a crochet map, i.e., there is an $f$-invariant connected graph $G$…

For K a field of characteristic 0 and d any integer number greater than or equal to 2, we prove the invertibility of polynomial endomorphisms of the affine space of dimension d over K of the form F=Id+H, where each coordinate of H is the…

Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with…

We classify two-qubit commuting Hamiltonians in terms of their computational complexity. Suppose one has a two-qubit commuting Hamiltonian H which one can apply to any pair of qubits, starting in a computational basis state. We prove a…

The goal of this paper is to discuss about the hyperbolicity of the non-wandering set $\mathcal{NW}(f_c)$ of real quadratic function $f_c(x)=x^2+c$ when $c\in (-\infty, -2]$. Even though the results we present here are not new, it is not…

Hyperdimensional (HD) computing is a set of neurally inspired methods for obtaining high-dimensional, low-precision, distributed representations of data. These representations can be combined with simple, neurally plausible algorithms to…

We explicitly compute the Dolbeault cohomologies of certain domains in complex space generalizing the classical Hartogs figure. The cohomology groups are non-Hausdorff topological vector spaces, and it is possible to identify the reduced…

We describe a new approach to certifying the global nonnegativity of multivariate polynomials by solving hyperbolic optimization problems---a class of convex optimization problems that generalize semidefinite programs. We show how to…

We consider H\"older continuous cocycles over an accessible partially hyperbolic system with values in the group of diffeomorphisms of a compact manifold $M$. We obtain several results for this setting. If a cocycle is bounded in…