Related papers: Boolean Factor Congruences and Property (*)

We prove the following result: Let K be a lattice, let D be a distributive lattice with zero, and let $\phi$: Con K $\to$ D be a {∨, 0}-homomorphism, where Conc K denotes the {∨, 0}-semilattice of all finitely generated…

In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…

We introduce a finiteness property for braided fusion categories, describe a conjecture that would characterize categories possessing this, and verify the conjecture in a number of important cases. In particular we say a category has F if…

Using the Feferman-Vaught Theorem, we prove that a definable subset of a product structure must be a Boolean combination of open sets, in the product topology induced by giving each factor structure the discrete topology. We prove a…

It is well known by analysts that a concept lattice has an exponential size in the data. Thus, as soon as he works with real data, the size of the concept lattice is a fundamental problem. In this chapter, we propose to investigate factor…

Given a noncommutative (nc) variety $\mathfrak{V}$ in the nc unit ball $\mathfrak{B}_d$, we consider the algebra $H^\infty(\mathfrak{V})$ of bounded nc holomorphic functions on $\mathfrak{V}$. We investigate the problem of when two algebras…

For a locally convex $^*$-algebra $A$ equipped with a fixed continuous $^*$-character $\varepsilon$, we define a cohomological property, called property $(FH)$, which is similar to character amenability. Let $C_c(G)$ be the space of…

We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…

Let B be a commutative B\'ezout domain B and let MSpec(B) be the maximal spectrum of B. We obtain a Feferman-Vaught type theorem for the class of B-modules. We analyse the definable sets in terms, on one hand, of the definable sets in the…

A fuzzy Boolean function is a map $f:\cube^n\to [0,1]$, where $n\in\mathbb N$. We introduce and compare three ways of saying that such a function has bounded complexity. The first is a sampling property: the value $f(x)$ can be recovered,…

Modules over a vertex operator algebra V give rise to sheaves of coinvariants on moduli of stable pointed curves. If V satisfies finiteness and semi-simplicity conditions, these sheaves are vector bundles. This relies on factorization, an…

The congruence subgroup property is established for the modular representations associated to any modular tensor category. This result is used to prove that the kernel of the representation of the modular group on the conformal blocks of…

We show that if $\mathsf V$ is a semigroup pseudovariety containing the finite semilattices and contained in $\mathsf {DS}$, then it has a basis of pseudoidentities between finite products of regular pseudowords if, and only if, the…

The {\em reticulation} of an algebra $A$ is a bounded distributive lattice whose prime spectrum of ideals (or filters), endowed with the Stone topology, is homeomorphic to the prime spectrum of congruences of $A$, with its own Stone…

We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…

We compare the forcing related properties of a complete Boolean algebra B with the properties of the convergences $\lambda_s$ (the algebraic convergence) and $\lambda_{ls}$ on B generalizing the convergence on the Cantor and Aleksandrov…

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…

Contents 1. Algebraicity criterion: statement 2. Proof of the algebraicity criterion. 3. Pseudoeffectivity and movable classes. 4. Harder-Narasimhan filtrations and pseudo-effectivity. 5. Pseudo-effectivity of relative canonical bundles. 6.…

We consider the factorisation problem for bialgebras: when a bialgebra $K$ factorises as $K=HL$, where $H$ and $L$ are algebras and coalgebras (but not necessarly bialgebras). Given two maps $R: H\ot L\to L\ot H$ and $W:L\ot H\to H\ot L$,…

Approximate Bayesian computation (ABC) methods have become increasingly prevalent of late, facilitating as they do the analysis of intractable, or challenging, statistical problems. With the initial focus being primarily on the practical…