Related papers: On the Expressive Power of First-Order Boolean Fun…
We show that in a rank supersolvable lattice that is graded by a bounded real interval, any antichain cutset is a level set for some appropriately constructed grading. As a consequence, given an antichain cutset in any of the measurable…
We study sublevel set and superlevel set persistent homology on discrete functions through the perspective of finite ordered sets of both linearly ordered and cyclically ordered domains. Finite ordered sets also serve as the codomain of our…
We give a new characterization of the Baire class 1 functions (defined on an ultrametric space) by proving that they are exactly the pointwise limits of sequences of full functions (which are particularly simple Lipschitz functions).…
Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the…
A specialization semilattice is a semilattice together with a coarser preorder satisfying a compatibility condition. We show that the category of specialization semilattices is isomorphic to the category of semilattices with a congruence,…
Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through…
Multiphase ranking functions (M$\Phi$RFs) are tuples $\langle f_1,\ldots,f_d \rangle$ of linear functions that are often used to prove termination of loops in which the computation progresses through a number of "phases". Our work provides…
This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…
In this paper we obtain several new complete characterizations of pseudolinear functions. Two of the results are of first-order and one is derivative free. All results are derived in terms of the Clarke-Rockafellar subdifferential.…
In the first section of the present work, we introduce the concept of pseudocomplementation for semirings and show semiring version of some known results in lattice theory. We also introduce semirings with pc-functions and prove some…
We consider spline functions over simplicial meshes in $\RR^n$. We assume that the spline pieces join together with some finite order of smoothness but the pieces themselves are infinitely smooth. Such splines can have extra orders of…
We investigate the lattice of clones that are generated by a set of functions that are induced on a finite field $\mathbb{F}$ by monomials. We study the atoms and coatoms of this lattice and investigate whether this lattice contains…
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…
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 study functional clones, which are sets of non-negative pseudo-Boolean functions (functions $\{0,1\}^k\to\mathbb{R}_{\geq 0}$) closed under (essentially) multiplication, summation and limits. Functional clones naturally form a lattice…
Boolean spaces with internal semigroups generalize profinite semigroups and are pertinent for the recognition of not-necessarily regular languages. Via recognition, the study of existential quantification in logic on words amounts to the…
The hypergraph states are pure multipartite quantum states corresponding to a hypergraph. It is an equal superposition of the states belonging to the computational basis. Given any hypergraph, we can construct a hypergraph state determined…
We study the extremal competitive ratio of Boolean function evaluation. We provide the first non-trivial lower and upper bounds for classes of Boolean functions which are not included in the class of monotone Boolean functions. For the…
The Boolean lattice $2^{[n]}$ is the power set of $[n]$ ordered by inclusion. A chain $c_{0}\subset...\subset c_{k}$ in $2^{[n]}$ is rank-symmetric, if $|c_{i}|+|c_{k-i}|=n$ for $i=0,...,k$; and it is symmetric, if $|c_{i}|=(n-k)/2+i$. We…
It is argued that the electron stripes as found in correlated oxides have to do with an unrecognized form of order. The manifestation of this order is the robust property that the charge stripes are at the same time anti-phase boundaries in…