Related papers: Boolean Operations, Joins, and the Extended Low Hi…

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…

Using a graph-theoretic approach, we derive a new sufficient condition for observability of a Boolean control network (BCN). Based on this condition, we describe two algorithms: the first selects a set of nodes so that observing this set…

It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

Larman showed that any closed subset of the plane with uncountable vertical cross-sections has aleph_1 disjoint Borel uniformizing sets. Here we show that Larman's result is best possible: there exist closed sets with uncountable…

Let $V$ be a finite set of size $n$. We consider real functions on the "slice" $\binom{V}{k}$, which are also known as functions in the Johnson scheme. For $I \subseteq J \subseteq V$, the characteristic function of the set of all…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

This paper is a contribution to the study of a quasi-order on the set $\Omega$ of Boolean functions, the \emph{simple minor} quasi-order. We look at the join-irreducible members of the resulting poset $\tilde{\Omega}$. Using a two-way…

An algebraic structure with two constants and one ternary operation, which is not completely commutative, is put forward to accommodate ternary Boolean algebras. When the ternary operation is interpreted as Church's conditioned disjunction,…

For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be expressed as a finite union of languages A*aA*bA*...A*cA*, where a,b,...,c are letters. The class L(1) is…

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…

We say that a set $S$ is $\Delta^0_{(n)}(X)$ if membership of $n$ in $S$ is a $\Delta^0_{n}(X)$ question, uniformly in $n$. A set $X$ is low for $\Delta$-Feiner if every set $S$ that is $\Delta^0_{(n)}(X)$ is also…

Higher-order networks are widely used to describe complex systems in which interactions can involve more than two entities at once. In this paper, we focus on inclusion within higher-order networks, referring to situations where specific…

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

A significant effort has been made to train neural networks that replicate algorithmic reasoning, but they often fail to learn the abstract concepts underlying these algorithms. This is evidenced by their inability to generalize to data…

We present an operator theoretic side of the story of squeezed states regardless the order of squeezing. For low order, that is for displacement (order 1) and squeeze (order 2) operators, we bring back to consciousness what is know or…

We show that the elasticity Hilbert complex with mixed boundary conditions on bounded strong Lipschitz domains is closed and compact. The crucial results are compact embeddings which follow by abstract arguments using functional analysis…

The notions of upper and lower exhausters are effective tools for the study of non smooth functions. There are many studies presenting optimality conditions for unconstrained and constrained cases. One can observe that optimality conditions…

In the early 1980s, Selman's seminal work on positive Turing reductions showed that positive Turing reduction to NP yields no greater computational power than NP itself. Thus, positive Turing and Turing reducibility to NP differ sharply…

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…