Related papers: Lattice induced threshold functions and Boolean fu…
The Fourier-Entropy Influence (FEI) Conjecture states that for any Boolean function $f:\{+1,-1\}^n \to \{+1,-1\}$, the Fourier entropy of $f$ is at most its influence up to a universal constant factor. While the FEI conjecture has been…
We construct a contour function for the entanglement entropies in generic harmonic lattices. In one spatial dimension, numerical analysis are performed by considering harmonic chains with either periodic or Dirichlet boundary conditions. In…
In this paper we model discontinuous extended real functions in pointfree topology following a lattice-theoretic approach, in such a way that, if $L$ is a subfit frame, arbitrary extended real functions on $L$ are the elements of the…
We prove that for any two lattices $L, M \subseteq \mathbb{R}^d$ of the same volume there exists a measurable, bounded, common fundamental domain of them. In other words, there exists a bounded measurable set $E \subseteq \mathbb{R}^d$ such…
We show that sharp thresholds for Boolean functions directly imply average-case circuit lower bounds. More formally we show that any Boolean function exhibiting a sharp enough threshold at \emph{arbitrary} critical density cannot be…
Recent results of Bucciarelli show that the semilattice of degrees of parallelism of first-order boolean functions in PCF has both infinite chains and infinite antichains. By considering a simple subclass of Sieber's sequentiality…
Threshold phenomena are investigated using a general approach, following Talagrand [Ann. Probab. 22 (1994) 1576--1587] and Friedgut and Kalai [Proc. Amer. Math. Soc. 12 (1999) 1017--1054]. The general upper bound for the threshold width of…
A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a…
We introduce a general class of (quasi-)interpolants of functions defined on a Bravais lattice, and establish several technical results for these interpolants that are crucial ingredients in the analysis of atomistic models and…
Classification of Non-linear Boolean functions is a long-standing problem in the area of theoretical computer science. In this paper, effort has been made to achieve a systematic classification of all n-variable Boolean functions, where…
We study centralizer clones of finite lattices and semilattices. For semilattices, we give two characterizations of the centralizer and also derive formulas for the number of operations of a given essential arity in the centralizer. We also…
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…
Boolean functional synthesis is the process of constructing a Boolean function from a Boolean specification that relates input and output variables. Despite significant recent developments in synthesis algorithms, Boolean functional…
In quantum field theories defined on a spacetime with boundaries, the entanglement entropy exhibits subleading, boundary-induced corrections to the ubiquitous area law. At critical points described by conformal field theories (CFTs), and…
We give the first non-trivial upper bounds on the average sensitivity and noise sensitivity of degree-$d$ polynomial threshold functions (PTFs). These bounds hold both for PTFs over the Boolean hypercube and for PTFs over $\R^n$ under the…
Correlation functions play an important role for the theoretical and experimental characterization of many-body systems. In solid-state systems, they are usually determined through scattering experiments whereas in cold-gases systems,…
In this paper we will establish necessary and sufficient conditions for a Laplace-Carleson embedding to be bounded for certain spaces of functions on the positive half-line. We will use these results to characterise weighted (infinite-time)…
We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…
A lattice of integers is the collection of all linear combinations of a set of vectors for which all entries of the vectors are integers and all coefficients in the linear combinations are also integers. Lattice reduction refers to the…
We investigate the representation of lattices as sublattices of the lattice of all convex subsets (intervals) of a linearly ordered set $(X,\le)$. We introduce the purely lattice-theoretic notion of a \textit{loc-lattice} and prove that…