中文
相关论文

相关论文: Near-unanimity-closed minions of Boolean functions

200 篇论文

The 93 minions of Boolean functions stable under left composition with the clone of self-dual monotone functions are described. As an easy consequence, all $(C_1,C_2)$-stable classes of Boolean functions are determined for an arbitrary…

环与代数 · 数学 2021-02-04 Erkko Lehtonen

A clonoid is a set of finitary functions from a set $A$ to a set $B$ that is closed under taking minors. Hence clonoids are generalizations of clones. By a classical result of Post, there are only countably many clones on a 2-element set.…

环与代数 · 数学 2019-09-20 Athena Sparks

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…

范畴论 · 数学 2025-01-28 Antonio Bucciarelli , Pierre-Louis Curien , Antonino Salibra

Clonoids are sets of finitary functions from an algebra $\mathbb{A}$ to an algebra $\mathbb{B}$ that are closed under composition with term functions of $\mathbb{A}$ on the domain side and with term functions of $\mathbb{B}$ on the codomain…

环与代数 · 数学 2024-04-17 Peter Mayr , Patrick Wynne

Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all…

环与代数 · 数学 2007-05-23 Michael Pinsker

We describe the ordering of a class of clones by minion homomorphisms, also known as minor preserving maps or height 1 clone homomorphisms. The class consists of all clones on finite sets determined by binary relations whose projections to…

组合数学 · 数学 2024-09-13 Libor Barto , Maryia Kapytka

Extending Sparks's theorem, we determine the cardinality of the lattice of $(C_1,C_2)$-clonoids of Boolean functions for certain pairs $(C_1,C_2)$ of clones of essentially unary, linear, or $0$- or $1$-separating functions or semilattice…

组合数学 · 数学 2024-12-03 Erkko Lehtonen

The approximate degree of a Boolean function is the minimum degree of real polynomial that approximates it pointwise. For any Boolean function, its approximate degree serves as a lower bound on its quantum query complexity, and generically…

计算复杂性 · 计算机科学 2023-05-23 Mark Bun , Nadezhda Voronova

Extending Sparks's theorem, we determine the cardinality of the lattice of $(C_1,C_2)$-clonoids of Boolean functions in the cases where the target clone $C_2$ is the clone of projections. Moreover, we explicitly describe the…

组合数学 · 数学 2024-07-01 Erkko Lehtonen

We study closure properties for the Littlestone and threshold dimensions of binary hypothesis classes. Given classes $\mathcal{H}_1, \ldots, \mathcal{H}_k$ of Boolean functions with bounded Littlestone (respectively, threshold) dimension,…

机器学习 · 计算机科学 2020-07-08 Badih Ghazi , Noah Golowich , Ravi Kumar , Pasin Manurangsi

It is shown that monotone Boolean functions on the Boolean cube capture the expected number of primes, under he usual identification by binary expansion. This answers a question posed by G.Kalai.

数论 · 数学 2012-11-30 Jean Bourgain

We consider clones on countable sets. If such a clone has quasigroup operations, is locally closed and countable, then there is a function $f : \mathbb{N} \to \mathbb{N}$ such that the $n$-ary part of $C$ is equal to the $n$-ary part of…

逻辑 · 数学 2019-09-04 Erhard Aichinger

A clone on a set X is a set of finitary functions on X which contains the projections and which is closed under composition. The set of all clones on X forms a complete algebraic lattice Cl(X). We obtain several results on the structure of…

环与代数 · 数学 2007-05-23 Michael Pinsker

We define and discuss properties of the class of unbounded operators which attain minimum modulus. We establish a relationship between this class and the class of norm attaining bounded operators and compare the properties of both. Also we…

泛函分析 · 数学 2019-04-10 S. H. Kulkarni , G. Ramesh

The r-th order nonlinearity of a Boolean function is the minimum number of elements that have to be changed in its truth table to arrive at a Boolean function of degree at most r. It is shown that the (suitably normalised) r-th order…

组合数学 · 数学 2013-08-15 Kai-Uwe Schmidt

We study a summability method called almost convergence for bounded measurable functions defined on a locally compact abelian group. We define almost convergence using topologically invariant means and exhibit two different kinds of…

泛函分析 · 数学 2023-09-12 Ryoichi Kunisada

We introduce a concept of approximately invertible elements in non-unital normed algebras which is, on one side, a natural generalization of invertibility when having approximate identities at hand, and, on the other side, it is a direct…

泛函分析 · 数学 2021-06-18 Kevin Esmeral , Hans G. Feichtinger , Ondrej Hutník , Egor A. Maximenko

Minimal thinness is a notion that describes the smallness of a set at a boundary point. In this paper, we provide tests for minimal thinness for a large class of subordinate killed Brownian motions in bounded C1,1 domains, C1,1 domains with…

概率论 · 数学 2015-11-23 Panki Kim , Renming Song , Zoran Vondracek

In this note we consider Boolean functions defined on the discrete cube equipped with a biased product probability measure. We prove that if the spectrum of such a function is concentrated on the first two Fourier levels, then the function…

组合数学 · 数学 2013-11-14 Piotr Nayar

We show that there exist unbounded functionals on the spaces of sequences that take at most one nonzero value on an arbitrary family of elements whose supports are pairwise disjoint.

泛函分析 · 数学 2025-12-09 Konstantin Storozhuk
‹ 上一页 1 2 3 10 下一页 ›