Related papers: Fixes of permutations acting on monotone Boolean f…
Boolean models are applied to deriving operator versions of the classical Farkas Lemma in the theory of simultaneous linear inequalities.
In this paper we present an explicit formula for the number of permutations with a given number of alternating descents. Moreover, we study the interlacing property of the real parts of the zeros of the generating polynomials of these…
This paper studies the problem of testing whether a function is monotone from a nonparametric Bayesian perspective. Two new families of tests are constructed. The first uses constrained smoothing splines, together with a hierarchical…
For any finite field $\mathbb{F}$ and any positive integer $n$ we count the number of monic polynomials of degree $n$ over $\mathbb{F}$ with nonzero constant coefficient and a self-reciprocal factor of any specified degree. An application…
Flexible sparsity regularization means stably approximating sparse solutions of operator equations by using coefficient-dependent penalizations. We propose and analyse a general nonconvex approach in this respect, from both theoretical and…
We study the computation of local approximations of invariant manifolds of parabolic fixed points and parabolic periodic orbits of periodic vector fields. If the dimension of these manifolds is two or greater, in general, it is not possible…
This paper presents a method for computing a least fixpoint of a system of equations over booleans. The resulting computation can be significantly shorter than the result of iteratively evaluating the entire system until a fixpoint is…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
A linear inference is a valid inequality of Boolean algebra in which each variable occurs at most once on each side. In this work we leverage recently developed graphical representations of linear formulae to build an implementation that is…
In recent work, Zeilberger and the author used a functional equations approach for enumerating permutations with r occurrences of the pattern 12...k. In particular, the approach yielded a polynomial-time enumeration algorithm for any fixed…
We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.
This paper proposes an algorithm for deciding consistency of systems of Boolean equations in several variables with co-efficients in the two element Boolean algebra $B_{0}=\{0,1\}$ and find all satisfying assignments. The algorithm is based…
This paper considers the problems of solving monotone variational inequalities with H\"older continuous Jacobians. By employing the knowledge of H\"older parameter $\nu$, we propose the $\nu$-regularized extra-Newton method within at most…
We prove that two fixed univariate functions, namely, an arbitrary continuous non-affine function and a concrete affine function, are sufficient to approximate continuous functions of one variable under the operations of addition and…
This paper establishes several upper and lower estimates for the maximal number of the connected components of the solution sets of monotone affine vector variational inequalities. Our results give a partial solution to Question~2 in [N.D.…
We present a numerical algorithm for finding real non-negative solutions to polynomial equations. Our methods are based on the expectation maximization and iterative proportional fitting algorithms, which are used in statistics to find…
Given two random variables $X$ and $Y$, stochastic monotonicity describes a monotone influence of $X$ on $Y$. We prove two different characterizations of stochastically monotone $2$-copulas using the isomorphism between $2$-copulas and…
A boolean function $f(x_1,...,x_n)$ is \textit{weakly symmetric} if it is invariant under a transitive permutation group on its variables. A boolean function $f(x_1,...,x_n)$ is \textit{elusive} if we have to check all $x_1$,..., $x_n$ to…
We define the pivotal set of a Boolean function and we prove a fundamental inequality on its expected size, when the inputs are independent random coins of parameter~$p$. We give two complete proofs of this inequality. Along the way, we…
We propose local versions of monotonicity for Boolean and pseudo-Boolean functions: say that a pseudo-Boolean (Boolean) function is p-locally monotone if none of its partial derivatives changes in sign on tuples which differ in less than p…