English
Related papers

Related papers: {\alpha} degrees as an automorphism base for the {…

200 papers

We propose a generalisation for the notion of the centre of an algebra in the setup of algebras graded by an arbitrary abelian group G. Our generalisation, which we call the G-centre, is designed to control the endomorphism category of the…

Representation Theory · Mathematics 2018-11-15 Kevin Coulembier , Volodymyr Mazorchuk

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…

Logic · Mathematics 2007-05-23 Randall Dougherty , Alexander S. Kechris

We work with the structure consisting of all computably enumerable (c.e.) sets ordered by set inclusion. The question we will partially address is which c.e.\ sets are autormorphic to low (or low$_2$ sets. Using work of Miller, we can see…

Logic · Mathematics 2015-12-29 Peter Cholak , Rachel Epstein

First we prove that any inner automorphism in the stabilizer of a graded-simple unital associative algebra whose grading group is abelian is the conjugation by a homogeneous element. Now consider a grading by an abelian group on an…

Rings and Algebras · Mathematics 2023-10-12 Adrián Rodrigo-Escudero

Consider a finite-dimensional, complex Lie algebra G and a semi-simple automorphism {\alpha}. This note aims to give a short and simple proof for explicit upper bounds for the derived length of the radical R and the rank of a Levi…

Rings and Algebras · Mathematics 2015-12-08 Wolfgang Alexander Moens

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

Logic · Mathematics 2019-03-05 Jennifer Chubb , Russell Miller , Reed Solomon

The goal of this article is to establish tauberian theorems for the $k$--summability processes defined by germs of analytic functions in several complex variables. The proofs are based on the tauberian theorems for $k$--summability in one…

Complex Variables · Mathematics 2020-05-12 Sergio A. Carrillo , Jorge Mozo-Fernández , Reinhard Schäfke

We show that every strongly jump-traceable set obeys every benign cost function. Moreover, we show that every strongly jump-traceable set is computable from a computably enumerable strongly jump-traceable set. This allows us to generalise…

Logic · Mathematics 2011-10-10 David Diamondstone , Noam Greenberg , Daniel Turetsky

We demonstrate that topological defects in a rational conformal field theory can be described by a classifying algebra for defects - a finite-dimensional semisimple unital commutative associative algebra whose irreducible representations…

High Energy Physics - Theory · Physics 2010-11-23 Jurgen Fuchs , Christoph Schweigert , Carl Stigner

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Logic · Mathematics 2008-03-25 Wesley Calvert , Desmond Cummins , Sara Miller , Julia F. Knight

In [2] Su Gao proves that the following are equivalent for a countable $M$ (cf. theorem 1.2 too): (I)There is an uncountable model of the Scott sentence of $M$. (II) There exists some $j\in \overline{Aut(M)}\setminus Aut(M)$, where…

Logic · Mathematics 2015-06-09 Ioannis Souldatos

We prove a theorem about the derivation algebra of the tensor product of two algebras. As an application, we determine the derivation algebra of the fixed point algebra of the tensor product of two algebras, with respect to the tensor…

Quantum Algebra · Mathematics 2007-05-23 Saeid Azam

We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…

Computational Complexity · Computer Science 2015-02-23 Christoph Berkholz , Martin Grohe

Martin's Conjecture states that every definable function on the Turing degrees is either constant or increasing, and that every increasing function is an iterate of the Turing jump. This classification has already been corroborated for the…

Logic · Mathematics 2025-11-11 Antonio Nakid Cordero

There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the…

Logic · Mathematics 2014-12-16 Fedor Pakhomov

In this article we generalize a theorem of Benson for generalized quadrangles to strongly regular graphs and directed strongly regular graphs. The main result provides numerical restrictions on the number of fixed vertices and the number of…

Combinatorics · Mathematics 2014-11-14 S. De Winter , E. Kamischke , Z. Wang

Let $A$ be an $n$-dimensional algebra over a field $k$ and $a(A)$ its quantum symmetry semigroup. We prove that the automorphisms group ${\rm Aut}_{\rm Alg} (A)$ of $A$ is isomorphic to the group $U \bigl( G(a (A)^{\rm o} ) \bigl)$ of all…

Rings and Algebras · Mathematics 2022-03-28 G. Militaru

Let $A$ be a ring and $\sigma: A \to A$ a ring endomorphism. A generalized skew (or $\sigma$-)derivation of $A$ is an additive map $d: A \to A$ for which there exists a map $\delta:A \to A$ such that $d(xy)=\delta(x)y+\sigma(x)d(y)$ for all…

Operator Algebras · Mathematics 2019-07-09 Ilja Gogić

The Turing degree of a real measures the computational difficulty of producing its binary expansion. Since Turing degrees are tailsets, it follows from Kolmogorov's 0-1 law that for any property which may or may not be satisfied by any…

Logic · Mathematics 2011-11-07 George Barmpalias , Adam R. Day , Andrew E. M. Lewis

A result of Kaufmann shows that if $L_\alpha$ is countable, admissible and satisfies $\Pi_n\textsf{-Collection}$, then $\langle L_\alpha, \in \rangle$ has a proper $\Sigma_{n+1}$-elementary end extension. This paper investigates to what…

Logic · Mathematics 2022-01-14 Zachiri McKenzie
‹ Prev 1 3 4 5 6 7 10 Next ›