Related papers: Counting unate and balanced monotone Boolean funct…
This paper studies the hazard-free formula complexity of Boolean functions. Our first result shows that unate functions are the only Boolean functions for which the monotone formula complexity of the hazard-derivative equals the hazard-free…
The use of charge balance functions in heavy-ion collision studies was initially proposed as a probe of delayed hadronization and two-stage quark production in these collisions. It later emerged that general balance functions can also serve…
In many classification tasks there is a requirement of monotonicity. Concretely, if all else remains constant, increasing (resp. decreasing) the value of one or more features must not decrease (resp. increase) the value of the prediction.…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…
In this paper, we obtain a new class of functions, which is developed via the Hermite--Hadamard inequality for convex functions. The well-known one-one correspondence between the class of operator monotone functions and operator connections…
We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…
The essential variables in a finite function $f$ are defined as variables which occur in $f$ and weigh with the values of that function. The number of essential variables is an important measure of complexity for discrete functions. When…
Scholars frequently use covariate balance tests to test the validity of natural experiments and related designs. Unfortunately, when measured covariates are unrelated to potential outcomes, balance is uninformative about key identification…
A common measure of a function's complexity is the count of its stationary points. For complicated functions, this count grows exponentially with the volume and dimension of their domain. In practice, the count is averaged over a class of…
The goal of this note is to construct a uniformly antisymmetric function f:R-> R with a bounded countable range. This answers Problem 1(b) of Ciesielski and Larson. (See also list of problems in Thomson and Problem 2(b) from Ciesielski's…
This paper is a survey of methods for solving smooth (strongly) monotone stochastic variational inequalities. To begin with, we give the deterministic foundation from which the stochastic methods eventually evolved. Then we review methods…
We consider collocated wireless sensor networks, where each node has a Boolean measurement and the goal is to compute a given Boolean function of these measurements. We first consider the worst case setting and study optimal block…
First, we construct a class of functions with good local avalanche characteristics, but bad global avalanche characteristics. We also derive some bounds for the nonlinearity of such functions. It improves upon the results of Son et al., and…
A real arithmetic function f is multiplicatively monotonous if f (mn) -- f (m) has constant sign for m, n positive integers. Properties and examples of such functions are discussed, with applications to positive hermitian…
We answer two questions from {\it V.Bykov, On Baire class one functions on a product space, Topol. Appl. {199} (2016) 55--62,} and prove that every Baire one function on a subspace of a countable perfectly normal product is the pointwise…
Lately, there have been intensive studies on strengths and limitations of nonuniform families of promise decision problems solvable by various types of polynomial-size finite automata families, where ``polynomial-size'' refers to the…
This paper proposes a method to address the longstanding problem of lack of monotonicity in estimation of conditional and structural quantile functions, also known as the quantile crossing problem. The method consists in sorting or monotone…
We prove a lower bound of $\tilde{\Omega}(n^{1/3})$ for the query complexity of any two-sided and adaptive algorithm that tests whether an unknown Boolean function $f:\{0,1\}^n\rightarrow \{0,1\}$ is monotone or far from monotone. This…
Variable projection solves structured optimization problems by completely minimizing over a subset of the variables while iterating over the remaining variables. Over the last 30 years, the technique has been widely used, with empirical and…