English
Related papers

Related papers: Non computable Mandelbrot-like set for a one-param…

200 papers

We generalise clones, which are sets of functions $f:A^n \rightarrow A$, to sets of mappings $f:A^n \rightarrow A^m$. We formalise this and develop language that we can use to speak about it. We then look at bijective mappings, which have…

Rings and Algebras · Mathematics 2018-11-12 Tim Boykett

We prove an algebraic extension theorem for the computably enumerable sets, $\mathcal{E}$. Using this extension theorem and other work we then show if $A$ and $\hat{A}$ are automorphic via $\Psi$ then they are automorphic via $\Lambda$…

Logic · Mathematics 2007-05-23 Peter Cholak , Leo Harrington

The computability of Julia sets of rational maps on the Riemann sphere has been intensively studied in recent years (see, e.g. https://doi.org/10.17323/1609-4514-2008-8-2-185-231, https://doi.org/10.1090/conm/797/15936) for an overview. For…

Dynamical Systems · Mathematics 2025-08-21 Suzanne Boyd , Christian Wolf

This text gives a rough, but linear summary covering some key definitions, notations, and propositions from Lambda Calculus: Its Syntax and Semantics, the classical monograph by Barendregt. First, we define a theory of untyped extensional…

Logic in Computer Science · Computer Science 2013-10-28 Anton Salikhmetov

The partition number $\pi(K)$ of a simplicial complex $K\subset 2^{[m]}$ is the minimum integer $\nu$ such that for each partition $A_1\uplus\ldots\uplus A_\nu = [m]$ of $[m]$ at least one of the sets $A_i$ is in $K$. A complex $K$ is…

Algebraic Topology · Mathematics 2018-09-18 Duško Jojić , Wacław Marzantowicz , Siniša T. Vrećica , Rade T. Živaljević

In this article, we study some potential theoretical and topological aspects of the generalized Mandelbrot set introduced by Baker and DeMarco. For $\alpha$ real, we study the set of all totally real algebraic parameters $c$ such that…

Dynamical Systems · Mathematics 2024-05-20 Kevin G. Hare , Chatchai Noytaptim

We consider two families of categories. The first is the family of semisimple quotients of H. Andersen's tilting module categories for quantum groups of Lie type $B$ specialized at odd roots of unity. The second consists of categories…

Quantum Algebra · Mathematics 2007-05-23 Eric C. Rowell

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

Logic · Mathematics 2021-08-05 Martin Klazar

Calder\'on-Zygmund operators with noncommuting kernels may fail to be Lp-bounded for $p \neq 2$, even for kernels with good size and smoothness properties. Matrix-valued paraproducts, Fourier multipliers on group vNa's or noncommutative…

Classical Analysis and ODEs · Mathematics 2014-05-14 Guixiang Hong , Luis Daniel López-Sánchez , José María Martell , Javier Parcet

We prove that lemniscates (i.e., sets of the form $|P(z)|=1$ where $P$ is a complex polynomial) are irreducible real algebraic curves.

Algebraic Geometry · Mathematics 2024-12-03 S. Yu. Orevkov

The paper deals with a three-parameter family of special double confluent Heun equations that was introduced and studied by V.M.Buchstaber and S.I.Tertychnyi as an equivalent presentation of a model of overdamped Josephson junction in…

Dynamical Systems · Mathematics 2019-11-12 Alexey Glutsyuk , Igor Netay

We suggest an approach to constructing physical systems with dynamical characteristics of the complex analytic iterative maps. The idea follows from a simple notion that the complex quadratic map by a variable change may be transformed into…

Chaotic Dynamics · Physics 2009-11-07 O. B. Isaeva , S. P. Kuznetsov , V. I. Ponomarenko

We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…

Logic in Computer Science · Computer Science 2012-09-12 Alejandro Díaz-Caro , Barbara Petit

With each Steiner triple system there is associated a one-parameter family of commutative, nonassociative, nonunital algebras that are by construction exact, meaning that the trace of every multiplication operator vanishes, and these…

Rings and Algebras · Mathematics 2022-06-13 Daniel J. F. Fox

Nonuniform families of polynomial-size finite automata and pushdown automata respectively have strong connections to nonuniform-NL and nonuniform-LOGCFL. We examine the behaviors of unambiguous and co-nondeterministic computations produced…

Computational Complexity · Computer Science 2025-12-16 Tomoyuki Yamakami

In this paper, we formalize the notion of lambda-AT-model (where $\lambda$ is a non-null integer) for a given chain complex, which allows the computation of homological information in the integer domain avoiding using the Smith Normal Form…

Computer Vision and Pattern Recognition · Computer Science 2011-05-24 Rocio Gonzalez-Diaz , Maria Jose Jimenez , Belen Medrano , Pedro Real

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

Group Theory · Mathematics 2025-01-15 Emmanuel Rauzy

A Misiurewicz parameter is a complex number $c$ for which the orbit of the critical point $z=0$ under $z^2+c$ is strictly preperiodic. Such parameters play the same role as special points in dynamical moduli spaces that singular moduli…

Number Theory · Mathematics 2025-06-19 Robert L. Benedetto , Vefa Goksel

Turing machines and register machines have been used for decades in theoretical computer science as abstract models of computation. Also the $\lambda$-calculus has played a central role in this domain as it allows to focus on the notion of…

Logic in Computer Science · Computer Science 2023-06-22 Giuseppe Della Penna , Benedetto Intrigila , Giulio Manzonetto

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