相关论文: The weighted difference substitutions and Nonnegat…

This paper mainly studies nonnegativity decision of forms based on variable substitutions. Unlike existing research, the paper regards simplex subdivisions as new perspectives to study variable substitutions, gives some subdivisions of the…

Let $z_{1},z_{2},...,z_{N}$ be a sequence of distinct grid points. A finite difference formula approximates the $m$-th derivative $f^{(m)}(0)$ as $\sum w_{k}f(z_{k})$, with $w_{k}$ being the weights. We derive an algorithm for finding the…

An important theorem by Timofte states that nonnegativity of real $n$-variate symmetric polynomials of degree $d$ can be decided at test sets given by all points with at most $\lfloor\frac{d}{2}\rfloor$ distinct components. However, if the…

In a recent paper [15], Hilbert space operators $T$ with the property that each sequence of the form $\{\|T^n h\|^2\}_{n=0}^{\infty}$ is conditionally positive definite in a semigroup sense were introduced. In the present paper, this line…

We establish effective versions of Oppenheim's conjecture for generic inhomogeneous quadratic forms. We prove such results for fixed shift vectors and generic quadratic forms. When the shift is rational we prove a counting result which…

We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…

We prove effective Nullstellensatz and elimination theorems for difference equations in sequence rings. More precisely, we compute an explicit function of geometric quantities associated to a system of difference equations (and these…

This paper treats the variation of sets. We attempt to formulate convergence and continuity of set-valued functions in a different way from the theories on sequences of sets and correspondence. In the final section, we also attempt to…

We tackle the problem of computing counterfactual explanations -- minimal changes to the features that flip an undesirable model prediction. We propose a solution to this question for linear Support Vector Machine (SVMs) models. Moreover,…

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

We study a general class of weighted shifts whose weights $\alpha$ are given by $\alpha_n = \sqrt{\frac{p^n + N}{p^n + D}}$, where $p > 1$ and $N$ and $D$ are parameters so that $(N,D) \in (-1, 1)\times (-1, 1)$. Some few examples of these…

We prove that a class of superlinear indefinite problems with homogeneous Neumann boundary conditions admits an arbitrarily high number of positive solutions, provided that the parameters of the problem are adequately chosen. The…

We propose new positive definite kernels for permutations. First we introduce a weighted version of the Kendall kernel, which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks.…

A new differential test for series of positive terms is proved. Let f(x) be a positive continuous function corresponded to a series of positive terms f(k), and g(x) is a derivative of reciprocal of f(x). Then, the convergence and divergence…

In this paper, we continue the study of linear sets with complementary weights. We find criteria to determine the set of points of any fixed weight and use this to present particular linear sets with few points of weight more than one. We…

We present and study new definitions of universal and programmable universal unary functions and consider a new simplicity criterion: almost decidability of the halting set. A set of positive integers S is almost decidable if there exists a…

We consider Delone sets with finite local complexity. We characterize validity of a subadditive ergodic theorem by uniform positivity of certain weights. The latter can be considered to be an averaged version of linear repetitivity. In this…

In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the…

Set prediction is about learning to predict a collection of unordered variables with unknown interrelations. Training such models with set losses imposes the structure of a metric space over sets. We focus on stochastic and underdefined…

The study of pinnacle sets has been a recent area of interest in combinatorics. Given a permutation, its pinnacle set is the set of all values larger than the values on either side of it. Largely inspired by conjectures posed by Davis,…