Related papers: Clonoids of Boolean functions with a linear source…

Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $\phi$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $\phi$ is,…

A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…

We shall explain here an idea to generalize classical complex analytic Kleinian group theory to any odd dimensional cases. For a certain class of discrete subgroups of $\PGL_{2n+1}(\C)$ acting on $\P^{2n+1}$, we can define their domains of…

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 investigate Boolean degree 1 functions for several classical association schemes, including Johnson graphs, Grassmann graphs, graphs from polar spaces, and bilinear forms graphs, as well as some other domains such as multislices (Young…

We obtain a criterion for an analytic subset of a Euclidean space to contain points of differentiability of a typical Lipschitz function, namely, that it cannot be covered by countably many sets, each of which is closed and purely…

We consider the problem of finding the set of classical polylogarithmic functions $\text{Li}_n$ with branching locus determined by the solution of $p_1\cdot p_2\cdot \ldots \cdot p_n=0$, where $p_1,\ldots, p_n$ are irreducible polynomials…

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…

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…

A Galois connection between clones and relational clones on a fixed finite domain is one of the cornerstones of the so-called algebraic approach to the computational complexity of non-uniform Constraint Satisfaction Problems (CSPs). Cohen…

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

To determine the dimension of null space of any given linearized polynomial is one of vital problems in finite field theory, with concern to design of modern symmetric cryptosystems. But, the known general theory for this task is much far…

In this paper, we propose an algebraic approach to determine whether two non-isomorphic caterpillar trees can have the same symmetric function generalization of the chromatic polynomial. On the set of all composition on integers, we…

Every partial algebra is the colimit of its total subalgebras. We prove this result for partial Boolean algebras (including orthomodular lattices) and the new notion of partial C*-algebras (including noncommutative C*-algebras), and…

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an…

The associativity property, usually defined for binary functions, can be generalized to functions of a given fixed arity n>=1 as well as to functions of multiple arities. In this paper, we investigate these two generalizations in the case…

This paper is inspired by the paper of Leonetti, Russo and Somaglia [\textit{Dense lineability and spaceability in certain subsets of $\ell_\infty$.} Bull. London Math. Soc., 55: 2283--2303 (2023)] and the lineability problems raised…

We study numerical integration of functions $f: \mathbb{R}^{s} \to \mathbb{R}$ with respect to a probability measure. By applying the corresponding inverse cumulative distribution function, the problem is transformed into integrating an…

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…

Even though a lattice and its sublattices have the same group of coincidence isometries, the coincidence index of a coincidence isometry with respect to a lattice $\Lambda_1$ and to a sublattice $\Lambda_2$ may differ. Here, we examine the…