English
Related papers

Related papers: Clones of Borel Boolean Functions

200 papers

In this paper, we study nullity-2 toroidal extended affine Lie algebras in the context of vertex algebras and their $\phi$-coordinated modules. Among the main results, we introduce a variant of toroidal extended affine Lie algebras,…

Quantum Algebra · Mathematics 2021-02-23 Fulin Chen , Haisheng Li , Shaobin Tan

The general Galois theory for functions and relational constraints over arbitrary sets described in the authors' previous paper is refined by imposing algebraic conditions on relations.

Combinatorics · Mathematics 2009-02-10 Miguel Couceiro , Stephan Foldes

In this paper we give an infinite class of finite simple right Bol loops of exponent 2. The right multiplication group of these loops is an extension of an elementary Abelian 2-group by $S_5$. The construction uses the description of the…

Group Theory · Mathematics 2007-10-01 Gabor P. Nagy

We construct a completely normal bounded distributive lattice D in which for every pair (a, b) of elements, the set {x $\in$ D | a $\le$ b $\lor$ x} has a countable coinitial subset, such that D does not carry any binary operation -…

Rings and Algebras · Mathematics 2019-05-15 Friedrich Wehrung

We provide a finite basis for the class of Borel functions that are not in the first Baire class, as well as the class of Borel functions that are not $\sigma$-continuous with closed witnesses.

Logic · Mathematics 2020-02-26 Raphaël Carroy , Benjamin D. Miller

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

We give a complete classification of the factorial functions of Eulerian binomial posets. The factorial function B(n) either coincides with $n!$, the factorial function of the infinite Boolean algebra, or $2^{n-1}$, the factorial function…

Combinatorics · Mathematics 2017-05-30 Richard Ehrenborg , Margaret A. Readdy

We prove that all functions obeying the Kramers-Kronig relations can be approximated as superpositions of Lorentzian functions, to any precision. As a result, the typical text-book analysis of dielectric dispersion response functions in…

Optics · Physics 2013-10-16 Christopher A. Dirdal , Johannes Skaar

For each $N$ an infinite number of Conformal Field Theories is presented that has the same fusion rules as SO(N) level 2. These new theories are obtained as extensions of the chiral algebra of $SO(NM^2)$ level 2, and correspond to new…

Quantum Algebra · Mathematics 2014-11-18 A. N. Schellekens

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.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

We show (almost) separation between certain important classes of Boolean functions. The technique that we use is to show that the total influence of functions in one class is less than the total influence of functions in the other class. In…

Computational Complexity · Computer Science 2020-10-23 Aniruddha Biswas , Palash Sarkar

This paper introduces a categorical framework to study the exact and approximate semantics of probabilistic programs. We construct a dagger symmetric monoidal category of Borel kernels where the dagger-structure is given by Bayesian…

Logic in Computer Science · Computer Science 2018-03-09 Fredrik Dahlqvist , Vincent Danos , Ilias Garnier , Alexandra Silva

Let $G$ be the unramified unitary group $U(2, 1)(E/F)$ defined over a non-archimedean local field $F$ of odd residue characteristic $p$, and $B$ be the standard Borel subgroup of $G$. In this note, we study the problem of the restriction of…

Representation Theory · Mathematics 2025-03-25 Peng Xu

Dualization of a monotone Boolean function on a finite lattice can be represented by transforming the set of its minimal 1 to the set of its maximal 0 values. In this paper we consider finite lattices given by ordered sets of their meet and…

Logic in Computer Science · Computer Science 2015-12-31 Mikhail A. Babin , Sergei O. Kuznetsov

Let $E\subseteq F$ and $E'\subseteq F'$ be Borel equivalence relations on the standard Borel spaces $X$ and $Y$, respectively. The pair $(E,F)$ is simultaneously Borel reducible to the pair $(E',F')$ if there is a Borel function $f:X\to Y$…

Logic · Mathematics 2014-09-22 Scott Schneider

The main result is that the category of ordinary modules of an affine vertex operator algebra of a simply laced Lie algebra at admissible level is rigid and thus a braided fusion category. If the level satisfies a certain coprime property…

Quantum Algebra · Mathematics 2018-07-03 Thomas Creutzig

We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…

Logic · Mathematics 2009-05-19 Jaap van Oosten

The symmetric difference in Boolean lattices can be defined in two different but equivalent forms. However, it can be introduced also in every bounded lattice with complementation where these two forms need not coincide. We study lattices…

Rings and Algebras · Mathematics 2025-06-26 Václav Cenker , Ivan Chajda , Helmut Länger

Extended affine Weyl groups are the Weyl groups of extended affine root systems. Finite presentations for extended affine Weyl groups are known only for nullities $\leq 2$, where for nullity 2 there is only one known such presentation. We…

Representation Theory · Mathematics 2007-05-23 Saeid Azam , Valiollah Shahsanaei

Constructive meaning is given to the assertion that every finite Boolean algebra is an injective object in the category of distributive lattices. To this end, we employ Scott's notion of entailment relation, in which context we describe…

Logic in Computer Science · Computer Science 2023-06-22 Davide Rinaldi , Daniel Wessel