相关论文: Universal (and Existential) Nulls
We provide the first evidence for the inherent difficulty of finding complex sets with optimal proof systems. For this, we construct oracles $O_1$ and $O_2$ with the following properties, where $\mathrm{RE}$ denotes the class of recursively…
Faithful representations of regular $\ast$-rings and modular complemented lattices with involution within orthosymmetric sesquilinear spaces are studied within the framework of Universal Algebra. In particular, the correspondence between…
We propose unifying techniques from probabilistic databases and relational embedding models with the goal of performing complex queries on incomplete and uncertain data. We formalize a probabilistic database model with respect to which all…
We prove a noncommutative real Nullstellensatz for 2-step nilpotent Lie algebras that extends the classical, commutative real Nullstellensatz as follows: Instead of the real polynomial algebra $\mathbb R[x_1, \dots, x_d]$ we consider the…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
We present an approach to computing consistent answers to queries possibly involving an aggregation operator in databases operating under a star schema and possibly containing missing values and inconsistent data. Our approach is based on…
Based on the intuitive notion of convexity, we formulate a universal property defining interval objects in a category with finite products. Interval objects are structures corresponding to closed intervals of the real line, but their…
The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…
An effective quantum number determining with high accuracy the levels ordering in arbitrary centrally symmetric potentials for any space dimensionality is introduced and calculated by means of certain universal methods based on the known…
For exponentially closed ordinals $\alpha$, we consider recognizability of constructible subsets of $\alpha$ for $\alpha$-(w)ITRMs and their distribution in the constructible hierarchy. In particular, for $\alpha$-ITRMs, we show that, there…
We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…
In the binary hypothesis testing problem, it is well known that sequentiality in taking samples eradicates the trade-off between two error exponents, yet implementing the optimal test requires the knowledge of the underlying distributions,…
We study finite-dimensional representations of hyper loop algebras, i.e., the hyperalgebras over an algebraically closed field of positive characteristic associated to the loop algebra over a complex finite-dimensional simple Lie algebra.…
The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (infinite) omega-categorical templates, and relies on two…
It is well known that the R, the set of real numbers, is an abstract set, where almost all its elements cannot be described in any finite language. We investigate possible approaches to what might be called an epi-constructionist approach…
Recent work in data mining and related areas has highlighted the importance of the statistical assessment of data mining results. Crucial to this endeavour is the choice of a non-trivial null model for the data, to which the found patterns…
In analogy with the 290-Theorem of Bhargava-Hanke, a criterion set is a finite subset $C$ of the totally positive integers in a given totally real number field such that if a quadratic form represents all elements of $C$, then it…
The $C^{\ast}$-algebra $\mathcal{U}_{nc}(n)$ is the universal $C^{\ast}$-algebra generated by $n^2$ generators $u_{ij}$ that make up a unitary matrix. We prove that Kirchberg's formulation of Connes' embedding problem has a positive answer…
A new computational method that uses polynomial equations and dynamical systems to evaluate logical propositions is introduced and applied to Goedel's incompleteness theorems. The truth value of a logical formula subject to a set of axioms…
We are concerned with the nodal set of solutions to equations of the form \begin{equation*} -\Delta u = \lambda_+ \left(u^+\right)^{q-1} - \lambda_- \left(u^-\right)^{q-1} \quad \text{in $B_1$} \end{equation*} where $\lambda_+,\lambda_- >…