Related papers: Computably Enumerable Sets that are Automorphic to…
The Rogers semilattice of effective programming systems (epses) is the collection of all effective numberings of the partial computable functions ordered such that \theta\ is less than or equal to \psi\ whenever \theta-programs can be…
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…
We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.
Let $G$ be a simple algebraic group of exceptional type over an algebraically closed field of characteristic $p > 0$. This paper continues a long-standing effort to classify the connected reductive subgroups of $G$. Having previously…
We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…
One way of studying a relational structure is to investigate functions which are related to that structure and which leave certain aspects of the structure invariant. Examples are the automorphism group, the self-embedding monoid, the…
An open (resp., closed) subset A of a topological space (X, T ) is called C-open (resp., C-closed) set if cl(A) \ A (resp., A \ int(A)) is a countable set. This paper aims to present the concept of C-open and C-closed sets. We first…
In the first half of this paper, we study the way that sets of real numbers closed under Turing equivalence sit inside the real line from the perspective of algebra, measure and order. Afterwards, we combine the results from our study of…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
Given partial information about a set, we are interested in fully recovering the original set from what is given. If a set encodes itself robustly, any partial information about the set suffices to fully recover the information about the…
We consider the arithmetic complexity of index sets of uniformly computably enumerable families learnable under different learning criteria. We determine the exact complexity of these sets for the standard notions of finite learning,…
We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…
We study automorphisms and representations of quasi polynomial algebras (QPAs) and quasi Laurent polynomial algebras (QLPAs). For any QLPA defined by an arbitrary skew symmetric integral matrix, we explicitly describe its automorphism…
Given any strong orbit equivalence class of minimal Cantor systems and any cardinal number that is finite, countable, or the continuum, we show that there exists a minimal subshift within the given class whose number of asymptotic…
A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…
In this paper, we study definably compact semigroups in o-minimal structures, aiming to extend the theory of definable groups to a broader algebraic setting. We show that any definably compact semigroup contains idempotents and admits a…
Let $\mathbf{K}$ be the class of countable structures $M$ with the strong small index property and locally finite algebraicity, and $\mathbf{K}_*$ the class of $M \in \mathbf{K}$ such that $acl_M(\{ a \}) = \{ a \}$ for every $a \in M$. For…
Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…
We investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group…