Related papers: Clonoids of Boolean functions with a monotone or d…
We study unary parts of centraliser clones on the set $\{0,1,2,3\}$, so-called centralising monoids. We describe and count all centralising monoids on the set $\{0,1,2,3\}$ having majority operations as witnesses, and we list the inclusion…
We analyze topological objects in pure gluonic $SU(2)$ lattice gauge theory and compute correlation functions between instantons and monopoles. Concerning the instantons we use geometric and field theoretic definitions of the topological…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
We discuss some problems posed by Ciesielski. For example we show that, consistently, d_c is a singular cardinal and e_c<d_c. Next we prove that the Martin Axiom for sigma --centered forcing notions implies that for every function f:R^2…
A characteristic function is a special operator-valued analytic function defined on the open unit ball of $\mathbb{C}^n$ associated with an $n$-tuple of commuting row contraction on some Hilbert space. In this paper, we continue our study…
We show that Boolean functions expressible as monotone disjunctive normal forms are PAC-evolvable under a uniform distribution on the Boolean cube if the hypothesis size is allowed to remain fixed. We further show that this result is…
We study monotonicity and other properties of the canonical c-function (defined through the correlator of the energy-momentum tensor) in some holographic duals of 4-d quantum field theories. The canonical c-function and its derivatives are…
We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…
The Sensitivity Conjecture, posed in 1994, states that the fundamental measures known as the sensitivity and block sensitivity of a Boolean function f, s(f) and bs(f) respectively, are polynomially related. It is known that bs(f) is…
There are a great many clone detection tools proposed in the literature. In this paper, we investigate the state of clone detection tool evaluation. We begin by surveying the clone detection benchmarks, and performing a multi-faceted…
Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we…
The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Mikl\"os and Singhi. We study the fundamentals properties of such lattices and of a…
We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…
We investigate the complexity of the lattice of local clones over a countably infinite base set. In particular, we prove that this lattice contains all algebraic lattices with at most countably many compact elements as complete sublattices,…
We address the problem of finding optimal strategies for computing Boolean symmetric functions. We consider a collocated network, where each node's transmissions can be heard by every other node. Each node has a Boolean measurement and we…
This paper considers the problem of approximating a Boolean function $f$ using another Boolean function from a specified class. Two classes of approximating functions are considered: $k$-juntas, and linear Boolean functions. The $n$ input…
We define tests of boolean functions which distinguish between linear (or quadratic) polynomials, and functions which are very far, in an appropriate sense, from these polynomials. The tests have optimal or nearly optimal trade-offs between…
Action operads and cloning systems are, respectively, the main ingredients in two approaches for axiomatically constructing Thompson-like groups due to Thumann and Witzel-Zaremsky. In this paper, we prove that action operads are equivalent…
We show that for any constant $c>0$, any (two-sided error) adaptive algorithm for testing monotonicity of Boolean functions must have query complexity $\Omega(n^{1/2-c})$. This improves the $\tilde\Omega(n^{1/3})$ lower bound of [CWX17] and…
Near every point of a real-analytic set in $\mathbb R^n$, we make use of Hironaka's resolution of singularity theorem to construct a family of continuous functions in $W^{1, 1}_{loc}$ such that their weak derivatives have (removable)…