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

We prove that the composition of a quasi-nearly subharmonic function and a quasiregular mappings of bounded multiplicity is quasi-nearly subharmonic. Also, we prove that if $u\circ f$ is quasi-nearly subharmonic for all quasi-nearly…

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…

Completions play an important r\^ole for studying structure by supplying elements that in some sense ``ought to be." Among these, the Dedekind-MacNeille completion is of particular importance. In 1968 Janowitz provided necessary and…

The approximate degree of a Boolean function f is the least degree of a real polynomial that approximates f pointwise to error at most 1/3. Approximate degree is known to be a lower bound on quantum query complexity. We resolve or nearly…

This paper is a contribution to the study of a quasi-order on the set $\Omega$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tilde{\Omega}$. Using a two-way…

We consider a countably generated and uniformly closed algebra of bounded functions. We assume that there is a lower semicontinuous, with respect to the supremum norm, quadratic form and that normal contractions operate in a certain sense.…

We introduce a concept of a quasi proximate order which is a generalization of a proximate order and allows us to study efficiently analytic functions whose order and lower order of growth are different. We prove an existence theorem of a…

Submodular function minimization is well studied, and existing algorithms solve it exactly or up to arbitrary accuracy. However, in many applications, such as structured sparse learning or batch Bayesian optimization, the objective function…

We give improved and almost optimal testers for several classes of Boolean functions on $n$ inputs that have concise representation in the uniform and distribution-free model. Classes, such as $k$-junta, $k$-linear functions, $s$-term DNF,…

The celebrated union-closed conjecture is concerned with the cardinalities of various subsets of the Boolean $d$-cube. The cardinality of such a set is equivalent, up to a constant, to its measure under the uniform distribution, so we can…

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 Boolean functions. Namely, when $C_1$ is a subclone (a proper subclone, resp.)…

We prove a lower bound for the Milnor number of function germ invariant with respect to a finite abelian group action. It is shown that this bound is tight for functions of arbitrarily many variables. We also prove the function germs that…

The main result is that the only non trivial closed ideal in the Banach algebra $L(L^p)$ of bounded linear operators on $L^p(0,1)$, $1\le p < \infty$, that has a left approximate identity is the ideal of compact operators. The algebra…

The concept of differential uniformity was recently extended to the $c$-differential uniformity. An interesting problem in this area is the construction of functions with low $c$-differential uniformity and a lot of research has been done…

The aim of this brief note is to offer another proof of a theorem of Hrushovski that approximate subgroups of GL_n(C) are almost nilpotent. This approach generalizes to uniformly non amenable groups.

A near permutation of a set is a bijection between two cofinite subsets, modulo coincidence on smaller cofinite subsets. Near permutations of a set form its near symmetric group. In this monograph, we define near actions as homomorphisms…

The algebra of so-called shifted symmetric functions on partitions has the property that for all elements a certain generating series, called the $q$-bracket, is a quasimodular form. More generally, if a graded algebra $A$ of functions on…

Elton's near unconditionality and quasi-greediness for largest coefficients are two properties of bases that made their appearance in functional analysis from very different areas of research. One of our aims in this note is to show that,…

An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…

The C-minor partial orders determined by the clones generated by a semilattice operation (and possibly the constant operations corresponding to its identity or zero elements) are shown to satisfy the descending chain condition.