相关论文: On a quasi-ordering on Boolean functions

Admissible orders play a key role in ranking subintervals of the unit interval. In 2013, Bustince et al. proposed constructing such relations by means of admissible pairs of aggregation functions. The only significant example in the…

Given a bounded open set $\Omega\subset \mathbb{R}^n$, we study sequences of quadratic functionals on the Sobolev space $H^1_0(\Omega)$, perturbed by sequences of bounded linear functionals. We prove that their $\Gamma$-limits, in the weak…

A function $u: X\to\mathbb{R}$ defined on a partially ordered set is quasi-Leontief if, if for all $x\in X$, the upper level set $\{x^\prime\in X: u(x^\prime)\geqslant u(x)\} $ has a smallest element. A function $u:…

We consider negabent Boolean functions that have Trace representation. We completely characterize quadratic negabent monomial functions. We show the relation between negabent functions and bent functions via a quadratic function. Using this…

We study when partial Boolean functions can (and cannot) exhibit superpolynomial quantum query speedups, and develop a general framework for ruling out such speedups via two complementary lenses: promise-aware complexity measures and…

We study the complexity of approximate representation and learning of submodular functions over the uniform distribution on the Boolean hypercube $\{0,1\}^n$. Our main result is the following structural theorem: any submodular function is…

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…

We prove that if there is a dominating family of size ${\aleph}_{1}$, then there is are ${\aleph}_{1}$ many compact subsets of ${\omega}^{\omega}$ whose union is a maximal almost disjoint family of functions that is also maximal with…

Infamously, the finite and unrestricted implication problems for the classes of i) functional and inclusion dependencies together, and ii) embedded multivalued dependencies alone are each undecidable. Famously, the restriction of i) to…

Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…

We introduce and study a new class of generalized convex functions termed star quasiconvex functions. This class includes convex, star-convex, quasiconvex, quasar-convex, and positively homogeneous functions of any degree $p>0$ as special…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

We know extensions of first order logic by quantifiers of the kind "there are uncountable many ...", "most ..." with new axioms and appropriate semantics. Related are operations such as "set of x, such that ...", Hilbert's…

For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…

We construct an uncountable family of well-quasi-ordered permutation classes, each with a distinct enumeration sequence. This disproves a conjecture that all well-quasi-ordered permutation classes have algebraic generating functions, and in…

Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…

This expository article is devoted to the notion of quasianalytic classes and the Borel mapping. Although quasianalytic classes are well known in analysis since several decades. We are interested in certain properties of Denjoy-Carleman's…

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…

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…