Related papers: Monotone Classes Beyond VNP
In this paper, we consider the problem of determining the density of monic polynomials over $\mathbb{Z}_p$ with squarefree discriminant over various subsets of the set of monic polynomials over $\mathbb{Z}_p$ of fixed degree. We compute the…
We consider a class of non-polynomial spline spaces over T-meshes, that is, of spaces locally spanned both by polynomial and by suitably-chosen non-polynomial functions, which we will refer to as generalized splines over T-meshes. For such…
In this paper we study compact monotone tall complexity one $T$-spaces. We use the classification of Karshon and Tolman, and the monotone condition, to prove that any two such spaces are isomorphic if and only if they have equal…
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular…
Monotonicity of a mapping implies its pseudomonotonicity and hence quasimonotonocity, the converse is not true. In this note we intend to study the situations under which quasimono tonicity of a mapping implies its monotonicity. Thus we…
This paper is concerned with the study of $M$-structures in spaces of polynomials. More precisely, we discuss for $E$ and $F$ Banach spaces, whether the class of weakly continuous on bounded sets $n$-homogeneous polynomials, $\mathcal…
We introduce a notion of substitutability for correspondences and establish a monotone comparative static result, unifying results such as the inverse isotonicity of M-matrices, Berry, Gandhi and Haile's identification of demand systems,…
Dai Pra et al studied two notions of monotonicity for continuous-time Markov processes on a finite partially ordered set (poset), and conjectured that monotonicity equivalence holds for a poset of W-glued diamond, and that there is no other…
In this paper we revisit some classic problems on classification under misspecification. In particular, we study the problem of learning halfspaces under Massart noise with rate $\eta$. In a recent work, Diakonikolas, Goulekakis, and Tzamos…
We give a poly-time construction for a combinatorial classic known as Sparse Incomparability Lemma, studied by Erdos, Lovasz, Nesetril, Rodl and others: We show that every Constraint Satisfaction Problem is poly-time equivalent to its…
The purpose of this note is to revive in $L^p$ spaces the original A. Markov ideas to study monotonicity of zeros of orthogonal polynomials. This allows us to prove and improve in a simple and unified way our previous result [Electron.…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity,…
We consider each of the three classes of representations of cyclic groups that arise in the study of rational sphere maps. We study the possible number of terms for invariant polynomials with non-negative coefficients that are constant on…
In this work we study oblivious complexity classes. These classes capture the power of interactive proofs where the prover(s) are only given the input size rather than the actual input. In particular, we study the connections between the…
By studying the group of self homotopy equivalences of the localization (at a prime $p$ and/or zero) of some aspherical complexes, we show that, contrary to the case when the considered space is a nilpotent complex, $\mathcal{E}_{\#}^m…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…
In this article, we study some special cases of the problem of classifying polynomials $p:\mathbb{R}^2_+\to (0,\infty)$ for which the net $\{\frac{1}{p(m,n)}\}_{m,n\in \mathbb{Z}_+}$ is a completely monotone net, where $p(x,y)=b(x)+a(x)y$,…
Multiple-environment Markov decision processes (MEMDPs) equip an MDP with several probabilistic transition functions (one per possible environment) so that the state is observable but the environment is not. Previous work studies two…
We consider generalized solutions of the Perona-Malik equation in dimension one, defined as all possible limits of solutions to the semi-discrete approximation in which derivatives with respect to the space variable are replaced by…