English
Related papers

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

200 papers

Given a finitely aligned $k$-graph $\Lambda$, we let $\Lambda^i$ denote the $(k-1)$-graph formed by removing all edges of degree $e_i$ from $\Lambda$. We show that the Toeplitz-Cuntz-Krieger algebra of $\Lambda$, denoted by…

Operator Algebras · Mathematics 2018-09-03 James Fletcher

We show that a topological semigroup of finite partial bijections $\mathscr{I}_\lambda^n$ of an infinite set with a compact subsemigroup of idempotents is absolutely $H$-closed and any countably compact topological semigroup does not…

Group Theory · Mathematics 2009-12-11 Oleg Gutik , Kateryna Pavlyk , Andriy Reiter

We extend the classical construction of solvable Lie algebras from a nilradical to compatible Lie algebras. Since the sum of nilpotent ideals may fail to be nilpotent, we replace the usual nilradical by a \emph{special nilradical} that…

Rings and Algebras · Mathematics 2026-03-02 A. Fernández Ouaridi , R. M. Navarro , B. A. Omirov , G. O. Solijanova

We construct uncountably categorical 3-nilpotent groups of exponent p > 3. They are not one-based and do not allow the interpretation of an infinite field. Therefore they are counterexamples to Zilbers Conjecture. First 2-nilpotent new…

Logic · Mathematics 2022-01-10 Andreas Baudisch

For the $p$-dimensional filiform Lie algebra ${\mathfrak m}_2(p)$ over a field ${\mathbb F}$ of prime characteristic $p\ge 5$ with nonzero Lie brackets $[e_1,e_i] = e_{i+1}$ for $1<i<p$ and $[e_2,e_i]=e_{i+2}$ for $2<i<p-1$, we show that…

Representation Theory · Mathematics 2019-12-03 Tyler J. Evans , Alice Fialowski

Every K-trivial set is computable from an incomplete Martin-L\"of random set, i.e., a Martin-L\"of random set that does not compute 0'.

This paper contains a complete description of minimal non-gatherable triangle triples in the lambda-sequences for the affine classical root systems and some claims for arbitrary (reduced) affine root systems. It continues our previous paper…

Quantum Algebra · Mathematics 2010-10-26 Ivan Cherednik , Keith Schneider

In this paper, we prove that given any \Pi^0_1 subset $P$ of $\{0,1\}^\NN$ there is a tileset $\tau$ with a set of configurations $C$ such that $P\times\ZZ^2$ is recursively homeomorphic to $C\setminus U$ where $U$ is a computable set of…

Discrete Mathematics · Computer Science 2011-05-11 Emmanuel Jeandel , Pascal Vanier

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

Representation Theory · Mathematics 2026-03-05 Shantanu Sardar

The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for…

Logic in Computer Science · Computer Science 2015-07-01 Pablo Arrighi , Alejandro Diaz-Caro

In this paper we show that any Bohr-zero non-periodic set $B$ of traceless integer valued matrices, denoted by $\Lambda$, intersects non-trivially the conjugacy class of any matrix from $\Lambda$. As a corollary, we obtain that the family…

Dynamical Systems · Mathematics 2017-03-27 Alexander Fish

We show that the Lawrence-Krammer representation based on two parameters that was used by Bigelow and independently Krammer to show the linearity of the braid group is generically irreducible, but that when its parameters are specialized to…

Representation Theory · Mathematics 2009-01-27 Claire I. Levaillant , David B. Wales

Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing…

Logic in Computer Science · Computer Science 2018-01-17 Jouke Witteveen , Leen Torenvliet

We construct in ZFC a countably compact group without non-trivial convergent sequences of size $2^{\mathfrak{c}}$, answering a question of Bellini, Rodrigues and Tomita. We also construct in ZFC a selectively pseudocompact group which is…

General Topology · Mathematics 2021-09-01 Artur Hideyuki Tomita , Juliane Trianon-Fraga

We classify the irreducible representations of a family of finite-dimensional pointed liftings $H_\lambda$ of the Nichols algebra associated with the diagram $A_2$ with parameter $q=-1$. We show that these algebras have infinite…

Quantum Algebra · Mathematics 2025-07-30 Agustín García Iglesias , Alfio Antonio Rodriguez

Let U(L) be the enveloping algebra of a finite dimensional Lie algebra L over a field k of characteristic zero, Z(U(L)) its center and Sz(U(L)) its semicenter. A sufficient condition is given in order for Sz(U(L)) to be a polynomial algebra…

Representation Theory · Mathematics 2008-06-26 Alfons I. Ooms

We prove that there exists a $\Sigma^0_1$ closed subset of $[0,1]$ that is not homeomorphic to any computably compact space. We show that the index set of c.e. subspaces of $[0,1]$ that admit a computably compact presentation is not…

In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of…

Logic in Computer Science · Computer Science 2019-12-06 Alejandro Díaz-Caro , Mauricio Guillermo , Alexandre Miquel , Benoît Valiron

Building on results of Medvedev, we construct a $\mathsf{ZFC}$ example of a non-Polish topological group that is countable dense homogeneous. Our example is a dense subgroup of $\mathbb{Z}^\omega$ of size $\mathfrak{b}$ that is a…

General Topology · Mathematics 2025-01-17 Claudio Agostini , Andrea Medini , Lyubomyr Zdomskyy

We investigate the topological aspects of some algebraic computation models, in particular the BSS-model. Our results can be seen as bounds on how different BSS-computability and computability in the sense of computable analysis can be. The…

Logic in Computer Science · Computer Science 2017-03-20 Eike Neumann , Arno Pauly