Related papers: The complexity of completions in partial combinato…
We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…
The finite-dimensional restricted simple Lie algebras of characteristic p > 5 are classical or of Cartan type. The classical algebras are analogues of the simple complex Lie algebras and have a well-advanced representation theory with…
This is an expository account of completion and local cohomology in brave new commutative algebra, especially as it applies to completion theorems and their duals in equivariant topology. The first part is fairly direct, but the second…
We discuss a selection of recent developments in arithmetic combinatorics having to do with ``approximate algebraic structure'' together with some of their applications.
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
Let $(P_1,...,P_n)$ be an $n$--tuple of projections in a unital $C^*$--algebra $\aa$. We say $\pn$ is complete in $\aa$ if $\aa$ is the linear direct sum of the closed subspaces $P_1\aa,...,P_n\aa$. In this paper, we give some necessary and…
This is the first of a series of papers in which we study deep computations (ultracomputations) and deep iterates, formalizing the ideas of "asymptotic limit" of computations and compositional iterates, respectively. In this first paper of…
In this paper we study noncommutative plane curves, i.e. non-commutative k-algebras for which the 1-dimensional simple modules form a plane curve. We study extensions of simple modules and we try to enlighten the completion problem, i.e.…
We classify $n$-representation infinite algebras $\Lambda$ of type \~A. This type is defined by requiring that $\Lambda$ has higher preprojective algebra $\Pi_{n+1}(\Lambda) \simeq k[x_1, \ldots, x_{n+1}] \ast G$, where $G \leq…
We introduce the notion of non commutative truncated polynomial extension of an algebra A. We study two families of these extensions. For the first one we obtain a complete classification and for the second one, which we call upper…
Quadratic algebras are generalizations of Lie algebras; they include the symmetry algebras of 2nd order superintegrable systems in 2 dimensions as special cases. The superintegrable systems are exactly solvable physical systems in classical…
Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…
We consider here the problem of obtaining reliable, consistent information from inconsistent databases -- databases that do not have to satisfy given integrity constraints. We use the notion of consistent query answer -- a query answer…
Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…
Randomized higher-order computation can be seen as being captured by a lambda calculus endowed with a single algebraic operation, namely a construct for binary probabilistic choice. What matters about such computations is the probability of…
We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal role in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the…
Several classes of DNR functions are characterized in terms of Kolmogorov complexity. In particular, a set of natural numbers A can wtt-compute a DNR function iff there is a nontrivial recursive lower bound on the Kolmogorov complexity of…
We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…
We present a theory that produces several examples where the homotopy Lie algebra of a complex hyperplane arrangement is not finitely presented. We also present examples of hyperplane arrangements where the enveloping algebra of this Lie…
We sketch a tentative proof of P-completeness for the $\beta$-convertibility problem on untyped planar (a.k.a. ordered or non-commutative) $\lambda$-terms.