Related papers: Boolean degree 1 functions on some classical assoc…
We study a question on characterizing polynomials among rational functions of degree $>1$ on the projective line over an algebraically closed field that is complete with respect to a non-trivial and non-archimedean absolute value, from the…
In this paper we introduce the study of quantum boolean functions, which are unitary operators f whose square is the identity: f^2 = I. We describe several generalisations of well-known results in the theory of boolean functions, including…
This article is devoted to the study of Jack connection coefficients, a generalization of the connection coefficients of the classical commutative subalgebras of the group algebra of the symmetric group closely related to the theory of Jack…
We prove that almost every level set of a Sobolev function in a planar domain consists of points, Jordan curves, or homeomorphic copies of an interval. For monotone Sobolev functions in the plane we have the stronger conclusion that almost…
Poisson algebra is usually defined to be a commutative algebra together with a Lie bracket, and these operations are required to satisfy the Leibniz rule. We describe Poisson structures in terms of a single bilinear operation. This enables…
We will study some important properties of Boolean functions based on newly introduced concepts called Special Decomposition of a Set and Special Covering of a Set. These concepts enable us to study important problems concerning Boolean…
We find a strong separation between two natural families of simple rank one theories in Keisler's order: the theories $T_\mathfrak{m}$ reflecting graph sequences, which witness that Keisler's order has the maximum number of classes, and the…
We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…
We define a measure for the complexity of Boolean functions related to their implementation in neural networks, and in particular close related to the generalization ability that could be obtained through the learning process. The measure…
This is the first installment in a series of papers devoted to examining certain aspects of the asymptotic value distribution and distribution of zeros manifested by members of a broad class of linear combinations of L-functions in the…
We study in detail the one-variable local theory of functions holomorphic over a finite-dimensional commutative associative unital $\mathbb{C}$-algebra $\mathcal{A}$, showing that it shares a multitude of features with the classical…
A classical result of Rothschild and van Lint asserts that if every non-zero Fourier coefficient of a Boolean function $f$ over $\mathbb{F}_2^{n}$ has the same absolute value, namely $|\hat{f}(\alpha)|=1/2^k$ for every $\alpha$ in the…
In classical function theory, a function is holomorphic if and only if it is complex analytic. For higher dimensional spaces it is natural to work in the context of Clifford algebras. The structures of these algebras depend on the parity of…
Let F(R^n) be the algebra of Fourier transforms of functions from L_1(R^n), K(R^n) be the algebra of Fourier transforms of bounded complex Borel measures in R^n and W be Wiener algebra of continuous 2pi-periodic functions with absolutely…
We investigate 1-factorisations in which the 2-regular graphs that occur as the union of a pair of 1-factors appear an equal number of times across the unions of all pairs of 1-factors in the 1-factorisation. We call such 1-factorisations…
A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some…
Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…
Entire functions in one complex variable are extremely relevant in several areas ranging from the study of convolution equations to special functions. An analog of entire functions in the quaternionic setting can be defined in the slice…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…