相关论文: Turing Degrees and Automorphism Groups of Substruc…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
We study the fixed point subalgebra of a certain class of lattice vertex operator algebras by an automorphism of order 3, which is a lift of a fixed-point-free isometry of the underlying lattice. We classify the irreducible modules for the…
We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…
It is a fairly known fact that most of the algebras appearing in the theory of rings of differential operators, quantized algebras of different kinds (including many quantum groups), regular algebras in projective non-commutative geometry,…
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$…
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
We adapt the classical notion of learning from text to computable structure theory. Our main result is a model-theoretic characterization of the learnability from text for classes of structures. We show that a family of structures is…
We introduce a strategy to study irreducible representations of automorphism groups of finite modules over local rings. We prove that these automorphism groups fit in a hierarchy that facilitates a stratification of their irreducible…
We study infinite dimensional tilting modules over a concealed canonical algebra of domestic or tubular type. In the domestic case, such tilting modules are constructed by using the technique of universal localization, and they can be…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…
The stratified structure of the configuration space $\mb G^N = G \times ... \times G$ reduced with respect to the action of $G$ by inner automorphisms is investigated for $G = SU(3) .$ This is a finite dimensional model coming from lattice…
In my Montreal lecture notes of 1988, it was suggested that the theory of linear quantum groups can be presented in the framework of the category of {\it quadratic algebras} (imagined as algebras of functions on "quantum linear spaces"),…
Four-dimensional twisted group lattices are used as models for space-time structure. Compared to other attempts at space-time deformation, they have two main advantages: They have a physical interpretation and there is no difficulty in…
We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…
Profinite semigroups are a generalization of finite semigroups that come about naturally when one is interested in considering free structures with respect to classes of finite semigroups. They also appear naturally through dualization of…
We investigate the general structure of the automorphism group and the Lie algebra of derivations of a finitely generated vertex operator algebra. The automorphism group is isomorphic to an algebraic group. Under natural assumptions, the…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
The problem of deciding whether CSP instances admit solutions has been deeply studied in the literature, and several structural tractability results have been derived so far. However, constraint satisfaction comes in practice as a…