Related papers: Weak N\'{e}ron models for cubic polynomial maps ov…
This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…
Let K be a non-archimedean field, and let f in K(z) be a polynomial or rational function of degree at least 2. We present a necessary and sufficient condition, involving only the fixed points of f and their preimages, that determines…
We establish a connection between (degenerate) nonsymmetric Macdonald polynomials and standard bases and dual standard bases of maximal parabolic modules of affine Hecke algebras. Along the way we prove a (weak) polynomiality result for…
The concept of open weak CAD is introduced. Every open CAD is an open weak CAD. On the contrary, an open weak CAD is not necessarily an open CAD. An algorithm for computing projection polynomials of open weak CADs is proposed. The key idea…
This is the first in a projected series of three papers in which we construct the second flip in the log minimal model program for $\bar{M}_g$. We introduce the notion of a weakly proper algebraic stack, which may be considered as an…
We discuss a notion of weak solution for a semilinear wave equation that models the interaction of an elastic body with a rigid substrate through an adhesive layer, relying on results in [2]. Our analysis embraces the vector-valued case in…
We study systems of equations over graphs, posets and matroids. We give the criteria, when a direct power of such algebraic structures is equationally Noetherian. Moreover we prove that any direct power of a finite algebraic structure is…
The purpose of this paper is to propose methods for verifying the positivity of a weak solution $ u $ of an elliptic problem assuming $ H^1_0 $-error estimation $ \left\|u-\hat{u}\right\|_{H_{0}^{1}} \leq \rho $ given some numerical…
The goal of this paper is to prove that several variants of deciding whether a poset can be (weakly) embedded into a small Boolean lattice, or to a few consecutive levels of a Boolean lattice, are NP-complete, answering a question of Griggs…
This paper addresses weak approximation for rationally connected varieties defined over the function field of a curve, especially at places of bad reduction. Our approach entails analyzing the rational connectivity of the smooth locus of…
The aim of this note is to show that Poincar\'e inequalities imply corresponding weighted versions in a quite general setting. Fractional Poincar\'e inequalities are considered, too. The proof is short and does not involve covering…
CM-type projective varieties X of complex dimension n are characterized by their CM-type rational Hodge structures on the cohomology groups. One may impose such a condition in a weakest form when the canonical bundle of X is trivial; the…
We present an effective method to investigate the asymptotic critical value set of a polynomial map. For this purpose we propose a method to construct rational curves with reduced number of terms present in its parametric representation. In…
Although the weak nonleptonic amplitudes of the Standard Model are notoriously difficult to calculate, we have produced a modified weak matrix element which can be analyzed using reliable methods. This hypothetical nonleptonic matrix…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
We develop a new kind of nonnegativity certificate for univariate polynomials on an interval. In many applications, nonnegative Bernstein coefficients are often used as a simple way of certifying polynomial nonnegativity. Our proposed…
The weak convergence of orthogonal polynomials is given under conditions on the asymptotic behaviour of the coefficients in the three-term recurrence relation. The results generalize known results and are applied to several systems of…
We consider polynomials of a few linear forms and show how exploit this type of sparsity for optimization on some particular domains like the Euclidean sphere or a polytope. Moreover, a simple procedure allows to detect this form of…
The paper presents geometric models for the set WO of weak orders on a finite set. In particulary, WO is modeled as a set of vertices of a cubical subdivision of a permutahedron. This approach is an alternative to the usual representation…
We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We disprove it. We show that the problem is NP-hard in general.…