Related papers: Hypercomputing the Mandelbrot Set?
Using computer graphics and visualization algorithms, we extend in this work the results obtained analytically in [1], on the connectivity domains of alternated Julia sets, defined by switching the dynamics of two quadratic Julia sets. As…
We survey the complexity class $\exists \mathbb{R}$, which captures the complexity of deciding the existential theory of the reals. The class $\exists \mathbb{R}$ has roots in two different traditions, one based on the Blum-Shub-Smale model…
The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
Classical and exceptional Lie algebras and their representations are among the most important tools in the analysis of symmetry in physical systems. In this letter we show how the computation of tensor products and branching rules of…
We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…
We say that a hypercomplex nilpotent Lie algebra is $\mathbb{H}$-solvable if there exists a sequence of $\mathbb{H}$-invariant subalgebras $\mathfrak{g}_1^{ \mathbb{H}}\supset\mathfrak{g}_2^{…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
Algorithms of numeric (in exact arithmetic) deduction of analytical expressions, proposed and described by Shevchenko and Vasiliev (1993), are developed and implemented in a computer algebra code. This code is built as a superstructure for…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
As a homomorphic image of the hyperalgebra $U_{q,R}(m|n)$ associated with the quantum linear supergroup $U_\upsilon(\mathfrak{gl}_{m|n})$, we first give a presentation for the $q$-Schur superalgebra $S_{q,R}(m|n,r)$ over a commutative ring…
It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…
In this note, we present a characterization of sets definable in Skolem arithmetic, i.e., the first-order theory of natural numbers with multiplication. This characterization allows us to prove the decidability of the theory. The idea is…
We study rational functions satisfying summability conditions - a family of weak conditions on the expansion along the critical orbits. Assuming their appropriate versions, we derive many nice properties: There exists a unique, ergodic, and…
We solve the longstanding conjecture by Milnor (1993) concerning the connectedness locus $M_1$ of the family of quadratic rational maps tangent to the identity at $\infty$. We prove that this locus in homeomorphic to the Mandelbrot set $M$…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
This paper presents a classification of 7-dimensional real and complex indecomposable solvable Lie algebras having some 5-dimensional nilradicals. Afterwards, we combine our results with those of Rubin and Winternitz (1993), Ndogmo and…
The unipotent groups are an important class of algebraic groups. We show that techniques used to compute with finitely generated nilpotent groups carry over to unipotent groups. We concentrate particularly on the maximal unipotent subgroup…