Related papers: Varieties with Definable Factor Congruences

Formal concept analysis (FCA) is a useful mathematical tool for obtaining information from relational datasets. One of the most interesting research goals in FCA is the selection of the most representative variables of the dataset, which is…

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

We study the problem of completely automatically verifying uninterpreted programs---programs that work over arbitrary data models that provide an interpretation for the constants, functions and relations the program uses. The verification…

Suppose B is the unital algebra consisting of the algebraic product of full matrix algebras over an index set X. A bijection is set up between the equivalence classes of irreducible representations of B as operators on a Banach space and…

A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…

Let $F$ be a field, $p$ a prime number, $X$ an indeterminate over $F$, $D_n =F[X^{\frac{1}{p^n}}, X^{-\frac{1}{p^n}}]$ for each integer $n \geq 0$ and $D = \bigcup\limits_{n\in\mathbb{N}_0}D_n.$ Then $D$ is a one-dimensional B{\'e}zout…

A braided fusion category is said to have Property $\textbf{F}$ if the associated braid group representations factor over a finite group. We verify integral metaplectic modular categories have property $\textbf{F}$ by showing these…

A system of linear dependent types for the lambda calculus with full higher-order recursion, called dlPCF, is introduced and proved sound and relatively complete. Completeness holds in a strong sense: dlPCF is not only able to precisely…

For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…

Let the finite distributive lattice $D$ be isomorphic to the congruence lattice of a finite lattice $L$. Let $Q$ denote those elements of $D$ that correspond to principal congruences under this isomorphism. Then $Q$ contains $0,1 \in D$ and…

We study star product algebras of analytic functions for which the power series defining the products converge absolutely. Such algebras arise naturally in deformation quantization theory and in noncommutative quantum field theory. We…

We affirm a conjecture of Sacks [1972] by showing that every countable distributive lattice is isomorphic to an initial segment of the hyperdegrees, $\mathcal{D}_{h}$. In fact, we prove that every sublattice of any hyperarithmetic lattice…

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…

This paper presents a framework designed to tackle a range of planning problems arise in manipulation, which typically involve complex geometric-physical reasoning related to contact and dynamic constraints. We introduce the Contact Factor…

It is known that a category of many-sorted algebras on pure sets of similarity type is "concretely equivalent" to a category of single-sorted algebras. In this paper, we characterize a single-sorted variety that corresponds to a many-sorted…

Collaborative filtering is one of the most popular techniques in designing recommendation systems, and its most representative model, matrix factorization, has been wildly used by researchers and the industry. However, this model suffers…

In a previous work the authors gave a conceptual explanation for the linearity of the Weil representation over a finite field k of odd characteristic: There exists a canonical system of intertwining operators between the Lagrangian models…

We investigate the Reidemeister spectrum of direct products of nilpotent groups. More specifically, we prove that the Reidemeister spectra of the individual factors yield complete information for the Reidemeister spectrum of the direct…

This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…

Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. Criteria are given which characterize existence of a fine or coarse moduli space classifying, up to isomorphism, the representations of $\Lambda$ with fixed…