Related papers: On the Expressive Power of First-Order Boolean Fun…
We show that the theories of partially ordered sets, lattices, semilattices, Boolean algebras, Heyting algebras with a further coarser partial order, or a linearization, or an auxiliary relation have the strong amalgamation property,…
We provide a first-order homogenization result for quadratic functionals. In particular, we identify the scaling of the energy and the explicit form of the limiting functional in terms of the first-order correctors. The main novelty of the…
A filter lattice is a distributive lattice formed by all filters of a poset in the anti-inclusion order. We study the combinatorial properties of the Hasse diagrams of filter lattices of certain posets, so called Fibonacci-like cubes, in…
Every partial function from bit strings of a given length to bit strings of a possibly different given length can be computed by a finite instruction sequence that contains only instructions to set and get the content of Boolean registers,…
We study a fine hierarchy of Borel-piecewise continuous functions, especially, between closed-piecewise continuity and $G_\delta$-piecewise continuity. Our aim is to understand how a priority argument in computability theory is connected to…
Program semantics can often be expressed as a (many-sorted) first-order theory S, and program properties as sentences $\varphi$ which are intended to hold in the canonical model of such a theory, which is often incomputable. Recently, we…
In this paper we extend some previous results on weak pseudo-bosons and on their related bi-coherent states. The role of {\em compatible} functions is discussed in details, and some examples are considered. The pseudo-bosonic ladder…
The characterization of level sets of finite Boolean lattices as antichain cutsets, due to Rival and Zaguia, is seen to hold in all discrete semimodular lattices.
We investigate a system of harmonically coupled identical nonlinear constituents subject to noise in different spatial arrangements. For global coupling we find for infinitely many constituents the coexistence of several ergodic components…
Given a total sequence in a Hilbert space, we speak of an upper (resp. lower) semi-frame if only the upper (resp. lower) frame bound is valid. Equivalently, for an upper semi-frame, the frame operator is bounded, but has an unbounded…
In this work we give a characterisation of first order phase transitions as equilibrium processes on the thermodynamic phase space for which the Legendre symmetry is broken. Furthermore, we consider generalised theories of thermodynamics,…
A structural condition is given for finite maximal antichains in the homomorphism order of relational structures to have the splitting property. It turns out that non-splitting antichains appear only at the bottom of the order. Moreover, we…
We examine a hierarchy of equivalence classes of quasi-random properties of Boolean Functions. In particular, we prove an equivalence between a number of properties including balanced influences, spectral discrepancy, local strong…
We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of…
In recent years, progress toward the classification of superintegrable systems with higher order integrals of motion has been made. In particular, a complete classification of all exotic potentials with a third or a fourth order integrals,…
In this paper, we establish a new inequality tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We…
We investigate the functional form of the order-parameter (two-point) correlation function in quantum critical phenomena. Contrary to the common lore, when there is no particle-hole symmetry we find that the equal-time correlation function…
We consider semiflows in general Banach spaces motivated by monotone cyclic feedback systems or differential equations with integer-valued Lyapunov functionals. These semiflows enjoy strong monotonicity properties with respect to cones of…
Notions of ordinal submodularity/supermodularity have been introduced and studied in the literature. We consider several classes of ordinally submodular functions defined on finite Boolean lattices and give characterizations of the set of…
Semisort is a fundamental algorithmic primitive widely used in the design and analysis of efficient parallel algorithms. It takes input as an array of records and a function extracting a \emph{key} per record, and reorders them so that…